Performance of orthogonal matching pursuit for multiple measurement vectors with noise
Authors:
- 1 July 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 67-71
Abstract
Orthogonal matching pursuit (OMP) algorithm for the multiple measurement vectors (MMV) is a greedy method to find the sparse matrix with few nonzero rows that represents the measurement vectors under the sensing matrix. This paper analyzes the recovery performance of OMP for MMV (OMPMMV) in the bounded noise scenarios, and provides the sufficient conditions that are related to the sensing matrix and sparse matrix for exact support recovery. We start with the intuitive sufficient conditions for exact support recovery, and then apply these conditions to scenarios of two types of bounded noise. The results show that under some conditions on the coherence of the sensing matrix and the minimum ℓ 2 norm of any nonzero row vector from the sparse matrix, exact support recovery of sparse matrix can be guaranteed.Keywords
This publication has 12 references indexed in Scilit:
- On the Recovery Limit of Sparse Signals Using Orthogonal Matching PursuitIEEE Transactions on Signal Processing, 2012
- Compressed Sensing2012
- A Remark on the Restricted Isometry Property in Orthogonal Matching PursuitIEEE Transactions on Information Theory, 2012
- Robustness of orthogonal matching pursuit for multiple measurement vectors in noisy scenario2012
- Orthogonal Matching Pursuit for Sparse Signal Recovery With NoiseIEEE Transactions on Information Theory, 2011
- Theoretical Results on Sparse Representations of Multiple-Measurement VectorsIEEE Transactions on Signal Processing, 2006
- Algorithms for simultaneous sparse approximation. Part I: Greedy pursuitSignal Processing, 2006
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Uncertainty principles and ideal atomic decompositionIEEE Transactions on Information Theory, 2001