Filtering electrocardiographic signals using an unbiased and normalized adaptive noise reduction system
Bibliographic record
Abstract
We present a novel unbiased and normalized adaptive noise reduction (UNANR) system to suppress random noise in electrocardiographic (ECG) signals. The system contains procedures for the removal of baseline wander with a two-stage moving-average filter, comb filtering of power-line interference with an infinite impulse response (IIR) comb filter, an additive white noise generator to test the system's performance in terms of signal-to-noise ratio (SNR), and the UNANR model that is used to estimate the noise which is subtracted from the contaminated ECG signals. The UNANR model does not contain a bias unit, and the coefficients are adaptively updated by using the steepest-descent algorithm. The corresponding adaptation process is designed to minimize the instantaneous error between the estimated signal power and the desired noise-free signal power. The benchmark MIT-BIH arrhythmia database was used to evaluate the performance of the UNANR system with different levels of input noise. The results of adaptive filtering and a study on convergence of the UNANR learning rate demonstrate that the adaptive noise-reduction system that includes the UNANR model can effectively eliminate random noise in ambulatory ECG recordings, leading to a higher SNR improvement than that with the same system using the popular least-mean-square (LMS) filter. The SNR improvement provided by the proposed UNANR system was higher than that provided by the system with the LMS filter, with the input SNR in the range of 5-20 dB over the 48 ambulatory ECG recordings tested.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| 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".