点击次数：

论文类型：会议论文

发表时间：2014-09-06

收录刊物：EI、CPCI-S、Scopus

卷号：8695

期号：PART 7

页面范围：456-471

关键字：Shrinkage-expansion rule; adaptive bound constraints; pairwise constrained metric learning; face verification

摘要：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.