混沌信号自适应协同滤波去噪

混沌信号协同滤波去噪算法充分利用了混沌信号的自相似结构特征,具有良好的信噪比提升性能.针对该算法的滤波参数优化问题,考虑到最优滤波参数的选取受到信号特征、采样频率和噪声水平的影响,为提高该算法的自适应性使其更符合实际应用需求,基于排列熵提出一种滤波参数自动优化准则.依据不同噪声水平的混沌信号排列熵的不同,首先选取不同滤波参数对含噪混沌信号进行去噪,然后计算各滤波参数对应重构信号的排列熵,最后通过比较各重构信号的排列熵,选取排列熵最小的重构信号对应的滤波参数为最优滤波参数,实现滤波参数的优化.分析了不同信号特征、采样频率和噪声水平情况下滤波参数的选取规律.仿真结果表明,该参数优化准则能在不同条件下对滤波参数进行有效的自动最优化,提高了混沌信号协同滤波去噪算法的自适应性.     

Symbolic transfer entropy rate is equal to transfer entropy rate for bivariate finite-alphabet stationary ergodic Markov processes

Transfer entropy is a measure of the magnitude and the direction of information flow between jointly distributed stochastic processes. In recent years, its permutation analogues are considered in the literature to estimate the transfer entropy by counting the number of occurrences of orderings of values, not the values themselves. It has been suggested that the method of permutation is easy to implement, computationally low cost and robust to noise when applying to real world time series data. In this paper, we initiate a theoretical treatment of the corresponding rates. In particular, we consider the transfer entropy rate and its permutation analogue, the symbolic transfer entropy rate, and show that they are equal for any bivariate finite-alphabet stationary ergodic Markov process. This result is an illustration of the duality method introduced in [T. Haruna, K. Nakajima, Physica D 240, 1370 (2011)]. We also discuss the relationship among the transfer entropy rate, the time-delayed mutual information rate and their permutation analogues.     

乙醇含量拉曼光谱检测中噪声与背景同时消除方法研究

乙醇含量拉曼光谱检测中,拉曼光谱信号中的各种噪声及光谱荧光造成的基线漂移和样品池背景等,影响了校正模型的预测精度。利用总体平均经验模态分解,将光谱信号分解成若干无模态混叠的内在模式分量,根据排列熵的信号随机性检测判据判断出代表背景信息和噪声信息的内在模式分量,将其置零即可同时消除拉曼光谱中的噪声与背景。将总体平均经验模态分解与排列熵相结合的预处理方法应用于乙醇含量的拉曼光谱检测中,并与小波变换和平均平滑滤波做了对比。实验结果表明：应用总体平均经验模态分解与排列熵相结合的方法能够有效的同时消除乙醇含量拉曼光谱检测中的噪声和背景信息,提高校正模型的预测精度,且使用简便,无需参数设置,对乙醇含量拉曼光谱检测具有实用价值。     

Double Feature Extraction Method of Ship-Radiated Noise Signal Based on Slope Entropy and Permutation Entropy

In order to accurately identify various types of ships and develop coastal defenses, a single feature extraction method based on slope entropy (SlEn) and a double feature extraction method based on SlEn combined with permutation entropy (SlEn&PE) are proposed. Firstly, SlEn is used for the feature extraction of ship-radiated noise signal (SNS) compared with permutation entropy (PE), dispersion entropy (DE), fluctuation dispersion entropy (FDE), and reverse dispersion entropy (RDE), so that the effectiveness of SlEn is verified, and SlEn has the highest recognition rate calculated by the k-Nearest Neighbor (KNN) algorithm. Secondly, SlEn is combined with PE, DE, FDE, and RDE, respectively, to extract the feature of SNS for a higher recognition rate, and SlEn&PE has the highest recognition rate after the calculation of the KNN algorithm. Lastly, the recognition rates of SlEn and SlEn&PE are compared, and the recognition rates of SlEn&PE are higher than SlEn by 4.22%. Therefore, the double feature extraction method proposed in this paper is more effective in the application of ship type recognition.     

一种基于非完整二维相空间分量置换的混沌检测方法

由于混沌时间序列和随机过程具有很多类似的性质, 因而在实际中很难将两者区分开来. 混沌信号检测与识别是混沌时间序列分析中一个重要的课题. 混沌信号是由确定性的混沌映射或混沌系统产生的, 相比于高斯白噪声序列, 其在非完整的二维相空间中表现出更加丰富的结构特性. 本文通过研究混沌时间序列和高斯白噪声序列在非完整二维相空间中的分布特性, 利用混沌信号的非线性动力学特性, 提出了一种基于非完整二维相空间分量置换的混沌信号检测方法. 该方法首先由接收序列得到非完整的二维相空间, 基于第一维分量大小关系实现对第二维分量的置换与分组, 进一步求得F检验统计量. 然后利用混沌系统的局部特性, 获取非完整二维相空间的动力学结构信息, 实现对混沌序列的有效检测. 在高斯白噪声条件下对多种混沌信号进行了信号检测的数值仿真. 仿真结果表明: 相比置换熵检测, 本文所提算法所需数据量小、计算简单以及具有更低的时间复杂度, 同时对噪声具有更好的鲁棒性.     

Permutation approach to finite-alphabet stationary stochastic processes based on the duality between values and orderings

The duality between values and orderings is a powerful tool to discuss relationships between various information-theoretic measures and their permutation analogues for discrete-time finite-alphabet stationary stochastic processes (SSPs). Applying it to output processes of hidden Markov models with ergodic internal processes, we have shown in our previous work that the excess entropy and the transfer entropy rate coincide with their permutation analogues. In this paper, we discuss two permutation characterizations of the two measures for general ergodic SSPs not necessarily having the Markov property assumed in our previous work. In the first approach, we show that the excess entropy and the transfer entropy rate of an ergodic SSP can be obtained as the limits of permutation analogues of them for the N-th order approximation by hidden Markov models, respectively. In the second approach, we employ the modified permutation partition of the set of words which considers equalities of symbols in addition to permutations of words. We show that the excess entropy and the transfer entropy rate of an ergodic SSP are equal to their modified permutation analogues, respectively.     

Application of permutation entropy method in the analysis of chaotic,noisy, and chaotic noisy series

We have considered a permutation entropy method for analyzing chaotic, noisy, and chaotic noisy series. We have introduced the concept of permutation entropy from a survey of some features of information entropy (Shannon entropy), described the algorithm for its calculation, and indicated the advantages of this approach in the analysis of time series; the application of this method in the analysis of various model systems and experimental data has also been demonstrated.     

Permutation complexity via duality between values and orderings

We study the permutation complexity of finite-state stationary stochastic processes based on a duality between values and orderings between values. First, we establish a duality between the set of all words of a fixed length and the set of all permutations of the same length. Second, on this basis, we give an elementary alternative proof of the equality between the permutation entropy rate and the entropy rate for a finite-state stationary stochastic processes first proved in [J.M. Amigó, M.B. Kennel, L. Kocarev, The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems, Physica D 210 (2005) 77-95]. Third, we show that further information on the relationship between the structure of values and the structure of orderings for finite-state stationary stochastic processes beyond the entropy rate can be obtained from the established duality. In particular, we prove that the permutation excess entropy is equal to the excess entropy, which is a measure of global correlation present in a stationary stochastic process, for finite-state stationary ergodic Markov processes.     

Optimized Variational Mode Decomposition and Permutation Entropy with Their Application in Feature Extraction of Ship-Radiated Noise

The complex and changeable marine environment surrounded by a variety of noise, including sounds of marine animals, industrial noise, traffic noise and the noise formed by molecular movement, not only interferes with the normal life of residents near the port, but also exerts a significant influence on feature extraction of ship-radiated noise (S-RN). In this paper, a novel feature extraction technique for S-RN signals based on optimized variational mode decomposition (OVMD), permutation entropy (PE), and normalized Spearman correlation coefficient (NSCC) is proposed. Firstly, with the mode number determined by reverse weighted permutation entropy (RWPE), OVMD decomposes the target signal into a set of intrinsic mode functions (IMFs). The PE of all the IMFs and SCC between each IMF with the raw signal are then calculated, respectively. Subsequently, feature parameters are extracted through the sum of PE weighted by NSCC for the IMFs. Lastly, the obtained feature vectors are input into the support vector machine multi-class classifier (SVM) to discriminate various types of ships. Experimental results indicate that five kinds of S-RN samples can be accurately identified with a recognition rate of 94% by the proposed scheme, which is higher than other previously published methods. Hence, the proposed method is more advantageous in practical applications.     

Practical considerations of permutation entropy

More than ten years ago Bandt and Pompe introduced a new measure to quantify complexity in measured time series. During these ten years, this measure has been modified and extended. In this review we will give a brief introduction to permutation entropy, explore the different fields of utilization where permutation entropy has been applied and provide a guide on how to choose appropriate parameters for different applications of permutation entropy.     

Permutation entropy and detrend fluctuation analysis for the natural complexity of cardiac heart interbeat signals

We compute fractal dimension and permutation entropy for healthy and people who have experienced heart failure. Our result shows that permutation entropy is a suitable approach as well as detrend fluctuation analysis (DFA). The result of DFA shows that the fractal dimensions for healthy and heart failure are different as well as the permutation entropy result. The fluctuation value for permutation entropy for an individual who has experienced heart failure is bigger than for a healthy person. There is some specific change in the interbeat signal of a person who has experienced heart failure, but there is not previous trend for a healthy person.     

Permutation entropy: One concept, two approaches

Since C. Bandt and B. Pompe introduced permutation entropy in 2002 for piecewise strictly monotonous self-maps of one-dimensional intervals, this concept has been generalized to ever more general settings by means of two similar, though not equivalent, approaches. The first one keeps the original spirit in that it uses “sharp” dynamics and the corresponding ordinal partitions. The second uses symbolic (or “coarse-grained” dynamics with respect to arbitrary finite partitions, as in the conventional approach to the Kolmogorov-Sinai entropy of dynamical systems. Precisely, one of the main questions along these two avenues refers to the relation between permutation entropy and Kolmogorov-Sinai entropy. In this paper the authors will explain the underpinnings of both approaches and the latest theoretical results on permutation entropy. The authors also discuss some remaining open questions.     

Rescaled Range Permutation Entropy: A Method for Quantifying the Dynamical Complexity of Extreme Volatility in Chaotic Time Series

Information entropy,as a quantitative measure of complexity in nonlinear systems,has been widely researched in a variety of contexts.With the development of a nonlinear dynamic,the entropy is faced with severe challenges in dealing with those signals exhibiting extreme volatility.In order to address this problem of weighted permutation entropy,which may result in the inaccurate estimation of extreme volatility,we propose a rescaled range permutation entropy,which selects the ratio of range and standard deviation as the weight of different fragments in the time series,thereby effectively extracting the maximum volatility.By analyzing typical nonlinear systems,we investigate the sensitivities of four methods in chaotic time series where extreme volatility occurs.Compared with sample entropy,fuzzy entropy,and weighted permutation entropy,this rescaled range permutation entropy leads to a significant discernibility,which provides a new method for distinguishing the complexity of nonlinear systems with extreme volatility.     

Mixing Bandt-Pompe and Lempel-Ziv approaches: another way to analyze the complexity of continuous-state sequences

In this paper, we propose to mix the approach underlying Bandt-Pompe permutation entropy with Lempel-Ziv complexity, to design what we call Lempel-Ziv permutation complexity. The principle consists of two steps: (i) transformation of a continuous-state series that is intrinsically multivariate or arises from embedding into a sequence of permutation vectors, where the components are the positions of the components of the initial vector when re-arranged; (ii) performing the Lempel-Ziv complexity for this series of ‘symbols’, as part of a discrete finite-size alphabet. On the one hand, the permutation entropy of Bandt-Pompe aims at the study of the entropy of such a sequence; i.e., the entropy of patterns in a sequence (e.g., local increases or decreases). On the other hand, the Lempel-Ziv complexity of a discrete-state sequence aims at the study of the temporal organization of the symbols (i.e., the rate of compressibility of the sequence). Thus, the Lempel-Ziv permutation complexity aims to take advantage of both of these methods. The potential from such a combined approach – of a permutation procedure and a complexity analysis – is evaluated through the illustration of some simulated data and some real data. In both cases, we compare the individual approaches and the combined approach.     

Fractional Brownian motion, fractional Gaussian noise, and Tsallis permutation entropy

In this work, we analyze two important stochastic processes, the fractional Brownian motion and fractional Gaussian noise, within the framework of the Tsallis permutation entropy. This entropic measure, evaluated after using the Bandt & Pompe method to extract the associated probability distribution, is shown to be a powerful tool to characterize fractal stochastic processes. It allows for a better discrimination of the processes than the Shannon counterpart for appropriate ranges of values of the entropic index. Moreover, we find the optimum value of this entropic index for the stochastic processes under study.     

Estimating Phase Amplitude Coupling between Neural Oscillations Based on Permutation and Entropy

Cross-frequency phase–amplitude coupling (PAC) plays an important role in neuronal oscillations network, reflecting the interaction between the phase of low-frequency oscillation (LFO) and amplitude of the high-frequency oscillations (HFO). Thus, we applied four methods based on permutation analysis to measure PAC, including multiscale permutation mutual information (MPMI), permutation conditional mutual information (PCMI), symbolic joint entropy (SJE), and weighted-permutation mutual information (WPMI). To verify the ability of these four algorithms, a performance test including the effects of coupling strength, signal-to-noise ratios (SNRs), and data length was evaluated by using simulation data. It was shown that the performance of SJE was similar to that of other approaches when measuring PAC strength, but the computational efficiency of SJE was the highest among all these four methods. Moreover, SJE can also accurately identify the PAC frequency range under the interference of spike noise. All in all, the results demonstrate that SJE is better for evaluating PAC between neural oscillations.     

Topological permutation entropy

Permutation entropy quantifies the diversity of possible ordering of the successively observed values a random or deterministic system can take, just as Shannon entropy quantifies the diversity of the values themselves. When the observable or state variable has a natural order relation, making permutation entropy possible to compute, then the asymptotic rate of growth in permutation entropy with word length forms an alternative means of describing the intrinsic entropy rate of a source. Herein, extending a previous result on metric entropy rate, we show that the topological permutation entropy rate for expansive maps equals the conventional topological entropy rate familiar from symbolic dynamics. This result is not limited to one-dimensional maps.     

Forbidden patterns, permutation entropy and stock market inefficiency

In this paper we introduce two new quantifiers for the stock market inefficiency: the number of forbidden patterns and the normalized permutation entropy. They are model-independent measures, thus they have more general applicability. We find robust evidence that degree of market inefficiency is positively correlated with the number of forbidden patterns and negatively correlated with the permutation entropy. Our empirical results suggest that these two physical tools are useful to discriminate the stage of stock market development and can be easily implemented.     

Rolling Bearing Fault Diagnosis Based on VMD-MPE and PSO-SVM

The goal of the paper is to present a solution to improve the fault detection accuracy of rolling bearings. The method is based on variational mode decomposition (VMD), multiscale permutation entropy (MPE) and the particle swarm optimization-based support vector machine (PSO-SVM). Firstly, the original bearing vibration signal is decomposed into several intrinsic mode functions (IMF) by using the VMD method, and the feature energy ratio (FER) criterion is introduced to reconstruct the bearing vibration signal. Secondly, the multiscale permutation entropy of the reconstructed signal is calculated to construct multidimensional feature vectors. Finally, the constructed multidimensional feature vector is fed into the PSO-SVM classification model for automatic identification of different fault patterns of the rolling bearing. Two experimental cases are adopted to validate the effectiveness of the proposed method. Experimental results show that the proposed method can achieve a higher identification accuracy compared with some similar available methods (e.g., variational mode decomposition-based multiscale sample entropy (VMD-MSE), variational mode decomposition-based multiscale fuzzy entropy (VMD-MFE), empirical mode decomposition-based multiscale permutation entropy (EMD-MPE) and wavelet transform-based multiscale permutation entropy (WT-MPE)).