IMPROVING THE PERFORMANCE OF MOTOR IMAGERY EEG-BASED BCIS VIA AN ADAPTIVE EPOCH TRIMMING MECHANISM
Bibliographic record
Abstract
Brain-Computer Interfaces (BCI) are rapidly evolving within both academia and industry necessitating urgent actions taken to further improve the signal processing module of such systems. Electroencephalography (EEG) is the leading choice for designing BCIs due to its affordability, convenience to use, and implementation simplicity. Motor Imagery (MI), which is merely the imagination of motory tasks without physically performing them, is one of the most common techniques within EEG-based BCIs. Despite the width of MI applications, researchers typically face two groups of subjects; Some subjects imagine repeating the requested movement during the response intervals (epoch), while some others might execute the mental imagination of the activity only once, and not necessarily consistently within equal intervals after the stimulus is presented. The paper focuses on this challenge and proposes an adaptive framework which finds the time interval of subject's concentration on the MI task through three different scenarios. The proposed framework trims the epochs in a way that the irrelevant information within each epoch is discarded as the remainder illustrates the maximum performance of the subject in each trial. The framework is benchmarked on datasets retrieved from BCI Competition III-IVa and the results exhibit significant improvement against its counterparts.
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.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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".