Iterative cosparse projection algorithms for the recovery of cosparse vectors

Raja Giryes*, Sangnam Nam, Rémi Gribonval, Mike E. Davies

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


Recently, a cosparse analysis model was introduced as an alternative to the standard sparse synthesis model. This model was shown to yield uniqueness guarantees in the context of linear inverse problems, and a new reconstruction algorithm was provided, showing improved performance compared to analysis 1 optimization. In this work we pursue the parallel between the two models and propose a new family of algorithms mimicking the family of Iterative Hard Thresholding algorithms, but for the cosparse analysis model. We provide performance guarantees for algorithms from this family under a Restricted Isometry Property adapted to the context of analysis models, and we demonstrate the performance of the algorithms on simulations.

Original languageEnglish
Pages (from-to)1460-1464
Number of pages5
JournalEuropean Signal Processing Conference
StatePublished - 2011
Externally publishedYes
Event19th European Signal Processing Conference, EUSIPCO 2011 - Barcelona, Spain
Duration: 29 Aug 20112 Sep 2011


Dive into the research topics of 'Iterative cosparse projection algorithms for the recovery of cosparse vectors'. Together they form a unique fingerprint.

Cite this