Design of a network permutation entropy and its applications for chaotic time series and EEG signals

Abstract

Measuring the complexity of time series provides an important indicator for characteristic analysis of nonlinear systems. The permutation entropy (PE) is widely used, but it still needs to be modified. In this paper, the PE algorithm is improved by introducing the concept of the network, and the network PE (NPE) is proposed. The connections are established based on both the patterns and weights of the reconstructed vectors. The complexity of different chaotic systems is analyzed. As with the PE algorithm, the NPE algorithm-based analysis results are also reliable for chaotic systems. Finally, the NPE is applied to estimate the complexity of EEG signals of normal healthy persons and epileptic patients. It is shown that the normal healthy persons have the largest NPE values, while the EEG signals of epileptic patients are lower during both seizure-free intervals and seizure activity. Hence, NPE could be used as an alternative to PE for the nonlinear characteristics of chaotic systems and EEG signal-based physiological and biomedical analysis.