EEG Signal Processing and Machine Learning. Saeid Sanei

---

Скачать книгу

---

an estimate of the coefficients is:

      (4.46)

      The cut‐off frequency is reduced by a factor 2 at each step, allowing a reduction of the number of samples by this factor. The wavelet coefficients at the scale j + 1 are:

      (4.47)

      and they can be computed directly from C_j by:

      (4.48)

      where G is the following discrete‐time filter:

      (4.49)

      and for and :

      (4.50)

      The frequency band is also reduced by a factor of two at each step. These relationships are also valid for DWT following Section 4.5.1.4.

      4.5.1.6 Reconstruction

      The reconstruction of the data from its wavelet coefficients can be performed step‐by‐step, starting from the lowest resolution. At each scale, we compute:

      (4.51)

      (4.52)

      we look for C_j knowing C_{j + 1}, W_{j + 1}, h, and g. Then is restored by minimizing:

      (4.53)

      using a least minimum squares estimator. and are weight functions which permit a general solution to the restoration of . The relationship from of is in the form of:

      (4.54)

      where the conjugate filters have the expressions:

(4.55)

(4.56)

It is straightforward to see that these filters satisfy the exact reconstruction condition given in Eq. (4.35). In fact, Eqs. (4.55) and (4.56) give the general solutions to this equation. In this analysis, the Shannon sampling condition is always respected. No aliasing exists, so that the anti‐aliasing condition (4.76) is not necessary.

      The denominator is reduced if we choose:

      (4.57)

      This corresponds to the case where the wavelet is the difference between the squares of two resolutions:

      (4.58)

      The reconstruction algorithm then carries out the following steps:

      1 Compute the fast Fourier transform (FFT) of the signal at the low resolution.

      2 Set j to np (number of WT resolutions); perform the following iteration steps:

      3 Compute the FFT of the wavelet coefficients at the scale j.

      4 Multiply the wavelet coefficients Wj by .

      5 Multiply the signal coefficients at the lower resolution Cj by .

      6 The inverse Fourier transform of gives the coefficients Cj‐1.

      7 j = j − 1 and return to step 3.

      The use of a band‐limited scaling function allows a reduction of sampling at each scale and limits the computation complexity.

      The WT has been widely used in EEG signal analysis. Its application to seizure detection, especially for neonates, modelling of the neuron potentials, and the detection of EP and ERPs will be discussed in the corresponding chapters of this book.

      4.5.2 Synchro‐Squeezed Wavelet Transform

The synchro‐squeezing wavelet transform (SSWT) has been introduced as a post‐processing technique to enhance the TF spectrum obtained by applying the WT [23]. Assuming that the input f(t) is a pure harmonic signal (f(t) = Acos(ωt)), using Plancherel's theorem, the following equations are derived from (4.20) [23]:

(4.59)

One assumption in the above equation (Eq. 4.59) is that the selected mother wavelet is concentrated within the positive energy range, which means , for ε < 0. If is concentrated around ε = ω ₀, then, W(a, b) is concentrated around a = ω ₀/ω. This is spread out over a region of the horizontal line (e.g. a = ω ₀/ω). In the situation where ω is almost but not exactly similar to the actual instantaneous frequency (IF) of the input signal, then, W(a, b) has non‐zero energy. By synchro‐squeezing, the idea is to move this energy away from ω. The proposed method in the SSWT aims to reassign the frequency locations which are closer to the actual IF to obtain an enhanced spectrum. To do that, first, the candidate IFs are calculated. For these IFs, W(a, b) ≠ 0:

      (4.60)

Considering the selected pure harmonic signal f(t)

---

Скачать книгу