Comparison of low-complexity algorithms for real-time QRS detection using standard ECG database

Abstract

Today, thanks to the development of advanced wearable devices, it is possible to track patient conditions outside hospital setting for several days. One of the most important bio-signals used for health analysis is the electrocardiographic (ECG) signal. It provides information about the heart rate, rhythm, and morphology of heart. Many algorithms are proposed over years for automated ECG analysis. Due to their computational complexity, not all these techniques can be implemented on wearable devices for real-time ECG detection. In this frame, a particular interest is toward the algorithms for automatic QRS detection. Different algorithms have been presented in the literature. Among all, more suitable class for the implementation on embedded systems is based on the use of signal derivatives and thresholds. These algorithms are composed by pre-processing stage, for the noise removal, and decision stage for the QRS detection. In literature, the different algorithms were discriminated only with respect to their preprocessing stages. Furthermore, not all algorithms were tested with standard database: this makes the results difficult to compare and evaluate. Moreover, the algorithms performance in case of pathological behaviours was not compared. This paper is motivated by the need to perform a comparison of the whole algorithms, both pre-processing and decision stages, under a standard database (MITBIH ECG database of Physionet), either for non-pathological and pathological signals. The results confirm that the Pan & Tompkins algorithm has the best performance in terms of QRS complex detection. However, in some cases, its performance is comparable with the other algorithms ones. For this reason, in the applications in which the reduced of computational complexity is an important constraint, it is possible to implemented algorithms with comparable performance but with lesser complexity with respect to P & T algorithm.