Schrödinger filtering: a precise EEG despiking technique for EEG-fMRI gradient artifact
Bibliographic record
Abstract
In EEG data acquired in the presence of fMRI, gradient-related spike artifacts contaminate the signal following the common preprocessing step of average artifact subtraction. Spike artifacts compromise EEG data quality since they overlap with the EEG signal in frequency, thereby confounding frequency-based inferences on activity. As well, spike artifacts can inflate or deflate correlations among time series, thereby confounding inferences on functional connectivity. We present Schrödinger filtering, which uses the Schrödinger equation to decompose the spike-containing input. The basis functions of the decomposition are localized and pulse-shaped, and selectively capture the various input peaks, with the spike components clustered at the beginning of the spectrum. Schrödinger filtering automatically subtracts the spike components from the data. On real and simulated data, we show that Schrödinger filtering (1) simultaneously accomplishes high spike removal and high signal preservation without affecting evoked activity, and (2) reduces spurious pairwise correlations in spontaneous activity. In these regards, Schrödinger filtering was significantly better than three other despiking techniques: median filtering, amplitude thresholding, and wavelet denoising. These results encourage the use of Schrödinger filtering in future EEG-fMRI pipelines, as well as in other spike-related applications (e.g., fMRI motion artifact removal or action potential extraction).
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.001 | 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.004 | 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".