Cosparse Analysis Modeling - Uniqueness and Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Cosparse Analysis Modeling - Uniqueness and Algorithms


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.
Fichier principal
Vignette du fichier
2011_ICASSP_NamEtAl_Cosparse.pdf (219.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00557933 , version 1 (22-02-2011)



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⟩
557 View
675 Download



Gmail Facebook Twitter LinkedIn More