2020
DOI: 10.1007/s12021-020-09473-9
|View full text |Cite
|
Sign up to set email alerts
|

Review of Riemannian Distances and Divergences, Applied to SSVEP-based BCI

Abstract: Background The first generation of brain-computer interfaces (BCI) classifies multi-channel electroencephalographic (EEG) signals, enhanced by optimized spatial filters. The second generation directly classifies covariance matrices estimated on EEG signals, based on straightforward algorithms such as the minimum-distance-to-Riemannian-mean (MDRM). Classification results vary greatly depending on the chosen Riemannian distance or divergence, whose definitions and reference implementations are spread across a wi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
37
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 45 publications
(37 citation statements)
references
References 51 publications
0
37
0
Order By: Relevance
“…On the other hand, for a given Riemannian space, a further discretionary element is given by the choice of a distance among the many available ones that can be defined on the space of covariance matrices. Each of these distances has specific properties (Arsigny et al, 2007;Yger, Berar, & Lotte, 2016), and relative task-specific performance level, some performing better in terms of classification accuracy, while others are better in terms of computational efficiency (Chevallier, Kalunga, Barthélemy, & Monacelli, 2021).…”
Section: Effects Of Edge Metrics On Network Propertiesmentioning
confidence: 99%
“…On the other hand, for a given Riemannian space, a further discretionary element is given by the choice of a distance among the many available ones that can be defined on the space of covariance matrices. Each of these distances has specific properties (Arsigny et al, 2007;Yger, Berar, & Lotte, 2016), and relative task-specific performance level, some performing better in terms of classification accuracy, while others are better in terms of computational efficiency (Chevallier, Kalunga, Barthélemy, & Monacelli, 2021).…”
Section: Effects Of Edge Metrics On Network Propertiesmentioning
confidence: 99%
“…To manipulate SPD matrices while respecting their intrinsic geometry, we can rely on Riemannian geometry. There are several possible metrics [11] but the Affine Invariant Riemannian Metric (AIRM) is the most natural metric. AIRM distance δ r between two SPD matrices C 1 and C 2 on manifold is defined as:…”
Section: Riemannian Geometry Of Eeg Covariance Matrixmentioning
confidence: 99%
“…On the contrary, the AIRM distance is immune to those drawbacks but its computation is more computationally demanding. Hence, the LogEuclidean distance has been proposed as a trade-off between AIRM and LogEuclidean distances, retaining some interesting properties of the AIRM distance while being faster to compute [28]. Overall, the use of a Riemanning geometry (LogEuclidean or AIRM) leads to a simpler feature extraction step tampering with the need for spatial filtering and a less complex data processing pipeline.…”
Section: Riemannian Geometrymentioning
confidence: 99%