Search NASA⌕ Search

Engineering topics

Sullivan, Clair J.

Publications and source records attributed to Sullivan, Clair J..

An automated isotope identification and quantification algorithm for isotope mixtures in low-resolution gamma-ray spectra

There is a need to develop an automated isotope identification and quantification algorithm that can perform well using low-resolution gamma-ray detectors. The algorithm should be able to perform well on spectra that contain a mixture of many isotopes as well as in cases where spectral features are difficult to analyze. Due to the low resolution of these detectors, spectra of isotope mixtures becomes complicated to identify when features overlap. Previous research applying machine learning algorithms to isotope identification has been promising. Further work is needed to demonstrate the limits of machine learning algorithms when applied to identifying mixtures of isotopes and spectra where features are not obvious. Because machine learning algorithms use abstract features of the spectrum, such as the shape of overlapping peaks and Compton continuum, they are a natural choice for analyzing isotope mixtures. In this work, an artificial neural network (ANN) has be trained to calculate the relative activities of 29 isotopes in a spectrum. The ANN is trained with simulated gamma-ray spectra, allowing custom datasets to be generated for specific identification tasks. The algorithms performance on simulated spectra without apparent features and on simulated isotope mixtures are both analyzed.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Uncertainty analysis of wavelet-based feature extraction for isotope identification on NaI gamma-ray spectra

Low-resolution isotope identifiers are widely deployed for nuclear security purposes, but these detectors currently demonstrate problems in making correct identifications in many typical usage scenarios. While there are many hardware alternatives and improvements that can be made, performance on existing low resolution isotope identifiers should be able to be improved by developing new identification algorithms. We have developed a wavelet-based peak extraction algorithm and an implementation of a Bayesian classifier for automated peak-based identification. The peak extraction algorithm has been extended to compute uncertainties in the peak area calculations. To build empirical joint probability distributions of the peak areas and uncertainties, a large set of spectra were simulated in MCNP6 and processed with the wavelet-based feature extraction algorithm. Kernel density estimation was then used to create a new component of the likelihood function in the Bayesian classifier. Furthermore, identification performance is demonstrated on a variety of real low-resolution spectra, including Category I quantities of special nuclear material.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Radioactive source localization in urban environments with sensor networks and the Internet of Things

The use of radiation detectors as an element in the so-called “Internet of Things” has recently become viable with the available of low-cost, mobile radiation sensors capable of streaming geo-referenced data. New methods for fusing the data from multiple sensors on such a network is presented. The traditional simple and ordinary Kriging methods present a challenge for such a network since the assumption of a constant mean is not valid in this application. In conclusion, a variety of Kalman filters are introduced in an attempt to solve the problem associated with this variable and unknown mean. Results are presented on a deployed sensor network.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Data depth based clustering analysis

Here, this paper proposes a new algorithm for identifying patterns within data, based on data depth. Such a clustering analysis has an enormous potential to discover previously unknown insights from existing data sets. Many clustering algorithms already exist for this purpose. However, most algorithms are not affine invariant. Therefore, they must operate with different parameters after the data sets are rotated, scaled, or translated. Further, most clustering algorithms, based on Euclidean distance, can be sensitive to noises because they have no global perspective. Parameter selection also significantly affects the clustering results of each algorithm. Unlike many existing clustering algorithms, the proposed algorithm, called data depth based clustering analysis (DBCA), is able to detect coherent clusters after the data sets are affine transformed without changing a parameter. It is also robust to noises because using data depth can measure centrality and outlyingness of the underlying data. Further, it can generate relatively stable clusters by varying the parameter. The experimental comparison with the leading state-of-the-art alternatives demonstrates that the proposed algorithm outperforms DBSCAN and HDBSCAN in terms of affine invariance, and exceeds or matches the ro-bustness to noises of DBSCAN or HDBSCAN. The robust-ness to parameter selection is also demonstrated through the case study of clustering twitter data.

58 GEOSCIENCES↗