Lebesgue-type Inequality for Orthogonal Matching Pursuit for Micro-coherent Dictionaries
Abstract
In this paper, we investigate the efficiency of some kind of Greedy Algorithms with respect to dictionaries from Hilbert spaces. We establish ideal Lebesgue-type inequality for Orthogonal Matching Pursuit also known in literature as the Orthogonal Greedy Algorithm for -coherent dictionaries. We show that the Orthogonal Matching Pursuit provides an almost optimal approximation on the first.
Full Text:
PDFRefbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License