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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on information theory Ročník 60; číslo 7; s. 3989 - 4000
Hlavní autori:	Livshitz, Eugene D., Temlyakov, Vladimir N.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.07.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!