The DOI matches its Crossref record.
Sparse Coding and Dictionary Learning for Symmetric Positive Definite Matrices: A Kernel Approach
Open accessAbstract
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 the space of symmetric positive definite matrices, which form a Riemannian manifold. With the aid of the recently introduced Stein kernel (related to a symmetric version of Bregman matrix divergence), we propose to perform sparse coding by embedding Riemannian manifolds into reproducing kernel Hilbert spaces. This leads to a convex and kernel version of the Lasso problem, which can be solved efficiently. We furthermore propose an algorithm for learning a Riemannian dictionary (used for sparse coding), closely tied to the Stein kernel. Experiments on several classification tasks (face recognition, texture classification, person re-identification) show that the proposed sparse coding approach achieves notable improvements in discrimination accuracy, in comparison to state-of-the-art methods such as tensor sparse coding, Riemannian locality preserving projection, and symmetry-driven accumulation of local features.
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
Cited by
Nweke, H. F., Teh, Y. W., Al-garadi, M. A., & Alo, U. R. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.03.056 · Cited by 930
A Riemannian Network for SPD Matrix Learning
Huang, Z., & Van Gool, L. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10866 · Cited by 410
Nweke, H. F., Teh, Y. W., Mujtaba, G., & Al-garadi, M. A. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.06.002 · Cited by 394
Kernel Methods on the Riemannian Manifold of Symmetric Positive Definite Matrices
Jayasumana, S., Hartley, R., Salzmann, M., Li, H., & Harandi, M. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.17 · Cited by 273
Self-citationWaytowich, N. R., Lawhern, V. J., Bohannon, A. W., Ball, K. R., & Lance, B. J. (2016) · Frontiers in Neuroscience · doi:10.3389/fnins.2016.00430 · Cited by 79
Metadata
- Authors
- Harandi, M. T., Sanderson, C., Hartley, R., & Lovell, B. C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2012
- Pages
- 216-229
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2169579681
- Cited by
- 181
- References
- 0
- FWCI
- 12.54
- 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: Sparse Coding and Dictionary Learning for Symmetric Positive Definite Matrices: A Kernel Approach. https://app.cochat.ai/papers/10.1007/978-3-642-33709-3_16
- The paper
- Harandi, M. T., Sanderson, C., Hartley, R., & Lovell, B. C. (2012). Sparse Coding and Dictionary Learning for Symmetric Positive Definite Matrices: A Kernel Approach. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-33709-3_16
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.