Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
Authors:
Top Cited Papers
- 23 January 2013
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (4) , 2082-2102
Abstract
The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse signals. Practical ADCs not only sample but also quantize each measurement to a finite number of bits; moreover, there is an inverse relationship between the achievable sampling rate and the bit depth. In this paper, we investigate an alternative CS approach that shifts the emphasis from the sampling rate to the number of bits per measurement. In particular, we explore the extreme case of 1-bit CS measurements, which capture just their sign. Our results come in two flavors. First, we consider ideal reconstruction from noiseless 1-bit measurements and provide a lower bound on the best achievable reconstruction error. We also demonstrate that i.i.d. random Gaussian matrices provide measurement mappings that, with overwhelming probability, achieve nearly optimal error decay. Next, we consider reconstruction robustness to measurement errors and noise and introduce the binary ε-stable embedding property, which characterizes the robustness of the measurement process to sign changes. We show that the same class of matrices that provide almost optimal noiseless performance also enable such a robust mapping. On the practical side, we introduce the binary iterative hard thresholding algorithm for signal reconstruction from 1-bit measurements that offers state-of-the-art performance.Keywords
All Related Versions
This publication has 51 references indexed in Scilit:
- Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching PursuitFoundations of Computational Mathematics, 2008
- Quantization Noise Shaping on Arbitrary Frame ExpansionsEURASIP Journal on Advances in Signal Processing, 2006
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Are Loss Functions All the Same?Neural Computation, 2004
- One‐bit sigma‐delta quantization with exponential accuracyCommunications on Pure and Applied Mathematics, 2003
- Analog-to-digital converter survey and analysisIEEE Journal on Selected Areas in Communications, 1999
- Vector quantization analysis of ΣΔ modulationIEEE Transactions on Signal Processing, 1996
- An overview of sigma-delta convertersIEEE Signal Processing Magazine, 1996
- Reduction of the MSE in R-times oversampled A/D conversion O(1/R) to O(1/R/sup 2/)IEEE Transactions on Signal Processing, 1994
- A new proof of the transposition theoremProceedings of the American Mathematical Society, 1970