Classification of Brain Signal (EEG) Induced by Shape-Analogous Letter Perception

Visual perception of English letters involves different underlying brain processes including brain activity alteration in multiple frequency bands. However, shape analogous letters elicit brain activities which are not obviously distinct and it is therefore difficult to differentiate those activities. In order to address discriminative feasibility and classification performance of the perception of shape-analogous letters, we performed an experiment in where EEG signals were obtained from 20 subjects while they were perceiving shape analogous letters (i.e., ‘p’, ‘q’, ‘b’, and ‘d’). Spectral power densities from five typical frequency bands (i.e., delta, theta, alpha, beta and gamma) were extracted as features, which were then classified by either individual widely-used classifiers, namely k-Nearest Neighbors (kNN), Support Vector Machine (SVM), Linear Discriminant Analysis (LDA), Random Forest (RF) and AdaBoost (ADA), or an ensemble of some of them. The F-score was employed to select most discriminative features so that the dimension of features was reduced. The results showed that the RF achieved the highest accuracy of 74.1% in the case of multi-class classification. In the case of binary classification, the best performance (Accuracy 86.39%) was achieved by the RF classifier in terms of average accuracy across all possible pairs of the letters. In addition, we employed decision fusion strategy to exert complementary strengths of different classifiers. The results demonstrated that the performance was elevated from 74.10% to 76.63% for the multi-class classification and from 86.39% to 88.08% for the binary class classification

Analysis of Dimension Reduction by PCA and AdaBoost on Spelling Paradigm EEG Data

Spelling Paradigm is a BCI application which aims to construct words by finding letters using P300 signals recorded via channel electrodes attached to the diverse points of the scalp. In this study effects of dimension reduction using Principal Component Analysis (PCA) and AdaBoost methods on time domain characteristics of P300 evoked potentials in Spelling Paradigm are analyzed. Support Vector Machine (SVM) is used for classification