The State Key Laboratory of Intelligent Technology and Systems, Computer Science and Technology School, Tsinghua University, FIT Building, Beijing 100084, China; Institute of Medical Equipment, Wandong Road, Hedong District, Tianjin, China.
The State Key Laboratory of Intelligent Technology and Systems, Computer Science and Technology School, Tsinghua University, FIT Building, Beijing 100084, China.
Comput Intell Neurosci. 2016;2016:2637603. doi: 10.1155/2016/2637603. Epub 2016 Dec 21.
The common spatial pattern (CSP) and other spatiospectral feature extraction methods have become the most effective and successful approaches to solve the problem of motor imagery electroencephalography (MI-EEG) pattern recognition from multichannel neural activity in recent years. However, these methods need a lot of preprocessing and postprocessing such as filtering, demean, and spatiospectral feature fusion, which influence the classification accuracy easily. In this paper, we utilize linear dynamical systems (LDSs) for EEG signals feature extraction and classification. LDSs model has lots of advantages such as simultaneous spatial and temporal feature matrix generation, free of preprocessing or postprocessing, and low cost. Furthermore, a low-rank matrix decomposition approach is introduced to get rid of noise and resting state component in order to improve the robustness of the system. Then, we propose a low-rank LDSs algorithm to decompose feature subspace of LDSs on finite Grassmannian and obtain a better performance. Extensive experiments are carried out on public dataset from "BCI Competition III Dataset IVa" and "BCI Competition IV Database 2a." The results show that our proposed three methods yield higher accuracies compared with prevailing approaches such as CSP and CSSP.
近年来,常见空间模式(CSP)和其他时空特征提取方法已成为解决多通道神经活动中运动想象脑电(MI-EEG)模式识别问题最有效和最成功的方法。然而,这些方法需要大量的预处理和后处理,如滤波、去均值和时空特征融合,这容易影响分类准确性。在本文中,我们利用线性动力系统(LDSs)进行 EEG 信号特征提取和分类。LDSs 模型具有许多优点,例如同时生成空间和时间特征矩阵、无需预处理或后处理以及低成本。此外,引入了一种低秩矩阵分解方法来去除噪声和静息状态分量,以提高系统的鲁棒性。然后,我们提出了一种低秩 LDSs 算法,对有限 Grassmannian 上的 LDSs 特征子空间进行分解,并获得更好的性能。在来自“BCI 竞赛 III 数据集 IVa”和“BCI 竞赛 IV 数据库 2a”的公共数据集上进行了广泛的实验。结果表明,与 CSP 和 CSSP 等现有方法相比,我们提出的三种方法具有更高的准确性。