Analysis Operator Learning for Overcomplete Cosparse Representations

Abstract : We consider the problem of learning a low-dimensional signal model from a collection of training samples. The mainstream approach would be to learn an overcomplete dictionary to provide good approximations of the training samples using sparse synthesis coefficients. This famous sparse model has a less well known counterpart, in analysis form, called the cosparse analysis model. In this new model, signals are characterized by their parsimony in a transformed domain using an overcomplete analysis operator. We propose to learn an analysis operator from a training corpus using a constrained optimization program based on L1 optimization. We derive a practical learning algorithm, based on projected subgradients, and demonstrate its ability to robustly recover a ground truth analysis operator, provided the training set is of sufficient size. A local optimality condition is derived, providing preliminary theoretical support for the well-posedness of the learning problem under appropriate conditions.
Document type :
Conference papers
European Signal Processing Conference (EUSIPCO'11), Aug 2011, Barcelona, Spain. 2011
Liste complète des métadonnées
Contributor : Rémi Gribonval <>
Submitted on : Saturday, July 2, 2011 - 12:41:39 AM
Last modification on : Friday, January 13, 2017 - 2:19:38 PM
Document(s) archivé(s) le : Monday, October 3, 2011 - 2:20:17 AM


Files produced by the author(s)


  • HAL Id : inria-00583133, version 1



Mehrdad Yaghoobi, Sangnam Nam, Rémi Gribonval, Mike E. Davies. Analysis Operator Learning for Overcomplete Cosparse Representations. European Signal Processing Conference (EUSIPCO'11), Aug 2011, Barcelona, Spain. 2011. <inria-00583133>



Record views


Document downloads