Positive definite dictionary learning for region covariances

  • Authors:
  • Ravishankar Sivalingam;Daniel Boley;Vassilios Morellas;Nikolaos Papanikolopoulos

  • Affiliations:
  • Department of Computer Science & Engineering, University of Minnesota, Minneapolis, USA;Department of Computer Science & Engineering, University of Minnesota, Minneapolis, USA;Department of Computer Science & Engineering, University of Minnesota, Minneapolis, USA;Department of Computer Science & Engineering, University of Minnesota, Minneapolis, USA

  • Venue:
  • ICCV '11 Proceedings of the 2011 International Conference on Computer Vision
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Sparse models have proven to be extremely successful in image processing and computer vision, and most efforts have been focused on sparse representation of vectors. The success of sparse modeling and the popularity of region covariances have inspired the development of sparse coding approaches for positive definite matrices. While in earlier work [1], the dictionary was pre-determined, it is clearly advantageous to learn a concise dictionary adaptively from the data at hand. In this paper, we propose a novel approach for dictionary learning over positive definite matrices. The dictionary is learned by alternating minimization between the sparse coding and dictionary update stages, and two different atom update methods are described. The online versions of the dictionary update techniques are also outlined. Experimental results demonstrate that the proposed learning methods yield better dictionaries for positive definite sparse coding. The learned dictionaries are applied to texture and face data, leading to improved classification accuracy and strong detection performance, respectively.