The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Kernel Methods on the Riemannian Manifold of Symmetric Positive Definite Matrices
Open accessAbstract
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 kernel, 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, object categorization, texture analysis, 2D motion segmentation and Diffusion Tensor Imaging (DTI) segmentation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Histograms of Oriented Gradients for Human Detection
Dalal, N., & Triggs, B. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.177 · Cited by 33,584
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
Schölkopf, B., Smola, A., & Müller, K.-R. (1998) · Neural Computation · doi:10.1162/089976698300017467 · Cited by 8,084
Fast Training of Support Vector Machines Using Sequential Minimal Optimization
Platt, J. C. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0016 · Cited by 5,437
Choosing Multiple Parameters for Support Vector Machines
Chapelle, O., Vapnik, V., Bousquet, O., & Mukherjee, S. (2002) · Machine Learning · doi:10.1023/a:1012450327387 · Cited by 2,206
A Riemannian Framework for Tensor Computing
Pennec, X., Fillard, P., & Ayache, N. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-005-3222-z · Cited by 1,550
Filtering for texture classification: a comparative study
Randen, T., & Husoy, J. H. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.761261 · Cited by 1,397
Harmonic Analysis on Semigroups
Berg, C., Christensen, J. P. R., & Ressel, P. (1984) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-1128-0 · Cited by 1,134
Region Covariance: A Fast Descriptor for Detection and Classification
Tuzel, O., Porikli, F., & Meer, P. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744047_45 · Cited by 1,115
Log-Euclidean metrics for fast and simple calculus on diffusion tensors
Arsigny, V., Fillard, P., Pennec, X., & Ayache, N. (2006) · Magnetic Resonance in Medicine · doi:10.1002/mrm.20965 · Cited by 1,113
Pedestrian Detection via Classification on Riemannian Manifolds
Tuzel, O., Porikli, F., & Meer, P. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.75 · Cited by 975
Metadata
- Authors
- Jayasumana, S., Hartley, R., Salzmann, M., Li, H., & Harandi, M.
- Venue
- 2013 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2013-06
- Pages
- 73-80
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2149652297
- Cited by
- 273
- References
- 20
- FWCI
- 22.61
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Kernel Methods on the Riemannian Manifold of Symmetric Positive Definite Matrices. https://app.cochat.ai/papers/10.1109/cvpr.2013.17
- The paper
- Jayasumana, S., Hartley, R., Salzmann, M., Li, H., & Harandi, M. (2013). Kernel Methods on the Riemannian Manifold of Symmetric Positive Definite Matrices. 2013 IEEE Conference on Computer Vision and Pattern Recognition. https://doi.org/10.1109/cvpr.2013.17
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.