A novel adaptive multilevel thresholding based algorithm for QRS detection
Bibliographic record
Abstract
The heart is the single most important organ of the human body. By studying the ECG signal any abnormalities in the heart’s tempo can be identified. The QRS complex is the most prominent feature of an ECG signal. However, the detection of this feature is hampered by the presence of high and low-frequency noises in the ECG signal and abrupt changes in the signal’s morphology. This paper presents a new method of QRS detection using advanced adaptive multilevel thresholding (AAMT) with selective statistical false peak elimination (SSFPE). Firstly, a band-pass filter is used to filter out most of the unwanted noise and interference to aid the detection operation. Then, AAMT is applied to the entire ECG record to find the location and amplitudes of the pseudo peaks. Next, SSFPE is employed to eliminate false peaks resulting from electromyogram (EMG) and any other high-frequency noise that has not been eliminated in the filtering stage. Finally, after most of the peaks are correctly identified a search back stage is included to find any low amplitude true peaks that might have been missed in the peak detection stage. The proposed method is tested on the MIT-BIH arrhythmia and Fantasia databases and shows high accuracy in detection compared to many state-of-the-art QRS detection methods. The method yields high sensitivity, positive predictivity, and a low detection error rate of 99.85%, 99.91%, and 0.25%, respectively, for the MIT-BIH arrhythmia and 99.98%, 99.90%, and 0.12%, respectively for the Fantasia database.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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.003 | 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".