27.11.2014 Views

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 ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

will be dominated by noise. One rst criteria is to take n > 2D 2 (Takens, 1981). In<br />

this case, the attractor will be completely unfolded but this criterion assumes a previous<br />

estimation <strong>of</strong> D 2 . One solution is then to repeat the calculations for dierent sets <strong>of</strong><br />

embedding dimensions <strong>and</strong> in case <strong>of</strong> nding convergence, then to cheek if this criterion<br />

is fullled. However, this is sometimes dicult to implement because the calculations<br />

do not depend solely on or on n, on the contrary, they depend on the combination<br />

<strong>of</strong> both (Broomhead <strong>and</strong> King, 1986 Mees et al., 1987 Albano et al., 1988 Palus <strong>and</strong><br />

Dvorak, 1992). Then, an estimation <strong>of</strong> a minimum n would be helpful. In this respect,<br />

Kennel et al. (1992) proposed the false nearest neighbors method. The main idea is to<br />

calculate if for a certain n nearest neighbors in the phase space still remain close for a<br />

dimension n +1. If this is not the case, then the attractor was not completely unfolded<br />

<strong>and</strong> the embedding dimension must be higher. The procedure is repeated for increasing<br />

embedding dimensions until neighbors remain close.<br />

Another important problem arises when choosing the linear region in the plots <strong>of</strong><br />

log C(R) vs. log R <strong>and</strong> also in how to calculate the slope. Up to the moment there is<br />

no unique solution to this question <strong>and</strong> dierent groups have dierent approaches for<br />

obtaining the values <strong>of</strong> D 2 from the log C(R) vs. log R plots. Some researchers prefer to<br />

show directly the plots (Pjin et al., 1997) or to limit the calculation to the correlation<br />

integral (eq. 44).<br />

5.2.5 Lyapunov Exponents <strong>and</strong> Kolmogorov Entropy<br />

Another useful tool for characterizing the attractor are the Lyapunov exponents. Lyapunov<br />

exponents provide a quantitative indication <strong>of</strong> the level <strong>of</strong> chaos <strong>of</strong> a system.<br />

They measure the mean exponential divergence <strong>of</strong> initially close phase space trajectories<br />

with time. As more rapidly two trajectories diverges for a certain period <strong>of</strong> time,<br />

more chaotic is the system <strong>and</strong> more sensitive to initial conditions.<br />

Let us consider a small spherical hypervolume in the phase space. After a short<br />

time, as trajectories evolve, the sphere will have an ellipsoid shape with its axes deformed<br />

according the Lyapunov exponents. If the system is known to be dissipative, the volume<br />

in the phase space will tend to contract <strong>and</strong> the sum <strong>of</strong> the Lyapunov exponents will be<br />

negative. The longest axis <strong>of</strong> the ellipsoid will correspond to the most unstable direction,<br />

determined by the largest Lyapunov exponent. Usually only this exponent is computed.<br />

If it is positive, trajectories will diverge otherwise, they will get closer reaching a non<br />

chaotic attractor. Following this argument, a necessary condition for a system to be<br />

chaotic is that at least one <strong>of</strong> the exponents (the largest one) is positive. Lyapunov<br />

exponents also give an indication <strong>of</strong> the period <strong>of</strong> time in which predictions are possible<br />

<strong>and</strong> this is strongly related with the concept <strong>of</strong> information theory <strong>and</strong> entropy. In fact,<br />

72

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!