A Graph-Constrained Changepoint Learning Approach for Automatic QRS-Complex Detection
Not on the map. Why?
Abstract (arXiv)
This study presents a new viewpoint on ECG signal analysis by applying a graph-based changepoint detection model to locate R-peak positions. This model is based on a new graph learning algorithm to learn the constraint graph given the labeled ECG data. The proposed learning algorithm starts with a simple initial graph and iteratively edits the graph so that the final graph has the maximum accuracy in R-peak detection. We evaluate the performance of the algorithm on the MIT-BIH Arrhythmia Database. The evaluation results demonstrate that the proposed method can obtain comparable results to other state-of-the-art approaches. The proposed method achieves the overall sensitivity of Sen = 99.64%, positive predictivity of PPR = 99.71%, and detection error rate of DER = 0.19.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 4 of its 12 references that are in the map. First posted on arXiv 2 Feb 2021.
Builds on
4 of 12 references.
References · 4
- 2018Inter- and intra- patient ECG heartbeat classification for arrhythmia detection: a sequence to sequence deep learning approachcited by 15
- 2019Single-modal and Multi-modal False Arrhythmia Alarm Reduction using Attention-based Convolutional and Recurrent Neural Networkscited by 5
- 2020A Graph-constrained Changepoint Detection Approach for ECG Segmentationcited by 3
- 2017A log-linear time algorithm for constrained changepoint detectioncited by 2
Built on by
Citing papers per year: 2021: 1.
1 paper.