Publication | Open Access
Multiclass Brain–Computer Interface Classification by Riemannian Geometry
778
Citations
17
References
2011
Year
EngineeringBiometricsSocial SciencesImage AnalysisData SciencePattern RecognitionPrincipal Component AnalysisNeuroinformaticsMinimum DistanceBci Competition IvNeuroimagingComputer ScienceStatistical Pattern RecognitionMotor ImageryNonlinear Dimensionality ReductionNeural InterfacesComputer VisionBrain-computer InterfaceComputational NeuroscienceRiemannian GeometryEeg Signal ProcessingNeuroscienceBraincomputer Interface
The paper introduces a motor‑imagery BCI classification framework that leverages Riemannian geometry on spatial covariance matrices of EEG signals. The framework implements two classifiers—minimum distance to Riemannian mean (MDRM) and tangent space LDA (TSLDA)—and compares them to a reference CSP+LDA approach on the BCI Competition IV dataset IIa. MDRM achieves performance comparable to the reference method, while TSLDA improves mean classification accuracy from 65.1 % to 70.2 %, demonstrating effective spatial information extraction without spatial filtering.
This paper presents a new classification framework for brain-computer interface (BCI) based on motor imagery. This framework involves the concept of Riemannian geometry in the manifold of covariance matrices. The main idea is to use spatial covariance matrices as EEG signal descriptors and to rely on Riemannian geometry to directly classify these matrices using the topology of the manifold of symmetric and positive definite (SPD) matrices. This framework allows to extract the spatial information contained in EEG signals without using spatial filtering. Two methods are proposed and compared with a reference method [multiclass Common Spatial Pattern (CSP) and Linear Discriminant Analysis (LDA)] on the multiclass dataset IIa from the BCI Competition IV. The first method, named minimum distance to Riemannian mean (MDRM), is an implementation of the minimum distance to mean (MDM) classification algorithm using Riemannian distance and Riemannian mean. This simple method shows comparable results with the reference method. The second method, named tangent space LDA (TSLDA), maps the covariance matrices onto the Riemannian tangent space where matrices can be vectorized and treated as Euclidean objects. Then, a variable selection procedure is applied in order to decrease dimensionality and a classification by LDA is performed. This latter method outperforms the reference method increasing the mean classification accuracy from 65.1% to 70.2%.
| Year | Citations | |
|---|---|---|
Page 1
Page 1