Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1406.0746

Detection of Nuclear Sources in Search Applications using Dynamic Quantum Clustering of Spectral Data

Marvin Weinstein·Alexander Heifetz·Raymond Klann
View original source ↗Read source document ↗Export metadata ↓

Abstract

In a search scenario, nuclear background spectra are continuously measured in short acquisition intervals with a mobile detector-spectrometer. Detecting sources from measured data is difficult because of low signal to noise ratio (S/N) of spectra, large and highly varying background due to naturally occurring radioactive material (NORM), and line broadening due to limited spectral resolution of nuclear detector. We have invented a method for detection of sources using clustering of spectral data. Our method takes advantage of the physical fact that a source not only produces counts in the region of its spectral emission, but also has the effect on the entire detector spectrum via Compton continuum. This allows characterizing the low S/N spectrum without distinct isotopic lines using multiple data features. We have shown that noisy spectra with low S/N can be grouped by overall spectral shape similarity using a data clustering technique called Dynamic Quantum Clustering (DQC). The spectra in the same cluster can then be averaged to enhance S/N of the isotopic spectral line. This would allow for increased accuracy of isotopic identification and lower false alarm rate. Our method was validated in a proof-of principle study using a data set of spectra measured in one-second intervals with Sodium Iodide detector. The data set consisted of over 7000 spectra obtained in urban background measurements, and approximately 70 measurements of Cs-137 and Co-60 sources. Using DQC analysis, we have observed that all spectra containing Cs-137 and Co-60 signal cluster away from the background.

Explore related subjects

physics.data-anphysics.ins-detphysics.soc-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marvin Weinstein, Alexander Heifetz, Raymond Klann. 2014-06-03. Detection of Nuclear Sources in Search Applications using Dynamic Quantum Clustering of Spectral Data. https://doi.org/10.1140/epjp%2Fi2014-14239-3

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Learning to bin: differentiable and Bayesian optimization for multi-dimensional discriminants in high-energy physics

Categorizing events using discriminant observables is central to many high-energy physics analyses. Yet, bin boundaries are often chosen manually. A simple, popular choice in multi-classification tasks is to assign events according to the largest per-class score ("argmax") and to apply equidistant binning to the resulting one-dimensional discriminants. We propose a binning optimization for signal significance directly in multi-dimensional discriminants. We use a Gaussian Mixture Model (GMM) to define flexible regions in the score space, which can be interpreted either as bins or as analysis categories. While this GMM-based strategy is applicable in both one and multiple dimensions, we also study a direct bin-boundary optimization in one dimension as a simpler alternative for binary discriminants. On this binning model, we study two optimization strategies: a differentiable and a Bayesian optimization approach. We study two toy setups: a binary classification and a three-class problem with two signals and backgrounds. In the one-dimensional case, both approaches achieve similar gains in signal sensitivity compared to equidistant binning for a given number of bins, while in the multi-dimensional case the differentiable approach performs best. We show that the GMM-based optimization can outperform argmax classification even after optimized binning is applied to the one-dimensional projections. We further study the performance of our methods on the FAIR Universe $H\rightarrowττ$ dataset, where the GMM-based optimization gives the highest signal significance. Both methods are released as lightweight Python plugins intended for straightforward integration into existing analyses.

physics.data-an↗
arXiv2026

When Should Team KPIs Be Absolute or Relative for Match-Outcome Prediction?

In rugby union and association football, team key performance indicators (KPIs) can be represented in absolute terms or relative to the opponent. Relativisation sometimes improves match-outcome prediction and sometimes harms it. There has been no general account of when each occurs. The answer depends on how much the two teams differ in variability and how strongly their KPI values rise and fall together. We combine these properties into the Paired Efficiency Factor (PEF), which generalises Fisher's paired-efficiency result to the unequal-variance conditions typical of competitive sport. The PEF also connects a KPI's statistical efficiency to how much information its relative form carries about the outcome. Combined KPIs can interact in complex ways, so we analyse each indicator on its own. Across 86 team KPIs from professional rugby union and association football, the PEF places every metric in one of four regimes. Anti-correlation is common, especially for high-volume competitive counts, and absolute measures are then usually preferable. Relativisation can still improve prediction when a noisier difference carries more outcome information. An idealised simulation and one representative KPI from each regime confirm both signs under team-blocked cross-validation. The same pairing geometry appears in healthcare, genomics, finance, and manufacturing. The PEF turns an ad hoc feature-engineering choice into a transparent, data-informed diagnostic for when to relativise performance metrics and when not to.

physics.data-an↗
arXiv2026

Comparison of Image Processing Models in Quark Gluon Jet Classification

Quark-gluon discrimination provides a useful test case for studying how different machine-learning architectures learn the spatial structure of QCD radiation. In this work, we compare convolutional neural network (CNN), Vision Transformers (ViT), and hierarchical Swin Transformers using the same three-channel jet-image representation, consisting of charged-particle momentum, neutral-particle momentum, and charged-particle multiplicity from PYTHIA 8 jets. We study their performance for different training-set sizes and fine-tuning configurations, with particular attention to the role of local and global information in the jet images. CNN and Swin models consistently perform better than ViT in the cases studied. Since both CNN and Swin retain a strong local component in their architectures, this suggests that local jet substructure plays an important role in quark-gluon discrimination. The performance of the hierarchical Swin model also suggests that combining local features over larger spatial scales is useful. Block-wise fine-tuning improves the performance of the Transformer models, although the improvement becomes smaller and the training less stable as more blocks are unfrozen. We also find that self-supervised Momentum Contrast (MoCo) pretraining improves the model initialization, particularly when the amount of labeled training data is limited. Based on these observations, we developed a smaller Swin model adopted to the jet-image representation used in this study. It achieves comparable performance with substantially fewer parameters. The results show that it is important to adapt the model architecture and training procedure to the specific input characteristics of High Energy Physics (HEP) data when applying vision models in HEP.

physics.data-an↗