RS slope detection algorithm for extraction of heart rate from noisy, multimodal recordings
Current gold-standard algorithms for heart beat detection do not work properly in the case of high noise levels and do not make use of multichannel data collected by modern patient monitors. The main idea behind the method presented in this paper is to detect the most prominent part of the QRS compl...
Saved in:
Published in | Physiological measurement Vol. 36; no. 8; pp. 1743 - 1761 |
---|---|
Main Authors | , , , , , |
Format | Journal Article |
Language | English |
Published |
England
IOP Publishing
01.08.2015
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Current gold-standard algorithms for heart beat detection do not work properly in the case of high noise levels and do not make use of multichannel data collected by modern patient monitors. The main idea behind the method presented in this paper is to detect the most prominent part of the QRS complex, i.e. the RS slope. We localize the RS slope based on the consistency of its characteristics, i.e. adequate, automatically determined amplitude and duration. It is a very simple and non-standard, yet very effective, solution. Minor data pre-processing and parameter adaptations make our algorithm fast and noise-resistant. As one of a few algorithms in the PhysioNet/Computing in Cardiology Challenge 2014, our algorithm uses more than two channels (i.e. ECG, BP, EEG, EOG and EMG). Simple fundamental working rules make the algorithm universal: it is able to work on all of these channels with no or only little changes. The final result of our algorithm in phase III of the Challenge was 86.38 (88.07 for a 200 record test set), which gave us fourth place. Our algorithm shows that current standards for heart beat detection could be improved significantly by taking a multichannel approach. This is an open-source algorithm available through the PhysioNet library. |
---|---|
Bibliography: | PMEA-100803.R2 Institute of Physics and Engineering in Medicine |
ISSN: | 0967-3334 1361-6579 |
DOI: | 10.1088/0967-3334/36/8/1743 |