A remark on joint sparse recovery with OMP algorithm under restricted isometry property
From MaRDI portal
(Redirected from Publication:1740232)
Recommendations
- Improved bounds on restricted isometry constant for orthogonal multi matching pursuit
- Recovery of sparse signals by orthogonal multi-matching pursuit
- A sharp RIP condition for orthogonal matching pursuit
- The performance of orthogonal multi-matching pursuit under the restricted isometry property
- Recovery of sparse signals using OMP and its variants: convergence analysis based on RIP
Cites work
- A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Analysis of convergence for the alternating direction method applied to joint sparse recovery
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- High-Resolution Radar via Compressed Sensing
- Stable recovery of sparse overcomplete representations in the presence of noise
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
- The restricted isometry property and its implications for compressed sensing
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
Cited in
(4)
This page was built for publication: A remark on joint sparse recovery with OMP algorithm under restricted isometry property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740232)