Purpose Motor imagery brain–computer interfaces (MI-BCIs) play a significant role in intelligent control systems. Given the advantages of non-invasive measures represented by electroencephalography (EEG) and magnetoencephalography (MEG), MI classification based on EEG and MEG data has become a focal point in the BCI field. However, the non-linear and non-stationary characteristics of EEG/MEG data result in distribution discrepancies among MI samples from different subjects, severely limiting the application of constructing online MI-BCIs. Design/methodology/approach To address this challenge, this study proposes a novel Transfer Riemannian Space-based Sparse Coding (TRSSC) method upon transfer learning theory to establish an efficient cross-subject MI classification process. The TRSSC method first computes the covariance centroid matrices of EEG/MEG samples and aligns each subject’s sample set to the identity matrix to reduce marginal distribution discrepancies. Subsequently, it extracts the aligned samples’ Riemannian tangent space (RTS) features for each subject and constructs domain-invariant sparse RTS features through minimizing maximum mean discrepancy (MMD) and sparse coding for cross-subject MI classification. Findings To validate the feasibility and effectiveness of the TRSSC method, comparative experiments were conducted on three representative MI-EEG/MEG datasets. The experimental results demonstrate that the TRSSC method surpasses state-of-the-art methods in classifying EEG/MEG data while maintaining a similar time complexity. Furthermore, through ablation experiments and parameters sensitivity analysis, the study confirms the completeness of the TRSSC method in domain-invariant sparse feature representation and its insensitivity to parameters. Originality/value The proposed TRSSC method offers a new option for online constructing MI-BCIs, showcasing high cross-subject classification accuracy and efficiency. Based on mobile EEG/MEG recording devices, TRSSC method has a potential in enhancing classification performance within a small computational burden.
Building similarity graph...
Analyzing shared references across papers
Loading...
Yuru Yang
Tian-jian Luo
International Journal of Intelligent Computing and Cybernetics
Fujian Normal University
Jimei University
Building similarity graph...
Analyzing shared references across papers
Loading...
Yang et al. (Sat,) studied this question.
www.synapsesocial.com/papers/68af59d7ad7bf08b1eade654 — DOI: https://doi.org/10.1108/ijicc-05-2025-0275