Ijet V3i6p3
Ijet V3i6p3
Ijet V3i6p3
Abstract:
Here we have presented a method for the classification of different types of electroencephalogram (EEG)
signals in the empirical mode decomposition (EMD) domain. Here we have used a EEG dataset which is available
online, in the dataset out of five subsets we have considered three subsets forming normal, interictal and ictal
states. Here we have used some of the statistical moments like variance, skewness and kurtosis and we have also
used fractal dimension and sample entropy on the intrinsic mode functions (IMFs) which are obtained by doing
EMD on the main EEG signals. All the obtained features are feed to a support vector machine for classification of
normal and ictal states as well as interictal and ictal states. The mentioned method gives a classification accuracy
of 100% in almost all the cases for classification of these states.
Keywords — Electroencephalogram (EEG), Support vector machine (SVM), Epileptic seizure, Empirical
mode decomposition (EMD)
II. DATASET
consisting of normal and ictal states and second where M is the number of IMFs, c (t ) is the mth
m
case is consisting of interictal and ictal states.
IMF and rM (t ) is the final residue. Each IMF in (1)
is assumed to yield a meaningful local frequency,
III. METHODS and different IMFs do not exhibit the same
A. EMPIRICAL MODE DECOMPOSITION (EMD) frequency at the same time. Then, (1) can be written
as
It is a signal processing technique that
M
decomposes a signal so called intrinsic mode
functions. The EMD method does not require any
x(t∑) =
m=1
Am (t)cos[ϕm (t)] (2)
condition about whether a signal is stationary or
The plot of subsets Z, F and S are shown in figure
not. The main aim of the EMD method is to
1. and their empirical mode decomposition are
decompose a signal x(t) into a numbers of intrinsic
shown in fig. 2, 3 and in 4.
mode functions (IMFs). Each IMF satisfies two
basic conditions: 1) the number of maxima-minima B. FRACTAL DIMENSION (FD)
and the number of zero crossings must be the same The term “fractal dimension” is given by
or differ at most by one; 2) at any instant, the mean Mandelbrot, on the basis of fractal geometry. It has
value of the envelope formed by the local maxima been found that fractal dimension is a promising
and the envelope formed by the local minima is parameter in distinguishing the non linear and non
zero. stationary property of EEG signal [16]. In this
The EMD algorithm of the signal x(t) can be paper, the most used Higuchi’s algorithm [17] is
explained as follows [7],[9]. used for the fractal dimension calculation of EEG
1) Detect the extrema (maxima and minima) of the sequences.
dataset x(t). Let us consider a discrete time sequence X
e m ( t ) containing N data points, X = {x(1), x(2), . . . ,
x(N)}, the reformed time series xrn with n discrete Sample Entropy is more immune to noise and does
time interval between points is given as [17]: not depend on the data series length. A lower value
of Sample Entropy means an increased matching in
N −r
xrn = {x(r) + x(r + n) + x(r + 2n) + ... + x(r + n)} (3) the time series data. Sample Entropy can be given
n by the following equation
Here, symbol y represents the greatest integer SaEn(m, r, k) = − ln[Bm+1(r) / Bm(r ) ] (7)
which is less than or equal to y; r = 1, 2, . . . ,n and
it means the initial time value.
The average length J m (n) of each subsequence xrn
is defined as
b
b = (N − r) / n (5)
Therefore, the fractal dimension of any time
sequence X can be calculated as
FD = log( J m (n)) / log(1/ n) (6)
In this paper we have taken n=5.
where B m ( r ) is the probability of matching two where µ 4 is a moment of fourth order around the
sequences for m points and B m +1 ( r ) is the mean.
probability that two sequence will match in the next
E. SUPPORT VECTOR MACHINE (SVM)
point i.e. for m+1 points.
In order to classify the normal and ictal as well as
interictal and ictal EEG signals, all the parameter
values obtained are given as a input to a support
vector machine. Suppose we have two classes and
an unknown feature vector which is to be classified,
then our goal is to design a hyperplane that
classifies all the training vectors in two classes, but
we may have different hyperplane so best choice
will be the hyperplane that leaves the maximum
margin for both classes [12]. The decision function
of a SVM is given by
k
l ( x) = sgn(∑ α i ri Ψ ( x, xi ) + b) (11)
j =1
designed a classifier in order to classify the ictal Fig. 6. Box-plot for the comparison of normal and
and normal signal as well as interictal and ictal ictal signals using kurtosis values.
signal and to get the classification accuracy we
need the training and the test data, for that we have
selected 60% of the dataset for training and
remaining data are for testing and the results are
shown in table III.
TABLE II
p-values obtained as a result of Kruskal-Wallis statistical test
for interictal and ictal signal
Fig. 10. Box-plot for the comparison of interictal Fig. 14. Box-plot for the comparison of interictal
and ictal signals using sample entropy values. and ictal signals using fractal dimension values.
V. CONCLUSION
In this paper, at the beginning we have applied
empirical mode decomposition on the EEG signals
to obtain IMFs, the parameters extracted from the
IMFs have been used in order to distinguish
between normal (Z) and ictal (S) as well as
interictal (F) and ictal (S). Here we have calculated
above mentioned parameters up to fourth IMF, and
got an average accuracy of 100% in order to
Fig. 11. Box-plot for the comparison of interictal discriminate between normal and ictal, also got an
and ictal signals using kurtosis values. average accuracy of 99.97% in order to
discriminate between interictal and ictal EEG
signals.
REFERENCES
[1] P. C. Petrantonakis and L. J. Hadjileontiadis, “Emotion
recognition from EEG using higher order crossings,”
IEEE Trans. Inf. Technol. Biomed., vol. 14, no. 2, pp.
186–197, Mar. 2010.
[2] Y. Li et al., “An EEG-based BCI system for 2-D cursor
control by combining mu/beta rhythm and p300
potential,” IEEE Trans. Biomed. Eng., vol. 57, no. 10, pp.
2495–2505, Oct. 2010.
Fig. 12. Box-plot for the comparison of interictal [3] Ling Guo, Daniel Rivero, Julian Dorado, Juan R.
and ictal signals using skewness values. Rabunal, Alejandro Pazos, “Automatic Epileptic Seizure
Detection in EEGs based on Line Length Feature and
Artificial Neural Network,” Journal of Neuroscience
Methods, Vol. 191, 2010, pp. 101-109.
[4] Adeli, H., Zhou, Z., Dadmehr, N., “Analysis of EEG
records in an epileptic patient using wavelet transform,”
J. Neurosci. Methods,vol . 123, pp.69-87, 2003.
[5] Srinivasan, V., Eswaran, C., Sriraam, N., “Artificial
neural network based epileptic detection using time-
domain and frequency-domain features,” J. Med. Syst.,
vol. 29, pp. 647-660, 2005.
[6] R. B. Pachori and V. Bajaj, “Analysis of normal and
epileptic seizure EEG signals using empirical mode
decomposition,” Comput. Methods Progr. Biomed., vol.
104, no. 3, pp. 373–381, 2011.
[7] V. Bajaj and R. Pachori, “Classification of seizure and
Fig. 13. Box-plot for the comparison of interictal non-seizure EEG signals using empirical mode
and ictal signals using variance values. decomposition,” IEEE Trans. Inf. Technol. Biomed., vol.
16, no. 6, pp. 1135–1142, Nov. 2012.
[8] EEG Time Series Download Page 2012 [Online].
Available: http://epileptologie-
bonn.de/cms/front_content.php?idcat=193&lang3
[9] N. E. Huang, Z. Shen, S. R. Long, M. C. Wu, H. H. Shih,
Q. Zheng, N. C.Yen, C. C.Tung, andH.H.Liu, “The
empirical mode decomposition and Hilbert spectrum for
nonlinear and non-stationary time series analysis,” Proc.
R. Soc. Lond. A, vol. 454, pp. 903–995, 1998.
[10] S. M. Pincus, "Approximate entropy as a measure of
system complexity," Proceedings of the National
Academy of Sciences, vol. 88, pp. 2297-2301, 1991.
[11] J. S. Richman, D. E. Lake, and J. R. Moorman, "Sample
Entropy," vol. 384, pp. 172-184, 2004.