Riemannian Dictionary Learning and Sparse Coding for Positive Definite Matrices
Open Access
- 13 September 2016
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 28 (12) , 2859-2871
Abstract
Data encoded as symmetric positive definite (SPD) matrices frequently arise in many areas of computer vision and machine learning. While these matrices form an open subset of the Euclidean space of symmetric matrices, viewing them through the lens of non-Euclidean Riemannian (Riem) geometry often turns out to be better suited in capturing several desirable data properties. Inspired by the great success of dictionary learning and sparse coding (DLSC) for vector-valued data, our goal in this paper is to represent data in the form of SPD matrices as sparse conic combinations of SPD atoms from a learned dictionary via a Riem geometric approach. To that end, we formulate a novel Riem optimization objective for DLSC, in which the representation loss is characterized via the affine-invariant Riem metric. We also present a computationally simple algorithm for optimizing our model. Experiments on several computer vision data sets demonstrate superior classification and retrieval performance using our approach when compared with SC via alternative non-Riem formulations.Keywords
All Related Versions
Funding Information
- Australian Research Council Centre of Excellence for Robotic Vision (CE140100016)
This publication has 45 references indexed in Scilit:
- Bayesian Nonparametric Clustering for Positive Definite MatricesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2015
- Riemannian coding and dictionary learning: Kernels to the rescue2015
- Log-Determinant Divergences Revisited: Alpha-Beta and Gamma Log-Det DivergencesEntropy, 2015
- Jensen-Bregman LogDet Divergence with Application to Efficient Similarity Search for Covariance MatricesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2012
- Positive definite dictionary learning for region covariances2011
- Action Recognition Using Sparse Representation on Covariance Manifolds of Optical Flow2010
- Trust-Region Methods on Riemannian ManifoldsFoundations of Computational Mathematics, 2006
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse RepresentationIEEE Transactions on Signal Processing, 2006
- Image Denoising Via Learned Dictionaries and Sparse representation2006
- Geometric meansLinear Algebra and its Applications, 2004