Adapted Beamforming: A Robust and Flexible Approach for Removing Various Types of Artifacts from TMS–EEG Data
Bibliographic record
Abstract
Electroencephalogram (EEG) recorded as response to transcranial magnetic stimulation (TMS) can be highly informative of cortical reactivity and connectivity. Reliable EEG interpretation requires artifact removal as the TMS-evoked EEG can contain high-amplitude artifacts. Several methods have been proposed to uncover clean neuronal EEG responses. In practice, determining which method to select for different types of artifacts is often difficult. Here, we used a unified data cleaning framework based on beamforming to improve the algorithm selection and adaptation to the recorded signals. Beamforming properties are well understood, so they can be used to yield customized methods for EEG cleaning based on prior knowledge of the artifacts and the data. The beamforming implementations also cover, but are not limited to, the popular TMS-EEG cleaning methods: independent component analysis (ICA), signal-space projection (SSP), signal-space-projection-source-informed-reconstruction method (SSP-SIR), the source-estimate-utilizing noise-discarding algorithm (SOUND), data-driven Wiener filter (DDWiener), and the multiple-source approach. In addition to these established methods, beamforming provides a flexible way to derive novel artifact suppression algorithms by considering the properties of the recorded data. With simulated and measured TMS-EEG data, we show how to adapt the beamforming-based cleaning to different data and artifact types, namely TMS-evoked muscle artifacts, ocular artifacts, TMS-related peripheral responses, and channel noise. Importantly, beamforming implementations are fast to execute: We demonstrate how the SOUND algorithm becomes orders of magnitudes faster via beamforming. Overall, the beamforming-based spatial filtering framework can greatly enhance the selection, adaptability, and speed of EEG artifact removal.
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.003 |
| Meta-epidemiology (narrow) | 0.002 | 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.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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".