Sparse signal recovery using a new class of random matrices
From MaRDI portal
Publication:520894
DOI10.1515/apam-2016-0039zbMath1361.60007OpenAlexW2581191450MaRDI QIDQ520894
Publication date: 6 April 2017
Published in: Advances in Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/apam-2016-0039
Related Items
Cites Work
- Unnamed Item
- A mathematical introduction to compressive sensing
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Iterative hard thresholding for compressed sensing
- Random sampling of sparse trigonometric polynomials
- The restricted isometry property and its implications for compressed sensing
- Sparsity in time-frequency representations
- A simple proof of the restricted isometry property for random matrices
- Invertibility of ``large submatrices with applications to the geometry of Banach spaces and harmonic analysis
- Non commutative Khintchine and Paley inequalities
- On the best constants in noncommutative Khintchine-type inequalities
- Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Compressed sensing and best 𝑘-term approximation
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Greed is Good: Algorithmic Results for Sparse Approximation
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
- Just relax: convex programming methods for identifying sparse signals in noise
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
- Operator Khintchine inequality in non-commutative probability
