MétaCan
Menu
Back to cohort
Record W2046579124 · doi:10.1109/icassp.2007.366699

A Simple and Fast Algorithm for Automatic Suppression of High-Amplitude Artifacts in EEG Data

2007· article· en· W2046579124 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsComputer scienceAlgorithmElectroencephalographyBlocking (statistics)Distortion (music)AmplitudeSimple (philosophy)SIMPLE algorithmMatrix (chemical analysis)Transformation matrixArtifact (error)Artificial intelligenceComputer visionBandwidth (computing)

Abstract

fetched live from OpenAlex

In this paper we present a simple and fast technique for correcting high amplitude artifacts that contaminate EEG signals. Examples of such artifacts are ocular movement, eye blinks, head movement, etc. Since the measured EEG data can be modeled as a linear combination of brain sources and artifacts, the proposed technique is based on multiplying the observed data matrix by a blocking matrix that has the effect of blocking high amplitude artifacts, while linearly transforming the other sources without any distortion. The advantages of using this technique are: 1) it is relatively fast, so it can be applied in real time, 2) it is completely automatic, and 3) can be successfully applied to signals which fail with ICA-based algorithms.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.965
Threshold uncertainty score0.248

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.034
GPT teacher head0.327
Teacher spread0.293 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations41
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicBlind Source Separation TechniquesFrench-language works237,207