In this paper, we developed and evaluated a robust single-lead electrocardiogram (ECG) delineation system based on the wavelet transform (WT). In a first step, QRS complexes are detected. Then, each QRS is delineated by detecting and identifying the peaks of the individual waves, as well as the complex onset and end. Finally, the determination of P and T wave peaks, onsets and ends is performed. We evaluated the algorithm on several manually annotated databases, such as MIT-BIH Arrhythmia, QT, European ST-T and CSE databases, developed for validation purposes. The QRS detector obtained a sensitivity of Se=99.66% and a positive predictivity of P+=99.56% over the first lead of the validation databases (more than 980,000 beats), while for the well-known MIT-BIH Arrhythmia Database, Se and P+ over 99.8% were attained. As for the delineation of the ECG waves, the mean and standard deviation of the differences between the automatic and manual annotations were computed. The mean error obtained with the WT approach was found not to exceed one sampling interval, while the standard deviations were around the accepted tolerances between expert physicians, outperforming the results of other well known algorithms, especially in determining the end of T wave.

A wavelet-based ECG delineator: evaluation on standard databases

The QRS complex is the most striking waveform within the electrocardiogram (ECG). Since it reflects the electrical activity within the heart during the ventricular contraction, the time of its occurrence as well as its shape provide much information about the current state of the heart. Due to its characteristic shape it serves as the basis for the automated determination of the heart rate, as an entry point for classification schemes of the cardiac cycle, and often it is also used in ECG data compression algorithms. In that sense, QRS detection provides the fundamentals for almost all automated ECG analysis algorithms. Software QRS detection has been a research topic for more than 30 years. The evolution of these algorithms clearly reflects the great advances in computer technology. Within the last decade many new approaches to QRS detection have been proposed; for example, algorithms from the field of artificial neural networks genetic algorithms wavelet transforms, filter banks as well as heuristic methods mostly based on nonlinear transforms. The authors provide an overview of these recent developments as well as of formerly proposed algorithms.

/pdf/the-principles-of-software-qrs-detection-1vgts9f7g6.pdf

The principles of software QRS detection

We have investigated the quantitative effects of a number of common elements of QRS detection rules using the MIT/BIH arrhythmia database. A previously developed linear and nonlinear filtering scheme was used to provide input to the QRS detector decision section. We used the filtering to preprocess the database. This yielded a set of event vectors produced from QRS complexes and noise. After this preprocessing, we tested different decision rules on the event vectors. This step was carried out at processing speeds up to 100 times faster than real time. The role of the decision rule section is to discriminate the QRS events from the noise events. We started by optimizing a simple decision rule. Then we developed a progressively more complex decision process for QRS detection by adding new detection rules. We implemented and tested a final real-time QRS detection algorithm, using the optimized decision rule process. The resulting QRS detection algorithm has a sensitivity of 99.69 percent and positive predictivity of 99.77 percent when evaluated with the MIT/BIH arrhythmia database.

Quantitative Investigation of QRS Detection Rules Using the MIT/BIH Arrhythmia Database

Premises of creation of Internet portal designed to provide access to participants of educational and scientific process for the joint creation, consolidation, concentration and rapid spreading of educational and scientific information resources in its own depository are considered. CMS-based portal content management systems’ potentiality is investigated. Architecture for Internet portal of MES of Ukraine’s information resources is offered.

Створення порталу інформаційно-довідкових ресурсів міністерства освіти і науки україни

Electrocardiogram (ECG) compression techniques are compared, and a unified view of these techniques is established. ECG data compression schemes are presented in two major groups: direct data compression and transformation methods. The direct data compression techniques are ECG differential pulse code modulation (DPCM) and entropy coding, AZTEC, Turning-point, CORTES, Fan and SAPA algorithms, peak-picking, and cycle-to-cycle compression methods. The transformation methods include Fourier, Walsh, and Karhunen-Loeve transforms. The theoretical bases behind the direct ECG data compression schemes are presented and classified into three categories: tolerance-comparison compression, DPCM, and entropy coding methods. A framework for evaluation and comparison of ECG compression schemes is presented. >

ECG data compression techniques-a unified approach

The method of Fourier descriptors (FD's) is presented for ECG data compression. The two-lead ECG data are segmented into QRS complexes and S-Q intervals, expressed as a complex sequence, and are Fourier transformed to obtain the FD's. A few lower order descriptors symmetrically situated with respect to the dc coefficient represent the data in the Fourier (compressed) domain. While compression ratios of 10:1 are feasible for the S-Q interval, the clinical information requirements limit this ratio to 3:1 for the QRS complex. With an overall compression ratio greater than 7, the quality of the reconstructed signal is well suited for morphological studies. The method is resistant to noisy signals and is simple, requiring implementation of forward and inverse FFT. The results of compression of ECG data obtained from more than 50 subjects with rhythm and morphological abnormalities are presented.

ECG Data Compression Using Fourier Descriptors

A complete solution for the delineation of the ECG signal into its component waves is proposed from a system theoretic point of view. The discrete cosine transform (DCT) of a bell-shaped biphasic function is approximated mathematically by a system function with two poles and two zeros, i.e., of order

Analysis of ECG from pole-zero models

A diagnostic system for ECG rhythm monitoring based on syntactic approaches to pattern recognition is presented here. The method proposed exploits the difference in shape and structure between arrhythmic and normal ECG patterns to generate distinctly different descriptions in terms of a chosen set of primitives. A given frame of signal is first approximated piecewise linearly into a set of line segments which are completely specified in terms of their length and slope values. The slope values are quantized into seven distinct levels and a unit-length line segment with a slope value in each of these levels is coded as a slope symbol. Seven such slope symbols constitute the set of primitives. The given signal is represented as a string of such symbols based on the length and angle of the line segments approximating the signal. Context-free languages are used for describing the classes of abnormal and normal ECG patterns considered here. Analysis of actual ECG data shows efficiency comparable with that of existing methods and a saving in processing time.

Syntactic Approach to ECG Rhythm Analysis

A new scheme is proposed for the detection of premature ventricular beats, which is a vital function in rhythm monitoring of cardiac patients. A transformation based on the first difference of the digitized electrocardiogram (ECG) signal is developed for the detection and delineation of QRS complexes. The method for classifying the abnormal complexes from the normal ones is based on the concepts of minimum phase and signal length. The parameters of a linear discriminant function obtained from a training feature vector set are used to classify the complexes. Results of application of the scheme to ECG of two arrhythmia patients are presented.

New Concepts for PVC Detection

Homomorphic analysis and pole-zero modeling of electrocardiogram (ECG) signals are presented in this paper. Four typical ECG signals are considered and deconvolved into their minimum and maximum phase components through cepstral filtering, with a view to study the possibility of more efficient feature selection from the component signals for diagnostic purposes. The complex cepstra of the signals are linearly filtered to extract the basic wavelet and the excitation function. The ECG signals are, in general, mixed phase and hence, exponential weighting is done to aid deconvolution of the signals. The basic wavelet for normal ECG approximates the action potential of the muscle fiber of the heart and the excitation function corresponds to the excitation pattern of the heart muscles during a cardiac cycle. The ECG signals and their components are pole-zero modeled and the pole-zero pattern of the models can give a clue to classify the normal and abnormal signals. Besides, storing only the parameters of the model can result in a data reduction of more than 3:1 for normal signals sampled at a moderate 128 samples/s.

I. S. N. Murthy

Papers

ECG Data Compression Using Fourier Descriptors

Analysis of ECG from pole-zero models

Syntactic Approach to ECG Rhythm Analysis

New Concepts for PVC Detection

Homomorphic Analysis and Modeling of ECG Signals