By Topic

A Low-Complexity ECG Feature Extraction Algorithm for Mobile Healthcare Applications

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

8 Author(s)
Mazomenos, E.B. ; Sch. of Electron. & Comput. Sci., Univ. of Southampton, Southampton, UK ; Biswas, D. ; Acharyya, A. ; Taihai Chen
more authors

This paper introduces a low-complexity algorithm for the extraction of the fiducial points from the electrocardiogram (ECG). The application area we consider is that of remote cardiovascular monitoring, where continuous sensing and processing takes place in low-power, computationally constrained devices, thus the power consumption and complexity of the processing algorithms should remain at a minimum level. Under this context, we choose to employ the discrete wavelet transform (DWT) with the Haar function being the mother wavelet, as our principal analysis method. From the modulus-maxima analysis on the DWT coefficients, an approximation of the ECG fiducial points is extracted. These initial findings are complimented with a refinement stage, based on the time-domain morphological properties of the ECG, which alleviates the decreased temporal resolution of the DWT. The resulting algorithm is a hybrid scheme of time- and frequency-domain signal processing. Feature extraction results from 27 ECG signals from QTDB were tested against manual annotations and used to compare our approach against the state-of-the art ECG delineators. In addition, 450 signals from the 15-lead PTBDB are used to evaluate the obtained performance against the CSE tolerance limits. Our findings indicate that all but one CSE limits are satisfied. This level of performance combined with a complexity analysis, where the upper bound of the proposed algorithm, in terms of arithmetic operations, is calculated as 2.423N+214 additions and 1.093N+12 multiplications for N ≤ 861 or 2.553N+102 additions and 1.093N+10 multiplications for N > 861 (N being the number of input samples), reveals that the proposed method achieves an ideal tradeoff between computational complexity and performance, a key requirement in remote cardiovascular disease monitoring systems.

Published in:

Biomedical and Health Informatics, IEEE Journal of  (Volume:17 ,  Issue: 2 )