Abstract
We show that the Orthogonal Greedy Algorithm (OGA) for dictionaries in a Hilbert space with small coherence M performs almost as well as the best m -term approximation for all signals with sparsity close to the best theoretically possible threshold m = 1 2 ( M − 1 + 1 ) by proving a Lebesgue-type inequality for arbitrary signals. Additionally, we present a dictionary with coherence M and a 1 2 ( M − 1 + 1 ) -sparse signal for which OGA fails to pick up any atoms from the support, showing that the above threshold is sharp. We also show that the Pure Greedy Algorithm (PGA) matches the rate of convergence of the best m -term approximation beyond the saturation limit of m − 1 2 .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
