2003
DOI: 10.1016/j.physleta.2003.08.018
|View full text |Cite
|
Sign up to set email alerts
|

Detection of weak transitions in signal dynamics using recurrence time statistics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0
1

Year Published

2006
2006
2016
2016

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 44 publications
(22 citation statements)
references
References 17 publications
0
21
0
1
Order By: Relevance
“…In this work, we have used nonlinear methods namely fractal dimension (FD) [16] , largest Lyapunov exponent (LLE) [17] , sample entropy (SampEnt) [18] , DFA [19] , Hurst's exponent (H) [20] , higher order spectra features (weighted centre of bispectrum (W_Bx, W_By), bispectrum phase entropy (EntPh) normalized bispectral entropy (Ent1) and normalized bispectral squared entropies (Ent2, Ent3)) [21] , and recurrence quantification analysis parameters (determinism (DET), entropy (ENTR), laminarity (LAM), and recurrence times (T2)) [22] . These extracted features are ranked using the t value [23] . In this work, we have extracted 15 features.…”
Section: Feature Extraction and Rankingmentioning
confidence: 99%
“…In this work, we have used nonlinear methods namely fractal dimension (FD) [16] , largest Lyapunov exponent (LLE) [17] , sample entropy (SampEnt) [18] , DFA [19] , Hurst's exponent (H) [20] , higher order spectra features (weighted centre of bispectrum (W_Bx, W_By), bispectrum phase entropy (EntPh) normalized bispectral entropy (Ent1) and normalized bispectral squared entropies (Ent2, Ent3)) [21] , and recurrence quantification analysis parameters (determinism (DET), entropy (ENTR), laminarity (LAM), and recurrence times (T2)) [22] . These extracted features are ranked using the t value [23] . In this work, we have extracted 15 features.…”
Section: Feature Extraction and Rankingmentioning
confidence: 99%
“…[50][51][52][53] Third, recurrence time statistics (i.e., the analysis of the distribution pðsÞ of time differences between the system leaving and reentering the neighborhood of a specific state vector) allows distinguishing different types of dynamic behavior. [54][55][56] Finally, e-recurrence networks (RNs) provide a graphtheoretical framework for quantifying various aspects of the underlying attractor's geometry. 29,[57][58][59][60][61][62][63][64][65][66][67] In the following, we will use pðsÞ and K 2 for further characterizing the dynamical complexity of the observed electrochemical oscillations.…”
Section: -5mentioning
confidence: 99%
“…In contrast to return times with respect to a fixed Poincaré surface, recurrence times refer to the time intervals after which the trajectory enters the ε-neighborhood of a previously visited point in phase space. Gao et al [33] demonstrated that similar to some line-based RQA measures, characteristics based on the RT distributions p(τ ) can be used for detecting subtle dynamical transitions, which motivated using a corresponding approach for testing against stationarity [34,35]. Besides their immediate importance for studies on extreme events [36], recurrence times have also proven their potential for the estimation of dynamical invariants such as the information dimension [30] and the Kolmogorov-Sinai entropy [37].…”
Section: A Recurrence Time Statisticsmentioning
confidence: 99%