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.

4.2.3 Multiresolution Analysis<br />

Contracted versions <strong>of</strong> the wavelet function will match high <strong>frequency</strong> components <strong>of</strong><br />

the original signal <strong>and</strong> on the other h<strong>and</strong>, dilated versions will match low <strong>frequency</strong><br />

oscillations. By correlating the original signal with wavelet functions <strong>of</strong> dierent sizes<br />

we can obtain the details <strong>of</strong> the signal in dierent scale levels. Then, the information<br />

given by the dyadic Wavelet Transform can be organized according to a hierarchical<br />

scheme called multiresolution <strong>analysis</strong> (Mallat, 1989 Chui, 1992).<br />

If we denote by W j the subspaces <strong>of</strong> L 2 generated by the wavelets jk for each level<br />

j, the space L 2 can be decomposed as a direct sum <strong>of</strong> the subspaces W j ,<br />

L 2 = X j2Z<br />

W j (30)<br />

Let us dene the closed subspaces<br />

V j = W j+1 W j+2 ::: j 2Z (31)<br />

The subspaces V j are a multiresolution approximation <strong>of</strong> L 2 <strong>and</strong> they are generated by<br />

scalings <strong>and</strong> translations <strong>of</strong> a single function jk called the scaling function. Then, for<br />

the subspaces V j we have the orthogonal complementary subspaces W j , namely:<br />

V j;1 = V j W j j 2Z (32)<br />

Let us suppose we have a discrete signal X(n), which we will denote as x 0 , with nite<br />

energy <strong>and</strong> without loss <strong>of</strong> generality, let us suppose that the sampling rate is t =1.<br />

Then, we can successively decompose it with the following recursive scheme<br />

x j;1 ( n ) = x j ( n ) r j ( n ) (33)<br />

where the terms x j (n) 2 V j give the coarser representation <strong>of</strong> the signal <strong>and</strong> r j (n) 2 W j<br />

give the details for each scale j =0 1 N. Then, for any resolution level N > 0, we<br />

can write the decomposition <strong>of</strong> the signal as<br />

x N (k) ( 2 ;N n ; k ) +<br />

NX<br />

X<br />

C j (k) jk (n) (34)<br />

X(n) = X k<br />

j=1<br />

k<br />

where () is the scaling function, C j (k) are the wavelet coecients, <strong>and</strong> the sequence<br />

fx N (k)g represents the coarser signal at the resolution level N. The second term is<br />

the wavelet expansion. The wavelet coecients C j (k) can be interpreted as the local<br />

residual errors between successive signal approximations at scales j ; 1 <strong>and</strong> j, <strong>and</strong><br />

39

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

Saved successfully!

Ooh no, something went wrong!