Sigma-Delta quantization of sub-Gaussian frame expansions and its application to compressed sensing

DOI10.1093/IMAIAI/IAT007MaRDI QIDQ5177862zbMATH OpenOpenAlexFDO

Authors Felix Krahmer, Rayan Saab, Özgür Yılmaz

Publication date 6 March 2015

Published in Information and Inference: A Journal of the IMA (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1306.4549

zbMATH Keywords

compressed sensingquantizationrandom framesroot-exponential accuracysigma-deltasub-Gaussian matrices

Mathematics Subject Classification ID

Application of orthogonal and other special functions (94A11) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Suppose that the collection ${e_i}_{i=1}^m$ forms a frame for $R^k$, where each entry of the vector $e_i$ is a sub-Gaussian random variable. We consider expansions in such a frame, which are then quantized using a Sigma-Delta scheme. We show that an arbitrary signal in $R^k$ can be recovered from its quantized frame coefficients up to an error which decays root-exponentially in the oversampling rate $m/k$. Here the quantization scheme is assumed to be chosen appropriately depending on the oversampling rate and the quantization alphabet can be coarse. The result holds with high probability on the draw of the frame uniformly for all signals. The crux of the argument is a bound on the extreme singular values of the product of a deterministic matrix and a sub-Gaussian frame. For fine quantization alphabets, we leverage this bound to show polynomial error decay in the context of compressed sensing. Our results extend previous results for structured deterministic frame expansions and Gaussian compressed sensing measurements.

Recommendations

• Compressed sensing and -quantization
• Near-optimal encoding for sigma-delta quantization of finite frame expansions
• Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements
• Complex sigma-delta quantization algorithms for finite frames
• Performance of Sigma–Delta Quantizations in Finite Frames
• Performance of Sigma–Delta Quantizations in Finite Frames
• Frame paths and error bounds for sigma-delta quantization
• Sigma delta quantization with harmonic frames and partial Fourier ensembles
• Adapted decimation on finite frames for arbitrary orders of sigma-delta quantization
• Analysis of decimation on finite frames with sigma-delta quantization

Cited in

(19)

• Sigma delta quantization with harmonic frames and partial Fourier ensembles
• Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements
• On recovery guarantees for one-bit compressed sensing on manifolds
• On the \(\ell^\infty\)-norms of the singular vectors of arbitrary powers of a difference matrix with applications to sigma-delta quantization
• Memoryless scalar quantization for random frames
• Quantized compressed sensing for random circulant matrices
• Quantization of compressive samples with stable and robust recovery
• Noise-shaping quantization methods for frame-based and compressive sampling systems
• Quantized compressed sensing: a survey
• Quantization and compressive sensing
• Sigma-delta quantization for fusion frames and distributed sensor networks
• Near-optimal encoding for sigma-delta quantization of finite frame expansions
• Compressed sensing and -quantization
• Endpoint results for Fourier integral operators on noncompact symmetric spaces
• High-order low-bit Sigma-Delta quantization for fusion frames
• Sigma Delta Quantization for Images
• One-bit sigma-delta modulation on the circle
• Frame quantization of neural networks
• Distributed noise-shaping quantization. I: Beta duals of finite frames and near-optimal quantization of random measurements

This page was built for publication: Sigma-Delta quantization of sub-Gaussian frame expansions and its application to compressed sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5177862)