TY - GEN
T1 - Automated selecting subset of channels based on CSP in motor imagery brain-computer interface system
AU - Meng, Jianjun
AU - Liu, Guangquan
AU - Huang, Gan
AU - Zhu, Xiangyang
PY - 2009/12/1
Y1 - 2009/12/1
N2 - The Common Spatial Pattern (CSP) algorithm is a popular method for efficiently calculating spatial filters. However, several previous studies show that CSP's performance deteriorates especially when the number of channels is large compared to small number of training datasets. As a result, it is necessary to choose an optimal subset of the whole channels to save computational time and retain high classification accuracy. In this paper, we propose a novel heuristic algorithm to select the optimal channels for CSP. The CSP procedure is applied to training datasets firstly and then a channel score based on ℓ1 norm is defined for each channel. Finally, channels with larger scores are retained for further CSP processing. This approach utilizes CSP procedure twice to select channels and extract features, respectively; hence the complex optimization problem of channel selection for CSP is solved heuristically. We apply our method and other two existing methods to datasets from BCI competition 2005 for comparison and the experiment results show this method provides an effective way to accomplish the task of channel selection.
AB - The Common Spatial Pattern (CSP) algorithm is a popular method for efficiently calculating spatial filters. However, several previous studies show that CSP's performance deteriorates especially when the number of channels is large compared to small number of training datasets. As a result, it is necessary to choose an optimal subset of the whole channels to save computational time and retain high classification accuracy. In this paper, we propose a novel heuristic algorithm to select the optimal channels for CSP. The CSP procedure is applied to training datasets firstly and then a channel score based on ℓ1 norm is defined for each channel. Finally, channels with larger scores are retained for further CSP processing. This approach utilizes CSP procedure twice to select channels and extract features, respectively; hence the complex optimization problem of channel selection for CSP is solved heuristically. We apply our method and other two existing methods to datasets from BCI competition 2005 for comparison and the experiment results show this method provides an effective way to accomplish the task of channel selection.
UR - http://www.scopus.com/inward/record.url?scp=77951450909&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951450909&partnerID=8YFLogxK
U2 - 10.1109/ROBIO.2009.5420462
DO - 10.1109/ROBIO.2009.5420462
M3 - Conference contribution
AN - SCOPUS:77951450909
SN - 9781424447756
T3 - 2009 IEEE International Conference on Robotics and Biomimetics, ROBIO 2009
SP - 2290
EP - 2294
BT - 2009 IEEE International Conference on Robotics and Biomimetics, ROBIO 2009
T2 - 2009 IEEE International Conference on Robotics and Biomimetics, ROBIO 2009
Y2 - 19 December 2009 through 23 December 2009
ER -