A remark on joint sparse recovery with OMP algorithm under restricted isometry property

DOI10.1016/j.amc.2017.07.081zbMath1426.94067OpenAlexW2760700656MaRDI QIDQ1740232

Xiaobo Yang, Jiaxin Xie, An-Ping Liao

Publication date: 29 April 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.07.081

zbMATH Keywords

greedy algorithmscompressed sensingorthogonal matching pursuitrestricted isometry propertyjoint sparse recovery

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Inverse problems in linear algebra (15A29) Numerical solution to inverse problems in abstract spaces (65J22)

Related Items (1)

Some results on OMP algorithm for MMV problem

Cites Work

• Analysis of convergence for the alternating direction method applied to joint sparse recovery
• The restricted isometry property and its implications for compressed sensing
• Algorithms for simultaneous sparse approximation. II: Convex relaxation
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• Greed is Good: Algorithmic Results for Sparse Approximation
• High-Resolution Radar via Compressed Sensing
• Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit
• The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
• Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property

This page was built for publication: A remark on joint sparse recovery with OMP algorithm under restricted isometry property