Log-euclidean metric learning on symmetric positive definite manifold with application to image set classification
Abstract The manifold of Symmetric Positive Definite (SPD) matrices has been successfully
used for data representation in image set classification. By endowing the SPD manifold with …
used for data representation in image set classification. By endowing the SPD manifold with …
A new spatial–spectral feature extraction method for hyperspectral images using local covariance matrix representation
In this paper, a novel local covariance matrix (CM) representation method is proposed to
fully characterize the correlation among different spectral bands and the spatial-contextual …
fully characterize the correlation among different spectral bands and the spatial-contextual …
Kernel 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 …
data. In many computer vision problems, the data can be naturally represented as points on …
Visual–tactile fusion for object recognition
The camera provides rich visual information regarding objects and becomes one of the most
mainstream sensors in the automation community. However, it is often difficult to be …
mainstream sensors in the automation community. However, it is often difficult to be …
Dimensionality reduction on SPD manifolds: The emergence of geometry-aware methods
Representing images and videos with Symmetric Positive Definite (SPD) matrices, and
considering the Riemannian geometry of the resulting space, has been shown to yield high …
considering the Riemannian geometry of the resulting space, has been shown to yield high …
Joint sparse representation and robust feature-level fusion for multi-cue visual tracking
Visual tracking using multiple features has been proved as a robust approach because
features could complement each other. Since different types of variations such as …
features could complement each other. Since different types of variations such as …
Wasserstein dictionary learning: Optimal transport-based unsupervised nonlinear dictionary learning
This paper introduces a new nonlinear dictionary learning method for histograms in the
probability simplex. The method leverages optimal transport theory, in the sense that our aim …
probability simplex. The method leverages optimal transport theory, in the sense that our aim …
Visual Classification by -Hypergraph Modeling
Visual classification has attracted considerable research interests in the past decades. In
this paper, a novel ℓ 1-hypergraph model for visual classification is proposed. Hypergraph …
this paper, a novel ℓ 1-hypergraph model for visual classification is proposed. Hypergraph …
Kernel-driven similarity learning
Similarity measure is fundamental to many machine learning and data mining algorithms.
Predefined similarity metrics are often data-dependent and sensitive to noise. Recently, data …
Predefined similarity metrics are often data-dependent and sensitive to noise. Recently, data …
Riemannian dictionary learning and sparse coding for positive definite matrices
Data encoded as symmetric positive definite (SPD) matrices frequently arise in many areas
of computer vision and machine learning. While these matrices form an open subset of the …
of computer vision and machine learning. While these matrices form an open subset of the …