By Topic

Application of quadratic optimization to multi-class common spatial pattern algorithm in brain-computer interfaces

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Qingguo Wei ; Dept. of Electron. Eng., Nanchang Univ., Nanchang, China ; Yuhui Ma ; Kui Chen

Common spatial pattern (CSP) algorithm is a highly successful method for the motor imagery based brain-computer interfaces (BCIs) in the case of two task conditions. But low information transfer rate (ITR) is an intrinsic problem that binary BCIs face, and restricts their practical application. The most effective method to increase ITR is to extend two mental tasks to multiple tasks. This paper generalizes binary CSP algorithm to multiple task conditions by approximate joint diagonalization based on quadratic optimization. This algorithm is used to five data sets recorded during a BCI experiment consisting of three motor imagery tasks and is evaluated by diagonalization error, convergence speed and classification accuracy. Results demonstrate that the performance of the algorithm is satisfactory.

Published in:

Biomedical Engineering and Informatics (BMEI), 2010 3rd International Conference on  (Volume:2 )

Date of Conference:

16-18 Oct. 2010