Learning Euclidean-to-Riemannian Metric for Point-to-Set Classification

被引:67
作者
Huang, Zhiwu [1 ,2 ]
Wang, Ruiping [1 ]
Shan, Shiguang [1 ]
Chen, Xilin [1 ]
机构
[1] Chinese Acad Sci, Inst Comp Technol, Key Lab Intelligent Informat Proc, Beijing 100190, Peoples R China
[2] Univ Chinese Acad Sci, Beijing 100049, Peoples R China
来源
2014 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) | 2014年
关键词
D O I
10.1109/CVPR.2014.217
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we focus on the problem of point-to-set classification, where single points are matched against sets of correlated points. Since the points commonly lie in Euclidean space while the sets are typically modeled as elements on Riemannian manifold, they can be treated as Euclidean points and Riemannian points respectively. To learn a metric between the heterogeneous points, we propose a novel Euclidean-to-Riemannian metric learning framework. Specifically, by exploiting typical Riemannian metrics, the Riemannian manifold is first embedded into a high dimensional Hilbert space to reduce the gaps between the heterogeneous spaces and meanwhile respect the Riemannian geometry of the manifold. The final distance metric is then learned by pursuing multiple transformations from the Hilbert space and the original Euclidean space (or its corresponding Hilbert space) to a common Euclidean subspace, where classical Euclidean distances of transformed heterogeneous points can be measured. Extensive experiments clearly demonstrate the superiority of our proposed approach over the state-of-the-art methods.
引用
收藏
页码:1677 / 1684
页数:8
相关论文
共 28 条
[1]  
[Anonymous], 2013, ICCV
[2]  
[Anonymous], 2011, CVPR
[3]  
[Anonymous], 2013, CVPR
[4]  
[Anonymous], CVPR
[5]  
[Anonymous], CVPR
[6]  
[Anonymous], ICML
[7]  
[Anonymous], 2008, ICML
[8]  
[Anonymous], 2007, ICML
[9]  
[Anonymous], 2012, CVPR
[10]  
[Anonymous], 2004, ADV NEURAL INF PROCE