A survey of compressed sensing
From MaRDI portal
Recommendations
Cites work
- A mathematical introduction to compressive sensing
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- A Probabilistic and RIPless Theory of Compressed Sensing
- A simple proof of the restricted isometry property for random matrices
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Approximate sparse recovery: optimizing time and measurements
- Approximation of functions of few variables in high dimensions
- Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
- Atomic Decomposition by Basis Pursuit
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Capturing ridge functions in high dimensions from point queries
- Complexity of approximation of functions of few variables in high dimensions
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Compressed Sensing and Redundant Dictionaries
- Compressive sensing
- Computational Complexity
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Decoding by Linear Programming
- Extensions of Lipschitz mappings into a Hilbert space
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 5485456 (Why is no real title available?)
- scientific article; zbMATH DE number 3676637 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 1508646 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- Kirkman Equiangular Tight Frames and Codes
- Learning functions of few arbitrary linear parameters in high dimensions
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Matching pursuits with time-frequency dictionaries
- Model-Based Compressive Sensing
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- New Bounds for Restricted Isometry Constants
- On the performance of algorithms for the minimization of ℓ 1 -penalized functionals
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- On variants of the Johnson–Lindenstrauss lemma
- Random sampling of sparse trigonometric polynomials
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Robust Recovery of Signals From a Structured Union of Subspaces
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Shifting Inequality and Recovery of Sparse Signals
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse Legendre expansions via _1-minimization
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Stable signal recovery from incomplete and inaccurate measurements
- Templates for convex cone problems with applications to sparse signal recovery
- The concentration of measure phenomenon
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The restricted isometry property and its implications for compressed sensing
Cited in
(31)- Extensions of compressed sensing
- Compressed sensing and its applications. Second international MATHEON conference, December 2015
- Sparse representation of vectors in lattices and semigroups
- On the volume of unit balls of finite-dimensional Lorentz spaces
- Entropy numbers of finite-dimensional embeddings
- On some aspects of approximation of ridge functions
- Sampling theory, a renaissance. Compressive sensing and other developments
- Theory and applications of compressed sensing
- Carl's inequality for quasi-Banach spaces
- scientific article; zbMATH DE number 6500467 (Why is no real title available?)
- An introduction to compressed sensing
- A short introduction to compressive sensing
- A mathematical introduction to compressive sensing
- Flavors of compressive sensing
- Finite frames for sparse signal processing
- Sparse convex optimization via adaptively regularized hard thresholding
- Compressed sensing: a survey
- Optimizing sparsity over lattices and semigroups
- Distance-sparsity transference for vertices of corner polyhedra
- Compressed sensing from a harmonic analysis point of view
- An Introduction to Compressed Sensing
- Compressed sensing with applications in wireless networks
- Introduction to compressed sensing and sparse filtering
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
- Compressed sensing and dictionary learning
- The maximum feasible subset problem (maxFS) and applications
- Embracing off-the-grid samples
- scientific article; zbMATH DE number 7750674 (Why is no real title available?)
- Inexact fixed-point proximity algorithm for the _0 sparse regularization problem
- On the implementation of ADMM with dynamically configurable parameter for the separable _1/_2 minimization
- Sparsity and proximity transference in integer programming
This page was built for publication: A survey of compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460827)
