Robust Removal of Slow Artifactual Dynamics Induced by Deep Brain Stimulation in Local Field Potential Recordings using SVD-based Adaptive Filtering
Bibliographic record
Abstract
Abstract Deep brain stimulation (DBS) is widely used as a treatment option for patients with movement disorders. In addition to its clinical impact, DBS has been utilized in the field of cognitive neuroscience wherein the answers to several fundamental questions underpinning the mechanisms of neuromodulation in decision making rely on how a burst of DBS pulses, usually delivered at clinical frequency, i.e., 130 Hz, perturb participants’ choices. It was observed that neural activities recorded during DBS were contaminated with stereotype large artifacts, which lasts for a few milliseconds, as well as a low-frequency (slow) signal (∼1-2 Hz) that can persist for hundreds of milliseconds. While the focus of the most of methods for removing DBS artifact was on the former, the artifact removal of the slow signal has not been addressed. In this work, we propose a new method based on combining singular value decomposition (SVD) and normalized adaptive filtering to remove both large (fast) and slow artifacts in local field potentials recorded during a cognitive task in which bursts of DBS were utilized. Using synthetic data, we show that our proposed algorithm outperforms four commonly used techniques in the literature, namely, (1) Normalized least mean square adaptive filtering, (2) Optimal FIR Wiener filtering, (3) Gaussian model matching, and (4) Moving average. The algorithm’s capabilities are further demonstrated by its ability to effectively remove DBS artifacts in local field potentials recorded from the subthalamic nucleus during a verbal Stroop task, highlighting its utility in real-world applications.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".