MCFANet: a multi-class fusion attention network for motor imagery EEG classification

Abstract

Introduction:

This paper proposes a Multi-Class Fusion Attention Network (MCFANet) that combines the multi-class spatial filtering outputs of FBCSP with the spatiotemporal feature extraction capability of convolutional neural networks for multi-class motor imagery EEG classification. In multi-class motor imagery decoding, traditional spatial filtering methods extract effective discriminative spatial features but decompose the task into independent binary subproblems, and typically retain only energy statistics while discarding temporal dynamics. Deep learning methods can learn spatiotemporal features but must learn spatial patterns from the beginning, making it difficult to fully capture established neurophysiological priors under limited training samples.

Methods:

MCFANet concatenates the spatial filtering outputs from all classes and sub-bands along the channel dimension to construct a virtual channel representation containing the discriminative responses of all classes. The full time series is preserved and fed into a convolutional module for spatiotemporal feature extraction, and a channel attention module adaptively reweights the feature maps to focus on the most discriminative representations. Four-class classification experiments were conducted on two public datasets.

Results:

On Dataset 2a, MCFANet achieved an accuracy of 67.94% ±13.70, outperforming FBEEGNet (63.98%) and EEGNet (58.79%). On the High Gamma Dataset, MCFANet achieved 87.10% ±10.09, improving over FBEEGNet by approximately 2.5 percentage points. Paired t-tests and effect size analysis confirm that the improvements over the main baseline methods are statistically significant.

Discussion:

The results suggest that reorganizing multi-class spatial discriminative responses into a unified representation that preserves temporal dynamics provides an effective path for bridging traditional spatial filtering and deep learning.

1 Introduction

Brain-computer interfaces (BCIs) provide a direct communication link between the brain and external devices such as computers, robots, and vehicles (Wolpaw et al., 2002). Electroencephalography (EEG) is the most commonly used signal acquisition method for non-invasive BCIs, owing to its high temporal resolution and low cost (Wolpaw et al., 2002; Lotte et al., 2018). Motor imagery (MI), which requires subjects to mentally simulate a specific limb movement without actual execution, serves as a stimulus-free BCI paradigm (Pfurtscheller and Neuper, 2001). However, the EEG responses elicited by MI are weaker and less consistent than those produced by real movement (Pfurtscheller and Lopes da Silva, 1999; Neuper et al., 2006; Miller et al., 2010). While binary MI decoding, such as distinguishing left from right hand imagery, has been extensively studied, extending to multi-class scenarios poses additional difficulties: cortical representations of different limbs partially overlap, and inter-subject variability further complicates multi-class discrimination (Brunner et al., 2008; Schirrmeister et al., 2017a).

Traditional MI-EEG classification methods have developed along two main lines. The first is spatial filtering, represented by the Common Spatial Pattern (CSP) algorithm (Ramoser et al., 2000; Koles et al., 1990; Blankertz et al., 2008), which designs spatial filters to maximize the variance difference between classes so as to extract event-related desynchronization/synchronization (ERD/ERS) features induced by MI tasks. Several CSP variants—including Filter Bank CSP (FBCSP) (Ang et al., 2008), Regularized CSP (Lotte and Guan, 2011), and Sparse CSP (Arvaneh et al., 2011)—extend this idea through spectral band selection and regularization. The second line is time-frequency analysis, including wavelet transform (Subasi, 2007), empirical mode decomposition (Park and Chung, 2019), and power spectral density estimation (Pfurtscheller and Lopes da Silva, 1999), which aim to capture multi-scale temporal and spectral features of EEG signals. In addition, Riemannian geometry-based methods map EEG covariance matrices onto the symmetric positive definite (SPD) manifold for classification and have shown notable robustness to noise (Barachant et al., 2012). However, these methods rely on traditional classifiers such as support vector machines (SVM) and linear discriminant analysis (LDA) (Lotte et al., 2018), where feature extraction and classifier training are carried out separately without end-to-end joint optimization. Moreover, CSP and its variants are sensitive to the quality of covariance matrix estimation: under small-sample conditions the covariance estimates become unreliable, degrading the quality of the resulting spatial filters and limiting generalization (Schirrmeister et al., 2017a).

Deep learning offers a path to overcome these bottlenecks. Convolutional neural networks (CNNs) can automatically learn hierarchical spatiotemporal features from raw signals in an end-to-end manner (Lawhern et al., 2018). Early CNN approaches such as DeepConvNet and ShallowConvNet (Schirrmeister et al., 2017a) achieved promising results; the latter mimics the bandpass and spatial filtering pipeline of FBCSP through temporal and spatial convolution layers. However, these networks contain many parameters and tend to overfit on small EEG datasets. EEGNet, proposed by Lawhern et al. (2018), uses depthwise separable convolutions to substantially reduce the parameter count and has become one of the most widely adopted baselines in this field due to its compact design and strong generalization. Despite these advances, purely data-driven networks do not take advantage of the neurophysiological priors underlying MI. Motor imagery produces pronounced ERD/ERS changes in the mu/beta band (8-30 Hz) over the contralateral sensorimotor cortex, and the scalp-level spatial energy distributions differ markedly between, for example, left and right hand imagery—this is precisely the neurophysiological basis that makes CSP effective (Pfurtscheller and Lopes da Silva, 1999). End-to-end networks must learn such patterns from scratch, which is difficult when training samples are limited. To address this, researchers have begun embedding traditional algorithms into network architectures: CSP-Net (Jiang et al., 2024) initializes the spatial convolution weights with CSP filters so that the network starts with effective spatial filtering; FBCNet (Mane et al., 2021) adopts the multi-subband decomposition strategy of FBCSP and extracts spectro-spatial features through filter-bank and variance layers; Graph-CSPNet (Ju and Guan, 2023) constructs graph structures on SPD manifolds in the time-frequency domain and uses Riemannian geometry to capture global geometric relationships in EEG signals.

In deep learning frameworks, attention mechanisms are commonly used to allow networks to assign different levels of importance to different features. The squeeze-and-excitation (SE) module proposed by (Hu et al. 2018) was originally designed for image classification, which assigns a weight to each channel through global pooling. (Woo et al. 2018) extended this idea by adding a spatial attention dimension on top of channel attention. This type of framework has been adopted in EEG-based motor imagery classification. (Altuwaijri et al. 2022) embedded SE blocks into a multi-branch EEGNet and demonstrated its effectiveness on the BCI Competition IV 2a dataset. (Altaheri et al. 2022) proposed ATCNet, which combined multi-head self-attention with a temporal convolutional network to extract features from MI-EEG signals. At the same time, a growing number of studies have explored attention-based designs for MI decoding, including multi-dimensional attention modules tailored to the characteristics of EEG signals (Miao et al., 2023) and the use of channel attention for automatic electrode selection (Tong et al., 2023), lightweight spatial-spectral attention for joint electrode modeling (Han et al., 2025), and a systematic comparative framework for channel attention mechanisms in MI decoding (Wimpff et al., 2024). These attention-based methods improve feature extraction, but their quality remains constrained by the two issues discussed below.

First, discriminative information across multiple classes lacks a unified representation. CSP is inherently a binary method, and its multi-class extension relies on one-vs.-rest decomposition, where each subproblem trains its own spatial filters and classifier in an independent feature space. Because the discriminative responses from different subproblems share no common reference frame, the relative relationships among class-specific responses are difficult to exploit. Hybrid methods such as CSP-Net and FBCNet improve current methods through end-to-end training, but they do not explicitly construct a representation that contains the spatial discriminative responses of all classes. Second, the standard FBCSP pipeline computes log-variance after spatial filtering, reducing an entire time series to a single number. This keeps only the total energy and throws away everything about how that energy changes over time. However, the ERD/ERS elicited by different MI classes differ in onset latency, rate of development, and duration (Pfurtscheller and Lopes da Silva, 1999; Neuper et al., 2006); these temporal differences are themselves informative for classification, yet they are entirely erased by the log-variance computation. Deep learning methods can capture such temporal dynamics, but when applied directly to raw EEG, the network must simultaneously learn spatial filtering and temporal feature extraction from limited data, while CSP already provides a mathematically optimized discriminative spatial projection that is not being utilized.

To address these two issues, this paper proposes the Multi-Class Fusion Attention Network (MCFANet). The main contributions of this work are summarized as follows:

MCFANet, a fusion attention network for multi-class motor imagery classification. The method concatenates the CSP-filtered outputs from all classes at the input into a virtual channel, allowing the network to process the discriminative responses of all classes within a common feature space simultaneously, rather than solving each binary subproblem independently.

The full time series after CSP projection is retained instead of being compressed into log-variance scalars as in the standard FBCSP pipeline. This allows the subsequent convolutional layers to learn temporal differences across classes directly from the spatially filtered signals.

A channel attention module is introduced to adaptively weight the feature maps produced by the convolutional backbone. Since different feature maps contribute differently to classification, the module learns importance weights that guide the network toward the most discriminative representations.

The method is evaluated on two public datasets with different channel numbers and sample sizes. Paired t-tests and effect size analysis are used to assess statistical significance, and additional analyses including confusion matrices and feature visualization are provided to examine the method in detail.

The remainder of this paper is organized as follows. Section 2 describes the datasets, preprocessing, and the detailed architecture of the proposed method. Section 3 reports the classification results and comparisons with baseline methods. Section 4 discusses the role of key components. Finally, Section 5 concludes the paper.

2 Methodology2.1 Dataset description

In this work, classification performance is evaluated on two public datasets, each involving four motor imagery tasks. They are referred to as Dataset 2a and Dataset HGD. Within each dataset, all compared methods were trained and evaluated under identical preprocessing conditions.

The first dataset is BCI Competition IV Dataset 2a (Tangermann et al., 2012), provided by Graz University of Technology. This dataset contains EEG data from 9 subjects. The four motor imagery tasks are left hand, right hand, both feet, and tongue. A total of 25 channels were recorded, of which 22 are EEG channels and 3 are EOG channels. Each subject completed two sessions on different days, with 288 trials per session (72 trials per class). At the beginning of each trial, a fixation cross and an acoustic warning tone were presented. After 2 s, a directional cue indicated the required motor imagery task. Subjects performed the imagery until the fixation cross disappeared at 6 s. The EOG channels are excluded from classification, no additional trial rejection was applied, as the dataset has been widely used in its original form in prior studies (Brunner et al., 2008; Mane et al., 2021). Signals were sampled at 250 Hz and band-pass filtered between 0.5 Hz and 100 Hz. For each trial, a 0-4 s time window is extracted starting from the task cue onset.

High Gamma Dataset(HGD) (Schirrmeister et al., 2017b) contains EEG data from 14 subjects. The four tasks are left hand, right hand, both feet, and rest. Data were recorded from 128 electrodes at a sampling rate of 500 Hz. Similarly, a 0-4 s time window is extracted for each trial. Trials containing artifacts are rejected based on an amplitude threshold. Only 44 channels over the motor cortex area are retained, covering the FC, C, and CP regions along with their surrounding high-density electrodes. The data are then downsampled to 250 Hz. Although this dataset provides an official split into training and test sets, only the official training set is used in the experiments, which is further divided into training and test subsets using a fixed random seed. Each subject has approximately 880 trials.

2.2 Multi-class fusion attention network

The Multi-Class Fusion Attention Network (MCFANet) combines the multi-band spatial filtering pipeline of FBCSP with the temporal feature extraction capability of EEGNet, and extends both through multi-class filter fusion and channel attention. The method consists of four steps: (1) multi-band decomposition and spatial filtering, (2) multi-class spatial filter fusion, (3) temporal–spatial feature extraction, and (4) channel attention and classification. The overall framework is shown in Figure 1. A detailed layer-by-layer specification of the network is provided in Table 1.

Diagram outlining a neural network workflow for EEG signal classification, showing stages from input raw EEG data, multi-band and common spatial pattern filtering, feature fusion, improved EEGNet processing with channel attention, and final classifier with flatten, fully connected, and output layers.

Overall framework of MCFANet. Raw EEG signals are decomposed into multiple sub-bands by a filter bank, and CSP spatial filters are computed within each sub-band. The top m and bottom m CSP components are selected from each class sub-band pair, and the outputs from all classes and sub-bands are concatenated along the channel dimension to form a virtual channel. The virtual channels are fed into a modified EEGNet, passing through Block 1 (temporal convolution + depthwise spatial convolution), Block 2 (separable convolution), and a channel attention module for feature extraction. The final classification into motor imagery classes is performed by a fully connected layer.

LayerOutput sizeParameterInput layer[B, 1, D, T]BatchNorm2d[B, 1, D, T]ZeroPad2d[B, 1, D, T+63](32, 31, 0, 0)Conv2d[B, 16, D, T](1, 64)BatchNorm2d[B, 16, D, T]Conv2d[B, 32, 1, T](D, 1), groupedBatchNorm2d[B, 32, 1, T]ELU[B, 32, 1, T]AvgPool2d[B, 32, 1, T//4](1, 4)Dropout[B, 32, 1, T//4]0.5ZeroPad2d[B, 32, 1, T//4+15](7, 8, 0, 0)Conv2d[B, 32, 1, T//4](1, 16), groupedConv2d[B, 32, 1, T//4](1, 1)BatchNorm2d[B, 32, 1, T//4]ELU[B, 32, 1, T//4]AvgPool2d[B, 32, 1, T//32](1, 8)Dropout[B, 32, 1, T//32]0.5Global AvgPool[B, 32]Global MaxPool[B, 32]Concatenate[B, 64]FC → ReLU[B, 32]FC → ReLU[B, 16]FC → Sigmoid[B, 32]Channel-wise Multiply[B, 32, 1, T//32]Flatten[B, 32 × T//32]FC → BN → ReLU → Dropout[B, 128]p = 0.5FC[B, K]

The model structure of MCFANet.

D = K×F×2m is the number of virtual channels.

2.2.1 Multi-band decomposition and spatial filtering

Motor imagery induces ERD/ERS patterns primarily in the mu (8–12 Hz) and beta (12–30 Hz) bands, but the discriminative frequency bands vary across subjects (Ang et al., 2008). To avoid manual band selection, the raw EEG signals are decomposed into F = 6 sub-bands using a bank of bandpass filters with 4 Hz bandwidth, covering 8–12 Hz, 12–16 Hz, …, 28–32 Hz. For each trial , the filtered signal in sub-band f is denoted , where C is the number of channels and T is the number of time samples. This filter bank configuration, with 4Hz bandwidth covering 8-32Hz, is consistent with prior work (Ang et al., 2008; Mane et al., 2021) and targets the mu and beta bands where ERD/ERS is most pronounced (Pfurtscheller and Lopes da Silva, 1999).

Within each sub-band, the Common Spatial Pattern (CSP) algorithm is applied to extract discriminative spatial features. Given zero-mean signals and a binary partition into class i and class j, CSP seeks a spatial filter w∈ℝC×1 that maximizes the variance ratio: where is the average spatial covariance matrix computed from the Ni trials of class i in sub-band f. This is solved as a generalized eigenvalue problem: A large λ means the filter produces high variance under class i and low variance under class j; a small λ gives the opposite. The eigenvectors corresponding to the m largest and m smallest eigenvalues are concatenated into the projection matrix W∈ℝC×2m.

Since CSP is defined for two classes, we extend it to the K-class setting by training K separate binary problems. For each class k (k = 1, …, K), the covariance matrix of class k and the pooled covariance matrix of all other classes are computed, and the generalized eigenvalue problem is solved in every sub-band. This yields a projection matrix for each class sub-band pair.

2.2.2 Multi-class spatial filter fusion

In Section 2.2.1, a separate projection matrix is obtained for each class–sub-band pair. We apply all K projections to every trial and concatenate the results into a single representation. For class k in sub-band f, applying to trial gives: Rather than computing log-variance as in FBCSP, we retain the full time series so that the subsequent network can learn how signal energy evolves over time. The filtered signals from all classes and sub-bands are concatenated along the channel dimension: where D = K×F×2m is the total number of virtual channels. The channels are arranged in a class–sub-band–component order: the first 2m channels correspond to class 1 in sub-band 1, the next 2m to class 1 in sub-band 2, and so on. This layout places channels sharing the same class and frequency band next to each other, which helps the subsequent depthwise convolution capture local patterns within each group. Before being fed into the network, the virtual channel representation is passed through a batch normalization layer to standardize the input distribution, mitigating amplitude differences across subjects and frequency bands.

By construction of CSP, when a trial from class k is projected through the class-k spatial filters, the top m components tend to produce large variance while the bottom m components tend to produce small variance; this pattern differs when the same trial is projected through the filters of other classes. The resulting variance profile across all virtual channels provides the basis for multi-class discrimination in the shared feature space of Vn.

2.2.3 Spatial-temporal feature extraction

The fused representation is passed to a feature extraction network built on the EEGNet architecture (Lawhern et al., 2018). The backbone comprises two convolutional blocks; the detailed structure is shown in Figure 2.

Diagram outlining two blocks of a neural network architecture. Block 1, titled Temporal-Spatial Feature Learning, sequentially applies zero padding, Conv2D-temporal, batch normalization, and depthwise Conv2D-spatial with an output of [B, 32, 1, 1000], followed by batch normalization, ELU activation, average pooling, and dropout. Block 2, Separable Convolution, applies depthwise and pointwise convolutions, followed by batch normalization, ELU, average pooling, and dropout, yielding output [B, 32(F2), 1, 31].

Detailed architecture of Block 1 and Block 2 in the feature extraction network.

Block 1 first applies a temporal convolution with kernel length of 64 samples along the time dimension, producing F1 = 16 temporal feature maps. After batch normalization, a depthwise convolution operates along the channel dimension, where each temporal feature map independently learns the combinations among the D virtual channels, doubling the number of feature maps to 2F1 = 32. This is followed by batch normalization, ELU activation, average pooling (stride 4), and dropout.

Block 2 applies a separable convolution to further extract temporal features: a depthwise convolution first filters along the time dimension, and a pointwise convolution then adjusts the number of feature maps to F2 = 32. This is followed by batch normalization, ELU activation, average pooling (stride 8), and dropout. Note that the depthwise convolution in the original EEGNet learns spatial filters across physical electrodes, whereas here it operates over the D virtual channels of Vn. Because adjacent channels share the same class and sub-band (Section 2.2.2), the depthwise convolution captures energy contrasts within each class–sub-band group.

2.2.4 Channel attention and classification

Block 2 produces F2 feature maps, but the input virtual channel contains CSP projections from all K classes. For a trial belonging to class k, the projections through class-k filters are expected to produce strong responses, while projections through other classes' filters may carry less relevant or redundant information. Consequently, not all feature maps contribute equally to classification. To address this, we add a channel attention module after Block 2, inspired by the channel attention mechanism in CBAM (Woo et al., 2018), to adaptively reweight the feature maps based on their relevance to the classification task. Its structure is shown in Figure 3.

Diagram illustrating a neural network architecture with a Channel Attention Module and a Classifier. The module processes input through global average and max pooling, concatenation, fully connected layers, and channel-wise multiplication to produce an output. The classifier includes flattening, fully connected layers with batch normalization, ReLU, dropout, and a SoftMax classifier.

Detailed architecture of the channel attention module and classifier.

The module compresses the spatial information of each feature map via global average pooling and global max pooling, and concatenates the two sets of statistics. The concatenated vector is passed through a fully connected network that first fuses the two pooling statistics back to the channel dimension, then learns inter-channel dependencies through a bottleneck structure, and finally outputs gate values via a Sigmoid function to rescale the feature maps channel-wise.

The attention-weighted feature maps are flattened and fed into a classifier consisting of fully connected layers, batch normalization, and dropout, which maps the features to K classes. The entire network is trained end-to-end by minimizing the cross-entropy loss: where yn, k is the ground-truth label and ŷn, k is the predicted probability for class k of the n-th trial.

3 Result analysis3.1 Parameter setting

The classification task in this study is a multi-class problem involving all motor imagery categories in each dataset. Five-fold cross-validation is used to split the data into training and test sets, with the mean and standard deviation of classification accuracy serving as evaluation metrics. All data-dependent operations, including band-pass filtering, CSP spatial filter computation, and network training, are performed exclusively on the training data within each fold to avoid data leakage. CSP filters are computed on the training data of each fold using a one-vs.-rest strategy for each motor imagery class, and the resulting spatial filters are applied to both the training and test sets of the corresponding fold. In addition, paired-samples t-tests are used to compare different methods, and Cohen's d is calculated to measure the effect size.

EEGNet, TTSNet, FBEEGNet, and MCFANet are trained with the same settings: learning rate of 0.001, batch size of 32, Adam optimizer, and cross-entropy loss. All hyperparameters are kept fixed across subjects and folds to avoid optimistic bias.

For individual subjects, the reported ± denotes the standard deviation across the five cross-validation folds. For the average across subjects, the ± denotes the standard deviation across subjects.

3.2 Compared method

In addition to CSP (Ramoser et al., 2000), FBCSP (Ang et al., 2008), and EEGNet (Lawhern et al., 2018), which are well-established baselines, we include the following methods for comparison:

STRCA The standard task-related component analysis method (Jia et al., 2023) applies TRCA spatial filters to remove task-unrelated components from EEG signals, and classifies trials by computing correlation coefficients between the filtered signals and class-specific templates.

TTSNet The two-stage-training temporal–spectral network (Jia et al., 2024) builds upon STRCA by replacing the correlation-based temporal decoding with EEGNet, and concatenates features from multiple filter banks for classification.

FBEEGNet This method uses the same filter bank decomposition and CSP spatial filtering as MCFANet, but applies only a single set of CSP filters to project all trials, without combining CSP outputs from multiple classes. The filtered time series are fed into EEGNet for classification. It serves as an ablation baseline to evaluate the contribution of the multi-class fusion strategy.

3.3 Hyperparameter tuning

The number of spatial filter pairs m is a key hyperparameter that needs to be determined for each dataset which is selected via grid search over m∈. For each candidate value of m, the full pipeline is executed, and the value yielding the highest mean cross-validation accuracy is selected. This procedure is performed independently for each dataset to account for differences in channel count and sample size. The search range for m is bounded by the spatial dimensionality of the data: since CSP selects the top m and bottom m eigenvectors from C×C covariance matrices, m is upper-bounded by C/2, but eigenvalues decay rapidly from both extremes and intermediate components carry little discriminative information. In prior work, (Ang et al. 2008) used m = 2 for a 22-channel dataset and m = 1 for a 3-channel dataset, confirming that small values of m are generally sufficient. We therefore search m∈, which covers the empirically effective range reported in the literature.

Increasing m has two competing effects: additional filter pairs can capture complementary spatial patterns, but lower-ranked eigenvectors carry weaker discriminative information and are more susceptible to estimation noise, particularly when training samples are limited relative to the number of channels. On Dataset 2a, as shown in Figure 4, which has only 22 channels and 72 trials per class, covariance estimates are less reliable and the spatial dimensionality is limited, so noise from redundant components quickly offsets any benefit. MCFANet achieves its best accuracy of 67.94% at m = 1 and declines steadily to 61.69% at m = 5. FBCSP and FBEEGNet both peak at m = 3 (57.70% and 63.98%, respectively) before declining.

Bar chart comparing classification accuracy for three models, FBCSP, FBEEGNet, and MCFANet, across one to five filter pairs. MCFANet consistently achieves the highest accuracy, followed by FBEEGNet, with FBCSP lowest. Error bars indicate variability for each model and filter pair.

Average Classification accuracy of FBCSP, FBEEGNet, and MCFANet on BCI Competition IV Dataset 2a as a function of the number of spatial filter pairs (m). Error bars indicate the standard deviation across subjects.

On HGD (Figure 5), which has 44 channels and approximately 220 trials per class, more reliable covariance estimation and richer spatial information allow additional filter pairs to contribute useful patterns before noise begins to dominate. FBCSP accuracy rises steadily from 66.75% (m = 1) to 77.01% (m = 5), FBEEGNet peaks at 84.64% with m = 4, and MCFANet peaks at 87.10% with m = 3 before declining to 82.80% at m = 5. These results indicate that the optimal m depends on the interplay between spatial dimensionality and sample size, and should be determined for each dataset using the cross-validation procedure described above. It is also worth noting that for a given m, MCFANet produces K times more virtual channels than FBEEGNet due to multi-class fusion, which explains why MCFANet reaches its optimal accuracy at a smaller m than the other two methods on Dataset 2a.

Bar chart comparing classification accuracy for FBCSP, FBEEGNet, and MCFANet across different numbers of filter pairs, with MCFANet consistently achieving the highest accuracy and FBCSP the lowest at each filter pair value. Error bars indicate variability.

Average classification accuracy of FBCSP, FBEEGNet, and MCFANet on High Gamma Dataset as a function of the number of spatial filter pairs (m). Error bars indicate the standard deviation across subjects.

3.3.1 Dimension matched comparison

To verify that the performance gain of MCFANet is not simply a result of increased input dimensionality, we matched the virtual channel size D across both methods by adjusting m accordingly. As shown in Table 2, MCFANet outperforms FBEEGNet at all three dimensionality levels on Dataset 2a, and at D = 96 and D = 144 on HGD. The entry for FBEEGNet at D = 144 on Dataset 2a is unavailable because the required CSP components (2m = 24) exceed the number of EEG channels (C = 22).

DFBEEGNetMCFANetmAccuracy (%)mAccuracy (%)BCI competition IV dataset 2a.48461.88 ± 15.60167.94 ± 13.7096862.99 ± 16.01267.39 ± 16.3414412—367.05 ± 11.87High gamma dataset48484.64 ± 11.03184.61 ± 11.0696884.06 ± 11.55284.91 ± 9.861441283.96 ± 11.52387.10 ± 10.09

Dimension matched accuracy comparison between FBEEGNet and MCFANet.

Accuracy is reported as mean ± standard deviation (%) across subjects. Bold values indicate the best performance.

3.4 Classification performance

In the following comparisons, each method uses the value of m that yields its highest cross-validation accuracy on the respective dataset, as determined by the grid search procedure in Section 3.3. Specifically, on Dataset 2a, MCFANet uses m = 1, FBEEGNet and FBCSP use m = 3; on HGD, MCFANet uses m = 3, FBEEGNet uses m = 4, and FBCSP uses m = 5. The same settings apply to all subsequent results.

In this section, six methods are compared to the proposed MCFANet method, including CSP, FBCSP, STRCA, TTSNet, EEGNet, and FBEEGNet. Figure 6 shows the classification accuracy of seven methods for each subject on the BCI Competition IV Dataset 2a, along with the mean accuracy and standard deviation.

Comments (0)

No login
gif