Optimal dual certificates for noise robustness bounds in compressive sensing

DOI10.1007/S10851-015-0575-YMaRDI QIDQ892815zbMATH OpenOpenAlexFDO

Authors Marc Nicodème, Flavius Turcu, Charles Dossal

Publication date 12 November 2015

Published in Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10851-015-0575-y

zbMATH Keywords

sparse approximationcompressive sensingdual certificates\(\ell^1\) minimization

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• On the Achievability of Cramér–Rao Bound in Noisy Compressed Sensing
• Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling
• Optimal D-RIP bounds in compressed sensing
• Compressed Sensing Performance Bounds Under Poisson Noise
• Corrections to “Asymptotic Achievability of the Cramér–Rao Bound for Noisy Compressive Sampling” [Mar 09 1233-1236]
• Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
• Stability and instance optimality for Gaussian measurements in compressed sensing
• Robust dequantized compressive sensing
• Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
• Effective zero-norm minimization algorithms for noisy compressed sensing

Cites work

• A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization
• Atomic Decomposition by Basis Pursuit
• Compressed sensing
• Consistency of \(\ell_1\) recovery from noisy deterministic measurements
• Convergence rates of convex variational regularization
• Decoding by Linear Programming
• Exact support recovery for sparse spikes deconvolution
• Just relax: convex programming methods for identifying sparse signals in noise
• Near-ideal model selection by \(\ell _{1}\) minimization
• Necessary and sufficient conditions for linear convergence of \(\ell^1\)-regularization
• On Polar Polytopes and the Recovery of Sparse Representations
• On Sparse Representations in Arbitrary Redundant Bases
• Probing the Pareto frontier for basis pursuit solutions
• Robust Sparse Analysis Regularization
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Super-resolution from noisy data
• The restricted isometry property and its implications for compressed sensing
• Towards a Mathematical Theory of Super‐resolution
• Variational methods in imaging

Cited in

(1)

• Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling

Describes a project that uses

Uses Software

• OPTI
• SPGL1
• PDCO

This page was built for publication: Optimal dual certificates for noise robustness bounds in compressive sensing

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