PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Online group-structured dictionary learning
Zoltan Szabo, Barnabas Poczos and András Lorincz
In: 24th IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 20-25 Jun 2011, Colorado Springs, CO, USA.

This is the latest version of this eprint.

Abstract

We develop a dictionary learning method which is (i) online, (ii) enables overlapping group structures with (iii) non-convex sparsity-inducing regularization and (iv) handles the partially observable case. Structured sparsity and the related group norms have recently gained widespread attention in group-sparsity regularized problems in the case when the dictionary is assumed to be known and fixed. However, when the dictionary also needs to be learned, the problem is much more difficult. Only a few methods have been proposed to solve this problem, and they can handle two of these four desirable properties at most. To the best of our knowledge, our proposed method is the first one that possesses all of these properties. We investigate several interesting special cases of our framework, such as the online, structured, sparse non-negative matrix factorization, and demonstrate the efficiency of our algorithm with several numerical experiments.

PDF - PASCAL Members only - Requires Adobe Acrobat Reader or other PDF viewer.
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Additional Information:http://dx.doi.org/10.1109/CVPR.2011.5995712
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:9533
Deposited By:Zoltan Szabo
Deposited On:29 May 2012

Available Versions of this Item