Geometry-aware Similarity Learning on SPD Manifolds for Visual Recognition
Not on the map. Why?
Abstract (arXiv)
Symmetric Positive Definite (SPD) matrices have been widely used for data representation in many visual recognition tasks. The success mainly attributes to learning discriminative SPD matrices with encoding the Riemannian geometry of the underlying SPD manifold. In this paper, we propose a geometry-aware SPD similarity learning (SPDSL) framework to learn discriminative SPD features by directly pursuing manifold-manifold transformation matrix of column full-rank. Specifically, by exploiting the Riemannian geometry of the manifold of fixed-rank Positive Semidefinite (PSD) matrices, we present a new solution to reduce optimizing over the space of column full-rank transformation matrices to optimizing on the PSD manifold which has a well-established Riemannian structure. Under this solution, we exploit a new supervised SPD similarity learning technique to learn the transformation by regressing the similarities of selected SPD data pairs to their ground-truth similarities on the target SPD manifold. To optimize the proposed objective function, we further derive an algorithm on the PSD manifold. Evaluations on three visual classification tasks show the advantages of the proposed approach over the existing SPD-based discriminant learning methods.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Aug 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 2; 2024: 1; 2025: 0; 2026: 2.
9 papers.
- 2021On Riemannian Optimization over Positive Definite Matrices with the Bures-Wasserstein Geometrycited by 32
- 2023A Survey of Geometric Optimization for Deep Learning: From Euclidean Space to Riemannian Manifoldcited by 21
- 2022Multi-manifold Attention for Vision Transformerscited by 12
- 2021Learning with symmetric positive definite matrices via generalized Bures-Wasserstein geometrycited by 10
- 2023Differential geometry with extreme eigenvalues in the positive semidefinite conecited by 5
- 2026Beyond First-Order: Learning Riemannian Geometries for Invariant Visual Place Recognitioncited by 2
- 2024Geometric sparsification in recurrent neural networkscited by 1
- 2021Learning Chebyshev Basis in Graph Convolutional Networks for Skeleton-based Action Recognitioncited by 0
- 2026K-GMRF: Kinetic Gauss-Markov Random Field for First-Principles Covariance Tracking on Lie Groupscited by 0
- 2026K-GMRF: Kinetic Gauss-Markov Random Field for First-Principles Covariance Tracking on Lie Groups20 Mar 2026
- 2026Beyond First-Order: Learning Riemannian Geometries for Invariant Visual Place Recognition31 Jan 2026
- 2024Geometric sparsification in recurrent neural networks10 Jun 2024
- 2023Differential geometry with extreme eigenvalues in the positive semidefinite cone14 Apr 2023
- 2023A Survey of Geometric Optimization for Deep Learning: From Euclidean Space to Riemannian Manifold16 Feb 2023
- 2022Multi-manifold Attention for Vision Transformers18 Jul 2022
- 2021Learning with symmetric positive definite matrices via generalized Bures-Wasserstein geometry20 Oct 2021
- 2021On Riemannian Optimization over Positive Definite Matrices with the Bures-Wasserstein Geometry1 Jun 2021
- 2021Learning Chebyshev Basis in Graph Convolutional Networks for Skeleton-based Action Recognition12 Apr 2021