资源论文Learning Euclidean-to-Riemannian Metric for Point-to-Set Classification

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

2019-12-11 | |  56 |   40 |   0

Abstract

In this paper, we focus on the problem of point-to-set classifification, 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. Specififically, by exploiting typical Riemannian metrics, the Riemannian manifold is fifirst 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 fifinal 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

上一篇:A Multigraph Representation for Improved Unsupervised/Semi-supervised Learning of Human Actions

下一篇:Multilabel Ranking with Inconsistent Rankers

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...