Skip to Main content Skip to Navigation
Conference papers

Cosparse Analysis Modeling - Uniqueness and Algorithms

Sangnam Nam 1 Michael E. Davies 2 Michael Elad 3 Rémi Gribonval 1 
1 METISS - Speech and sound data modeling and processing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : In the past decade there has been a great interest in a synthesis-based model for signals, based on sparse and redundant representations. Such a model assumes that the signal of interest can be composed as a linear combination of few columns from a given matrix (the dictionary). An alternative analysis-based model can be envisioned, where an analysis operator multiplies the signal, leading to a cosparse outcome. In this paper, we consider this analysis model, in the context of a generic missing data problem (e.g., compressed sensing, inpainting, source separation, etc.). Our work proposes a uniqueness result for the solution of this problem, based on properties of the analysis operator and the measurement matrix. This paper also considers two pursuit algorithms for solving the missing data problem, an L1-based and a new greedy method. Our simulations demonstrate the appeal of the analysis model, and the success of the pursuit techniques presented.
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Sangnam Nam Connect in order to contact the contributor
Submitted on : Tuesday, February 22, 2011 - 6:33:41 PM
Last modification on : Friday, February 4, 2022 - 3:09:28 AM
Long-term archiving on: : Monday, May 23, 2011 - 2:42:22 AM


Files produced by the author(s)



Sangnam Nam, Michael E. Davies, Michael Elad, Rémi Gribonval. Cosparse Analysis Modeling - Uniqueness and Algorithms. Acoustics, Speech and Signal Processing, IEEE International Conference on (ICASSP 2011), May 2011, Prague, Czech Republic. ⟨10.1109/ICASSP.2011.5947680⟩. ⟨inria-00557933⟩



Record views


Files downloads