Complexity measurements for analysis and diagnosis of early ventricular fibrillation

Dejin Yu, M. Small, R. G. Harrison, C. Robertson, G. Clegg, M. Holzer, F. Sterz

Research output: Contribution to journalConference article

7 Citations (Scopus)

Abstract

We present complexity measurements from ECG signals during ventricular fibrillation (VF) using the Gaussian kernel algorithm. Ten ECG data sets of early VF among 53 pig subjects are selected for such analysis. A single test uses a segment of 33.33 seconds and 15 measurements are made on each ECG trace over sliding windows with a skipping length of 10 seconds. It has been shown that the early VF contains approximately 80%-90% low-dimensional deterministic dynamics and approximately 10%-20% high-dimensional component. Dimensions differ from subject to subject and segment to segment, with D2(overbar) to approximately 5, and entropy is positive. For a given ECG trace, variation in dimension along the data is within ±1.0 around its mean value and no monotonic trend exists. Further, the measurements reveal the existence of complex structure within 3 minutes, which is consistent with periodicity analysis.

Original languageEnglish
Pages (from-to)21-24
Number of pages4
JournalComputing in Cardiology
Publication statusPublished - 1 Dec 1999
Externally publishedYes
EventThe 26th Annual Meeting: Computers in Cardiology 1999 - Hannover, Germany
Duration: 26 Sep 199929 Sep 1999

    Fingerprint

Cite this

Yu, D., Small, M., Harrison, R. G., Robertson, C., Clegg, G., Holzer, M., & Sterz, F. (1999). Complexity measurements for analysis and diagnosis of early ventricular fibrillation. Computing in Cardiology, 21-24.