One‐Bit Compressed Sensing by Linear Programming

We give the first computationally tractable and almost optimal solution to the problem of one-bit compressed sensing, showing how to accurately recover an s-sparse vector x in R^n from the signs of O(s log^2(n/s)) random linear measurements of x. The recovery is achieved by a simple linear program. This result extends to approximately sparse vectors x. Our result is universal in the sense that with high probability, one measurement scheme will successfully recover all sparse vectors simultaneously. The argument is based on solving an equivalent geometric problem on random hyperplane tessellations.

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

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

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

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

[5]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

[6]  Petros Boufounos,et al.  Reconstruction of sparse signals from distorted randomized measurements , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.

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

[8]  N. Alon,et al.  The Probabilistic Method, Second Edition , 2000 .

[9]  D. Mackenzie,et al.  Compressed sensing makes every pixel count , 2009 .

[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]  Peter Damaschke.  Threshold Group Testing , 2005, Electron. Notes Discret. Math..

[12]  Rayan Saab,et al.  Sobolev Duals for Random Frames and Sigma-Delta Quantization of Compressed Sensing Measurements , 2010, ArXiv.

[13]  Olgica Milenkovic,et al.  A comparative study of quantized compressive sensing schemes , 2009, 2009 IEEE International Symposium on Information Theory.

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

[15]  Roman Vershynin,et al.  Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.

[16]  Robert D. Nowak,et al.  Sample complexity for 1-bit compressed sensing and sparse classification , 2010, 2010 IEEE International Symposium on Information Theory.

[17]  P. Wojtaszczyk,et al.  Stability and Instance Optimality for Gaussian Measurements in Compressed Sensing , 2010, Found. Comput. Math..

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

[19]  Dirk Werner,et al.  What's Happening in the Mathematical Sciences? , 2001 .

[20]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[21]  Mahdi Cheraghchi,et al.  Bit precision analysis for compressed sensing , 2009, 2009 IEEE International Symposium on Information Theory.

[22]  G. Pisier.  The volume of convex bodies and Banach space geometry , 1989 .

[23]  P. Bickel,et al.  SIMULTANEOUS ANALYSIS OF LASSO AND DANTZIG SELECTOR , 2008, 0801.1095.

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

[25]  E. Candès,et al.  Error correction via linear programming , 2005, FOCS 2005.

[26]  Dietrich Stoyan,et al.  Stochastic Geometry and Random Tessellations , 2007 .

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

[28]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

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