Brain–Computer Interface Design for Asynchronous Control Applications: Improvements to the LF-ASD Asynchronous Brain Switch
Bibliographic record
Abstract
The low-frequency asynchronous switch design (LF-ASD) was introduced as a direct brain-computer interface (BCI) technology for asynchronous control applications. The LF-ASD operates as an asynchronous brain switch (ABS) which is activated only when a user intends control and maintains an inactive state output when the user is not meaning to control the device (i.e., they may be idle, thinking about a problem, or performing some other action). Results from LF-ASD evaluations have shown promise, although the reported error rates are too high for most practical applications. This paper presents the evaluation of four new LF-ASD designs with data collected from individuals with high-level spinal cord injuries and able-bodied subjects. These new designs incorporated electroencephalographic energy normalization and feature space dimensionality reduction. The error characteristics of the new ABS designs were significantly better than the LF-ASD design with true positive rate increases of approximately 33% for false positive rates in the range of 1%-2%. The results demonstrate that the dimensionality of the LF-ASD feature space can be reduced without performance degradation. The results also confirm previous findings that spinal cord-injured subjects can operate ABS designs to the same ability as able-bodied subjects.
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.001 | 0.004 |
| 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.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".