Near-oracle performance guarantees for greedy-like methods

Raja Giryes*, Michael Elad

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


In this paper analysis for Greedy-Like methods are presented. These methods include Subspace Pursuit (SP), Compressive Sampling Matching Pursuit (CoSaMP) and Iterative Hard Thresholding (IHT) algorithms. The proposed analysis is based on the Restricted-Isometry-Property (RIP), establishing a near-oracle performance guarantee for each of these techniques. The signal is assumed to be corrupted by an additive random white Gaussian noise; and to have a K-sparse representation with respect to a known dictionary D. The results for the three algorithms are of the same type but uses different constants and different requirements on the cardinality of the sparse representation.

Original languageEnglish
Pages (from-to)1734-1736
Number of pages3
JournalAIP Conference Proceedings
StatePublished - 2010
Externally publishedYes
EventInternational Conference on Numerical Analysis and Applied Mathematics 2010, ICNAAM-2010 - Rhodes, Greece
Duration: 19 Sep 201025 Sep 2010


  • CoSaMP
  • Compressed Sensing
  • Iterative Hard Thresholding
  • Near Oracle performance
  • Subspace Pursuit


Dive into the research topics of 'Near-oracle performance guarantees for greedy-like methods'. Together they form a unique fingerprint.

Cite this