Riemannian Sparse Coding for Positive Definite Matrices - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Riemannian Sparse Coding for Positive Definite Matrices


Inspired by the great success of sparse coding for vector valued data, our goal is to represent symmetric positive definite (SPD) data matrices as sparse linear combinations of atoms from a dictionary, where each atom itself is an SPD matrix. Since SPD matrices follow a non-Euclidean (in fact a Riemannian) geometry, existing sparse coding techniques for Euclidean data cannot be directly extended. Prior works have approached this problem by defining a sparse coding loss function using either extrinsic similarity measures (such as the log-Euclidean distance) or kernelized variants of statistical measures (such as the Stein divergence, Jeffrey's divergence, etc.). In contrast, we propose to use the intrinsic Riemannian distance on the manifold of SPD matrices. Our main contribution is a novel mathematical model for sparse coding of SPD matrices; we also present a computationally simple algorithm for optimizing our model. Experiments on several computer vision datasets showcase superior classification and retrieval performance compared with state-of-the-art approaches.
Fichier principal
Vignette du fichier
geospfinal.pdf (494.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01057703 , version 1 (03-12-2014)



Anoop Cherian, Suvrit Sra. Riemannian Sparse Coding for Positive Definite Matrices. ECCV - European Conference on Computer Vision, Sep 2014, Zurich, Switzerland. pp.299-314, ⟨10.1007/978-3-319-10578-9_20⟩. ⟨hal-01057703⟩
343 View
683 Download



Gmail Facebook X LinkedIn More