Statistical post-processing improves basis pursuit denoising performance

For compressive sensing (CS), we explore the framework of Bayesian linear models to achieve a robust reconstruction performance in the presence of measurement noise. Using a priori statistical knowledge, we develop a two stage method such that the performance of a standard l1 norm minimization based CS method improves. In the two stage framework, we use a standard basis pursuit denoising (BPDN) method in the first stage for estimating the support set of higher amplitude signal components and then use a linear estimator in the second stage for achieving better CS reconstruction. Through experimental evaluations, we show that the use of the new two stage based algorithm leads to a better CS reconstruction performance than the direct use of the standard BPDN method.

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

[2]  Yi Hu,et al.  A generalized subspace approach for enhancing speech corrupted by colored noise , 2003, IEEE Trans. Speech Audio Process..

[3]  Thippur V. Sreenivas,et al.  GMM based Bayesian approach to speech enhancement in signal / transform domain , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

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

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

[6]  Lawrence Carin,et al.  Exploiting Structure in Wavelet-Based Bayesian Compressive Sensing , 2009, IEEE Transactions on Signal Processing.

[7]  Justin Ziniel,et al.  Fast bayesian matching pursuit , 2008, 2008 Information Theory and Applications Workshop.

[8]  Richard G. Baraniuk,et al.  Bayesian Compressive Sensing Via Belief Propagation , 2008, IEEE Transactions on Signal Processing.

[9]  E. Candès,et al.  The Dantzig selector: Statistical estimation when P is much larger than n , 2005, math/0506081.

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

[11]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

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

[13]  Marco Righero,et al.  An introduction to compressive sensing , 2009 .

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

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

[16]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[17]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[18]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

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

[20]  Bhaskar D. Rao,et al.  Sparse Bayesian learning for basis selection , 2004, IEEE Transactions on Signal Processing.

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

[22]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[23]  M. Skoglund,et al.  Robust matching pursuit for recovery of Gaussian sparse signal , 2011, 2011 Digital Signal Processing and Signal Processing Education Meeting (DSP/SPE).

[24]  Weiyu Xu,et al.  Breaking through the thresholds: an analysis for iterative reweighted ℓ1 minimization via the Grassmann angle framework , 2009, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.

[25]  Yariv Ephraim,et al.  A signal subspace approach for speech enhancement , 1995, IEEE Trans. Speech Audio Process..