Quantitative analysis of EEG signals: Time-frequency methods and ...
Quantitative analysis of EEG signals: Time-frequency methods and ...
Quantitative analysis of EEG signals: Time-frequency methods and ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
the sum <strong>of</strong> the positive exponents (i.e. the ones giving the rate <strong>of</strong> expansion <strong>of</strong> the<br />
volume), equals the Kolmogorov entropy (Pesin, 1977).<br />
K 2 = X >0<br />
i (47)<br />
5.2.6 Calculating Lyapunov Exponents<br />
Wolf Method<br />
Wolfetal. (1985) proposed an algorithm for calculating the largest Lyapunov exponent.<br />
First, the phase space reconstruction is made (eq.43) <strong>and</strong> the nearest neighbor is<br />
searched for one <strong>of</strong> the rst embedding vectors. A restriction must be made when searching<br />
for the neighbor: it must be suciently separated in time in order not to compute<br />
as nearest neighbors successive vectors <strong>of</strong> the same trajectory. Without considering this<br />
correction, Lyapunov exponents could be spurious due to temporal correlation <strong>of</strong> the<br />
neighbors. Once the neighbor <strong>and</strong> the initial distance (L) is determined, the system is<br />
evolved forward some xed time (evolution time) <strong>and</strong> the new distance (L 0 ) is calculated.<br />
This evolution is repeated, calculating the successive distances, until the separation is<br />
greater than a certain threshold. Then a new vector (replacement vector) is searched as<br />
close as possible to the rst one, having approximately the same orientation <strong>of</strong> the rst<br />
neighbor. Finally, Lyapunov exponents can be estimated using the following formula:<br />
L 1 =<br />
1<br />
(t k ; t 0 )<br />
kX<br />
i=1<br />
ln L0 (t i )<br />
L(t i;1 )<br />
(48)<br />
where k is the number <strong>of</strong> time propagation steps.<br />
Rosenstein Method<br />
Rosenstein et al. (1993) developed another algorithm for the calculation <strong>of</strong> the largest<br />
Lyapunov Exponent in short <strong>and</strong> noisy time series. As before, the rst step is to make<br />
a phase space reconstruction. Then the nearest neighbor for each embedding vector<br />
is found. After this, the system is evolved some xed time <strong>and</strong> the largest Lyapunov<br />
Exponent can be estimated as the mean rate <strong>of</strong> separation <strong>of</strong> the neighbors.<br />
Assuming that the separation is determined by the largest Lyapunov Exponent (),<br />
then at a time t the distance will be:<br />
d(t) C e t (49)<br />
where C is the initial separation. Taking the natural logarithm <strong>of</strong> both sides we obtain:<br />
73