Skip to yearly menu bar Skip to main content


Poster

Joint Dimensionality Reduction and Metric Learning: A Geometric Take

Mehrtash Harandi · Mathieu Salzmann · Richard I Hartley

Gallery #15

Abstract:

To be tractable and robust to data noise, existing metric learning algorithms commonly rely on PCA as a pre-processing step. How can we know, however, that PCA, or any other specific dimensionality reduction technique, is the method of choice for the problem at hand? The answer is simple: We cannot! To address this issue, in this paper, we develop a Riemannian framework to jointly learn a mapping performing dimensionality reduction and a metric in the induced space. Our experiments evidence that, while we directly work on high-dimensional features, our approach yields competitive runtimes with and higher accuracy than state-of-the-art metric learning algorithms.

Live content is unavailable. Log in and register to view live content