One-bit compressed sensing with non-Gaussian measurements
Information Theory
2013-04-10 v2 math.IT
Abstract
In one-bit compressed sensing, previous results state that sparse signals may be robustly recovered when the measurements are taken using Gaussian random vectors. In contrast to standard compressed sensing, these results are not extendable to natural non-Gaussian distributions without further assumptions, as can be demonstrated by simple counter-examples. We show that approximately sparse signals that are not extremely sparse can be accurately reconstructed from single-bit measurements sampled according to a sub-gaussian distribution, and the reconstruction comes as the solution to a convex program.
Cite
@article{arxiv.1208.6279,
title = {One-bit compressed sensing with non-Gaussian measurements},
author = {Albert Ai and Alex Lapanowski and Yaniv Plan and Roman Vershynin},
journal= {arXiv preprint arXiv:1208.6279},
year = {2013}
}
Comments
20 pages, streamlined proofs, improved error bounds