2018
DOI: 10.3390/jimaging4070085
|View full text |Cite
|
Sign up to set email alerts
|

Fisher Vector Coding for Covariance Matrix Descriptors Based on the Log-Euclidean and Affine Invariant Riemannian Metrics

Abstract: This paper presents an overview of coding methods used to encode a set of covariance matrices. Starting from a Gaussian mixture model (GMM) adapted to the Log-Euclidean (LE) or affine invariant Riemannian metric, we propose a Fisher Vector (FV) descriptor adapted to each of these metrics: the Log-Euclidean Fisher Vectors (LE FV) and the Riemannian Fisher Vectors (RFV). Some experiments on texture and head pose image classification are conducted to compare these two metrics and to illustrate the potential of th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 60 publications
0
3
0
Order By: Relevance
“…The symmetric positive definite‐matrix space where the commonly used sample covariance matrix is located is a Riemannian manifold. The traditional linear discriminant analysis (LDA), CCA, and other methods use the sample covariance matrix in Euclidean space without considering the curvature of a symmetric positive definite‐matrix space, which is not conducive to accurate establishment of a model [50]. In Riemannian geometry, the Riemannian distance exhibits the invariance of inversion and congruence [51].…”
Section: Decoding Algorithm For Ssvepmentioning
confidence: 99%
“…The symmetric positive definite‐matrix space where the commonly used sample covariance matrix is located is a Riemannian manifold. The traditional linear discriminant analysis (LDA), CCA, and other methods use the sample covariance matrix in Euclidean space without considering the curvature of a symmetric positive definite‐matrix space, which is not conducive to accurate establishment of a model [50]. In Riemannian geometry, the Riemannian distance exhibits the invariance of inversion and congruence [51].…”
Section: Decoding Algorithm For Ssvepmentioning
confidence: 99%
“…This has the advantage of more accurately capturing the underlying scatter of the data points (that are covariance matrices) than is possible with methods that treat data points as elements in a vector space. For many applications, the log-Euclidean framework has shown competitive results compared to the affine invariant Riemannian one [31,32]. This log-Euclidean framework is considered in this paper for its efficiency and ease of use.…”
Section: Log-euclidean Framework For Second-order Statistics Of Cnn Featuresmentioning
confidence: 99%
“…Recently, we have proposed to extend the FV descriptors to SPD features. This has involved the Log-Euclidean Fisher vectors (LE FV) and the Riemannian Fisher vectors (RFV) [26], [27], [28]. Although the log-Euclidean metric do not yield full affine invariance compared to the affine invariant Riemannian metric, it is invariant by similarity (orthogonal transformation and scaling).…”
Section: Introductionmentioning
confidence: 99%