9 citations · 17 across the 4 of their papers we have counts for
Showing 2010 · math.NAShow all
2 papers · 2 filters
math.NA2010★ 9 cited
On efficiency of Orthogonal Matching Pursuit
Eugene Livshitz
We show that if a matrix satisfies the RIP of order with isometry constant $\dt = c K^{-0.2}$ and has coherence less than , then Orthogonal Matchin…
math.NA2010★ 2 cited
On the optimality of Orthogonal Greedy Algorithm for M-coherent dictionaries
Eugene Livshitz
We show that Orthogonal Greedy Algorithms (Orthogonal Matching Pursuit) provides almost optimal approximation on the first [1/(20M)] steps for M-coherent dictionaries