An efficient hybrid linear and kernel CSP approach for EEG feature extraction
Common spatial patterns (CSP) has proved to be very successful in EEG feature extraction. To relax the presumption of strictly linear patterns in the CSP, nonlinear variants of the approach are proposed using the kernel method. However, they typically suffer from two main drawbacks: the problem of complexity and low generalization ability dealing with different subjects. To overcome these drawbacks, in this paper, two effective solutions are proposed. First, data bunching in the low-dimensional space is used to solve the complexity problem. The second problem is tackled by choosing appropriate kernel functions, which take into account very small amounts of nonlinearity in a generally linear context of the brain spatial patterns, and also are able to be adapted to fit each certain case.
common spatial patterns kernel method eeg classification