 |
    |
Shrinkage Expansion Adaptive Metric Learning*
Qilong Wang1, 3, Wangmeng Zuo2, Lei Zhang3, and Peihua Li1
1School of Information and Communications Engineering, Dalian University of Technology, China
csqlwang@gmail.com
peihuali@dlut.edu.cn
2School of Computer Science and Technology, Harbin Institute of Technology, China
cswmzuo@gmail.com
3Department of Computing, Hong Kong Polytechnic University, Hong Kong
cslzhang@comp.polyu.edu.hk
Abstract. Conventional pairwise constrained metric learning methods usually restrict the distance between samples of a similar pair to be lower than a fixed upper bound, and the distance between samples of a dissimilar pair higher than a fixed lower bound. Such fixed bound based constraints, however, may not work well when the intra- and inter-class variations are complex. In this paper, we propose a shrinkage expansion adaptive metric learning (SEAML) method by defining a novel shrinkage-expansion rule for adaptive pairwise constraints. SEAML is very effective in learning metrics from data with complex distributions. Meanwhile, it also suggests a new rule to assess the similarity between a pair of samples based on whether their distance is shrunk or expanded after metric learning. Our extensive experimental results demonstrated that SEAML achieves better performance than state-of-the-art metric learning methods. In addition, the proposed shrinkage-expansion adaptive pairwise constraints can be readily applied to many other pairwise constrained metric learning algorithms, and boost significantly their performance in applications such as face verification on LFW and PubFig databases.
Keywords: Shrinkage-expansion rule, adaptive bound constraints, pairwise constrained metric learning, face verification
Electronic Supplementary Material:
LNCS 8695, p. 456 ff.
lncs@springer.com
© Springer International Publishing Switzerland 2014