Riemannian Dictionary Learning and Sparse Coding for Positive Definite Matrices
Preprint
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 geometry often turns out to be better suited in capturing several desirable data properties. However, formulating classical machine learning algorithms within such a geometry is often non-trivial and computationally expensive. Inspired by the great success of dictionary learning and sparse coding 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 Riemannian geometric approach. To that end, we formulate a novel Riemannian optimization objective for dictionary learning and sparse coding in which the representation loss is characterized via the affine invariant Riemannian metric. We also present a computationally simple algorithm for optimizing our model. Experiments on several computer vision datasets demonstrate superior classification and retrieval performance using our approach when compared to sparse coding via alternative non-Riemannian formulations.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Covariance based point cloud descriptors for object detection and recognitionComputer Vision and Image Understanding, 2016
- Positive definite matrices and the S-divergenceProceedings of the American Mathematical Society, 2015
- Tensor Sparse Coding for Region Covariances2010
- Texture and color segmentation based on the combined use of the structure tensor and the image componentsSignal Processing, 2008
- Log‐Euclidean metrics for fast and simple calculus on diffusion tensorsMagnetic Resonance in Medicine, 2006
- Region Covariance: A Fast Descriptor for Detection and Classification2006
- A Riemannian Framework for Tensor ComputingInternational Journal of Computer Vision, 2006
- On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point MethodsMathematische Annalen, 2002
- A comparative study of texture measures with classification based on featured distributionsPattern Recognition, 1996
- Two-Point Step Size Gradient MethodsIMA Journal of Numerical Analysis, 1988