On the optimality of Orthogonal Greedy Algorithm for M-coherent dictionaries

Details On the optimality of Orthogonal Greedy Algorithm for M-coherent dictionaries On the optimality of Orthogonal Greedy Algorithm for M-coherent dictionaries

2010-03-28

arxiv.org/abs/1003.5349v1

Mathematics

Numerical Analysis

Scientific paper

We show that Orthogonal Greedy Algorithms (Orthogonal Matching Pursuit)
provides almost optimal approximation on the first [1/(20M)] steps for
M-coherent dictionaries

Affiliated with

Also associated with

No associations

Rating

On the optimality of Orthogonal Greedy Algorithm for M-coherent dictionaries 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 the optimality of Orthogonal Greedy Algorithm for M-coherent dictionaries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the optimality of Orthogonal Greedy Algorithm for M-coherent dictionaries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-127618