A Pathway To Implement Security System Using EEG Signals of Digit Recognition Activity
A Pathway To Implement Security System Using EEG Signals of Digit Recognition Activity
Abstract. This paper discusses the application of EEG signal in security systems. EEG
signal vary from person to person. It is not possible to steal or replicate the EEG signal.
So the EEG signal has biometric potential. In this study we explored the characteristics
of multichannel Electroencephalogram (EEG), which is recorded from no of subjects
recognizing different numbers displayed on the screen by GUI software designed in
VB6.We processed these EEG signals by using Linear Discriminate Analysis (LDA).
We found that the scaling exponent of each digit is different especially at positions C3
and C4, and at positions O1 and O2. This study shows that it is possible to distinguish
EEG signal of different digits. The results of this paper are used in designing Security
systems based on EEG signal.
Introduction
waves with higher frequency are seen during intense mental activity and stress. Delta
waves occur during deep sleep, during infancy and in serious organic brain diseases.
Theta waves appear during emotional stress in adults in sleep, particularly during
disappointment and frustration .Literature review of similar work which focuses more
on identification from EEG of healthy subjects rather than classification of
pathological cases for diagnosis were made [1,2, 3, 7, 8, 9, 10] EEG is collected at the
millisecond level, in contrast to the longer time intervals required for traditional
measures such as mouse clicks or user responses. This permits effective monitoring of
workload fluctuations in very rapid decision-making processes that are unobservable
using traditional methods [11]. As security issue is always challenging to the real
world applications many biometric approaches, such as fingerprint, iris and retina,
have been proposed to improve recognizing accuracy or practical facility in individual
identification in security. However, there is little research on individual identification
using EEG methodology mainly because of the complexity of EEG signal collection
and analysis in practice [5]. In future we can work to extract individual specific
information from a persons EEG and use this information to develop identification
methods like EEG biometry .The remaining sections are organized as follows. Section
2 provides experimental data acquisition setup used in this research work. Section 3
details the experimental analysis of EEG data, followed by results and conclusion in
section 4.
EEG recordings of 10 male right-handed subjects in the age group of (20-25) were
taken. The subjects were normal without any mental disorder. They did not have any
problem in communicating and had normal vision.
The subjects had given their written consent for recording EEG signals before
participating. For the EEG data, experiments were conducted in which subjects were
shown visual stimuli consisting of the Random Number Generator. Graphics User
Interface was developed in VB6 .The snapshot of GUI is as shown in fig 1.This GUI
was shown for one minute and EEG signal of corresponding activity was recorded. A
single experimental session typically comprised of 5 trials of complete display of GUI
from 0 to 9. The record of the displayed number was maintained for reference during
analysis and pattern matching. The electrodes are placed using 10-20 system. Here we
study the EEG signals of six Electrodes [C3, C4, P3, P4, O1, O2] as shown in gure
2.
EXPERIMENTAL ANALYSES
The EEG recordings were captured according to the time of numbers generated on
the GUI. The readings were statistically analyzed. There are four frequency bands
associated with the EEG signals. All fours bands with their functionalities are listed in
table 1[7].Type Frequency (Hz) Normally Delta up to 4 Has been found dominant
during some continuous attention tasks.
Upto 4
Theta
4-<8
Alpha
8-13
Beta
13-30
By observing the above table, we decided to concentrate on the beta signals of all 6
electrodes for recognizing the number. The Linear Discriminate analysis (LDA) is
used for data classification and dimensionality reduction. This method easily handles
the case where the Within-class frequencies are unequal and their performance has
been examined on randomly generated test data. This method maximizes the ratio of
between-class variance to the within-class variance in any particular data set thereby
guaranteeing maximal severability.
3. 1 Linear Discriminant Analysis
Linear Discriminate Analysis is a well-known scheme for feature extraction and
dimension reduction. It has been widely used in many application such as face
recognition, image retrieval, microarray classication. LDA projects the data onto a
lower dimensional vector space such that the ratio of the between class distance to the
within class distance is maximized, thus achieves maximum discrimination
In this section we give a brief overview of LDA. Given a matrix A RNxn,LDA aims
to nd a transformation G RNxl that maps each column a i of A, for 1 i n,in the
N-dimensional space to a vector bi in the l-dimensional space. That is G : a i RN >
bi = GT ai Rl (l < N). LDA aims to nd a vector space G spanned by g i where G =
[g1, g2, ..., gl] such that each ai is projected onto G by (g1T .ai, ..., glT .ai)T Rl.
Assume that the original data in A partitioned into k classes as A={1, 2, ..., k}
k
=n
i=1
optimal transformation G such that the class structure of the original high dimensional
space is preserved in the low dimensional space. In general if each class is tightly
grouped, but well separated from the other classes , the quality of considered to be
high. In discriminate analysis ,two scatter matrices, called as within class (Sw) and
between-class (Sb) matrices, are dened to quantify the quality of cluster as follows:
Sw = i = 1k x i (x - mi) (x - mi)T
Sb = i = 1k ni ( mi - m) ( mi - m)T
of
Fig3.
to 9
Table
2
information
X
0.009345304
0.004600992
0.002613943
-0.015974174
0.002046017
-0.012309459
-0.001831391
-0.00399276
0.008251523
-0.008728191
Cluster
for digit-0
Y
0.146554217
0.190279302
0.119080978
0.126782597
0.143718024
0.118067418
0.16674048
0.175422066
0.131259941
0.140959334
Distance
0.00173175
0.044421612
0.026853037
0.019170542
0.002693518
0.027864866
0.020915166
0.029578819
0.01471351
0.005179706
We process each cluster as follows to calculate center and radius of each cluster. The
resultant information is given in table 4.
All data points in a single cluster are called as cluster feature (CF).Let CF is a data
structure summarizing information about all points in the dataset,
CF = (n,LS)
where LS is linear sum of n data points.
ie
n
xi
i=1
yi
i=1
( xixo ) 2+ ( yi y 0 ) 2
The radius of cluster is calculated as
n
( xixo ) 2+( yi y 0 ) 2/
k=0
X
-0.0016
0.107965628
-0.064113698
0.032867432
0.106169638
0.10241185
-0.278322
-0.006807753
0.045618502
-0.035999385
Y
0.145886
0.093447148
0.096575553
-0.22817591
0.034016434
-0.375910337
-0.140508139
0.287239623
0.013377525
0.122955778
Distance
0.019312253
0.238866421
0.065449459
0.288061438
0.109176504
0.103655998
0.279101655
0.157660533
0.048312754
0.042695393
References
1.