Riemannian Sparse Coding for Positive Definite Matrices

Anoop Cherian; Suvrit Sra

doi:10.1007/978-3-319-10578-9_20

ScienceGate Book Chapters

BOOK-CHAPTER

Riemannian Sparse Coding for Positive Definite Matrices

Anoop Cherian Suvrit Sra

Year: 2014 Lecture notes in computer science Pages: 299-314 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-319-10578-9_20

Get Full-Text PDF Get Analytical Report

Keywords:

Positive-definite matrix Neural coding Coding (social sciences) Euclidean distance Mathematics Euclidean geometry Riemannian manifold Manifold (fluid mechanics) Divergence (linguistics) Algorithm Sparse matrix Hessian matrix Matrix (chemical analysis) Computer science Pattern recognition (psychology) Artificial intelligence Eigenvalues and eigenvectors Applied mathematics Pure mathematics Geometry Statistics

Metrics

Cited By

6.70

FWCI (Field Weighted Citation Impact)

Refs

0.98

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Face and Expression Recognition

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Advanced Image and Video Retrieval Techniques

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Remote-Sensing Image Classification

Physical Sciences → Engineering → Media Technology

Riemannian Sparse Coding for Positive Definite Matrices

Metrics

Citation History

Topics

Related Documents

Tensor Sparse Coding for Positive Definite Matrices

Multi-kernel sparse subspace clustering on the Riemannian manifold of symmetric positive definite matrices

Coordinate Coding on the Riemannian Manifold of Symmetric Positive-Definite Matrices for Image Classification

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

Sparse Coding for Symmetric Positive Definite Matrices with Application to Image Set Classification