Lebesgue-type Inequality for Orthogonal Matching Pursuit for Micro-coherent Dictionaries

Ye Peixin, Wei Xiujie

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.

 

DOI: http://dx.doi.org/10.11591/telkomnika.v11i1.1890


Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics