paper-with-me

Papers

Kernel Methods on the Riemannian Manifold of Symmetric Positive Definite Matrices

2014-12-13 · CVPR 2013 6 · Sadeep Jayasumana, Richard Hartley, Mathieu Salzmann, Hongdong Li, Mehrtash Harandi

Symmetric Positive Definite (SPD) matrices have become popular to encode image information. Accounting for the geometry of the Riemannian manifold of SPD matrices has proven key to the success of many algorithms. However, most existing methods only approximate the true shape of the manifold locally by its tangent plane. In this paper, inspired by kernel methods, we propose to map SPD matrices to a high dimensional Hilbert space where Euclidean geometry applies. To encode the geometry of the manifold in the mapping, we introduce a family of provably positive definite kernels on the Riemannian manifold of SPD matrices. These kernels are derived from the Gaussian ker- nel, but exploit different metrics on the manifold. This lets us extend kernel-based algorithms developed for Euclidean spaces, such as SVM and kernel PCA, to the Riemannian manifold of SPD matrices. We demonstrate the benefits of our approach on the problems of pedestrian detection, ob- ject categorization, texture analysis, 2D motion segmentation and Diffusion Tensor Imaging (DTI) segmentation.

📄 PDF Abstract BibTeX arXiv:1412.4172

Code (0)

등록된 구현이 없습니다.

Tasks

Motion SegmentationPedestrian DetectionSegmentationTexture Classification

Methods 이 논문이 사용한 방법론

PCA Principle Components Analysis (PCA) is an unsupervised method primary used for dimensionality reduction within machine learning. PCA is calculated via a singular value…
SVM A Support Vector Machine, or SVM, is a non-parametric supervised learning model. For non-linear classification and regression, they utilise the kernel trick to map inputs…

Similar Papers 제목 키워드 기반

Kernel Methods on Riemannian Manifolds with Gaussian RBF Kernels

2014-11-30 · Sadeep Jayasumana, Richard Hartley, Mathieu Salzmann, Hongdong Li 외

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…

Sparse Coding and Dictionary Learning for Symmetric Positive Definite Matrices: A Kernel Approach

2013-04-16 · Mehrtash T. Harandi, Conrad Sanderson, Richard Hartley, Brian C. Lovell

Recent advances suggest that a wide range of computer vision problems can be addressed more appropriately by considering non-Euclidean geometry. This paper tackles the problem of sparse coding and dictionary learning in …

Dictionary LearningFace RecognitionGeneral ClassificationPerson Re-Identification+1

Universal kernels via harmonic analysis on Riemannian symmetric spaces

2025-06-24 · Franziskus Steinert, Salem Said, Cyrus Mostajeran

The universality properties of kernels characterize the class of functions that can be approximated in the associated reproducing kernel Hilbert space and are of fundamental importance in the theoretical underpinning of …

Component SPD Matrices: A lower-dimensional discriminative data descriptor for image set classification

2018-06-16 · Kai-Xuan Chen, Xiao-Jun Wu

In the domain of pattern recognition, using the SPD (Symmetric Positive Definite) matrices to represent data and taking the metrics of resulting Riemannian manifold into account have been widely used for the task of imag…

General Classification

Kernel Sparse Subspace Clustering on Symmetric Positive Definite Manifolds

2016-01-04 · CVPR 2016 6 · Ming Yin, Yi Guo, Junbin Gao, Zhaoshui He 외

Sparse subspace clustering (SSC), as one of the most successful subspace clustering methods, has achieved notable clustering accuracy in computer vision tasks. However, SSC applies only to vector data in Euclidean space.…

Clustering