Skip to Main content Skip to Navigation
Conference papers

From Euclidean to Riemannian Means: Information Geometry for SSVEP Classification

Abstract : 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 .
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01351753
Contributor : Sylvain Chevallier <>
Submitted on : Thursday, August 4, 2016 - 4:29:28 PM
Last modification on : Friday, October 9, 2020 - 9:50:45 AM
Long-term archiving on: : Tuesday, November 8, 2016 - 9:04:10 PM

File

#49-Kalunga.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

636

Files downloads

1283