Learning across multi-stimulus enhances target recognition methods in SSVEP-based BCIs
Bibliographic record
Abstract
OBJECTIVE: Latest target recognition methods that are equipped with learning from the subject's calibration data, represented by the extended canonical correlation analysis (eCCA) and the ensemble task-related component analysis (eTRCA), can achieve extra high performance in the steady-state visual evoked potential (SSVEP)-based brain-computer interfaces (BCIs), however their performance deteriorate drastically if the calibration trials are insufficient. This paper develops a new scheme to learn from limited calibration data. APPROACH: A learning across multiple stimuli scheme is proposed for the target recognition methods, which applies to learning the data corresponding to not only the target stimulus but also the other stimuli. The resulting optimization problems can be simplified and solved utilizing the prior knowledge and properties of SSVEPs across different stimuli. With the new learning scheme, the eCCA and the eTRCA can be extended to the multi-stimulus eCCA (ms-eCCA) and the multi-stimulus eTRCA (ms-eTRCA), respectively, as well as a combination of them (i.e. ms-eCCA+ms-eTRCA) that incorporates their merits. MAIN RESULTS: Evaluation and comparison using an SSVEP-BCI benchmark dataset with 35 subjects show that the ms-eCCA (or ms-eTRCA) performs significantly better than the eCCA (or eTRCA) method while the ms-eCCA+ms-eTRCA performs the best. With the learning across stimuli scheme, the existing target recognition methods can be further improved in terms of the target recognition performance and the ability against insufficient calibration. SIGNIFICANCE: A new learning scheme is proposed towards the efficient use of the calibration data, providing enhanced performance and saving calibration time in the SSVEP-based BCIs.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".