Classification of BCI Multiclass Motor Imagery Task Based on Artificial Neural Network
Bibliographic record
Abstract
Motor imagery (MI) signals recorded by electroencephalography provide the most practical basis for conceiving brain-computer interfaces (BCI). These interfaces offer a high degree of freedom. This helps people with motor disabilities communicate with the device by tackling a sequence of motor imagery tasks. However, the extracting user-specific features and increasing the accuracy of the classifier remain as difficult tasks in MI-based BCI. In this work, we propose a new method using artificial neural network (ANN) enhancing the performance of the motor imagery classification. Feature extraction techniques, like time domain parameters, band power features, signal power features, and wavelet packet decomposition (WPD), are studied and compared. Four classification algorithms are implemented which are Quadratic Discriminant Analysis, k-Nearest Neighbors, Linear Discriminant Analysis, and proposed ANN architecture. We added Batch Normalization layers to the proposed ANN architecture to improve the learning time and accuracy of the neural network. These layers also alleviate the effect of weight initialization and the addition of a regularization effect on the network. Our proposed method using ANN architecture achieves 0.5545 of kappa and 58.42% of accuracy on the BCI Competition IV-2a dataset. Our results show that the modified ANN method, with frequency and spatial features extracted by WPD and Common Spatial Pattern, respectively, offers a better classification compared to other current methods.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".