Highly Influenced

4 Excerpts

- Published 2011 in ArXiv

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.

Citations per Year

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

See our **FAQ** for additional information.

Showing 1-10 of 138 extracted citations

Highly Influenced

4 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

7 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

8 Excerpts

Highly Influenced

6 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

1 Excerpt

Highly Influenced

2 Excerpts

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