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