Performance of Orthogonal Matching Pursuit for Multiple Measurement Vectors

Details Performance of Orthogonal Matching Pursuit for Multiple Measurement Vectors Performance of Orthogonal Matching Pursuit for Multiple Measurement Vectors

2011-09-29

arxiv.org/abs/1109.6390v1

Computer Science

Information Theory

Scientific paper

In this paper, we consider orthogonal matching pursuit (OMP) algorithm for multiple measurement vectors (MMV) problem. The robustness of OMPMMV is studied under general perturbations---when the measurement vectors as well as the sensing matrix are incorporated with additive noise. The main result shows that although exact recovery of the sparse solutions is unrealistic in noisy scenario, recovery of the support set of the solutions is guaranteed under suitable conditions. Specifically, a sufficient condition is derived that guarantees exact recovery of the sparse solutions in noiseless scenario.

Affiliated with

Also associated with

No associations

Rating

Performance of Orthogonal Matching Pursuit for Multiple Measurement Vectors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Performance of Orthogonal Matching Pursuit for Multiple Measurement Vectors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance of Orthogonal Matching Pursuit for Multiple Measurement Vectors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-151153