Efficient CSP Algorithm With Spatio-Temporal Filtering for Motor Imagery Classification

Abstract

Common spatial pattern (CSP) is an efficient algorithm widely used in feature extraction of EEG-based motor imagery classification. Traditional CSP depends only on spatial filtering, that aims to maximize or minimize the ratio of variances of filtered EEG signals in different classes. Recent advances of CSP approaches show that temporal filtering is also preferable to extract discriminative features. In view of this perspective, a novel spatio-temporal filtering strategy is proposed in this paper. To improve computational efficiency and alleviate the overfitting issue frequently encountered in the case of small sample size, the same temporal filter is designed by EEG signals of the same class and shared by all the spatial channels. Spatial and temporal filters can be updated alternatively in practice. Furthermore, each of the resulting designs can still be cast as a CSP problem and tackled efficiently by the eigenvalue decomposition. To alleviate the adverse effects of outliers or noisy EEG channels, sparse spatial or temporal filters can also be achieved by incorporating an l ₁ -norm-based regularization term in our CSP problem. The regularized spatial or temporal filter design is iteratively reformulated as a CSP problem via the reweighting technique. Two sets of motor imagery EEG data of BCI competitions are used in our experiments to verify the effectiveness of the proposed algorithm.