A numerical exploration of compressed sampling recovery
From MaRDI portal
Publication:2267399
DOI10.1016/j.laa.2009.11.022zbMath1181.94042OpenAlexW2094503020MaRDI QIDQ2267399
Gabriel Peyré, Charles Dossal, Jalal Fadili
Publication date: 1 March 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.11.022
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Related Items (7)
Computing and analyzing recoverable supports for sparse reconstruction ⋮ Sparse total least squares: analysis and greedy algorithms ⋮ The restricted isometry property for random block diagonal matrices ⋮ A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization ⋮ An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices ⋮ Towards a Mathematical Theory of Super‐resolution ⋮ Empirical average-case relation between undersampling and sparsity in X-ray CT
Uses Software
Cites Work
- Unnamed Item
- Smooth minimization of non-smooth functions
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- The restricted isometry property and its implications for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Extensions of compressed sensing
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Compressed Sensing: How Sharp Is the Restricted Isometry Property?
- On sparse reconstruction from Fourier and Gaussian measurements
- An EM algorithm for wavelet-based image restoration
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Sparse representations in unions of bases
- Just relax: convex programming methods for identifying sparse signals in noise
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A generalized uncertainty principle and sparse representation in pairs of bases
- On sparse representation in pairs of bases
- Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Neighborliness of randomly projected simplices in high dimensions
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Signal Recovery by Proximal Forward-Backward Splitting
- Computer Vision - ECCV 2004
- Compressed sensing
This page was built for publication: A numerical exploration of compressed sampling recovery
