Optimal dual certificates for noise robustness bounds in compressive sensing
DOI10.1007/S10851-015-0575-YzbMATH Open1353.94019OpenAlexW2093898758MaRDI QIDQ892815FDOQ892815
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
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
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Probing the Pareto frontier for basis pursuit solutions
- Atomic Decomposition by Basis Pursuit
- Decoding by Linear Programming
- Just relax: convex programming methods for identifying sparse signals in noise
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- Necessary and sufficient conditions for linear convergence of \(\ell^1\)-regularization
- On Sparse Representations in Arbitrary Redundant Bases
- Convergence rates of convex variational regularization
- Variational methods in imaging
- On Polar Polytopes and the Recovery of Sparse Representations
- The restricted isometry property and its implications for compressed sensing
- Super-resolution from noisy data
- Towards a Mathematical Theory of Super‐resolution
- Near-ideal model selection by \(\ell _{1}\) minimization
- Exact support recovery for sparse spikes deconvolution
- Robust Sparse Analysis Regularization
- A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization
- Consistency of \(\ell_1\) recovery from noisy deterministic measurements
Cited In (1)
Uses Software
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)
