Abstract : 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 $\ell_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.
Type de document :
Communication dans un congrès
The 19th European Signal Processing Conference (EUSIPCO‐2011), 2011, Barcelona, Spain. 2011
https://hal.inria.fr/inria-00611592
Contributeur : Sangnam Nam
<>
Soumis le : mardi 26 juillet 2011 - 16:01:42
Dernière modification le : vendredi 16 novembre 2018 - 01:21:59
Document(s) archivé(s) le : lundi 7 novembre 2011 - 11:32:39
Raja Giryes, Sangnam Nam, Rémi Gribonval, Mike E. Davies. Iterative Cosparse Projection Algorithms for the Recovery of Cosparse Vectors. The 19th European Signal Processing Conference (EUSIPCO‐2011), 2011, Barcelona, Spain. 2011. 〈inria-00611592〉
