Analysis of first-derivative based QRS detection algorithms

Accurate QRS detection is an important first step for the analysis of heart rate variability. Algorithms based on the differentiated ECG are computationally efficient and hence ideal for real-time analysis of large datasets. Here, we analyze traditional first-derivative based squaring function (Hamilton-Tompkins) and Hilbert transform-based methods for QRS detection and their modifications with improved detection thresholds. On a standard ECG dataset, the Hamilton-Tompkins. algorithm had the highest detection accuracy (99.68% sensitivity, 99.63% positive predictivity) but also the largest time error. The modified Hamilton-Tompkins algorithm as well as the Hilbert transform-based algorithms had comparable, though slightly lower, accuracy; yet these automated algorithms present an advantage for real-time applications by avoiding human intervention in threshold determination. The high accuracy of the Hilbert transform-based method compared to detection with the second derivative of the ECG is ascribable to its inherently uniform magnitude spectrum. For all algorithms, detection errors occurred mainly in beats with decreased signal slope, such as wide arrhythmic beats or attenuated beats. For best performance, a combination of the squaring function and Hilbert transform-based algorithms can be applied such that differences in detection will point to abnormalities in the signal that can be further analyzed.