A Survey of Compressed Sensing
From MaRDI portal
Publication:3460827
DOI10.1007/978-3-319-16042-9_1zbMath1333.94015OpenAlexW948098727MaRDI QIDQ3460827
Jan VybĂral, Gitta Kutyniok, Robert Calderbank, Holger Boche
Publication date: 8 January 2016
Published in: Compressed Sensing and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16042-9_1
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02)
Related Items
The maximum feasible subset problem (maxFS) and applications, Optimizing Sparsity over Lattices and Semigroups, Carl's inequality for quasi-Banach spaces, On the volume of unit balls of finite-dimensional Lorentz spaces, Embracing off-the-grid samples, Unnamed Item, Unnamed Item, Entropy numbers of finite-dimensional embeddings, Distance-Sparsity Transference for Vertices of Corner Polyhedra, On some aspects of approximation of ridge functions, On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels, Sparse representation of vectors in lattices and semigroups
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Learning functions of few arbitrary linear parameters in high dimensions
- Approximation of functions of few variables in high dimensions
- Iterative hard thresholding for compressed sensing
- Random sampling of sparse trigonometric polynomials
- The restricted isometry property and its implications for compressed sensing
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- A simple proof of the restricted isometry property for random matrices
- Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Templates for convex cone problems with applications to sparse signal recovery
- Capturing ridge functions in high dimensions from point queries
- Complexity of approximation of functions of few variables in high dimensions
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Approximate sparse recovery
- Compressed sensing and best đ-term approximation
- New and Improved JohnsonâLindenstrauss Embeddings via the Restricted Isometry Property
- Extensions of Lipschitz mappings into a Hilbert space
- On variants of the JohnsonâLindenstrauss lemma
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and Redundant Representations
- Compressed Sensing and Redundant Dictionaries
- On the performance of algorithms for the minimization of â 1 -penalized functionals
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Atomic Decomposition by Basis Pursuit
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Shifting Inequality and Recovery of Sparse Signals
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Matching pursuits with time-frequency dictionaries
- Compressive Sensing
- Robust Recovery of Signals From a Structured Union of Subspaces
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- A Probabilistic and RIPless Theory of Compressed Sensing
- New Bounds for Restricted Isometry Constants
- Model-Based Compressive Sensing
- Computational Complexity
- Kirkman Equiangular Tight Frames and Codes
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
