2019
DOI: 10.1155/2019/1403829
|View full text |Cite
|
Sign up to set email alerts
|

Improved Permutation Entropy for Measuring Complexity of Time Series under Noisy Condition

Abstract: Measuring complexity of observed time series plays an important role for understanding the characteristics of the system under study. Permutation entropy (PE) is a powerful tool for complexity analysis, but it has some limitations. For example, the amplitude information is discarded; the equalities (i.e., equal values in the analysed signal) are not properly dealt with; and the performance under noisy condition remains to be improved. In this paper, the improved permutation entropy (IPE) is proposed. The prese… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
58
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 43 publications
(58 citation statements)
references
References 38 publications
0
58
0
Order By: Relevance
“…Of course, there are also different selections (for details, see the literature [25]). Some recent applications and development of permutation entropy also can be seen in related literature [26,27].…”
Section: Permutation Entropymentioning
confidence: 99%
“…Of course, there are also different selections (for details, see the literature [25]). Some recent applications and development of permutation entropy also can be seen in related literature [26,27].…”
Section: Permutation Entropymentioning
confidence: 99%
“…x (1) x (2) x 3x (22) x (23) x (29) x (30) x(31) A time series {x(i) : 1 ≤ i ≤ 50} is given to illustrate the process for calculating SampEn(m, r, N). We specify m = 2 and r = 0.15 SD.…”
Section: Sample Entropymentioning
confidence: 99%
“…The dependence of the output value on the previous terms increases as the order p increases. Furthermore, as the order p increases, the correlation of the signal increases accordingly, making the model more predictable [23,29]. That is, the complexity of AR(p + 1) is lower than that of AR(p).…”
Section: Hierarchical Entropy Analysis For the Ar Processmentioning
confidence: 99%
See 1 more Smart Citation
“…Such features exhibit a very high discriminating power, and that is why they have been successfully employed in many applications [ 9 , 10 , 11 ]. However, there are ongoing efforts to further improve this discriminating power with new complexity estimation algorithms or by tweaking current ones [ 12 , 13 , 14 , 15 , 16 , 17 ], as is the case in this paper.…”
Section: Introductionmentioning
confidence: 99%