A remark on the Restricted Isometry Property in Orthogonal Matching Pursuit

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

This paper demonstrates that if the restricted isometry constant $\delta_{K+1}$ of the measurement matrix $A$ satisfies $$ \delta_{K+1} < \frac{1}{\sqrt{K}+1}, $$ then a greedy algorithm called Orthogonal Matching Pursuit (OMP) can recover every $K$--sparse signal $\mathbf{x}$ in $K$ iterations from $A\x$. By contrast, a matrix is also constructed with the restricted isometry constant $$ \delta_{K+1} = \frac{1}{\sqrt{K}} $$ such that OMP can not recover some $K$-sparse signal $\mathbf{x}$ in $K$ iterations. This result positively verifies the conjecture given by Dai and Milenkovic in 2009.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A remark on the Restricted Isometry Property in Orthogonal Matching Pursuit 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 A remark on the Restricted Isometry Property in Orthogonal Matching Pursuit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A remark on the Restricted Isometry Property in Orthogonal Matching Pursuit will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-468415

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.