Related Experiment Video
Updated: Dec 17, 2025

SSVEP-based Experimental Procedure for Brain-Robot Interaction with Humanoid Robots
Published on: November 24, 2015
Review of Riemannian Distances and Divergences, Applied to SSVEP-based BCI
S Chevallier1, E K Kalunga2, Q Barthélemy3
1Université Paris-Saclay, UVSQ, LISV, 78124, Vélizy-Villacoublay, France. sylvain.chevallier@uvsq.fr.
Abstract:
The firstgeneration 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 wide mathematical literature. This paper reviews all the Riemannian distances and divergences to process covariance matrices, with an implementation compatible with BCI constraints. The impact of using different metrics is assessed on a steady-state visually evoked potentials (SSVEP) dataset, evaluating centers of classes and classification accuracy. Riemannian approaches embed crucial properties to process EEG data. The Riemannian centers of classes outperform Euclidean ones both in offline and online setups. Some Riemannian distances and divergences have better performances in terms of classification accuracy, while others have appealing computational efficiency.
Related Concept Videos
Divergence and Curl of Electric Field
Divergence and Stokes' Theorems
Divergence and Curl of Magnetic Field
Divergence and Curl
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
Routh-Hurwitz Criterion I
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...

