On the optimality of Orthogonal Greedy Algorithm for M-coherent dictionaries
arXiv:1003.5349
Abstract
We show that Orthogonal Greedy Algorithms (Orthogonal Matching Pursuit) provides almost optimal approximation on the first [1/(20M)] steps for M-coherent dictionaries