On efficiency of Orthogonal Matching Pursuit

Details On efficiency of Orthogonal Matching Pursuit On efficiency of Orthogonal Matching Pursuit

2010-04-22

arxiv.org/abs/1004.3946v1

Mathematics

Numerical Analysis

Scientific paper

We show that if a matrix $\Phi$ satisfies the RIP of order $[CK^{1.2}]$ with isometry constant $\dt = c K^{-0.2}$ and has coherence less than $1/(20 K^{0.8})$, then Orthogonal Matching Pursuit (OMP) will recover $K$-sparse signal $x$ from $y=\Phi x$ in at most $[CK^{1.2}]$ iterations. This result implies that $K$-sparse signal can be recovered via OMP by $M=O(K^{1.6}\log N)$ measurements.

Affiliated with

Also associated with

No associations

Rating

On efficiency of 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 On efficiency of Orthogonal Matching Pursuit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On efficiency of Orthogonal Matching Pursuit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-459768