Riemannian Coding and Dictionary Learning: Kernels to the Rescue

Mehrtash Harandi, Mathieu Salzmann; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015, pp. 3926-3935

Abstract


While sparse coding on non-flat Riemannian manifolds has recently become increasingly popular, existing solutions either are dedicated to specific manifolds, or rely on optimization problems that are difficult to solve, especially when it comes to dictionary learning. In this paper, we propose to make use of kernels to perform coding and dictionary learning on Riemannian manifolds. To this end, we introduce a general Riemannian coding framework with its kernel-based counterpart. This lets us (i) generalize beyond the special case of sparse coding; (ii) introduce efficient solutions to two coding schemes; (iii) learn the kernel parameters; (iv) perform unsupervised and supervised dictionary learning in a much simpler manner than previous Riemannian coding methods. We demonstrate the effectiveness of our approach on three different types of non-flat manifolds, and illustrate its generality by applying it to Euclidean spaces, which also are Riemannian manifolds.

Related Material


[pdf]
[bibtex]
@InProceedings{Harandi_2015_CVPR,
author = {Harandi, Mehrtash and Salzmann, Mathieu},
title = {Riemannian Coding and Dictionary Learning: Kernels to the Rescue},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2015}
}