From Euclidean to Riemannian Means: Information Geometry for SSVEP Classification - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

From Euclidean to Riemannian Means: Information Geometry for SSVEP Classification

Résumé

Brain Computer Interfaces (BCI) based on electroencephalog-raphy (EEG) rely on multichannel brain signal processing. Most of the state-of-the-art approaches deal with covariance matrices , and indeed Riemannian geometry has provided a substantial framework for developing new algorithms. Most notably , a straightforward algorithm such as Minimum Distance to Mean yields competitive results when applied with a Riemannian distance. This applicative contribution aims at assessing the impact of several distances on real EEG dataset , as the invariances embedded in those distances have an influence on the classification accuracy . Euclidean and Riemannian distances and means are compared both in term of quality of results and of computational load .
Fichier principal
Vignette du fichier
#49-Kalunga.pdf (317.06 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01351753 , version 1 (04-08-2016)

Licence

Paternité

Identifiants

Citer

Emmanuel Kalunga, Sylvain Chevallier, Quentin Barthélemy, Karim Djouani, Yskandar Hamam, et al.. From Euclidean to Riemannian Means: Information Geometry for SSVEP Classification. Geometric Science of Information, Oct 2015, Palaiseau, France. pp.595-604, ⟨10.1007/978-3-319-25040-3_64⟩. ⟨hal-01351753⟩
390 Consultations
512 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More