Interpretation of the Lempel-Ziv Complexity Measure in the Context of Biomedical Signal Analysis

Lempel-Ziv complexity (LZ) and derived LZ algorithms have been extensively used to solve information theoretic problems such as coding and lossless data compression. In recent years, LZ has been widely used in biomedical applications to estimate the complexity of discrete-time signals. Despite its popularity as a complexity measure for biosignal analysis, the question of LZ interpretability and its relationship to other signal parameters and to other metrics has not been previously addressed. We have carried out an investigation aimed at gaining a better understanding of the LZ complexity itself, especially regarding its interpretability as a biomedical signal analysis technique. Our results indicate that LZ is particularly useful as a scalar metric to estimate the bandwidth of random processes and the harmonic variability in quasi-periodic signals

[1]  Aaron D. Wyner,et al.  Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression , 1989, IEEE Trans. Inf. Theory.

[2]  Sanjeev R. Kulkarni,et al.  Source codes as random number generators , 1997, Proceedings of IEEE International Symposium on Information Theory.

[3]  Maria V. Sanchez-Vives,et al.  Application of Lempel–Ziv complexity to the analysis of neural discharges , 2003, Network.

[4]  Benjamin Weiss,et al.  Entropy and data compression schemes , 1993, IEEE Trans. Inf. Theory.

[5]  Neri Merhav,et al.  A measure of relative entropy between individual sequences with application to universal classification , 1993, IEEE Trans. Inf. Theory.

[6]  Radhakrishnan Nagarajan,et al.  Quantifying physiological data with Lempel-Ziv complexity-certain issues , 2002, IEEE Transactions on Biomedical Engineering.

[7]  Xu-Sheng Zhang,et al.  Detecting ventricular tachycardia and fibrillation by complexity measure , 1999, IEEE Transactions on Biomedical Engineering.

[8]  Marcelo J. Weinberger,et al.  Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm , 1992, IEEE Trans. Inf. Theory.

[9]  X. -S. Zhang,et al.  New approach to studies on ECG dynamics: Extraction and analyses of QRS complex irregularity time series , 1997, Medical and Biological Engineering and Computing.

[10]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[11]  Vladimir D. Gusev,et al.  On the complexity measures of genetic sequences , 1999, Bioinform..

[12]  Abraham Lempel,et al.  Design of universal test sequences for VLSI , 1985, IEEE Trans. Inf. Theory.

[13]  Xu-Sheng Zhang,et al.  Derived fuzzy knowledge model for estimating the depth of anesthesia , 2001, IEEE Transactions on Biomedical Engineering.

[14]  Abraham Lempel,et al.  On the power of straight- line computations in finite fields , 1982, IEEE Trans. Inf. Theory.

[15]  Roberto Hornero,et al.  Adaptive modeling and spectral estimation of nonstationary biomedical signals based on Kalman filtering , 2005, IEEE Transactions on Biomedical Engineering.

[16]  X. -S. Zhang,et al.  Predicting movement during anaesthesia by complexity analysis of electroencephalograms , 1999, Medical & Biological Engineering & Computing.

[17]  Abraham Lempel,et al.  Match-length functions for data compression , 1996, IEEE Trans. Inf. Theory.

[18]  Neri Merhav,et al.  Estimating the number of states of a finite-state source , 1992, IEEE Trans. Inf. Theory.

[19]  En-Hui Yang,et al.  Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm , 1996, IEEE Trans. Inf. Theory.

[20]  H. X. Zhang,et al.  Complexity measure and complexity rate information based detection of ventricular tachycardia and fibrillation , 2000, Medical and Biological Engineering and Computing.

[21]  Roberto Hornero,et al.  Analysis of EEG background activity in Alzheimer's disease patients with Lempel-Ziv complexity and central tendency measure. , 2006, Medical engineering & physics.

[22]  Guy Louchard,et al.  Average redundancy rate of the Lempel-Ziv code , 1996, Proceedings of Data Compression Conference - DCC '96.

[23]  Amos Lapidoth,et al.  On the Universality of the LZ-Based Decoding Algorithm , 1998, IEEE Trans. Inf. Theory.

[24]  Serap A. Savari,et al.  Redundancy of the Lempel-Ziv incremental parsing rule , 1997, IEEE Trans. Inf. Theory.

[25]  Roberto Hornero,et al.  Complex analysis of intracranial hypertension using approximate entropy* , 2006, Critical care medicine.

[26]  N Radhakrishnan,et al.  Estimating regularity in epileptic seizure time-series data. A complexity-measure approach. , 1998, IEEE engineering in medicine and biology magazine : the quarterly magazine of the Engineering in Medicine & Biology Society.

[27]  T I Dix,et al.  Discovering patterns in Plasmodium falciparum genomic DNA. , 2001, Molecular and biochemical parasitology.

[28]  José María Amigó,et al.  Estimating the Entropy Rate of Spike Trains via Lempel-Ziv Complexity , 2004, Neural Computation.

[29]  Neri Merhav,et al.  Universal prediction of individual sequences , 1992, IEEE Trans. Inf. Theory.

[30]  Yuriy L. Orlov,et al.  Complexity: an internet resource for analysis of DNA sequence complexity , 2004, Nucleic Acids Res..

[31]  Tsutomu Kawabata,et al.  Exact analysis of the Lempel-Ziv algorithm for i.i.d. sources , 1993, IEEE Trans. Inf. Theory.

[32]  Wojciech Szpankowski,et al.  A suboptimal lossy data compression based on approximate pattern matching , 1997, IEEE Trans. Inf. Theory.

[33]  Roberto Hornero,et al.  Interpretation of approximate entropy: analysis of intracranial pressure approximate entropy during acute intracranial hypertension , 2005, IEEE Transactions on Biomedical Engineering.

[34]  Peter Grassberger,et al.  Estimating the information content of symbol sequences and efficient codes , 1989, IEEE Trans. Inf. Theory.

[35]  Jinghua Xu,et al.  Information transmission in human cerebral cortex , 1997 .

[36]  Abraham Lempel,et al.  On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[37]  Erik W. Jensen,et al.  EEG complexity as a measure of depth of anesthesia for patients , 2001, IEEE Trans. Biomed. Eng..

[38]  Tuvi Etzion,et al.  Algorithms for the generation of full-length shift-register sequences , 1984, IEEE Trans. Inf. Theory.

[39]  Khalid Sayood,et al.  A new sequence distance measure for phylogenetic tree construction , 2003, Bioinform..

[40]  Abraham Lempel,et al.  Compression of two-dimensional data , 1986, IEEE Trans. Inf. Theory.

[41]  Abraham Lempel,et al.  A class of balanced binary sequences with optimal autocorrelation properties , 1977, IEEE Trans. Inf. Theory.