Adaptive one-bit quantization for compressed sensing

There have been a number of studies on sparse signal recovery from one-bit quantized measurements. Nevertheless, less attention has been paid to the choice of the quantization thresholds and its impact on the signal recovery performance. In this paper, we examine the problem of quantization in a general framework of one-bit compressed sensing with non-zero quantization thresholds. Our analysis shows that when the number of one-bit measurements is sufficiently large, with a high probability the sparse signal can be recovered with an error decaying linearly with the ?2-norm of the difference between the quantization thresholds and the original unquantized measurements. Specifically, by setting the thresholds sufficiently close to the original unquantized measurements, sparse signals can be recovered with an arbitrarily small error. By borrowing an idea from the Delta modulation, we propose an adaptive quantization scheme where the quantization thresholds are iteratively adjusted based on previous encoded bits such that they eventually oscillate around the original unquantized measurements with decreasing granular noise. Numerical results are provided to collaborate our theoretical results and to illustrate the effectiveness of the proposed scheme.

[1]  Michael Unser,et al.  Optical imaging using binary sensors. , 2010, Optics express.

[2]  Sundeep Rangan,et al.  Optimal quantization for compressive sensing under message passing reconstruction , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[3]  Laurent Jacques,et al.  Error Decay of (Almost) Consistent Signal Estimations From Quantized Gaussian Random Projections , 2014, IEEE Transactions on Information Theory.

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

[5]  Laurent Jacques,et al.  Quantization and Compressive Sensing , 2014, ArXiv.

[6]  Martin J. Wainwright,et al.  Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting , 2007, IEEE Transactions on Information Theory.

[7]  Pramod K. Varshney,et al.  Performance Bounds for Sparsity Pattern Recovery With Quantized Noisy Random Projections , 2012, IEEE Journal of Selected Topics in Signal Processing.

[8]  Richard G. Baraniuk,et al.  A simple proof that random matrices are democratic , 2009, ArXiv.

[9]  Laurent Jacques,et al.  Error Decay of (almost) Consistent Signal Estimations from Quantized Random Gaussian Projections , 2014, ArXiv.

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

[11]  Qiang Fu,et al.  Compressed Sensing of Complex Sinusoids: An Approach Based on Dictionary Refinement , 2012, IEEE Transactions on Signal Processing.

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

[13]  Giuseppe Durisi,et al.  A robust RFPI-based 1-bit compressive sensing reconstruction algorithm , 2012, 2012 IEEE Information Theory Workshop.

[14]  Wotao Yin,et al.  Iteratively reweighted algorithms for compressive sensing , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[15]  Massimo Fornasier,et al.  Compressive Sensing , 2015, Handbook of Mathematical Methods in Imaging.

[16]  Zhi Chen,et al.  A one-bit reweighted iterative algorithm for sparse signal recovery , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[17]  M. Rudelson,et al.  The smallest singular value of a random rectangular matrix , 2008, 0802.3956.

[18]  Neil Genzlinger.  A. and Q , 2006 .

[19]  Rayan Saab,et al.  One-Bit Compressive Sensing With Norm Estimation , 2014, IEEE Transactions on Information Theory.

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

[21]  Olgica Milenkovic,et al.  Information Theoretical and Algorithmic Approaches to Quantized Compressive Sensing , 2011, IEEE Transactions on Communications.

[22]  Junzhou Huang,et al.  Learning with structured sparsity , 2009, ICML '09.

[23]  Richard G. Baraniuk,et al.  Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals , 2014, IEEE Transactions on Information Theory.

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

[25]  Jun Fang,et al.  Distributed Estimation of Gauss - Markov Random Fields With One-Bit Quantized Data , 2010, IEEE Signal Processing Letters.

[26]  Jun Fang,et al.  Robust One-Bit Bayesian Compressed Sensing with Sign-Flip Errors , 2015, IEEE Signal Processing Letters.

[27]  Bhaskar D. Rao,et al.  Sparse Signal Recovery With Temporally Correlated Source Vectors Using Sparse Bayesian Learning , 2011, IEEE Journal of Selected Topics in Signal Processing.

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

[29]  Kerry Kretchmar,et al.  Democracy (In)Action , 2014 .

[30]  Cishen Zhang,et al.  Off-Grid Direction of Arrival Estimation Using Sparse Bayesian Inference , 2011, IEEE Transactions on Signal Processing.

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

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

[33]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[34]  Michael Unser,et al.  One-Bit Measurements With Adaptive Thresholds , 2012, IEEE Signal Processing Letters.

[35]  Richard G. Baraniuk,et al.  Compressive Sensing , 2008, Computer Vision, A Reference Guide.

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

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

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

[39]  Vivek K. Goyal,et al.  Optimal quantization of random measurements in compressed sensing , 2009, 2009 IEEE International Symposium on Information Theory.

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

[41]  Richard G. Baraniuk,et al.  Regime Change: Bit-Depth Versus Measurement-Rate in Compressive Sensing , 2011, IEEE Transactions on Signal Processing.

[42]  Richard G. Baraniuk,et al.  Democracy in Action: Quantization, Saturation, and Compressive Sensing , 2011 .

[43]  Rayan Saab,et al.  Sigma delta quantization for compressed sensing , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).