On the efficiency of the Orthogonal Matching Pursuit in compressed sensing
Author:
- Evgenii D LivshitsELEvgenii D Livshits
- 28 February 2012
- journal article
- Published by Steklov Mathematical Institute in Sbornik: Mathematics
- Vol. 203 (2) , 183-195
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Greedy approximationActa Numerica, 2008
- A remark on Compressed SensingMathematical Notes, 2007
- On Lebesgue-type inequalities for greedy approximationJournal of Approximation Theory, 2007
- Замечание о задаче сжатого измерения2007
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Atomic Decomposition by Basis PursuitSIAM Review, 2001
- Some remarks on greedy algorithmsAdvances in Computational Mathematics, 1996
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993
- DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONSMathematics of the USSR-Izvestiya, 1977