Coordinated Local Metric Learning

Shreyas Saxena, Jakob Verbeek; The IEEE International Conference on Computer Vision (ICCV) Workshops, 2015, pp. 127-135


Mahalanobis metric learning amounts to learning a linear data projection, after which the L2 metric is used to compute distances. To allow more flexible metrics, not restricted to linear projections, local metric learning techniques have been developed. Most of these methods partition the data space using clustering, and for each cluster a separate metric is learned. Using local metrics, however, it is not clear how to measure distances between data points assigned to different clusters. In this paper we propose to embed the local metrics in a global low-dimensional representation, in which the L2 metric can be used. With each cluster we associate a linear mapping that projects the data to the global representation. This global representation directly allows computing distances between points regardless to which local cluster they belong. Moreover, it also enables data visualization in a single view, and the use of L2-based efficient retrieval methods. Experiments on the Labeled Faces in the Wild dataset show that our approach improves over previous global and local metric learning approaches.

Related Material

author = {Saxena, Shreyas and Verbeek, Jakob},
title = {Coordinated Local Metric Learning},
booktitle = {The IEEE International Conference on Computer Vision (ICCV) Workshops},
month = {December},
year = {2015}