Robust and efficient location of T-wave ends in electrocardiogram

A new algorithm is proposed in this paper for T-wave end location in electrocardiogram (ECG). It mainly consists of the computation of an indicator related to the area covered by the T-wave curve and delimited in a special manner. Based on simple assumptions, essentially on the concavity of the T-wave form, it is proved that the maximum of the computed indicator inside each cardiac cycle coincides with the T-wave end. The algorithm is robust to measurement noise, to wave form morphological variations and to baseline wander. It is also computationally very simple: the main computation can be implemented as a simple finite impulse response (FIR) filter

[1]  R. Orglmeister,et al.  The principles of software QRS detection , 2002, IEEE Engineering in Medicine and Biology Magazine.

[2]  Pablo Laguna,et al.  A database for evaluation of algorithms for measurement of QT and other waveform intervals in the ECG , 1997, Computers in Cardiology 1997.

[3]  Qinghua Zhang,et al.  An Algorithm for Robust and Efficient Location of T-Wave Ends in Electrocardiograms , 2006, IEEE Transactions on Biomedical Engineering.

[4]  Pawel Strumillo,et al.  Nested median filtering for detecting T-wave offset in ECGs , 2002 .

[5]  Pablo Laguna,et al.  A wavelet-based ECG delineator: evaluation on standard databases , 2004, IEEE Transactions on Biomedical Engineering.

[6]  P Caminal,et al.  Automatic detection of wave boundaries in multilead ECG signals: validation with the CSE database. , 1994, Computers and biomedical research, an international journal.

[7]  Senén Barro,et al.  A new approach for TU complex characterization , 2000, IEEE Transactions on Biomedical Engineering.