By Topic

Clustering Linear Discriminant Analysis for MEG-Based 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
$33 $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

6 Author(s)
Jinyin Zhang ; Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA ; Gustavo Sudre ; Xin Li ; Wei Wang
more authors

In this paper, we propose a clustering linear discriminant analysis algorithm (CLDA) to accurately decode hand movement directions from a small number of training trials for magnetoencephalography-based brain computer interfaces (BCIs). CLDA first applies a spectral clustering algorithm to automatically partition the BCI features into several groups where the within-group correlation is maximized and the between-group correlation is minimized. As such, the covariance matrix of all features can be approximated as a block diagonal matrix, thereby facilitating us to accurately extract the correlation information required by movement decoding from a small set of training data. The efficiency of the proposed CLDA algorithm is theoretically studied and an error bound is derived. Our experiment on movement decoding of five human subjects demonstrates that CLDA achieves superior decoding accuracy over other traditional approaches. The average accuracy of CLDA is 87% for single-trial movement decoding of four directions (i.e., up, down, left, and right).

Published in:

IEEE Transactions on Neural Systems and Rehabilitation Engineering  (Volume:19 ,  Issue: 3 )