A survey on compressive sensing: classical results and recent advancements
From MaRDI portal
Publication:5855706
DOI10.22124/jmm.2020.16701.1450zbMath1488.94058arXiv1908.01014MaRDI QIDQ5855706
Mehdi Rezaee, Ahmad Mousavi, Ramin Ayanzadeh
Publication date: 19 March 2021
Full work available at URL: https://arxiv.org/abs/1908.01014
90C35: Programming involving graphs or networks
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- Testing the nullspace property using semidefinite programming
- A unified primal-dual algorithm framework based on Bregman iteration
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- Iterative hard thresholding for compressed sensing
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Iterative thresholding algorithms
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- A simple proof of the restricted isometry property for random matrices
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- A sharp RIP condition for orthogonal matching pursuit
- Sparse recovery with integrality constraints
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Compressed sensing and its applications. MATHEON workshop, Berlin, Germany, December 2013
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- Compressed sensing for finite-valued signals
- Quantization of compressive samples with stable and robust recovery
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Atomic Decomposition by Basis Pursuit
- On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
- Theory and applications of compressed sensing
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Multipath Matching Pursuit
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- On Mehrotra-Type Predictor-Corrector Algorithms
- An EM algorithm for wavelet-based image restoration
- Greed is Good: Algorithmic Results for Sparse Approximation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- Robust methods in inverse theory
- Does $\ell _{p}$ -Minimization Outperform $\ell _{1}$ -Minimization?
- Sparse Optimization Theory and Methods
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Shifting Inequality and Recovery of Sparse Signals
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- Generalized Orthogonal Matching Pursuit
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- GESPAR: Efficient Phase Retrieval of Sparse Signals
- Support Recovery With Orthogonal Matching Pursuit in the Presence of Noise
- Perfect Recovery Conditions for Non-negative Sparse Modeling
- A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A generalized uncertainty principle and sparse representation in pairs of bases
- Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$
- An adaptive inverse scale space method for compressed sensing
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ1 minimization
- Sparse Signal Recovery with Exponential-Family Noise
- A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- A Probabilistic and RIPless Theory of Compressed Sensing
- Blind Compressed Sensing
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
- Model-Based Compressive Sensing
- Sparsity and incoherence in compressive sampling
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Exact Recovery Conditions for Sparse Representations With Partial Support Information
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Greedy Sparsity-Constrained Optimization
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
