A VEP-based Spelling System With Sequential Stimulus Using Binary BCH Codes
A VEP-based Spelling System With Sequential Stimulus Using Binary BCH Codes
Abstract: It is known that electroencephalograph (EEG) signals show specic responses with a event; e.g., visual
stimulus, cognition or motor imagery. Especially users can control an electronic device by classifying and interpreting the
EEG signals; such a system is called brain-computer interface (BCI). In this study, we tried to construct the BCI system,
based on transient visual evoked potentials (VEPs) and its visual stimuli ash in conformity with the sequence of binary
Bose-Chaudhuri-Hocquenghem (BCH) codes.
where i = 1, , 2k .
Then, i represents index of the templates bits for
which maximizes the correlation coefcient among all of
templates. The correlation is calculated until restore bi-
nary sequences for all test data.
i = arg max i (3)
i
- 1604 -
by majority of the estimated ve. The outline of this al- repeated stimuli at rapidly ashing of 5 Hz and over[10].
gorithm is shown at Fig. 3. Also the bit error rate (BER) In our experimental system, the stimuli of this segment
dened as dij /15 was used for evaluating output binary were ashing at 10 Hz. The frequency of 10 Hz satis-
sequences (where dij is the Hamming distance between ed with a condition of evoking SSVEP. Then the bit fol-
sequences i and j). lowing the four consecutive ashes was investigated by
the template matching. Table 1 shows the error rate of
Outline of algorithm which the output bit, an original bit is 0, is judged as
Input: The single trial (corresponding to 60 sequences 1 using 1-bit template. From Table 1, it was obvious
and divided into the training and the test), that the four consecutive ashes inuenced S1. Looking
a priori information of used binary sequences, toward the other subjects, it was conrmed that the error
and the number of bits k. rate showed a different tendency. The tendency should be
Output: The target character examined thoroughly. We will refer to the BER of whole
Initialization: Give a signicance to non-ash or ash bits at following section.
with {0,1}
Method:
1. Generate 2k bits template obtained by the training
data.
2. For iteration number c =1:number of the test data
Examine the test with 2 templates using cor-
k
relation coefcient.
Decide temporal binary sequence conforming
to bits of templates similar to the test.
Correct the temporal bits to the nearest binary
sequence by the Hamming distance.
3. Judge the target by a majority decision.
Fig. 3 Algorithm of detecting the target.
- 1605 -
response signal of VEPs which had subsequent latency spite of being guaranteed the minimum Hamming dis-
when k is larger. The required number of average times tance may give a lower effect to the discrimination. In
for VEPs was from about a hundred to two hundred[10] this study, the BCH codes we selected can correct 3 error
and an adequate number of times could not be obtained bits within 15 bits[9]. As shown in Table 2, the binary
in a present method when k 4. Also the number of sequences will be corrected perfectly when the BER is
average times for {0,1} reached about from four hundred under 20%; i.e., we can detect the target completely if the
twenty to four hundred eighty when k = 1. It is the most error bits of one sequence are under 3 bits within 15 bits.
important that the necessary and sufcient number of av- In future work, a precise decision of binary sequences
erage times has been given on recording evoked poten- will be needed as well as the optimal codes besides rear-
tials. There is a strong possibility that the result of aver- ranging above factors properly.
age signal was obscure using the large number of average The required length of detecting a target was 7.5 sec-
signal times; thus, it may bring the decline of accuracy. ond although a majority decision should be investigated
From the above, we can draw the following discussion: how many majorities are appropriate on our method in
it is necessary that users would receive the adjustment of detail. Mainly calculation was only correlation between
stimulation patterns and a necessary and sufcient train- an original signal and templates. We could make special
ing data should be obtained in advance as P300-based mention of obtaining a sort of results with the method
spelling device considering a practical interface. which is a simple calculation.
22 33
Subject 1 bit 2 bits 3 bits 1 bit 2 bits 3 bits
S1 46.2 42.4 41.2 43.7 43.9 41.0
S2 46.2 42.4 44.8 47.8 46.8 46.5
Fig. 5 The result of {0,1} pattern (k = 1) in 2 2 and S3 45.2 46.5 42.0 45.8 46.0 43.9
3 3, all subjects. S4 41.8 44.1 40.0 42.5 42.2 39.5
S5 47.6 47.6 46.8 47.3 47.6 46.9
[%]
5. CONCLUSIONS
In this study, we tried to construct the EEG typewriter
system based on VEPs by applying template matching.
Fig. 6 The result of {00,01,10,11} pattern (k = 2) in The system was designed to stimulate users in conformity
2 2 and 3 3, all subjects. with binary sequences by BCH codes.
There seems to be a similarity in each of averaged
waveform although the discrepancy of shape of VEPs ex-
ists. Thus the characteristic VEPs were extracted in our
system. Also as for multiple sight stimulations, the prob-
lems of the inuence from other sight stimulations were
found.
By calculation of correlation between templates and
processed signal, it was conrmed that subjects could
choose the target with up to about 74% of recognition ac-
Fig. 7 The result of {000, 001, 010, 011, 100, 101, 110,
curacy in four classes and about 59% in nine classes using
111} pattern (k = 3) in 2 2 and 3 3, all subjects.
the processed length of 7.5 second. The output binary
Table 2 shows the BER for all subjects when all of sequences were inaccurate because the BER showed a
bit templates were used. From Table 2 the BER of 3- higher error rate than 20%. We will investigate the appro-
bits template is the smallest. It means that the output bi- priate method of a precise decision of binary sequences,
nary sequences are the most accurate; i.e., 3-bits template which will be able to output more accurate bits. It also
can restore the sequence which is obtained by our method requires consideration from BCH codes. More practical
to accurate one, compared with the other template. Em- BCI system using VEP will be constructed by developing
ploying the sequences which resemble the other ones in this research further.
- 1606 -
REFERENCES
[1] J. R. Wolpaw, N. Birbaumer, D. J. McFarland, G.
Pfurtscheller, and T. M. Vaughan, Brain-computer
interfaces for communication and control, Clin.
Neurophysiol., vol. 113, pp.767-791, 2002.
[2] L. A. Farwell and E. Donchin, Talking off the top
of your head: toward a mental prosthesis utilizing
event-related brain potentials, Electroenceph. Clin.
Neurophysiol., vol. 70, no. 6, 1988.
[3] C. Guger, S. Daban, E. Sellers, C. Holzner, G.
Krausz, R. Carabalona, F. Gramatica, and G.
Edlinger, How many people are able to control a
P300-based brain-computer interface (BCI)?, Neu-
rosci. Letters, vol. 462, pp.94-98, 2009.
[4] P. Martinez, H. Bakardjian, and A. Cichocki,
Fully online multicommand brain-computer in-
terface with visual neurofeedback using SSVEP
paradigm, J. Comput. Intell. Neurosci., 2007.
[5] Y. Wang, R. Wang, X. Gao, B. Hong, and S. Gao,
A practical VEP-based brain-computer interface,
IEEE Trans. Neural Syst. Rehab. Eng., vol. 14, no.
2, 2006.
[6] G. Bin, X. Gao, Y. Wang, Y. Li, B. Hong, and S.
Gao, A high-speed BCI based on code modulation
VEP, J. Neural Eng., vol. 8, no. 2, 2011.
[7] J. Irie, T. Yamaguchi, K. Omori, and K. Inoue,
Feature extraction of visual evoked potentials us-
ing state-space model, SICE Annu. Conf. 2010, pp.
5457, 2010.
[8] T. Yamaguchi, J. Irie, M. Fujio, and K. Inoue, De-
sign method of morphological lter fo EEG signal
analysis in brain computer interface, IIC-11, pp.21-
26, 2011.
[9] H. Miyagawa, Y. Iwatare, and H. Imai, Coding
Theory, Shokodo, 1973.
[10] T. Takahashi, and Y. Kuroiwa, Vision and Clinical
EEG, Shinkoh-igaku,1995.
- 1607 -