Sparse Approximation and Recovery by Greedy Algorithms

We study sparse approximation by greedy algorithms. Our contribution is twofold. First, we prove exact recovery with high probability of random K-sparse signals within ΓK(1+ε)l iterations of the orthogonal matching pursuit (OMP). This result shows that in a probabilistic sense, the OMP is almost opt...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 60; no. 7; pp. 3989 - 4000
Main Authors:	Livshitz, Eugene D., Temlyakov, Vladimir N.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.07.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Approximation Approximation algorithms Banach space Banach spaces Chebyshev approximation Dictionaries Greedy algorithms Hilbert space Inequalities Matching Matching pursuit algorithms Mathematical analysis Optimization Probability distribution Recovery Greedy algorithms lebesgue-type inequality sparse approximation probability orthogonal matching pursuit
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!