DENOISING WITH GREEDY-LIKE PURSUIT ALGORITHMS

Abstract : This paper provides theoretical guarantees for denoising per-formance of greedy-like methods. Those include Compres-sive Sampling Matching Pursuit (CoSaMP), Subspace Pur-suit (SP), and Iterative Hard Thresholding (IHT). Our resultsshow that the denoising obtained with these algorithms isa constant and a log-factor away from the oracle's perfor-mance, if the signal's representation is sufficiently sparse.Turning to practice, we show how to convert these algorithmsto work without knowing the target cardinality, and insteadconstrain the solution to an error-budget. Denoising tests onsynthetic data and image patches show the potential in thisstagewise technique as a replacement of the classical OMP.
Document type :
Conference papers
The 19th European Signal Processing Conference (EUSIPCO‐2011), Aug 2011, Barcelona, Spain. 2011
Liste complète des métadonnées

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00623895
Contributor : Rémi Gribonval <>
Submitted on : Thursday, September 15, 2011 - 12:08:47 PM
Last modification on : Thursday, September 15, 2011 - 1:10:15 PM
Document(s) archivé(s) le : Friday, December 16, 2011 - 2:22:03 AM

File

EUSIPCO-Denoising-Guarantees.p...
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00623895, version 1

Collections

Citation

Raja Giryes, Michael Elad. DENOISING WITH GREEDY-LIKE PURSUIT ALGORITHMS. The 19th European Signal Processing Conference (EUSIPCO‐2011), Aug 2011, Barcelona, Spain. 2011. 〈inria-00623895〉

Share

Metrics

Record views

188

Files downloads

68