Analysis of orthogonal multi-matching pursuit under restricted isometry property
DOI10.1007/S11425-014-4843-XzbMATH Open1307.65020OpenAlexW2252480727MaRDI QIDQ477291FDOQ477291
Publication date: 3 December 2014
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-014-4843-x
Recommendations
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- The performance of orthogonal multi-matching pursuit under the restricted isometry property
- Orthogonal matching pursuit under the restricted isometry property
- A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit
- Improved bounds on restricted isometry constant for orthogonal multi matching pursuit
- Robustness of orthogonal matching pursuit under restricted isometry property
- On the efficiency of the orthogonal matching pursuit in compressed sensing
- On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit
- Recovery of sparse signals by orthogonal multi-matching pursuit
- Perturbation Analysis of Orthogonal Matching Pursuit
algorithmsparse recoveryorthogonal matching pursuitrestricted isometry propertysignal reconstruction
Numerical mathematical programming methods (65K05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Algorithms for approximation of functions (65D15)
Cites Work
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Decoding by Linear Programming
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Greed is Good: Algorithmic Results for Sparse Approximation
- Sparse recovery by non-convex optimization - instance optimality
- Robustness of orthogonal matching pursuit under restricted isometry property
- Shifting Inequality and Recovery of Sparse Signals
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Recovery of sparse signals using OMP and its variants: convergence analysis based on RIP
- A sharp RIP condition for orthogonal matching pursuit
- Generalized Orthogonal Matching Pursuit
- Compressed sensing: a survey
Cited In (7)
- Efficiency of weak greedy algorithms for \(m\)-term approximations
- Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
- A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit
- 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
- Design and Generalization Analysis of Orthogonal Matching Pursuit Algorithms
Uses Software
This page was built for publication: Analysis of orthogonal multi-matching pursuit under restricted isometry property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477291)
