Quantization of compressive samples with stable and robust recovery

@article{Saab2015QuantizationOC,
  title={Quantization of compressive samples with stable and robust recovery},
  author={Rayan Saab and Rongrong Wang and {\"O}zg{\"u}r Yilmaz},
  journal={ArXiv},
  year={2015},
  volume={abs/1504.00087}
}
In this paper we study the quantization stage that is implicit in any compressed sensing signal acquisition paradigm. We propose using Sigma-Delta quantization and a subsequent reconstruction scheme based on convex optimization. We prove that the reconstruction error due to quantization decays polynomially in the number of measurements. Our results apply to arbitrary signals, including compressible ones, and account for measurement noise. Additionally, they hold for sub-Gaussian (including… Expand

Paper Mentions

Quantization for Low-Rank Matrix Recovery
TLDR
A full generalization of analogous results, obtained in the classical setup of bandlimited function acquisition, and more recently, in the finite frame and compressed sensing setups to the case of low-rank matrices sampled with sub-Gaussian linear operators, is provided. Expand
Quantized compressed sensing for random circulant matrices
Abstract We provide the first analysis of a non-trivial quantization scheme for compressed sensing with structured measurements. We consider compressed sensing matrices consisting of rows selectedExpand
Quantized compressed sensing for partial random circulant matrices
  • J. Feng, F. Krahmer, Rayan Saab
  • Mathematics, Computer Science
  • 2017 International Conference on Sampling Theory and Applications (SampTA)
  • 2017
TLDR
This analysis studies compressed sensing matrices consisting of rows selected at random, without replacement, from a circulant matrix generated by a random subgaussian vector, and shows that the part of the reconstruction error due to quantization decays polynomially in the number of measurements. Expand
On one-stage recovery for Σ∆-quantized compressed sensing
  • Arman Arian, Özgür Yilmaz
  • Computer Science
  • 2019 13th International conference on Sampling Theory and Applications (SampTA)
  • 2019
TLDR
This work focuses on one of the approaches that yield efficient quantizers for CS: Σ∆ quantization, followed by a one-stage tractable reconstruction method, which was developed in [20] with theoretical error guarantees in the case of sub-Gaussian matrices. Expand
Deterministic compressed sensing and quantization
TLDR
This note focuses on quantization in CS with chirp sensing matrices and present quantization approaches and numerical experiments. Expand
On one-stage recovery for $\Sigma \Delta$-quantized compressed sensing
TLDR
This work focuses on one of the approaches that yield efficient quantizers for CS: $\Sigma \Delta$ quantization, followed by a one-stage tractable reconstruction method, which was developed by Saab et al. with theoretical error guarantees in the case of sub-Gaussian matrices. Expand
Memoryless scalar quantization for random frames
TLDR
This work rigorously establishes sharp non-asymptotic error bounds without using the WNH that explain the observed decay rate, and extends this approach to the compressed sensing setting, obtaining rigorous error bounds that agree with empirical observations. Expand
One-Bit Compressive Sensing of Dictionary-Sparse Signals
TLDR
This work analyzes several different algorithms---based on convex programming and on hard thresholding---and shows that, under natural assumptions on the sensing matrix (satisfied by Gaussian matrices), these algorithms can efficiently recover analysis-dictionary-sparse signals in the one-bit model. Expand
Quantization for spectral super-resolution
TLDR
The oversampling ratio λ is defined as the largest integer such that ⌊M/λ⌋ − 1 ≥ 4/∆, where M denotes the number of Fourier measurements and ∆ is the minimum separation distance associated with the atomic measure to be resolved. Expand
Quantized Compressed Sensing: A Survey
  • S. Dirksen
  • Computer Science
  • Applied and Numerical Harmonic Analysis
  • 2019
TLDR
An overview of the state-of-the-art rigorous reconstruction results that have been obtained for three popular quantization models: one-bit quantization, uniform scalarquantization, and noise-shaping methods is given. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 60 REFERENCES
Quantization and Compressive Sensing
TLDR
This chapter explores the interaction of quantization and compressive sensing and examines practical quantization strategies for compressive acquisition systems and provides a brief overview ofquantization and examines fundamental performance bounds applicable to any quantization approach. Expand
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
TLDR
This paper investigates an alternative CS approach that shifts the emphasis from the sampling rate to the number of bits per measurement, and introduces the binary iterative hard thresholding algorithm for signal reconstruction from 1-bit measurements that offers state-of-the-art performance. Expand
Stabilizing Nonuniformly Quantized Compressed Sensing With Scalar Companders
This paper addresses the problem of stably recovering sparse or compressible signals from compressed sensing measurements that have undergone optimal nonuniform scalar quantization, i.e., minimizingExpand
Sobolev Duals for Random Frames and ΣΔ Quantization of Compressed Sensing Measurements
TLDR
This paper shows that if an rth-order ΣΔ (Sigma–Delta) quantization scheme with the same output alphabet is used to quantize y, then there is an alternative recovery method via Sobolev dual frames which guarantees a reduced approximation error of the order δ(k/m)(r−1/2)α for any 0<α<1, if m≳r,αk(logN)1/(1−α). Expand
Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine
TLDR
A new class of convex optimization programs, or decoders, coined Basis Pursuit DeQuantizer of moment p (BPDQp), that model the quantization distortion more faithfully than the commonly used Basis pursuit DeNoise (B PDN) program are presented. Expand
1-Bit compressive sensing
TLDR
This paper reformulates the problem by treating the 1-bit measurements as sign constraints and further constraining the optimization to recover a signal on the unit sphere, and demonstrates that this approach performs significantly better compared to the classical compressive sensing reconstruction methods, even as the signal becomes less sparse and as the number of measurements increases. Expand
Universal Rate-Efficient Scalar Quantization
  • P. Boufounos
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 2012
TLDR
It is demonstrated that it is possible to reduce the quantization error by incorporating side information on the acquired signal, such as sparse signal models or signal similarity with known signals, and establish a relationship between quantization performance and the Kolmogorov entropy of the signal model. Expand
Iterative Hard Thresholding for Compressed Sensing
TLDR
This paper presents a theoretical analysis of the iterative hard thresholding algorithm when applied to the compressed sensing recovery problem and shows that the algorithm has the following properties - it gives near-optimal error guarantees, and is robust to observation noise. Expand
Subspace Pursuit for Compressive Sensing Signal Reconstruction
TLDR
The presented analysis shows that in the noiseless setting, the proposed algorithm can exactly reconstruct arbitrary sparse signals provided that the sensing matrix satisfies the restricted isometry property with a constant parameter. Expand
Message-Passing De-Quantization With Applications to Compressed Sensing
TLDR
This paper develops message-passing de-quantization algorithms for minimum mean-squared error estimation of a random vector from quantized linear measurements, notably allowing the linear expansion to be overcomplete or undercomplete and the scalar quantization to be regular or non-regular. Expand
...
1
2
3
4
5
...