An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
From MaRDI portal
Publication:2251220
DOI10.1007/s10851-013-0453-4zbMath1319.94018OpenAlexW1997764727MaRDI QIDQ2251220
Charles Dossal, N. Pustelnik, Yannick Berthoumieu, Philippe Ricoux, Flavius Turcu
Publication date: 11 July 2014
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-013-0453-4
Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Uses Software
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Explicit constructions of RIP matrices and related problems
- Iterative hard thresholding for compressed sensing
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- A numerical exploration of compressed sampling recovery
- Deterministic constructions of compressed sensing matrices
- Proximal Splitting Methods in Signal Processing
- Optimization with Sparsity-Inducing Penalties
- On the Fundamental Limits of Adaptive Sensing
- 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
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Sparse representations in unions of bases
- Just relax: convex programming methods for identifying sparse signals in noise
- Uncertainty principles and ideal atomic decomposition
- Towards a Mathematical Theory of Super‐resolution
