Quantized compressive sensing with RIP matrices: the benefit of dithering
From MaRDI portal
Abstract: Quantized compressive sensing (QCS) deals with the problem of coding compressive measurements of low-complexity signals with quantized, finite precision representations, i.e., a mandatory process involved in any practical sensing model. While the resolution of this quantization clearly impacts the quality of signal reconstruction, there actually exist incompatible combinations of quantization functions and sensing matrices that proscribe arbitrarily low reconstruction error when the number of measurements increases. This work shows that a large class of random matrix constructions known to respect the restricted isometry property (RIP) is "compatible" with a simple scalar and uniform quantization if a uniform random vector, or a random dither, is added to the compressive signal measurements before quantization. In the context of estimating low-complexity signals (e.g., sparse or compressible signals, low-rank matrices) from their quantized observations, this compatibility is demonstrated by the existence of (at least) one signal reconstruction method, the projected back projection (PBP), whose reconstruction error decays when the number of measurements increases. Interestingly, given one RIP matrix and a single realization of the dither, a small reconstruction error can be proved to hold uniformly for all signals in the considered low-complexity set. We confirm these observations numerically in several scenarios involving sparse signals, low-rank matrices, and compressible signals, with various RIP matrix constructions such as sub-Gaussian random matrices and random partial discrete cosine transform (DCT) matrices.
Recommendations
Cited in
(12)- Memoryless scalar quantization for random frames
- Quantized compressed sensing for random circulant matrices
- Time for dithering: fast and quantized random embeddings via the restricted isometry property
- Endpoint results for Fourier integral operators on noncompact symmetric spaces
- Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
- A unified approach to uniform signal recovery from nonlinear observations
- Robust one-bit compressed sensing with partial circulant matrices
- Uniform recovery guarantees for quantized corrupted sensing using structured or generative priors
- Tensor recovery from quantized measurements based on modewise operators
- A parameter-free two-bit covariance estimator with improved operator norm error rate
- Robust tensor completion from uniformly dithered one-bit observations
- Robust instance optimal phase-only compressed sensing
This page was built for publication: Quantized compressive sensing with RIP matrices: the benefit of dithering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006530)
