• DocumentCode
    1852176
  • Title

    Terated sparse reconstruction for activity estimation in nuclear spectroscopy

  • Author

    Sepulcre, Y. ; Trigano, T.

  • Author_Institution
    Dept. of Comput. Sci., Jerusalem Coll. of Eng., Jerusalem, Israel
  • fYear
    2012
  • fDate
    27-31 Aug. 2012
  • Firstpage
    2367
  • Lastpage
    2371
  • Abstract
    The aim of nuclear spectroscopy is to provide as many information as possible regarding the activity and the content of an unknown radioactive source. Due to some random perturbations called pileup phenomenon, electrical pulses recorded by the spectrometric apparatus may overlap. Recent developments in compressive sensing and sparse signal reconstruction allow us to build efficient algorithms for the estimation of the activity. We suggest in this paper an iterative algorithm which improves this estimation. This algorithm is based on successive sparse approximations of the residual signal with a slowly decreasing sparsity parameter, so that at each step pulses with smaller amplitude are detected. The algorithm is detailed and its performances compared to other methods based on sparse reconstruction. Results show that the proposed approach perform better than the state-of-the-art methods, and emphasize the usefulness of the iterative scheme.
  • Keywords
    iterative methods; radioactive sources; signal reconstruction; spectrometers; electrical pulses; iterated sparse reconstruction; iterative algorithm; iterative scheme; nuclear spectroscopy; pileup phenomenon; radioactive source; random perturbations; residual signal; sparse signal reconstruction; spectrometric apparatus; state-of-the-art method; Detectors; Dictionaries; Estimation; Iterative methods; Shape; Signal processing algorithms; Spectroscopy; LASSO; Sparse reconstruction; counting rate estimation; nuclear spectroscopy;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing Conference (EUSIPCO), 2012 Proceedings of the 20th European
  • Conference_Location
    Bucharest
  • ISSN
    2219-5491
  • Print_ISBN
    978-1-4673-1068-0
  • Type

    conf

  • Filename
    6334066