Key result
A proposed graph signal representation using smoothness constraint-based Graph Signal Processing demonstrated superiority over Pearson correlation and RBF-based functional connectivity for EEG classification.
Why the study?
Most current mental task classification techniques treat EEG channels independently, neglecting functional brain connectivity, and are primarily subject specific.
A novel graph signal processing technique using graph spectral features improves cross-subject mental task classification from multi-channel EEG signals compared to traditional functional connectivity metrics.
May aid EEG-based mental task decoding; leaves open clinical translation pending validation.
Classification of mental tasks from electroencephalogram (EEG) signals play a crucial role in designing various brain-computer interface (BCI) applications. Most of the current techniques consider each channel as independent, neglecting the functional connectivity of the brain during mental activity and are primarily subject specific. This paper proposes a graph signal representation to classify a pair of mental tasks using multichannel EEG signals (MTMC-EEG) with cross subject classification within the database. Here, each channel of EEG signal corresponds to nodes of the task based graph whose EEG time series resides on the respective nodes. Functional connectivity of the brain between these nodes is obtained using smoothness constraint based Graph Signal Processing (GSP) technique. Graph spectral features namely, two-norm total variation of eigen vector (TNTV) corresponding to weighted adjacency matrix, graph Laplacian energy (GLE) using eigenvalues of Laplacian matrix and convex sum of TNTV and GLE in the form of joint total variation energy (JTVE) are proposed in this paper. The performance of the proposed methodology is evaluated on publicly available two different databases of MTMC EEG signals using benchmark classifiers and compared with the state of the art. Further, the superiority of the proposed metric obtained from the smoothened graph of GSP technique is validated by comparing it with Pearson correlation and Gaussian radial basis function (RBF) based functional connectivity in terms of accuracy, F-Score, and information transfer rate (ITR). The robustness of the proposed method is validated by adding white Gaussian noise (AWGN) to the EEG signals using different SNRs.
No takes yet. Share an insight, caveat, or question.
Mathur et al. (2022) studied Mental tasks (EEG signals). Graph signal representation using smoothness constraint based Graph Signal Processing (GSP) vs. Pearson correlation and Gaussian radial basis function (RBF) based functional connectivity was evaluated on Classification accuracy, F-Score, and information transfer rate (ITR). A proposed graph signal representation using smoothness constraint-based Graph Signal Processing demonstrated superiority over Pearson correlation and RBF-based functional connectivity for EEG classification.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: