A survey on compressive sensing: classical results and recent advancements
From MaRDI portal
(Redirected from Publication:5855706)
Abstract: Recovering sparse signals from linear measurements has demonstrated outstanding utility in a vast variety of real-world applications. Compressive sensing is the topic that studies the associated raised questions for the possibility of a successful recovery. This topic is well-nourished and numerous results are available in the literature. However, their dispersity makes it challenging and time-consuming for readers and practitioners to quickly grasp its main ideas and classical algorithms, and further touch upon the recent advancements in this surging field. Besides, the sparsity notion has already demonstrated its effectiveness in many contemporary fields. Thus, these results are useful and inspiring for further investigation of related questions in these emerging fields from new perspectives. In this survey, we gather and overview vital classical tools and algorithms in compressive sensing and describe significant recent advancements. We conclude this survey by a numerical comparison of the performance of described approaches on an interesting application.
Recommendations
Cites work
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A generalized uncertainty principle and sparse representation in pairs of bases
- 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 Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit
- A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
- A sharp RIP condition for orthogonal matching pursuit
- A simple proof of the restricted isometry property for random matrices
- A unified primal-dual algorithm framework based on Bregman iteration
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- An adaptive inverse scale space method for compressed sensing
- An EM algorithm for wavelet-based image restoration
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Atomic decomposition by basis pursuit
- Blind Compressed Sensing
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Compressed sensing and its applications. MATHEON workshop, Berlin, Germany, December 2013
- Compressed sensing for finite-valued signals
- Compressive sampling
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- Data streams: algorithms and applications.
- Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
- Does $\ell _{p}$ -Minimization Outperform $\ell _{1}$ -Minimization?
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- Exact Recovery Conditions for Sparse Representations With Partial Support Information
- Generalized Orthogonal Matching Pursuit
- GESPAR: Efficient Phase Retrieval of Sparse Signals
- Greed is Good: Algorithmic Results for Sparse Approximation
- Greedy sparsity-constrained optimization
- scientific article; zbMATH DE number 5853153 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- Iterative thresholding algorithms
- Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- Model-Based Compressive Sensing
- Multipath Matching Pursuit
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- On Mehrotra-Type Predictor-Corrector Algorithms
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Perfect Recovery Conditions for Non-negative Sparse Modeling
- Quantization of compressive samples with stable and robust recovery
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Robust methods in inverse theory
- RSP-Based Analysis for Sparsest and Least \ell₁-Norm Solutions to Underdetermined Linear Systems
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Shifting Inequality and Recovery of Sparse Signals
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained _1 minimization
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Sparse optimization theory and methods
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- Sparse recovery with integrality constraints
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Sparse signal recovery with exponential-family noise
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparsity and incoherence in compressive sampling
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Support Recovery With Orthogonal Matching Pursuit in the Presence of Noise
- Testing the nullspace property using semidefinite programming
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Theory and applications of compressed sensing
- Theory of compressive sensing via _1-minimization: a non-RIP analysis and extensions
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
Cited in
(10)- Portfolio optimization model with and without options under additional constraints
- Sampling theory, a renaissance. Compressive sensing and other developments
- Quadratic surface support vector machine with L1 norm regularization
- scientific article; zbMATH DE number 6500467 (Why is no real title available?)
- A penalty decomposition algorithm with greedy improvement for mean‐reverting portfolios with sparsity and volatility constraints
- A novel regularization-based optimization approach to sparse mean-reverting portfolios selection
- A survey on compressed sensing approach to systems and control
- Towards probabilistic robust and sparsity-free compressive sampling in civil engineering: a review
- Statistical proxy based mean-reverting portfolios with sparsity and volatility constraints
- Cardinality constrained mean-variance portfolios: a penalty decomposition algorithm
This page was built for publication: A survey on compressive sensing: classical results and recent advancements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855706)
