Sparse Regression Algorithm for Activity Estimation in $\gamma$ Spectrometry

We consider the counting rate estimation of an unknown radioactive source, which emits photons at times modeled by an homogeneous Poisson process. A spectrometer converts the energy of incoming photons into electrical pulses, whose number provides a rough estimate of the intensity of the Poisson process. When the activity of the source is high, a physical phenomenon known as pileup effect distorts direct measurements, resulting in a significant bias to the standard estimators of the source activities used so far in the field. We show in this paper that the problem of counting rate estimation can be interpreted as a sparse regression problem. We suggest a post-processed, non-negative, version of the Least Absolute Shrinkage and Selection Operator (LASSO) to estimate the photon arrival times. The main difficulty in this problem is that no theoretical conditions can guarantee consistency in sparsity of LASSO, because the dictionary is not ideal and the signal is sampled. We therefore derive theoretical conditions and bounds which illustrate that the proposed method can none the less provide a good, close to the best attainable, estimate of the counting rate activity. The good performances of the proposed approach are studied on simulations and real datasets.

[1]  Karim Lounici Sup-norm convergence rate and sign concentration property of Lasso and Dantzig estimators , 2008, 0801.4610.

[2]  Y. X. Wang,et al.  Nuclear Instruments and Methods in Physics Research Section B : Beam Interactions with Materials and Atoms , 2018 .

[3]  Eric Moulines,et al.  Statistical Pileup Correction Method for HPGe Detectors , 2007, IEEE Transactions on Signal Processing.

[4]  R. Tibshirani,et al.  Least angle regression , 2004, math/0406456.

[5]  Peng Zhao,et al.  On Model Selection Consistency of Lasso , 2006, J. Mach. Learn. Res..

[6]  Thomas L. Saaty,et al.  Elements of queueing theory , 2003 .

[7]  Martin J. Wainwright,et al.  Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$ -Constrained Quadratic Programming (Lasso) , 2009, IEEE Transactions on Information Theory.

[8]  David P. Wipf,et al.  Iterative Reweighted 1 and 2 Methods for Finding Sparse Solutions , 2010, IEEE J. Sel. Top. Signal Process..

[9]  N. Meinshausen,et al.  High-dimensional graphs and variable selection with the Lasso , 2006, math/0608017.

[10]  M. Nonis,et al.  Experimental comparison of different dead-time correction techniques in single-channel counting experiments , 2009 .

[11]  Yonina C. Eldar,et al.  Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise , 2009, IEEE Transactions on Signal Processing.

[12]  Quentin Bristow Theoretical and experimental investigations of coincidences in Poisson distributed pulse trains and spectral distortion caused by pulse pileup , 1990 .

[13]  M. R. Osborne,et al.  On the LASSO and its Dual , 2000 .

[14]  N. Meinshausen,et al.  LASSO-TYPE RECOVERY OF SPARSE REPRESENTATIONS FOR HIGH-DIMENSIONAL DATA , 2008, 0806.0145.

[15]  Donald L. Snyder,et al.  Random point processes , 1975 .

[16]  G. P. Westphal Instrumental correction of counting losses in nuclear pulse spectroscopy , 1985 .

[17]  Marco Riva,et al.  A method for digital processing of pile-up events in organic scintillators , 2008 .

[18]  P. Bickel,et al.  SIMULTANEOUS ANALYSIS OF LASSO AND DANTZIG SELECTOR , 2008, 0801.1095.

[19]  H.W. Kraner,et al.  Radiation detection and measurement , 1981, Proceedings of the IEEE.

[20]  Stephen P. Boyd,et al.  Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.

[21]  Xiaoming Huo,et al.  Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.

[22]  S. Geer,et al.  On the conditions used to prove oracle results for the Lasso , 2009, 0910.0722.

[23]  G. Knoll Radiation Detection And Measurement, 3rd Ed , 2009 .

[24]  D. Ruppert The Elements of Statistical Learning: Data Mining, Inference, and Prediction , 2004 .

[25]  M. Vencelj,et al.  Gauss-Seidel Iterative Method as a Real-Time Pile-Up Solver of Scintillation Pulses , 2009, IEEE Transactions on Nuclear Science.

[26]  W. Leo Techniques for Nuclear and Particle Physics Experiments: A How-To Approach , 1987 .

[27]  R. Tibshirani Regression Shrinkage and Selection via the Lasso , 1996 .

[28]  T. Montagu,et al.  ADONIS : a new system for high count rate HPGe γ spectrometry , 2006, 2006 IEEE Nuclear Science Symposium Conference Record.

[29]  David P. Wipf,et al.  Sparse Estimation with Structured Dictionaries , 2011, NIPS.

[30]  M. Yuan,et al.  Model selection and estimation in regression with grouped variables , 2006 .

[31]  Michael Elad,et al.  Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation , 2010, IEEE Transactions on Signal Processing.

[32]  G. P. Westphal,et al.  Real-time correction of counting losses in nuclear pulse spectroscopy , 1982 .

[33]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[34]  Thierry Blu,et al.  Sampling signals with finite rate of innovation , 2002, IEEE Trans. Signal Process..

[35]  M. Vencelj,et al.  Event by event pile-up compensation in digital timestamped calorimetry , 2009 .

[36]  Cun-Hui Zhang,et al.  The sparsity and bias of the Lasso selection in high-dimensional linear regression , 2008, 0808.0967.