Learning Euclidean-to-Riemannian Metric for Point-to-Set Classification
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.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationGeneral ClassificationMetric LearningSimilar Papers 제목 키워드 기반
Probabilistic Learning Vector Quantization on Manifold of Symmetric Positive Definite Matrices
In this paper, we develop a new classification method for manifold-valued data in the framework of probabilistic learning vector quantization. In many classification scenarios, the data can be naturally represented by sy…
EEGElectroencephalogram (EEG)General ClassificationMotor Imagery+1Cross Euclidean-to-Riemannian Metric Learning with Application to Face Recognition from Video
Riemannian manifolds have been widely employed for video representations in visual classification tasks including video-based face recognition. The success mainly derives from learning a discriminant Riemannian metric wh…
Face RecognitionMetric LearningKernel Methods on Riemannian Manifolds with Gaussian RBF Kernels
In this paper, we develop an approach to exploiting kernel methods with manifold-valued data. In many computer vision problems, the data can be naturally represented as points on a Riemannian manifold. Due to the non-Euc…
Riemannian Multinomial Logistics Regression for SPD Neural Networks
Deep neural networks for learning Symmetric Positive Definite (SPD) matrices are gaining increasing attention in machine learning. Despite the significant progress, most existing SPD networks use traditional Euclidean cl…
Action RecognitionEEGregressionTemporal Action LocalizationProbabilistic Riemannian submanifold learning with wrapped Gaussian process latent variable models
Latent variable models (LVMs) learn probabilistic models of data manifolds lying in an \emph{ambient} Euclidean space. In a number of applications, a priori known spatial constraints can shrink the ambient space into a c…
Uncertainty Quantification