Constrained Metric Learning by Permutation Inducing Isometries

被引:5
作者
Bosveld, Joel [1 ,2 ]
Mahmood, Arif [3 ]
Huynh, Du Q. [1 ]
Noakes, Lyle [2 ]
机构
[1] Univ Western Australia, Sch Comp Sci & Software Engn, Nedlands, WA 6009, Australia
[2] Univ Western Australia, Sch Math & Stat, Nedlands, WA 6009, Australia
[3] Qatar Univ, Dept Comp Sci & Engn, Doha 2713, Qatar
关键词
Constrained metric learning; isometry constraints; logistic-discriminant metric learning; face recognition; object classification; pedestrian identification; RECOGNITION; SCALE;
D O I
10.1109/TIP.2015.2502144
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The choice of metric critically affects the performance of classification and clustering algorithms. Metric learning algorithms attempt to improve performance, by learning a more appropriate metric. Unfortunately, most of the current algorithms learn a distance function which is not invariant to rigid transformations of images. Therefore, the distances between two images and their rigidly transformed pair may differ, leading to inconsistent classification or clustering results. We propose to constrain the learned metric to be invariant to the geometry preserving transformations of images that induce permutations in the feature space. The constraint that these transformations are isometries of the metric ensures consistent results and improves accuracy. Our second contribution is a dimension reduction technique that is consistent with the isometry constraints. Our third contribution is the formulation of the isometry constrained logistic discriminant metric learning (IC-LDML) algorithm, by incorporating the isometry constraints within the objective function of the LDML algorithm. The proposed algorithm is compared with the existing techniques on the publicly available labeled faces in the wild, viewpoint-invariant pedestrian recognition, and Toy Cars data sets. The IC-LDML algorithm has outperformed existing techniques for the tasks of face recognition, person identification, and object classification by a significant margin.
引用
收藏
页码:92 / 103
页数:12
相关论文
共 47 条
[1]  
[Anonymous], 2012, 2012 24 INT C MICR I, DOI DOI 10.1109/ICM.2012.6471365
[2]  
[Anonymous], 2012, ADV NEURAL INFORM PR
[3]  
[Anonymous], 2006, P ADV NEUR INF PROC
[4]  
[Anonymous], 2010, P ACM SIGKDD
[5]  
[Anonymous], 2014, Matrix analysis
[6]  
[Anonymous], 2012, Advances in Neural Information Processing Systems
[7]  
[Anonymous], 2013, SURVEY METRIC LEARNI
[8]  
[Anonymous], 2006, P BRIT MACH VIS C
[9]  
[Anonymous], 2002, NIPS
[10]  
[Anonymous], P ADV NEUR INF PROC