EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Decoding Multi-Class Motor Imagery and Motor Execution Tasks Using Riemannian Geometry Algorithms on Large EEG Datasets

Zaid Shuqfa iD, Abdelkader Nasreddine Belkacem iD, Abderrahmane Lakas iD

Sensors · 25.05.2023 · 23 (11) · 5051

DOI: 10.3390/s23115051 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sensors, online erschienen am 25.05.2023. Verfasst von Zaid Shuqfa und 2 weiteren Autor:innen. Beteiligte Einrichtung: Connected Autonomous Intelligent Systems Laboratory, Department of Computer and Network Engineering, College of IT (CIT), United Arab Emirates Univer…. Hauptthemen laut MEDLINE: Algorithms, Brain-Computer Interfaces. Die Arbeit wurde bisher 24-mal zitiert (Crossref) und nennt 58 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Strategic Research Program - Emirates Center for Mobility Research, Strategic Research Program—Emirates Center for Mobility Research.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The use of Riemannian geometry decoding algorithms in classifying electroencephalography-based motor-imagery brain–computer interfaces (BCIs) trials is relatively new and promises to outperform the current state-of-the-art methods by overcoming the noise and nonstationarity of electroencephalography signals. However, the related literature shows high classification accuracy on only relatively small BCI datasets. The aim of this paper is to provide a study of the performance of a novel implementation of the Riemannian geometry decoding algorithm using large BCI datasets. In this study, we apply several Riemannian geometry decoding algorithms on a large offline dataset using four adaptation strategies: baseline, rebias, supervised, and unsupervised. Each of these adaptation strategies is applied in motor execution and motor imagery for both scenarios 64 electrodes and 29 electrodes. The dataset is composed of four-class bilateral and unilateral motor imagery and motor execution of 109 subjects. We run several classification experiments and the results show that the best classification accuracy is obtained for the scenario where the baseline minimum distance to Riemannian mean has been used. The mean accuracy values up to 81.5% for motor execution, and up to 76.4% for motor imagery. The accurate classification of EEG trials helps to realize successful BCI applications that allow effective control of devices.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsBrain-Computer InterfacesHumansElectroencephalographyImagery, Psychotherapy

Stichwörter der Autor:innen

Riemannian geometry decoding algorithm (RGDA)brain–computer interface (BCI)electroencephalography/electroencephalogram (EEG)motor execution (ME)motor imagery (MI)multiclass classification

Autor:innen und Institutionen

  • Connected Autonomous Intelligent Systems Laboratory, Department of Computer and Network Engineering, College of IT (CIT), United Arab Emirates University (UAEU), Al Ain 15551, United Arab Emirates.

ORCID-Profile: Zaid Shuqfa, Abdelkader Nasreddine Belkacem, Abderrahmane Lakas

Förderung

  • Strategic Research Program - Emirates Center for Mobility Research
  • Strategic Research Program—Emirates Center for Mobility Research

Zitieren

APA

Shuqfa, Z., Belkacem, A. N., & Lakas, A. (2023). Decoding Multi-Class Motor Imagery and Motor Execution Tasks Using Riemannian Geometry Algorithms on Large EEG Datasets. Sensors, 23(11), 5051. https://doi.org/10.3390/s23115051

Vancouver

Shuqfa Z, Belkacem AN, Lakas A. Decoding Multi-Class Motor Imagery and Motor Execution Tasks Using Riemannian Geometry Algorithms on Large EEG Datasets. Sensors. 2023;23(11):5051. doi:10.3390/s23115051

BibTeX
@article{Shuqfa2023,
  author = {Shuqfa, Zaid and Belkacem, Abdelkader Nasreddine and Lakas, Abderrahmane},
  title = {Decoding Multi-Class Motor Imagery and Motor Execution Tasks Using Riemannian Geometry Algorithms on Large EEG Datasets},
  journal = {Sensors},
  year = {2023},
  volume = {23},
  number = {11},
  pages = {5051},
  doi = {10.3390/s23115051}
}
Kostenlos starten →