Abstract

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.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.