A Graph-Constrained Changepoint Learning Approach for Automatic QRS-Complex Detection
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph World Model
S2FGL: Spatial Spectral Federated Graph Learning
Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations
Fast and Distributed Equivariant Graph Neural Networks by Virtual Node Learning
Higher-Order Graph Databases
Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark
토론
이 논문과 연결된 포럼 글이 아직 없습니다.