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 ∈ R from the signs of O(s log(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.

Extracted Key Phrases

1 Figure or Table

Citations per Year

219 Citations

Semantic Scholar estimates that this publication has 219 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Plan2011OnebitCS, title={One-bit compressed sensing by linear programming}, author={Yaniv Plan and Roman Vershynin}, journal={CoRR}, year={2011}, volume={abs/1109.4299} }