Approximation of functions over redundant dictionaries using coherence
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On Lebesgue-type inequalities for greedy approximation
Journal of Approximation Theory
Deterministic constructions of compressed sensing matrices
Journal of Complexity
Full length article: On the size of incoherent systems
Journal of Approximation Theory
Full length article: On performance of greedy algorithms
Journal of Approximation Theory
Greed is good: algorithmic results for sparse approximation
IEEE Transactions on Information Theory
Stable recovery of sparse overcomplete representations in the presence of noise
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this article, we continue to study the performance of Greedy Algorithms. We show that the Orthogonal Greedy Algorithm (Orthogonal Matching Pursuit) provides an almost optimal approximation on the first [@m^-^1/20] steps for @m-coherent dictionaries.