DocumentCode :
3672306
Title :
Beyond Mahalanobis metric: Cayley-Klein metric learning
Author :
Yanhong Bi; Bin Fan; Fuchao Wu
Author_Institution :
Institute of Automation, Chinese Academy of Sciences, Beijing, 100190, China
fYear :
2015
fDate :
6/1/2015 12:00:00 AM
Firstpage :
2339
Lastpage :
2347
Abstract :
Cayley-Klein metric is a kind of non-Euclidean metric suitable for projective space. In this paper, we introduce it into the computer vision community as a powerful metric and an alternative to the widely studied Mahalanobis metric. We show that besides its good characteristic in non-Euclidean space, it is a generalization of Mahalanobis metric in some specific cases. Furthermore, as many Mahalanobis metric learning, we give two kinds of Cayley-Klein metric learning methods: MMC Cayley-Klein metric learning and LMNN Cayley-Klein metric learning. Experiments have shown the superiority of Cayley-Klein metric over Mahalanobis ones and the effectiveness of our Cayley-Klein metric learning methods.
Keywords :
"Geometry","Symmetric matrices","Learning systems","Euclidean distance","Linear programming","Training data"
Publisher :
ieee
Conference_Titel :
Computer Vision and Pattern Recognition (CVPR), 2015 IEEE Conference on
Electronic_ISBN :
1063-6919
Type :
conf
DOI :
10.1109/CVPR.2015.7298847
Filename :
7298847
Link To Document :
بازگشت