On oracle-type local recovery guarantees in compressed sensing

DOI10.1093/IMAIAI/IAAA007MaRDI QIDQ5006480zbMATH OpenOpenAlexFDO

Authors Ben Adcock, Claire Boyer, Simone Brugiapaglia

Publication date 16 August 2021

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

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

zbMATH Keywords

compressed sensinglocal recovery guaranteeoracle-type inequalitystructured sparsityvariable density sampling

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Sampling theory, sample surveys (62D05) Density estimation (62G07) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Abstract: We present improved sampling complexity bounds for stable and robust sparse recovery in compressed sensing. Our unified analysis based on l1 minimization encompasses the case where (i) the measurements are block-structured samples in order to reflect the structured acquisition that is often encountered in applications; (ii) the signal has an arbitrary structured sparsity, by results depending on its support S. Within this framework and under a random sign assumption, the number of measurements needed by l1 minimization can be shown to be of the same order than the one required by an oracle least-squares estimator. Moreover, these bounds can be minimized by adapting the variable density sampling to a given prior on the signal support and to the coherence of the measurements. We illustrate both numerically and analytically that our results can be successfully applied to recover Haar wavelet coefficients that are sparse in levels from random Fourier measurements in dimension one and two, which can be of particular interest in imaging problems. Finally, a preliminary numerical investigation shows the potential of this theory for devising adaptive sampling strategies in sparse polynomial approximation.

Recommendations

• Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
• An unbiased approach to compressed sensing
• On the role of total variation in compressed sensing
• \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
• Compressed sensing

Cited in

(15)

• Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling
• Local recovery bounds for prior support constrained compressed sensing
• A numerical exploration of compressed sampling recovery
• Near oracle performance and block analysis of signal space greedy methods
• Recovering block-structured activations using compressive measurements
• Globally sparse and locally dense signal recovery for compressed sensing
• Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
• Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames
• Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
• An unbiased approach to compressed sensing
• Compressed sensing photoacoustic tomography reduces to compressed sensing for undersampled Fourier measurements
• A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry
• Compressed sensing with frames and sparsity in levels class
• Adapted variable density subsampling for compressed sensing
• Polynomial-augmented neural networks (PANNs) with weak orthogonality constraints for enhanced function and PDE approximation

This page was built for publication: On oracle-type local recovery guarantees in compressed sensing

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