Robust 1-bit compressive sensing via variational Bayesian algorithm

In a compressive sensing (CS) framework, a sparse signal can be stably reconstructed at a reduced sampling rate. Quantization and noise corruption are inevitable in practical applications. Recent studies have shown that using only the sign information of measurements can achieve accurate signal reconstruction in a CS framework. We consider the problem of reconstructing a sparse signal from 1-bit quantized, Gaussian noise corrupted measurements. In this paper, we present a variational Bayesian inference based 1-bit compressive sensing algorithm, which essentially models the effect of quantization as well as the Gaussian noise. A variational message passing method is adopted to achieve the inference. Through numerical experiments, we demonstrate that our algorithm outperforms state-of-the-art 1-bit compressive sensing algorithms in the presence of Gaussian noise corruption.

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

[2]  Richard G. Baraniuk,et al.  1-Bit compressive sensing , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[3]  Laurent Jacques,et al.  Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors , 2011, IEEE Transactions on Information Theory.

[4]  Mark Girolami,et al.  Variational Bayesian Multinomial Probit Regression with Gaussian Process Priors , 2006, Neural Computation.

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

[6]  Cishen Zhang,et al.  Variational Bayesian Algorithm for Quantized Compressed Sensing , 2012, IEEE Transactions on Signal Processing.

[7]  D. Hunter,et al.  A Tutorial on MM Algorithms , 2004 .

[8]  Vivek K Goyal,et al.  Quantization for Compressed Sensing Reconstruction , 2009 .

[9]  Laurent Jacques,et al.  Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine , 2009, IEEE Transactions on Information Theory.

[10]  P. Boufounos.  Greedy sparse signal reconstruction from sign measurements , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[11]  Stephen P. Boyd,et al.  Compressed Sensing With Quantized Measurements , 2010, IEEE Signal Processing Letters.

[12]  Michael E. Tipping.  Sparse Bayesian Learning and the Relevance Vector Machine , 2001, J. Mach. Learn. Res..

[13]  Yaniv Plan,et al.  One‐Bit Compressed Sensing by Linear Programming , 2011, ArXiv.

[14]  Ming Yan,et al.  Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit , 2012, IEEE Transactions on Signal Processing.

[15]  Jian Li,et al.  Compressed Sensing via Sparse Bayesian Learning and Gibbs Sampling , 2009, 2009 IEEE 13th Digital Signal Processing Workshop and 5th IEEE Signal Processing Education Workshop.

[16]  Wotao Yin,et al.  Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements , 2011, IEEE Transactions on Signal Processing.

[17]  David J. C. MacKay,et al.  Bayesian Interpolation , 1992, Neural Computation.

[18]  Jun Fang,et al.  Sparse signal recovery from one-bit quantized data: An iterative reweighted algorithm , 2014, Signal Process..

[19]  Bhaskar D. Rao,et al.  An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem , 2007, IEEE Transactions on Signal Processing.

[20]  Yaniv Plan,et al.  Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach , 2012, IEEE Transactions on Information Theory.

[21]  Javier de Diego,et al.  Proceedings oh the International Congress of Mathematicians: Madrid, August 22-30,2006 : invited lectures , 2006 .

[22]  Charles M. Bishop,et al.  Variational Message Passing , 2005, J. Mach. Learn. Res..