Robustness of orthogonal matching pursuit under restricted isometry property
From MaRDI portal
Publication:476748
DOI10.1007/s11425-013-4655-4zbMath1307.65021OpenAlexW1973029877MaRDI QIDQ476748
Publication date: 2 December 2014
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-013-4655-4
signal reconstructioncompressed sensingorthogonal matching pursuitrestricted isometry propertyundetermined equation
Numerical mathematical programming methods (65K05) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Algorithms for approximation of functions (65D15)
Related Items
Required Number of Iterations for Sparse Signal Recovery via Orthogonal Least Squares ⋮ Efficiency of weak greedy algorithms for \(m\)-term approximations ⋮ Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization ⋮ Distributed compressed sensing for multi-sourced fusion and secure signal processing in private cloud ⋮ A new sufficient condition for sparse recovery with multiple orthogonal least squares ⋮ Compressed sensing based on trust region method ⋮ Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP ⋮ A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit ⋮ Analysis of orthogonal multi-matching pursuit under restricted isometry property ⋮ A sharp RIP condition for orthogonal matching pursuit
Uses Software
Cites Work
- Sparse recovery by non-convex optimization - instance optimality
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Recovery of sparse signals using OMP and its variants: convergence analysis based on RIP
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Signal recovery with partially known signal support
- Compressed sensing: a survey
- The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Stable Recovery of Sparse Signals and an Oracle Inequality
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Compressed sensing
