Bukkapatnam Satish, Komanduri Ranga, Yang Hui, Rao Prahalad, Lih Wen-Chen, Malshe Milind, Raff Lionel M, Benjamin Bruce, Rockley Mark
Industrial Engineering and Management, Oklahoma State University, Stillwater, OK, USA.
J Electrocardiol. 2008 Jul-Aug;41(4):292-9. doi: 10.1016/j.jelectrocard.2008.01.004. Epub 2008 Mar 25.
Atrial fibrillation (AF) is the most common form of cardiac arrhythmia. This paper presents the application of the Classification and Regression Tree (CART) technique for detecting spontaneous termination or sustenance of AF with sparse data.
Electrocardiogram (ECG) recordings were obtained from the PhysioNet (AF Termination Challenge Database 2004) Web site. Signal analysis, feature extraction, and classification were made to distinguish among 3 AF episodes, namely, Nonterminating (N), Soon (<1 minute) to be terminating (S), and Terminating immediately (<1 second) (T).
A continuous wavelet transform whose basis functions match the EKG patterns was found to yield compact representation (approximately 2 orders of magnitude). This facilitates the development of efficient algorithms for beat detection, QRST subtraction, and multiple ECG quantifier extraction (eg, QRS width, QT interval). A compact feature set was extracted through principal component analysis of these quantifiers. Accuracies exceeding 90% for AF episode classification were achieved.
A wavelet representation customized to the ECG signal pattern was found to yield 98% lower entropies compared with other representations that use standard library wavelets. The Classification and Regression Tree (CART) technique seems to distinguish the N vs T, and the S vs T classifications very accurately.
心房颤动(AF)是最常见的心律失常形式。本文介绍了分类回归树(CART)技术在利用稀疏数据检测AF自发终止或持续方面的应用。
从PhysioNet(2004年AF终止挑战数据库)网站获取心电图(ECG)记录。进行信号分析、特征提取和分类,以区分3种AF发作类型,即非终止型(N)、即将(<1分钟)终止型(S)和立即(<1秒)终止型(T)。
发现一种基函数与心电图模式匹配的连续小波变换能产生紧凑表示(约2个数量级)。这有助于开发用于心跳检测、QRST减法和多个心电图量化指标提取(如QRS宽度、QT间期)的高效算法。通过对这些量化指标进行主成分分析提取了一个紧凑的特征集。AF发作类型分类的准确率超过了90%。
与使用标准库小波的其他表示相比,发现一种根据心电图信号模式定制的小波表示能使熵降低98%。分类回归树(CART)技术似乎能非常准确地区分N与T以及S与T分类。