Performance bound of multiple hypotheses classification in compressed sensing

Compressed sensing (CS) has been widely researched in the past decade due to its important contributions in sparse signal processing. In this paper, we study the problem of multiple hypotheses classification with sparse signals in compressed sensing. The performance of classifying sparse signals reconstructed with the underdetermined linear measurements under Gaussian random noise is considered. With the prior knowledge of the support set of a sparse signal, the theoretical classification bound with the recovered signal based on the oracle estimator and the restricted isometry property (RIP) of the sampling matrix is developed. The effectiveness of the proposed theoretical bound is demonstrated by the simulations results obtained by four representative reconstruction algorithms in CS.

[1]  Yonina C. Eldar,et al.  The Cramér-Rao Bound for Estimating a Sparse Parameter Vector , 2010, IEEE Transactions on Signal Processing.

[2]  Robert D. Nowak,et al.  Compressive Sampling for Signal Detection , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[3]  R. Tibshirani,et al.  Sparse inverse covariance estimation with the graphical lasso. , 2008, Biostatistics.

[4]  N. L. Johnson,et al.  Continuous Univariate Distributions. , 1995 .

[5]  Zhiping Lin,et al.  Bayesian signal detection with compressed measurements , 2014, Inf. Sci..

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

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

[8]  Steven Kay,et al.  Fundamentals Of Statistical Signal Processing , 2001 .

[9]  Richard G. Baraniuk,et al.  The smashed filter for compressive classification and target recognition , 2007, Electronic Imaging.

[10]  Zhiping Lin,et al.  The detection bound of the probability of error in compressed sensing using Bayesian approach , 2012, 2012 IEEE International Symposium on Circuits and Systems.

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

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

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

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

[15]  Ashish Kapoor,et al.  Multilabel Classification using Bayesian Compressed Sensing , 2012, NIPS.

[16]  S. Kay.  Fundamentals of statistical signal processing: estimation theory , 1993 .

[17]  Terence Tao,et al.  The Dantzig selector: Statistical estimation when P is much larger than n , 2005, math/0506081.

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

[19]  Refet Firat Yazicioglu,et al.  Reconstruction of neural action potentials using signal dependent sparse representations , 2013, 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013).

[20]  Yao Zhao,et al.  Directional block compressed sensing for image coding , 2013, 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013).

[21]  Pramod K. Varshney,et al.  Performance Limits of Compressive Sensing-Based Signal Classification , 2012, IEEE Transactions on Signal Processing.

[22]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.