Abstract

We introduce a new technique for the classification of motor imagery electroencephalogram (EEG) recordings in a Brain Computer Interface (BCI) task. The technique is based on an adaptive time-frequency analysis of EEG signals computed using Local Discriminant Bases (LDB) derived from Local Cosine Packets (LCP). Unlike prior work on adaptive time-frequency analysis of EEG signals, this paper uses arbitrary non-dyadic time segments and adaptively selects the size of the frequency bands used for feature extractions. In an offline step, the EEG data obtained from the C3/C4 electrode locations of the standard 10/20 system is adaptively segmented in time, over a non-dyadic grid. This is followed by a frequency domain clustering procedure in each adapted time segment to maximize the discrimination power of the resulting time-frequency features. Then, the most discriminant features from the resulting arbitrarily segmented time-frequency plane are sorted. A Principal Component Analysis (PCA) step is applied to reduce the dimensionality of the feature space. The online step simply computes the reduced dimensionality features determined by the offline step and feeds them to the linear discriminant. The algorithm was applied to all nine subjects of the BCI Competition 2002. The classification performance of the proposed algorithm varied between 70% and 92.6% across subjects using just two electrodes. The average classification accuracy was 80.6%. For comparison, we also implemented an Adaptive Autoregressive model based classification procedure that achieved an average classification rate of 76.3% on the same subjects, and higher error rates than the proposed approach on each individual subject.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call