Quantized compressed sensing for random circulant matrices
From MaRDI portal
Abstract: We provide the first analysis of a non-trivial quantization scheme for compressed sensing measurements arising from structured measurements. Specifically, our analysis studies compressed sensing matrices consisting of rows selected at random, without replacement, from a circulant matrix generated by a random subgaussian vector. We quantize the measurements using stable, possibly one-bit, Sigma-Delta schemes, and use a reconstruction method based on convex optimization. We show that the part of the reconstruction error due to quantization decays polynomially in the number of measurements. This is in line with analogous results on Sigma-Delta quantization associated with random Gaussian or subgaussian matrices, and significantly better than results associated with the widely assumed memoryless scalar quantization. Moreover, we prove that our approach is stable and robust; i.e., the reconstruction error degrades gracefully in the presence of non-quantization noise and when the underlying signal is not strictly sparse. The analysis relies on results concerning subgaussian chaos processes as well as a variation of McDiarmid's inequality.
Recommendations
- Compressed sensing and \(\Sigma\Delta\)-quantization
- Quantization of compressive samples with stable and robust recovery
- Robust one-bit compressed sensing with partial circulant matrices
- Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements
- Sigma delta quantization with harmonic frames and partial Fourier ensembles
Cites work
- A mathematical introduction to compressive sensing
- An optimal family of exponentially accurate one-bit sigma-delta quantization schemes
- Approximating a bandlimited function using very coarsely quantized data: a family of stable sigma-delta modulators of arbitrary order
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing
- Compressive sensing and structured random matrices
- Compressive sensing by random convolution
- Democracy in action: quantization, saturation, and compressive sensing
- Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine
- Fast binary embeddings and quantized compressed sensing with structured matrices
- From Compressed Sensing to Compressed Bit-Streams: Practical Encoders, Tractable Decoders
- Iterative hard thresholding for compressed sensing
- Lower bounds for the error decay incurred by coarse quantization schemes
- Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing
- On sparse reconstruction from Fourier and Gaussian measurements
- One-bit compressed sensing by linear programming
- One-bit compressed sensing with partial Gaussian circulant matrices
- One-bit sigma-delta quantization with exponential accuracy
- Oversampled Sigma-Delta Modulation
- Probabilistic methods for algorithmic discrete mathematics
- Quantized compressive sensing with RIP matrices: the benefit of dithering
- Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
- Restricted isometries for partial random circulant matrices
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Root-Exponential Accuracy for Coarse Quantization of Finite Frame Expansions
- Sigma-Delta quantization of sub-Gaussian frame expansions and its application to compressed sensing
- Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames
- Smooth frame-path termination for higher order sigma-delta quantization
- Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements
- Sobolev duals in frame theory and Sigma-Delta quantization
- Stable signal recovery from incomplete and inaccurate measurements
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Suprema of chaos processes and the restricted isometry property
- The pros and cons of democracy
- The sizes of compact subsets of Hilbert space and continuity of Gaussian processes
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Upper and lower bounds for stochastic processes. Modern methods and classical problems
Cited in
(14)- Uniform recovery guarantees for quantized corrupted sensing using structured or generative priors
- Memoryless scalar quantization for random frames
- High-order low-bit Sigma-Delta quantization for fusion frames
- Robust one-bit compressed sensing with partial circulant matrices
- Quantized compressive sensing with RIP matrices: the benefit of dithering
- Sigma Delta Quantization for Images
- On recovery guarantees for one-bit compressed sensing on manifolds
- Compressed sensing and \(\Sigma\Delta\)-quantization
- Analysis of quantization noise spectrum in signal reconstruction
- Fast binary embeddings and quantized compressed sensing with structured matrices
- Endpoint results for Fourier integral operators on noncompact symmetric spaces
- Robust dequantized compressive sensing
- One-bit compressed sensing with partial Gaussian circulant matrices
- Quantized compressed sensing: a survey
This page was built for publication: Quantized compressed sensing for random circulant matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2330944)
