Generalized compressive detection of stochastic signals using Neyman–Pearson theorem

Compressive sensing (CS) enables reconstructing a sparse signal from fewer samples than those required by the classic Nyquist sampling theorem. In general, CS signal recovery algorithms have high computational complexity. However, several signal processing problems such as signal detection and classification can be tackled directly in the compressive measurement domain. This makes recovering the original signal from its compressive measurements not necessary in these applications. We consider in this paper detecting stochastic signals with known probability density function from their compressive measurements. We refer to it as the compressive detection problem to highlight that the detection task can be achieved via directly exploring the compressive measurements. The Neyman–Pearson (NP) theorem is applied to derive the NP detectors for Gaussian and non-Gaussian signals. Our work is more general over many existing literature in the sense that we do not require the orthonormality of the measurement matrix, and the compressive detection problem for stochastic signals is generalized from the case of Gaussian signals to the case of non-Gaussian signals. Theoretical performance results of the proposed NP detectors in terms of their detection probability and the false alarm rate averaged over the random measurement matrix are established. They are verified via extensive computer simulations.

[1]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[2]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[3]  Jean-Luc Starck,et al.  Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.

[4]  E.J. Candes Compressive Sampling , 2022 .

[5]  Emmanuel J. Candès,et al.  Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions , 2004, Found. Comput. Math..

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

[7]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[8]  Simon Foucart,et al.  Hard Thresholding Pursuit: An Algorithm for Compressive Sensing , 2011, SIAM J. Numer. Anal..

[9]  Olgica Milenkovic,et al.  Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.

[10]  H. Cramér Mathematical methods of statistics , 1947 .

[11]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[12]  Antonio Artés-Rodríguez,et al.  Compressive sensing detection of stochastic signals , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[13]  Björn E. Ottersten,et al.  Detection of sparse random signals using compressive measurements , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[14]  T. Blumensath,et al.  Iterative Thresholding for Sparse Approximations , 2008 .

[15]  Zhu Han,et al.  Sparse event detection in wireless sensor networks using compressive sensing , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[16]  E. Candès The restricted isometry property and its implications for compressed sensing , 2008 .

[17]  S. D. Chatterji Proceedings of the International Congress of Mathematicians , 1995 .

[18]  Wenrui Dai,et al.  Compressive detection with sparse random projections , 2013 .

[19]  Lawrence Carin,et al.  Bayesian Compressive Sensing , 2008, IEEE Transactions on Signal Processing.

[20]  Peter Linz,et al.  Numerical methods for Volterra integral equations of the first kind , 1969, Comput. J..

[21]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

[22]  Brian M. Sadler,et al.  Subspace compressive detection for sparse signals , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[23]  R.G. Baraniuk,et al.  Compressive Sensing [Lecture Notes] , 2007, IEEE Signal Processing Magazine.

[24]  Richard G. Baraniuk,et al.  Signal Processing With Compressive Measurements , 2010, IEEE Journal of Selected Topics in Signal Processing.

[25]  Bhaskar D. Rao,et al.  Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..

[26]  Rebecca Willett,et al.  Hyperspectral target detection from incoherent projections: Nonequiprobable targets and inhomogeneous SNR , 2010, 2010 IEEE International Conference on Image Processing.

[27]  Pramod K. Varshney,et al.  Performance analysis of stochastic signal detection with compressive measurements , 2010, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers.

[28]  Richard G. Baraniuk,et al.  Sparse Signal Detection from Incoherent Projections , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[29]  Rebecca Willett,et al.  Hyperspectral target detection from incoherent projections , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.

[30]  Aggelos K. Katsaggelos,et al.  Bayesian Compressive Sensing Using Laplace Priors , 2010, IEEE Transactions on Image Processing.