Computer Science – Information Theory
Scientific paper
2012-01-13
Computer Science
Information Theory
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.
Mo Qun
Shen Yi
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-468415