Abstract

Tensor analysis can comprehensively retain multidomain characteristics, which has been employed in EEG studies. However, existing EEG tensor has large dimension, making it difficult to extract features. Traditional Tucker decomposition and Canonical Polyadic decomposition(CP) decomposition algorithms have problems of low computational efficiency and weak capability to extract features. To solve the above problems, Tensor-Train(TT) decomposition is adopted to analyze the EEG tensor. Meanwhile, sparse regularization term can then be added to TT decomposition, resulting in a sparse regular TT decomposition (SR-TT). The SR-TT algorithm is proposed in this paper, which has higher accuracy and stronger generalization ability than state-of-the-art decomposition methods. The SR-TT algorithm was verified with BCI competition III and BCI competition IV dataset and achieved 86.38% and 85.36% classification accuracies, respectively. Meanwhile, compared with traditional tensor decomposition (Tucker and CP) method, the computational efficiency of the proposed algorithm was improved by 16.49 and 31.08 times in BCI competition III and 20.72 and 29.45 times more efficient in BCI competition IV. Besides, the method can leverage tensor decomposition to extract spatial features, and the analysis is performed by pairs of brain topography visualizations to show the changes of active brain regions under the task condition. In conclusion, the proposed SR-TT algorithm in the paper provides a novel insight for tensor EEG analysis.

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.