A Constrained ICA Approach for Real-Time Cardiac Artifact Rejection in Magnetoencephalography
Bibliographic record
Abstract
Recently, magnetoencephalography (MEG)-based real-time brain computing interfaces (BCI) have been developed to enable novel and promising methods of neuroscience research and therapy. Artifact rejection prior to source localization largely enhances the localization accuracy. However, many BCI approaches neglect real-time artifact removal due to its time consuming processing. With cardiac artifact rejection for real-time analysis (CARTA), we introduce a novel algorithm capable of real-time cardiac artifact (CA) rejection. The method is based on constrained independent component analysis (ICA), where a priori information of the underlying source signal is used to optimize and accelerate signal decomposition. In CARTA, this is performed by estimating the subject's individual density distribution of the cardiac activity, which leads to a subject-specific signal decomposition algorithm. We show that the new method is capable of effectively reducing CAs within one iteration and a time delay of 1 ms. In contrast, Infomax and Extended Infomax ICA converged not until seven iterations, while FastICA needs at least ten iterations. CARTA was tested and applied to data from three different but most common MEG systems (4-D-Neuroimaging, VSM MedTech Inc., and Elekta Neuromag). Therefore, the new method contributes to reliable signal analysis utilizing BCI approaches.
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.002 |
| 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.001 |
| 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.001 | 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".