Recovery of Compressively Sampled Sparse Signals using Cyclic Matching Pursuit

Bob L. Sturm, Mads Græsbøll Christensen, Rémi Gribonval

Research output: Contribution to conference without publisher/journalPosterResearchpeer-review

206 Downloads (Pure)

Abstract

We empirically show how applying a pure greedy algorithm cyclically
can recover compressively sampled sparse signals as well
as other more computationally complex approaches, such as orthogonal greedy algorithms,
iterative thresholding, and $\ell_1$-minimization.
Original languageEnglish
Publication date2011
Publication statusPublished - 2011
EventSPARS2011 - Edinburgh, United Kingdom
Duration: 27 Jun 2011 → …

Conference

ConferenceSPARS2011
Country/TerritoryUnited Kingdom
CityEdinburgh
Period27/06/2011 → …

Fingerprint

Dive into the research topics of 'Recovery of Compressively Sampled Sparse Signals using Cyclic Matching Pursuit'. Together they form a unique fingerprint.

Cite this