Do you want to publish a course? Click here

Threat determination for radiation detection from the Remote Sensing Laboratory

67   0   0.0 ( 0 )
 Added by William Ford
 Publication date 2019
and research's language is English




Ask ChatGPT about the research

The ability to search for radiation sources is of interest to the Homeland Security community. The hope is to find any radiation sources which may pose a reasonable chance for harm in a terrorist act. The best chance of success for search operations generally comes with fielding as many detection systems as possible. In doing this, the hoped for encounter with the threat source will inevitably be buried in an even larger number of encounters with non-threatening radiation sources commonly used for many medical and industrial use. The problem then becomes effectively filtering the non-threatening sources, and presenting the human-in-the-loop with a modest list of potential threats. Our approach is to field a collection of detection systems which utilize soft-sensing algorithms for the purpose of discriminating potential threat and non-threat objects, based on a variety of machine learning techniques.



rate research

Read More

Earth observation from satellite sensory data poses challenging problems, where machine learning is currently a key player. In recent years, Gaussian Process (GP) regression has excelled in biophysical parameter estimation tasks from airborne and satellite observations. GP regression is based on solid Bayesian statistics and generally yields efficient and accurate parameter estimates. However, GPs are typically used for inverse modeling based on concurrent observations and in situ measurements only. Very often a forward model encoding the well-understood physical relations between the state vector and the radiance observations is available though and could be useful to improve predictions and understanding. In this work, we review three GP models that respect and learn the physics of the underlying processes in the context of both forward and inverse modeling. After reviewing the traditional application of GPs for parameter retrieval, we introduce a Joint GP (JGP) model that combines in situ measurements and simulated data in a single GP model. Then, we present a latent force model (LFM) for GP modeling that encodes ordinary differential equations to blend data-driven modeling and physical constraints of the system governing equations. The LFM performs multi-output regression, adapts to the signal characteristics, is able to cope with missing data in the time series, and provides explicit latent functions that allow system analysis and evaluation. Finally, we present an Automatic Gaussian Process Emulator (AGAPE) that approximates the forward physical model using concepts from Bayesian optimization and at the same time builds an optimally compact look-up-table for inversion. We give empirical evidence of the performance of these models through illustrative examples of vegetation monitoring and atmospheric modeling.
We examine the two-point correlation function of local maxima in temperature fluctuations at the last scattering surface when this stochastic field is modified by the additional fluctuations produced by straight cosmic strings via the Kaiser-Stebbins effect. We demonstrate that one can detect the imprint of cosmic strings with tension $Gmu gtrsim 1.2 times 10^{-8}$ on noiseless $1^prime$ resolution cosmic microwave background (CMB) maps at 95% confidence interval. Including the effects of foregrounds and anticipated systematic errors increases the lower bound to $Gmu gtrsim 9.0times 10^{-8}$ at $2sigma$ confidence level. Smearing by beams of order 4 degrades the bound further to $Gmu gtrsim 1.6 times 10^{-7}$. Our results indicate that two-point statistics are more powerful than 1-point statistics (e.g. number counts) for identifying the non-Gaussianity in the CMB due to straight cosmic strings.
This paper describes some new results on recursive l_1-minimizing by Kalman filtering. We consider the l_1-norm as an explicit constraint, formulated as a nonlinear observation of the state to be estimated. Interpretiing a sparse vector to be estimated as a state which is observed from erroneous (undersampled) measurements we can address time- and space-variant sparsity, any kind of a priori information and also easily address nonstationary error influences in the measurements available. Inherently in our approach we move slightly away from the classical RIP-based approaches to a more intuitive understanding of the structure of the nullspace which is implicitly related to the well understood engineering concepts of deterministic and stochastic observability in estimation theory
In recent years, deep learning methods bring incredible progress to the field of object detection. However, in the field of remote sensing image processing, existing methods neglect the relationship between imaging configuration and detection performance, and do not take into account the importance of detection performance feedback for improving image quality. Therefore, detection performance is limited by the passive nature of the conventional object detection framework. In order to solve the above limitations, this paper takes adaptive brightness adjustment and scale adjustment as examples, and proposes an active object detection method based on deep reinforcement learning. The goal of adaptive image attribute learning is to maximize the detection performance. With the help of active object detection and image attribute adjustment strategies, low-quality images can be converted into high-quality images, and the overall performance is improved without retraining the detector.
We present a new approach to solve the exponential retrieval problem. We derive a stable technique, based on the singular value decomposition (SVD) of lag-covariance and crosscovariance matrices consisting of covariance coefficients computed for index translated copies of an initial time series. For these matrices a generalized eigenvalue problem is solved. The initial signal is mapped into the basis of the generalized eigenvectors and phase portraits are consequently analyzed. Pattern recognition techniques could be applied to distinguish phase portraits related to the exponentials and noise. Each frequency is evaluated by unwrapping phases of the corresponding portrait, detecting potential wrapping events and estimation of the phase slope. Efficiency of the proposed and existing methods is compared on the set of examples, including the white Gaussian and auto-regressive model noise.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا