
<!DOCTYPE article
  PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD with MathML3 v1.4 20241031//EN" "JATS-archivearticle1-4-mathml3.dtd">
<article article-type="data-paper" xml:lang="en" dtd-version="1.4"><processing-meta base-tagset="archiving" mathml-version="3.0" table-model="xhtml" tagset-family="jats"><restricted-by>pmc</restricted-by></processing-meta><front><journal-meta><journal-id journal-id-type="nlm-ta">Sci Data</journal-id><journal-id journal-id-type="iso-abbrev">Sci Data</journal-id><journal-id journal-id-type="pmc-domain-id">2628</journal-id><journal-id journal-id-type="pmc-domain">sdata</journal-id><journal-title-group><journal-title>Scientific Data</journal-title></journal-title-group><issn pub-type="epub">2052-4463</issn><publisher><publisher-name>Nature Publishing Group</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="pmcid">PMC11930978</article-id><article-id pub-id-type="pmcid-ver">PMC11930978.1</article-id><article-id pub-id-type="pmcaid">11930978</article-id><article-id pub-id-type="pmcaiid">11930978</article-id><article-id pub-id-type="pmid">40122923</article-id><article-id pub-id-type="doi">10.1038/s41597-025-04826-y</article-id><article-id pub-id-type="publisher-id">4826</article-id><article-version article-version-type="pmc-version">1</article-version><article-categories><subj-group subj-group-type="heading"><subject>Data Descriptor</subject></subj-group></article-categories><title-group><article-title><italic toggle="yes">A multi-day and high-quality EEG dataset for motor imagery</italic> brain-computer interface</article-title></title-group><contrib-group><contrib contrib-type="author" corresp="yes" equal-contrib="yes"><name name-style="western"><surname>Yang</surname><given-names initials="B">Banghua</given-names></name><address><email>yangbanghua@shu.edu.cn</email></address><xref ref-type="aff" rid="Aff1">1</xref><xref ref-type="aff" rid="Aff2">2</xref></contrib><contrib contrib-type="author" equal-contrib="yes"><name name-style="western"><surname>Rong</surname><given-names initials="F">Fenqi</given-names></name><xref ref-type="aff" rid="Aff1">1</xref></contrib><contrib contrib-type="author"><name name-style="western"><surname>Xie</surname><given-names initials="Y">Yunlong</given-names></name><xref ref-type="aff" rid="Aff1">1</xref></contrib><contrib contrib-type="author"><name name-style="western"><surname>Li</surname><given-names initials="D">Du</given-names></name><xref ref-type="aff" rid="Aff1">1</xref></contrib><contrib contrib-type="author" corresp="yes"><name name-style="western"><surname>Zhang</surname><given-names initials="J">Jiayang</given-names></name><address><email>zhangjiayang@tju.edu.cn</email></address><xref ref-type="aff" rid="Aff3">3</xref></contrib><contrib contrib-type="author"><name name-style="western"><surname>Li</surname><given-names initials="F">Fu</given-names></name><xref ref-type="aff" rid="Aff4">4</xref></contrib><contrib contrib-type="author"><name name-style="western"><surname>Shi</surname><given-names initials="G">Guangming</given-names></name><xref ref-type="aff" rid="Aff4">4</xref></contrib><contrib contrib-type="author"><name name-style="western"><surname>Gao</surname><given-names initials="X">Xiaorong</given-names></name><xref ref-type="aff" rid="Aff5">5</xref></contrib><aff id="Aff1"><label>1</label><institution-wrap><institution-id institution-id-type="ROR">https://ror.org/006teas31</institution-id><institution-id institution-id-type="GRID">grid.39436.3b</institution-id><institution-id institution-id-type="ISNI">0000 0001 2323 5732</institution-id><institution>School of Mechatronic Engineering and Automation, Research Center of Brain-Computer Engineering, </institution><institution>Shanghai University, </institution></institution-wrap>Shanghai, China </aff><aff id="Aff2"><label>2</label><institution-wrap><institution-id institution-id-type="ROR">https://ror.org/01mv9t934</institution-id><institution-id institution-id-type="GRID">grid.419897.a</institution-id><institution-id institution-id-type="ISNI">0000 0004 0369 313X</institution-id><institution>Engineering Research Center of Traditional Chinese Medicine Intelligent Rehabilitation, </institution><institution>Ministry of Education, </institution></institution-wrap>Shanghai, China </aff><aff id="Aff3"><label>3</label><institution-wrap><institution-id institution-id-type="ROR">https://ror.org/012tb2g32</institution-id><institution-id institution-id-type="GRID">grid.33763.32</institution-id><institution-id institution-id-type="ISNI">0000 0004 1761 2484</institution-id><institution>Medical School, </institution><institution>Tianjin University, </institution></institution-wrap>Tianjin, China </aff><aff id="Aff4"><label>4</label><institution-wrap><institution-id institution-id-type="ROR">https://ror.org/05s92vm98</institution-id><institution-id institution-id-type="GRID">grid.440736.2</institution-id><institution-id institution-id-type="ISNI">0000 0001 0707 115X</institution-id><institution>School of Artificial Intelligence, </institution><institution>Xidian University, </institution></institution-wrap>Xi’an, China </aff><aff id="Aff5"><label>5</label><institution-wrap><institution-id institution-id-type="ROR">https://ror.org/03cve4549</institution-id><institution-id institution-id-type="GRID">grid.12527.33</institution-id><institution-id institution-id-type="ISNI">0000 0001 0662 3178</institution-id><institution>Department of Biomedical Engineering, School of Medicine, </institution><institution>Tsinghua University, </institution></institution-wrap>Beijing, China </aff></contrib-group><pub-date pub-type="epub"><day>23</day><month>3</month><year>2025</year></pub-date><pub-date pub-type="collection"><year>2025</year></pub-date><volume>12</volume><issue-id pub-id-type="pmc-issue-id">478261</issue-id><elocation-id>488</elocation-id><history><date date-type="received"><day>22</day><month>5</month><year>2023</year></date><date date-type="accepted"><day>11</day><month>3</month><year>2025</year></date></history><pub-history><event event-type="pmc-release"><date><day>23</day><month>03</month><year>2025</year></date></event><event event-type="pmc-live"><date><day>24</day><month>03</month><year>2025</year></date></event><event event-type="pmc-last-change"><date iso-8601-date="2025-03-26 15:25:48.597"><day>26</day><month>03</month><year>2025</year></date></event></pub-history><permissions><copyright-statement>© The Author(s) 2025</copyright-statement><copyright-year>2025</copyright-year><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/" specific-use="textmining" content-type="ccbylicense">https://creativecommons.org/licenses/by/4.0/</ali:license_ref><license-p><bold>Open Access</bold> This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">http://creativecommons.org/licenses/by/4.0/</ext-link>.</license-p></license></permissions><self-uri xmlns:xlink="http://www.w3.org/1999/xlink" content-type="pmc-pdf" xlink:href="41597_2025_Article_4826.pdf"><?pdf-name 41597_2025_Article_4826.pdf?><?pdf-size 4672672?><?pdf-md5 e69c5d104318fbdd72cf234d6a62e3c6?><?pdf-image-server-status NEVER_LOAD?><?pdf-cloudpmc-urn urn:app:238e/11930978/e69c5d104318/41597_2025_Article_4826.pdf?></self-uri><abstract id="Abs1"><p id="Par1">A key challenge in developing a robust electroencephalography (EEG)-based brain-computer interface (BCI) is obtaining reliable classification performance across multiple days. In particular, EEG-based motor imagery (MI) BCI faces large variability and low signal-to-noise ratio. To address these issues, collecting a large and reliable dataset is critical for learning of cross-session and cross-subject patterns while mitigating EEG signals inherent instability. In this study, we obtained a comprehensive MI dataset from the 2019 World Robot Conference Contest-BCI Robot Contest. We collected EEG data from 62 healthy participants across three recording sessions. This experiment includes two paradigms: (1) two-class tasks: left and right hand-grasping, (2) three-class tasks: left and right hand-grasping, and foot-hooking. The dataset comprises raw data, and preprocessed data. For the two-class data, an average classification accuracy of 85.32% was achieved using EEGNet, while the three-class data achieved an accuracy of 76.90% using deepConvNet. Different researchers can reuse the dataset according to their needs. We hope that this dataset will significantly advance MI-BCI research, particularly in addressing cross-session and cross-subject challenges.</p></abstract><kwd-group kwd-group-type="npg-subject"><title>Subject terms</title><kwd>Brain-machine interface</kwd><kwd>Neuroscience</kwd></kwd-group><funding-group><award-group><funding-source><institution-wrap><institution-id institution-id-type="FundRef">https://doi.org/10.13039/501100001809</institution-id><institution>National Natural Science Foundation of China (National Science Foundation of China)</institution></institution-wrap></funding-source><award-id>62376149</award-id><principal-award-recipient><name name-style="western"><surname>Yang</surname><given-names>Banghua</given-names></name></principal-award-recipient></award-group></funding-group><funding-group><award-group><funding-source><institution>National Key Research and Development Program of China (2022YFF1202500, 2022YFF1202504) Shanghai science and technology Project (24DZ2201500) Shanghai Major Science and Technology Project (2021SHZDZX)</institution></funding-source></award-group></funding-group><custom-meta-group><custom-meta><meta-name>pmc-status-qastatus</meta-name><meta-value>0</meta-value></custom-meta><custom-meta><meta-name>pmc-status-live</meta-name><meta-value>yes</meta-value></custom-meta><custom-meta><meta-name>pmc-status-embargo</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-status-released</meta-name><meta-value>yes</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-open-access</meta-name><meta-value>yes</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-olf</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-manuscript</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-legally-suppressed</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-has-pdf</meta-name><meta-value>yes</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-has-supplement</meta-name><meta-value>yes</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-pdf-only</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-suppress-copyright</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-is-real-version</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-is-scanned-article</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-preprint</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-in-epmc</meta-name><meta-value>yes</meta-value></custom-meta><custom-meta><meta-name>issue-copyright-statement</meta-name><meta-value>© Springer Nature Limited 2025</meta-value></custom-meta></custom-meta-group></article-meta></front><body><sec id="Sec1"><title>Background &amp; Summary</title><p id="Par2">Brain-computer interface (BCI) represents a revolutionary technology, enabling users to control external devices and software applications by decoding neural activity, bypassing the need for muscular involvement<sup><xref ref-type="bibr" rid="CR1">1</xref>,<xref ref-type="bibr" rid="CR2">2</xref></sup>. These neural activities are captured and analyzed using non-invasive methods such as electroencephalography (EEG)<sup><xref ref-type="bibr" rid="CR1">1</xref></sup>, functional magnetic resonance imaging (fMRI)<sup><xref ref-type="bibr" rid="CR3">3</xref></sup>, and functional near-infrared spectroscopy (fNIRS)<sup><xref ref-type="bibr" rid="CR4">4</xref></sup>. Among these techniques, EEG is particularly favoured in BCI systems due to its lower risk, cost-effectiveness, and parcticality<sup><xref ref-type="bibr" rid="CR5">5</xref>,<xref ref-type="bibr" rid="CR6">6</xref></sup>. BCI systems typically utilize paradigms such as steady-state visual evoked potential<sup><xref ref-type="bibr" rid="CR7">7</xref></sup>, event-related potential<sup><xref ref-type="bibr" rid="CR8">8</xref></sup>, and motor imagery (MI)<sup><xref ref-type="bibr" rid="CR9">9</xref></sup>. Notably, MI is distinct in that it reflects the subject’s voluntary movement awareness without any actual physical motion<sup><xref ref-type="bibr" rid="CR10">10</xref></sup>. Recent advancements have underscored the potential of BCI, particularly MI-based BCI (MI-BCI), in post-stroke motor rehabilitation, highlighting its significant therapeutic benefits<sup><xref ref-type="bibr" rid="CR1">1</xref>,<xref ref-type="bibr" rid="CR11">11</xref>–<xref ref-type="bibr" rid="CR13">13</xref></sup>.</p><p id="Par3">To promote technological innovation in EEG-based MI-BCI and neuroscience, enhance research transparency and scientific rigor, and foster interdisciplinary collaboration, many MI EEG datasets have been made publicly available. The BCI IV-2b<sup><xref ref-type="bibr" rid="CR14">14</xref></sup> and OpenBMI<sup><xref ref-type="bibr" rid="CR15">15</xref></sup> datasets are two representative examples, each focusing on two-class MI tasks. These datasets have played a key role in accelerating the validation and enhancement of EEG classification models. The BCI IV-2b dataset contains EEG data from 9 subjects, recorded using three electrodes (C3, C4, Cz). The OpenBMI dataset includes MI EEG data from 54 healthy subjects across three recording sessions, yet the average decoding accuracy across all subjects and sessions is only 74.7% when using the state-of-the-art algorithm<sup><xref ref-type="bibr" rid="CR16">16</xref></sup>. Currently, the only widely used multi-task MI dataset for algorithm research is the BCI IV-2a dataset, which includes left-right hand, foot and tongue MI tasks, and was collected in 2008<sup><xref ref-type="bibr" rid="CR17">17</xref></sup>. Like the 2b dataset, this 2a dataset also involves only 9 subjects and includes recordings from 22 electrodes.</p><p id="Par4">Most existing datasets face challenges related to limited data diversity and suboptimal data quality. Common issues include a small number of subjects, a low channel count, limited recording sessions, a restricted range of tasks, and subpar classification accuracy. These shortcomings, particularly the small sample sizes, significantly hinder the development and validation of advanced algorithms. Moreover, inadequate sample sizes or single-task designs pose barriers to technological progress and iterative advancements in the MI-BCI field. With the application of deep learning algorithms in the MI-BCI field<sup><xref ref-type="bibr" rid="CR18">18</xref></sup>, there is an increasing demand for large scale, high quality EEG datasets. In this paper, we introduce a comprehensive MI-BCI dataset comprising data from 62 subjects across three recording sessions. This dataset includes two paradigms: the first involves upper limb movements with left and right hand-grasping, with 51 subjects participating; the second adds a foot-hooking task, involving 11 subjects. For clarity, we refer to the two-task paradigm dataset as 2 C and the three-task paradigm dataset as 3 C. The average decoding accuracies across all subjects and sessions for the 2 C and 3 C data, respectively, using state-of-the-art algorithms are 85.3% and 76.9%. The public dataset consists of raw data, processed data and the associated code. These have been made publicly available on Figshare to ensure wider accessibility, with access provided through a dedicated link<sup><xref ref-type="bibr" rid="CR19">19</xref></sup> (10.25452/figshare.plus.22671172).</p><p id="Par5">Based on this dataset, we compare the differences in EEG activation patterns between different tasks from a temporal-spectral-spatial perspective, and utilize both existing baselines and state-of-the-art methods to perform decoding tasks, demonstrating that the quality of this dataset surpasses that of currently available public datasets. Also, we observed that the MI ability of different subjects improved progressively after multiple MI sessions. More deeply, due to the well-distributed performance of the 2 C dataset, future development of this dataset could also focus on BCI illiteracy, exploring the differences between high performers and low performers.</p><p id="Par6">We hope that this dataset will serve as a significant and robust resource for advancing of MI-BCI systems, owing to its high quality and large scale. Its versatility makes it an invaluable tool for both traditional and deep learning approaches in MI-BCI research. This includes applications in subject-specific<sup><xref ref-type="bibr" rid="CR20">20</xref></sup>, subject-independent<sup><xref ref-type="bibr" rid="CR21">21</xref></sup>, and session-to-session transfer studies<sup><xref ref-type="bibr" rid="CR22">22</xref></sup>, as well as in the development of transfer models.</p></sec><sec id="Sec2"><title>Methods</title><sec id="Sec3"><title>The 2019 world robot conference contest-BCI robot contest MI</title><p id="Par7">The “World Robot Conference Contest-BCI Robot Contest MI (WBCIC-MI)” serves as a platform to promote advancements in BCI technology and foster interdisciplinary collaboration. The two datasets presented in this study were collected during the 2019 edition of WBCIC-MI, where participants engaged in standardized MI tasks under controlled conditions. The contest provided a unique environment for collecting high-quality, large-scale EEG data, contributing significantly to the development of this comprehensive dataset.</p></sec><sec id="Sec4"><title>Participants and environment</title><p id="Par8">In this experiment, 62 healthy, right-handed participants (aged 17–30, including 18 females), all naive BCI users, were recruited. Among them, 51 subjects participated in the two-class MI experiment, and 11 in the three-class MI experiment. None had a history of neurophysiological, psychiatric, or musculoskeletal disorders that might have influenced the results. Prior to the experiment, all subjects are thoroughly informed about the procedure, purpose, requirements (such as maintaining health, adequate sleep, abstaining from alcohol), and MI techniques. After ensuring their understanding, written informed consent is obtained. The study receives approval from the Tsinghua University Medical Ethics Committee (approval number: 20190002) and adhered to the Declaration of Helsinki principles.</p><p id="Par9">The participants consist of university students. The recruitment information includes details about the experiment, its purpose, instructions, and potential risks involved (mainly physical fatigue). This targeted recruitment aims to minimize age variability and offers an educational opportunity in BCI technology. Participant privacy is strictly protected, with voluntary participation assured, and the commitment that data from any withdrawing participants would not be used. No participants are harmed, but provisions for compensation and treatment were established in case of harm.</p><p id="Par10">The participants consist of university students. The recruitment information includes details about the experiment, its purpose, instructions, and potential risks involved (mainly physical fatigue). This targeted recruitment aims to minimize age variability and offered an educational opportunity in BCI technology. Participant privacy is strictly protected, with voluntary participation assured, and the commitment that data from any withdrawing participants would not be used. No participants are harmed, but provisions for compensation and treatment were established in case of harm.</p></sec><sec id="Sec5"><title>Experimental paradigm</title><p id="Par11">The two experiment paradigms are designed to quantitatively acquire data related to different limb MI tasks. The experimental tasks comprise three tasks: left hand-grasping, right hand-grasping and foot-hooking. In particular, foot-hooking refers to keeping the heel of the foot stationary while slowly lifting the toe, creating a 45-degree angle with the ground. At the beginning of each experiment, visual and auditory instructions appeared simultaneously. The visual cues of MI tasks are provided on the monitor by displaying a brief video on a white background, while the resting cue is displayed as a white cross sign on a black background, as shown in Fig. <xref rid="Fig1" ref-type="fig">1</xref>.<fig id="Fig1" position="float" orientation="portrait"><label>Fig. 1</label><caption><p>The representations of visual cues according to each task. (<bold>a</bold>) Left-hand grasping. (<bold>b</bold>) Right-hand grasping. (<bold>c</bold>) Foot-hooking. (<bold>d</bold>) Break.</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" id="d33e371" position="float" orientation="portrait" xlink:href="41597_2025_4826_Fig1_HTML.jpg"><?image-name 41597_2025_4826_Fig1_HTML.jpg?><?image-size 16602?><?image-md5 0a539a3e2ddc8b2905cc8343a4679d35?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 286?><?image-original-width 1900?><?image-scaled-height 114?><?image-scaled-width 760?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/0a539a3e2ddc/41597_2025_4826_Fig1_HTML.jpg?><?thumb-name 41597_2025_4826_Fig1_HTML.gif?><?thumb-size 2407?><?thumb-md5 03b6d7facaf51829403aa20fe5473b4b?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 30?><?thumb-scaled-width 200?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/03b6d7facaf5/41597_2025_4826_Fig1_HTML.gif?></graphic></fig></p><p id="Par12">Each subject does three recording sessions with the same MI paradigm on different days. Our experiments comprised multiple recording sessions (three days) to consider inter-session and inter-participant variabilities. Each recording session last about 35–48 minutes, which includes eye-opening (60 s), eye-closing (60 s) and five MI blocks as indicated in Fig. <xref rid="Fig2" ref-type="fig">2(a)</xref>. We provide a flexible break period between the two MI blocks owing this experiment required subjects to remain focused for a long time. After the 60 s of break, the participants can choose to start the next MI block or continue to break according to their conditions.<fig id="Fig2" position="float" orientation="portrait"><label>Fig. 2</label><caption><p>Experimental Paradigm of MI. (<bold>a</bold>) The experimental paradigm includes a resting phase and a MI phase, with the MI phase comprising five MI blocks. (<bold>b</bold>) Experimental paradigm in a single trial.</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" id="d33e390" position="float" orientation="portrait" xlink:href="41597_2025_4826_Fig2_HTML.jpg"><?image-name 41597_2025_4826_Fig2_HTML.jpg?><?image-size 66263?><?image-md5 5afd9adfeaf6e6e5f6f9563e48cd1640?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 1033?><?image-original-width 1650?><?image-scaled-height 413?><?image-scaled-width 660?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/5afd9adfeaf6/41597_2025_4826_Fig2_HTML.jpg?><?thumb-name 41597_2025_4826_Fig2_HTML.gif?><?thumb-size 4815?><?thumb-md5 6008ebc7978e8ac15fcf9ed26195d30a?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 80?><?thumb-scaled-width 127?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/6008ebc7978e/41597_2025_4826_Fig2_HTML.gif?></graphic></fig></p><p id="Par13">After the tasks of eye-opening and eye-closing, the MI task is started. In the 2 C dataset, there are 40 trials in each block with balanced left-right hand MI tasks (3 C dataset: 60 trials, each block with balanced left-right hand and foot-hooking MI tasks). The duration of each trial is 7.5 s, which is shown in Fig. <xref rid="Fig2" ref-type="fig">2(b)</xref>. The first 1.5 seconds of a single trial involve brief visual and auditory cues. After the brief cues, participants perform the corresponding MI task during the MI period based on these cues, lasting for 4 seconds. During the MI period, participants are required to mentally repeat the imagined tasks 2–4 times based on the given cues. The subjects stop the MI task, when the monitor displays a white cross sign on a black background. The break lasts for 2 seconds.</p><p id="Par14">It is important to note that there are no unnecessary visual and auditory stimuli throughout the entire experimental process. As shown in Fig. <xref rid="Fig2" ref-type="fig">2</xref>, each MI block consists of 40 trials. Therefore, there are 200 trials pear recording session of 2 C dataset, with 100 trials for each MI task (left-right hand grasping). And there are 300 trials pear recording session of 3 C dataset, with 100 trials for each MI task.</p></sec><sec id="Sec6"><title>Data collection</title><p id="Par15">An EEG cap with 64 channels is placed on the head of each subject, which is a new generation of wireless EEG equipment independently developed by Neuracle (<ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="http://www.neuracle.cn/productinfo/148706.html">http://www.neuracle.cn/productinfo/148706.html</ext-link>)<sup><xref ref-type="bibr" rid="CR23">23</xref>–<xref ref-type="bibr" rid="CR25">25</xref></sup>, as shown in Fig. <xref rid="Fig3" ref-type="fig">3(a)</xref>. The system is characterized by good portability, signal stability, and effective shielding. More information about the amplifier and the system is presented in Table <xref rid="Tab1" ref-type="table">1</xref>. The electrode positions of the EEG cap are arranged according to the international 10–20 system. Of the 64 channels, 1–59 record EEG signals, and channels 60–64 record electrocardiogram (ECG) (60) and electrooculogram (EOG) (61–64) signals, respectively.<fig id="Fig3" position="float" orientation="portrait"><label>Fig. 3</label><caption><p>The data collection equipment used in this experiment. (a) The EEG cap and amplifier used in the experiment. (<bold>b</bold>) The electrode positions on the EEG cap and impedance values for one participant before the experiment, unit: kΩ. Where, the gray dot represents ground electrodes, while the green one represents reference electrodes. VEOU: Vertical electrooculography upper. VEOL: Vertical electrooculography lower. HEOR: Horizontal electrooculography right. HEOL: Horizontal electrooculography left.</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" id="d33e432" position="float" orientation="portrait" xlink:href="41597_2025_4826_Fig3_HTML.jpg"><?image-name 41597_2025_4826_Fig3_HTML.jpg?><?image-size 71438?><?image-md5 b351f59120e22f4c0031d5af6827fb0f?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 625?><?image-original-width 1500?><?image-scaled-height 313?><?image-scaled-width 750?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/b351f59120e2/41597_2025_4826_Fig3_HTML.jpg?><?thumb-name 41597_2025_4826_Fig3_HTML.gif?><?thumb-size 6922?><?thumb-md5 54219b0afdd6e5cf94a6ffec98a5a0c1?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 80?><?thumb-scaled-width 192?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/54219b0afdd6/41597_2025_4826_Fig3_HTML.gif?></graphic></fig><table-wrap id="Tab1" position="float" orientation="portrait"><label>Table 1</label><caption><p>Information about the amplifier and the system used in this study.</p></caption><table frame="hsides" rules="groups"><thead><tr><th colspan="2" rowspan="1">Technical specifications</th></tr></thead><tbody><tr><td colspan="1" rowspan="1">Sampling Rate:</td><td colspan="1" rowspan="1">Maximum single-channel sampling frequency of 16 kHz</td></tr><tr><td colspan="1" rowspan="1">Common Mode Rejection Ratio:</td><td colspan="1" rowspan="1">120 dB</td></tr><tr><td colspan="1" rowspan="1">ADC Resolution:</td><td colspan="1" rowspan="1">24bits</td></tr><tr><td colspan="1" rowspan="1">Bandwidth:</td><td colspan="1" rowspan="1">DC amplification preserving the full bandwidth signal, DC-4kHz under 16 kHz sampling</td></tr><tr><td colspan="1" rowspan="1">Input Noise:</td><td colspan="1" rowspan="1">&lt;0.4uVrms (0.3~70 Hz)</td></tr><tr><td colspan="1" rowspan="1">Input Range:</td><td colspan="1" rowspan="1">+/−375 mV</td></tr><tr><td colspan="1" rowspan="1">Data Transmission:</td><td colspan="1" rowspan="1">WIFI transmission, supports 2.4 GHz/5 GHz dual-band transmission</td></tr><tr><td colspan="1" rowspan="1">Data Sync Accuracy/Time Accuracy:</td><td colspan="1" rowspan="1">&lt;1 ms</td></tr><tr><td colspan="1" rowspan="1">Power Supply:</td><td colspan="1" rowspan="1">Lithium battery</td></tr><tr><td colspan="1" rowspan="1">EEG Cap Waterproof Rating:</td><td colspan="1" rowspan="1">IPX8, can be quickly cleaned and dried with specialized equipment</td></tr><tr><td colspan="1" rowspan="1">Weight:</td><td colspan="1" rowspan="1">84 g</td></tr><tr><td colspan="1" rowspan="1">Pose Detection:</td><td colspan="1" rowspan="1">Pose Detection</td></tr><tr><td colspan="1" rowspan="1">Anti-interference Capability:</td><td colspan="1" rowspan="1">Excellent electromagnetic shielding, capable of operating in various complex environments</td></tr></tbody></table></table-wrap></p><p id="Par16">As shown in Fig. <xref rid="Fig3" ref-type="fig">3(b)</xref>, the electrode positions for EEG collections are indicated within the red box, while the rest pertain to ECG and EOG. The ECG and EOG electrodes are not used during these two experiments. During the experiment, to obtain high-quality signals, the impedance for all channels is kept as low as possible, preferably below 5 kΩ, and the sampling frequency is set to 1000 Hz. The impedance values for all channels of one participant before the experiment are presented in Fig. <xref rid="Fig3" ref-type="fig">3(b)</xref>, the numbers inside the circles represent the impedance values for the corresponding channels, measured in kΩ.</p><p id="Par17">The experimental paradigms outlined in this study are implemented using E-Prime<sup><xref ref-type="bibr" rid="CR26">26</xref></sup>, a comprehensive software suite designed for creating and conducting psychological and neuroscientific experiments. E-Prime offers a user-friendly graphical interface, facilitating the entire process from the generation of experiments to the collection of data with millisecond precision. It also enables preliminary data analysis. The software’s versatility allows for the presentation of various stimuli, including text, images, and sounds. Additionally, E-Prime provides detailed timing information and logs event specifics, which are crucial for the accuracy and reliability of experimental data in neuroscience research.</p></sec><sec id="Sec7"><title>EEG data pre-processing</title><p id="Par18">The aforementioned system provides continuous raw EEG data. The raw data contains irrelevant channels and a high sampling frequency (1000 Hz). Therefore, pre-processing methods are required to obtain cleaner EEG data. In this paper, the data pre-processing is conducted using the EEGLAB (v2023.0) toolbox in the MATLAB (R2021b) environment. The specific pre-processing methods are as follows:<list list-type="bullet"><list-item><p id="Par19">Select data. Even though the ECG and EOG channels did not record any data during the MI experiments, these five channels were still included in the final EEG data. Hence, the first step of pre-processing is to remove the irrelevant channels, such as ECG (60) and EOG (61–64) (In this case, the number of data channels is 59).</p></list-item><list-item><p id="Par20">Re-reference. To avoid information loss, further to ensure consistency and comparability of results, the data from all participants underwent re-referencing. For re-reference of EEG data in this paper, Pz is used as the reference electrode (In this case, the number of data channels is 58 and after testing, this re-reference method is the best method).</p></list-item><list-item><p id="Par21">Filtering. To eliminate power line interference and high-frequency noise during the experiments, the filtering process is applied to the data. In this study, we used finite impulse response (FIR) in EEGLAB to perform band pass filtering (0.5–40 Hz) and filtering of 50 Hz. When the cutoff frequency is less than 2 Hz, the cutoff frequency is set to twice its value. This can help better eliminate low-frequency noise or baseline drift, ensuring that the signal retains the desired high-frequency components.</p></list-item><list-item><p id="Par22">Extract epochs. What we’re interested in is the data segment that makes the stimulus. The four seconds after the visual and auditory cue ends are the period we are focusing on. The MI section shown in Fig. <xref rid="Fig2" ref-type="fig">2(b)</xref> represents the valid epochs we extracted. At this point, the EEG data of each subject is divided into 200 trials on the 2 C dataset (3 C dataset: 300 trials) based on event markers.</p></list-item><list-item><p id="Par23">Remove epoch baseline. EEG signals contain baseline interference signals (low frequency noise), which can adversely affect signal analysis. Removing the epoch baseline is also a key step in pre-processing.</p></list-item><list-item><p id="Par24">Change sampling rate. In order to reduce the amount of data and improve the calculation speed, the data are down-sampled to 250 Hz.</p></list-item></list></p></sec></sec><sec id="Sec8"><title>Data Records</title><p id="Par25">The dataset is available at Figshare<sup><xref ref-type="bibr" rid="CR19">19</xref></sup>. The source files and meta-data files in this dataset were organized according to EEG-BIDS<sup><xref ref-type="bibr" rid="CR27">27</xref></sup>. The directory tree for this repository and some previews for data are shown in Fig. <xref rid="Fig4" ref-type="fig">4</xref>.<fig id="Fig4" position="float" orientation="portrait"><label>Fig. 4</label><caption><p>Directory tree for the repository with previews of EEG files.</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" id="d33e573" position="float" orientation="portrait" xlink:href="41597_2025_4826_Fig4_HTML.jpg"><?image-name 41597_2025_4826_Fig4_HTML.jpg?><?image-size 125394?><?image-md5 fd38420c486cce2b41bd728a43d3b1f3?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 2300?><?image-original-width 1848?><?image-scaled-height 920?><?image-scaled-width 739?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/fd38420c486c/41597_2025_4826_Fig4_HTML.jpg?><?thumb-name 41597_2025_4826_Fig4_HTML.gif?><?thumb-size 3809?><?thumb-md5 11f03fe83a61cc622b868cd673f34c37?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 124?><?thumb-scaled-width 100?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/11f03fe83a61/41597_2025_4826_Fig4_HTML.gif?></graphic></fig></p><p id="Par26">On the whole, the repository’s data consists of two parts: (1) Raw data is stored in the home folder – ‘scourcedata’; (2) Processed data store in the derivatives folder – ‘.mat’ files. Within these directories, the subdirectory corresponding to each subject is named “sub-xxx”, where xxx represents the serial number of the subject.</p><sec id="Sec9"><title>Raw data</title><p id="Par27">The acquired raw data by Neuracle for a single task session are saved as ‘.bdf’ and organized according to the following naming rules:</p><p id="Par28">sub-xxx\ses-yy\eeg\data.bdf,</p><p id="Par29">sub-xxx\ses-yy\eeg\evt.bdf,</p><p id="Par30">where, xxx represents for the subject number (2 C dataset: 001, 002, …, 051; 3 C dataset: 001, 002, …, 011), yy is the recording session number (01, 02, 03). There were two ‘. bdf’ files in each folder, which are the data file (data.bdf) and the trigger file (evt.bdf). It is important to note that naming the raw data as “data” and “evt” ensures that the data can be properly opened in EEGLAB.</p></sec><sec id="Sec10"><title>Processed data</title><p id="Par31">The processed data are obtained through the EEGLAB (v2023.0) toolbox based on MATLAB (R2021b). After pre-processing steps, the data for each recording session is stored as one file. The naming rule for each file is as follows:</p><p id="Par32">sub-xxx_ses-yy_task-motorimagery_eeg.mat,</p><p id="Par33">Each ‘.mat’ file contains two variables:</p><p id="Par34">data: 200 or 300 trials of MI data (2 C dataset: 200 trials, 3 C dataset: 300 trials), there are 100 trials for each class of MI task. Its dimension was [58 × 1000 × 200] or [58 × 1000 × 300], which is channel numbers × time samples × trial numbers.</p><p id="Par35">labels: It contains the task triggers (2 C dataset: ‘1’ and ‘2’, 3 C dataset: ‘1’, ‘2’and ‘3’).</p></sec></sec><sec id="Sec11"><title>Technical Validation</title><p id="Par36">We evaluate the dataset through time-frequency-space domain visualization and commonly used classification algorithms in the MI-BCI field.</p><p id="Par37">During MI, the cerebral cortex undergoes significant changes in specific rhythm signals, notably the mu-rhythm (8–12 Hz) and beta-rhythm (13–30 Hz)<sup><xref ref-type="bibr" rid="CR28">28</xref></sup>. These signal alterations play a crucial role in understanding the neural mechanisms underlying MI. We focus on the Event-Related Desynchronization/Synchronization (ERD/ERS) features, which are essential in MI tasks. ERD/ERS features differ in their spatial distribution patterns across the brain depending on the limb involved in the MI task. These patterns correspond to the distribution of the cortical motor areas associated with the active limbs<sup><xref ref-type="bibr" rid="CR29">29</xref></sup>.</p><p id="Par38">In addition to visual analysis, evaluating the quality of MI data using advanced algorithms is an effective approach. The performance of classification algorithms can serve as an indirect measure of the data’s quality<sup><xref ref-type="bibr" rid="CR30">30</xref></sup>. The overall classification performance can reveal the usability and the quality of the dataset as a whole.</p><sec id="Sec12"><title>Temporal domain</title><p id="Par39">Recent studies have increasingly validated the utility of ERD/ERS as effective analytical methods for studying brain functional signals. In our research, we specifically focus on the ERD/ERS of the mu-rhythm (8–12 Hz), which is closely associated with limb sensory-motor activities. This rhythm can be modulated by sensory stimulation and motor activities. The process for calculating ERD/ERS in our study was methodically structured as follows: (1) The 8–12 Hz band pass filtering is performed on the EEG signal; (2) each sample point of the filtered EEG signal is squared; (3) The squared EEG signals corresponding to the same MI task are superimposed and averaged; (4) The average curve is smoothed using a sliding time window. (5) The ERD/ERS metric was obtained using the formula:<disp-formula id="Equ1"><label>1</label><alternatives><tex-math id="d33e622"><?equation-image-name d33e622.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e622.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$${ERD}/{ERS}=\frac{A-R}{R}\times 100 \% $$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e628" display="block"><mml:mi mathvariant="italic">ERD</mml:mi><mml:mo>/</mml:mo><mml:mi mathvariant="italic">ERS</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>A</mml:mi><mml:mo>−</mml:mo><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi></mml:mrow></mml:mfrac><mml:mo>×</mml:mo><mml:mn>100</mml:mn><mml:mo>%</mml:mo></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" position="anchor" orientation="portrait" xlink:href="41597_2025_4826_Article_Equ1.gif"><?image-name 41597_2025_4826_Article_Equ1.gif?><?image-size 2013?><?image-md5 69236ccdb10dd587145715c6c0caf987?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 34?><?image-scaled-width 200?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/69236ccdb10d/41597_2025_4826_Article_Equ1.gif?><?thumb-name 41597_2025_4826_Article_Equ1.gif?><?thumb-size 2013?><?thumb-md5 69236ccdb10dd587145715c6c0caf987?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 34?><?thumb-scaled-width 200?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/69236ccdb10d/41597_2025_4826_Article_Equ1.gif?></graphic></alternatives></disp-formula>here, <inline-formula id="IEq1"><alternatives><tex-math id="d33e647"><?equation-image-name d33e647.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e647.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$$A$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e652"><mml:mi>A</mml:mi></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41597_2025_4826_Article_IEq1.gif"><?image-name 41597_2025_4826_Article_IEq1.gif?><?image-size 145?><?image-md5 f6d10fded3e05a99aea9ab1cb4fc4acb?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 14?><?image-scaled-width 17?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/f6d10fded3e0/41597_2025_4826_Article_IEq1.gif?><?thumb-name 41597_2025_4826_Article_IEq1.gif?><?thumb-size 145?><?thumb-md5 f6d10fded3e05a99aea9ab1cb4fc4acb?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 14?><?thumb-scaled-width 17?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/f6d10fded3e0/41597_2025_4826_Article_IEq1.gif?></inline-graphic></alternatives></inline-formula> represents the power spectral density (PSD) of the EEG signal in a specific frequency band during MI, while <inline-formula id="IEq2"><alternatives><tex-math id="d33e656"><?equation-image-name d33e656.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e656.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$$R$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e661"><mml:mi>R</mml:mi></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41597_2025_4826_Article_IEq2.gif"><?image-name 41597_2025_4826_Article_IEq2.gif?><?image-size 159?><?image-md5 bd0f2a7a38dbae11fac96c0b901d5d08?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 14?><?image-scaled-width 18?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/bd0f2a7a38db/41597_2025_4826_Article_IEq2.gif?><?thumb-name 41597_2025_4826_Article_IEq2.gif?><?thumb-size 159?><?thumb-md5 bd0f2a7a38dbae11fac96c0b901d5d08?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 14?><?thumb-scaled-width 18?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/bd0f2a7a38db/41597_2025_4826_Article_IEq2.gif?></inline-graphic></alternatives></inline-formula> represents the PSD of the same frequency band of the EEG signal during the reference period (resting state). <inline-formula id="IEq3"><alternatives><tex-math id="d33e665"><?equation-image-name d33e665.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e665.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$$A$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e670"><mml:mi>A</mml:mi></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41597_2025_4826_Article_IEq3.gif"><?image-name 41597_2025_4826_Article_IEq3.gif?><?image-size 145?><?image-md5 f6d10fded3e05a99aea9ab1cb4fc4acb?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 14?><?image-scaled-width 17?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/f6d10fded3e0/41597_2025_4826_Article_IEq3.gif?><?thumb-name 41597_2025_4826_Article_IEq3.gif?><?thumb-size 145?><?thumb-md5 f6d10fded3e05a99aea9ab1cb4fc4acb?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 14?><?thumb-scaled-width 17?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/f6d10fded3e0/41597_2025_4826_Article_IEq3.gif?></inline-graphic></alternatives></inline-formula> and <inline-formula id="IEq4"><alternatives><tex-math id="d33e674"><?equation-image-name d33e674.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e674.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$$R$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e679"><mml:mi>R</mml:mi></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41597_2025_4826_Article_IEq4.gif"><?image-name 41597_2025_4826_Article_IEq4.gif?><?image-size 159?><?image-md5 bd0f2a7a38dbae11fac96c0b901d5d08?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 14?><?image-scaled-width 18?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/bd0f2a7a38db/41597_2025_4826_Article_IEq4.gif?><?thumb-name 41597_2025_4826_Article_IEq4.gif?><?thumb-size 159?><?thumb-md5 bd0f2a7a38dbae11fac96c0b901d5d08?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 14?><?thumb-scaled-width 18?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/bd0f2a7a38db/41597_2025_4826_Article_IEq4.gif?></inline-graphic></alternatives></inline-formula> are both vectors.</p></sec><sec id="Sec13"><title>Spectral domain</title><p id="Par40">The MI-EEG also showed obvious performance in the spectral domain. The event-related spectral perturbation (ERSP) is used to reflect the changes of energy during MI tasks<sup><xref ref-type="bibr" rid="CR31">31</xref></sup>. ERSP is a method used in EEG analysis to examine the changes in the spectral power of brain oscillations in response to specific events or tasks. It provides a time-frequency representation of the EEG signal and allows researchers to investigate the dynamic modulation of neural activity during different MI tasks. ERSP involves calculating the spectral power at different frequencies and time points relative to a baseline period. The baseline period is typically a pre-task interval where the participant is at rest or engaged in a neutral state. By comparing the spectral power during the task or event to the baseline, it can determine the event-related changes in power at specific frequency bands and time intervals. The calculation process for ERSP involved the following steps: (1) Apply the short-time fourier transform (STFT) to the time-frequency decomposition of preprocessing data; (2) Calculate the energy values for each time point and frequency bin in the time-frequency representation; (3) Use the time before the start of the MI tasks as the baseline period; (4) Compute the average energy values during the event of interest and the baseline period. The formula for calculating ERSP is as follows,<disp-formula id="Equ2"><label>2</label><alternatives><tex-math id="d33e691"><?equation-image-name d33e691.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e691.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$${ERSP}\left(f,t\right)=\frac{1}{n}\mathop{\sum }\limits_{k-1}^{1}{\left|{F}_{k}\left(f,t\right)\right|}^{2}$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e697" display="block"><mml:mi mathvariant="italic">ERSP</mml:mi><mml:mrow><mml:mfenced close=")" open="("><mml:mrow><mml:mi>f</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfenced></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:munderover><mml:mo>∑</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:msup><mml:mrow><mml:mfenced close="|" open="|"><mml:mrow><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mfenced close=")" open="("><mml:mrow><mml:mi>f</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:mfenced></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" position="anchor" orientation="portrait" xlink:href="41597_2025_4826_Article_Equ2.gif"><?image-name 41597_2025_4826_Article_Equ2.gif?><?image-size 2139?><?image-md5 92d4aa20737f501460f0d759e16e8974?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 46?><?image-scaled-width 200?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/92d4aa20737f/41597_2025_4826_Article_Equ2.gif?><?thumb-name 41597_2025_4826_Article_Equ2.gif?><?thumb-size 2139?><?thumb-md5 92d4aa20737f501460f0d759e16e8974?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 46?><?thumb-scaled-width 200?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/92d4aa20737f/41597_2025_4826_Article_Equ2.gif?></graphic></alternatives></disp-formula>here, <inline-formula id="IEq5"><alternatives><tex-math id="d33e740"><?equation-image-name d33e740.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e740.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$${F}_{k}(f,t)$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e745"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:mi>f</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41597_2025_4826_Article_IEq5.gif"><?image-name 41597_2025_4826_Article_IEq5.gif?><?image-size 361?><?image-md5 23883cc91f89f30168b6aef3b570cfbb?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 19?><?image-scaled-width 55?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/23883cc91f89/41597_2025_4826_Article_IEq5.gif?><?thumb-name 41597_2025_4826_Article_IEq5.gif?><?thumb-size 361?><?thumb-md5 23883cc91f89f30168b6aef3b570cfbb?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 19?><?thumb-scaled-width 55?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/23883cc91f89/41597_2025_4826_Article_IEq5.gif?></inline-graphic></alternatives></inline-formula> is the spectral estimate of trial <inline-formula id="IEq6"><alternatives><tex-math id="d33e758"><?equation-image-name d33e758.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e758.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$$k$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e763"><mml:mi>k</mml:mi></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41597_2025_4826_Article_IEq6.gif"><?image-name 41597_2025_4826_Article_IEq6.gif?><?image-size 145?><?image-md5 ba93e6d256fb958688c1ea56845ecaa1?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 14?><?image-scaled-width 13?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/ba93e6d256fb/41597_2025_4826_Article_IEq6.gif?><?thumb-name 41597_2025_4826_Article_IEq6.gif?><?thumb-size 145?><?thumb-md5 ba93e6d256fb958688c1ea56845ecaa1?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 14?><?thumb-scaled-width 13?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/ba93e6d256fb/41597_2025_4826_Article_IEq6.gif?></inline-graphic></alternatives></inline-formula> at frequency <inline-formula id="IEq7"><alternatives><tex-math id="d33e767"><?equation-image-name d33e767.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e767.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$$f$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e772"><mml:mi>f</mml:mi></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41597_2025_4826_Article_IEq7.gif"><?image-name 41597_2025_4826_Article_IEq7.gif?><?image-size 142?><?image-md5 951cd93c21d4f0b124b0c6be66cb66c6?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 17?><?image-scaled-width 14?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/951cd93c21d4/41597_2025_4826_Article_IEq7.gif?><?thumb-name 41597_2025_4826_Article_IEq7.gif?><?thumb-size 142?><?thumb-md5 951cd93c21d4f0b124b0c6be66cb66c6?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 17?><?thumb-scaled-width 14?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/951cd93c21d4/41597_2025_4826_Article_IEq7.gif?></inline-graphic></alternatives></inline-formula> and time <inline-formula id="IEq8"><alternatives><tex-math id="d33e777"><?equation-image-name d33e777.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e777.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$$t$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e782"><mml:mi>t</mml:mi></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41597_2025_4826_Article_IEq8.gif"><?image-name 41597_2025_4826_Article_IEq8.gif?><?image-size 120?><?image-md5 6b30bd65fb1e49e2a329e669188b621f?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 13?><?image-scaled-width 10?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/6b30bd65fb1e/41597_2025_4826_Article_IEq8.gif?><?thumb-name 41597_2025_4826_Article_IEq8.gif?><?thumb-size 120?><?thumb-md5 6b30bd65fb1e49e2a329e669188b621f?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 13?><?thumb-scaled-width 10?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/6b30bd65fb1e/41597_2025_4826_Article_IEq8.gif?></inline-graphic></alternatives></inline-formula>.</p></sec><sec id="Sec14"><title>Spatial domain</title><p id="Par41">The common spatial pattern (CSP) is a widely used method in the analysis of EEG and other biological signals. It is particularly effective in extracting spatial patterns that show maximum differences between distinct brain states. After preprocessing the EEG signals, the CSP algorithm is applied to extract spatial features by computing a set of spatial filters. In the CSP algorithm, a set of spatial filters is computed based on the covariance matrices of EEG signals for different conditions or tasks. The goal of CSP is to find a set of spatial filters that maximize the variance of the signals from one class and minimize the variance of the signals from the other class. This is done by solving the following optimization problem:<disp-formula id="Equ3"><label>3</label><alternatives><tex-math id="d33e790"><?equation-image-name d33e790.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e790.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$${\arg }\,{\max }\sum _{i,j}\frac{{var}\left({X}_{i}W\right)}{{var}({X}_{j}W)}$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e796" display="block"><mml:mi mathvariant="italic">arg</mml:mi><mml:mspace width="0.15em"/><mml:mrow><mml:mi mathvariant="italic">max</mml:mi><mml:munder><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant="italic">var</mml:mi><mml:mrow><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mi>W</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="italic">var</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mi>W</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" position="anchor" orientation="portrait" xlink:href="41597_2025_4826_Article_Equ3.gif"><?image-name 41597_2025_4826_Article_Equ3.gif?><?image-size 1386?><?image-md5 4e61384d09407bf2ddeb05fd8c85e32c?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 49?><?image-scaled-width 166?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4e61384d0940/41597_2025_4826_Article_Equ3.gif?><?thumb-name 41597_2025_4826_Article_Equ3.gif?><?thumb-size 1386?><?thumb-md5 4e61384d09407bf2ddeb05fd8c85e32c?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 49?><?thumb-scaled-width 166?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/4e61384d0940/41597_2025_4826_Article_Equ3.gif?></graphic></alternatives></disp-formula>where, <inline-formula id="IEq9"><alternatives><tex-math id="d33e838"><?equation-image-name d33e838.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e838.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$${X}_{i}$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e843"><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41597_2025_4826_Article_IEq9.gif"><?image-name 41597_2025_4826_Article_IEq9.gif?><?image-size 175?><?image-md5 b59d1e917dd17ec6cd41f005686a84cb?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 16?><?image-scaled-width 22?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/b59d1e917dd1/41597_2025_4826_Article_IEq9.gif?><?thumb-name 41597_2025_4826_Article_IEq9.gif?><?thumb-size 175?><?thumb-md5 b59d1e917dd17ec6cd41f005686a84cb?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 16?><?thumb-scaled-width 22?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/b59d1e917dd1/41597_2025_4826_Article_IEq9.gif?></inline-graphic></alternatives></inline-formula> represents the EEG signal matrices for different class, <inline-formula id="IEq10"><alternatives><tex-math id="d33e851"><?equation-image-name d33e851.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e851.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$$W$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e856"><mml:mi>W</mml:mi></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41597_2025_4826_Article_IEq10.gif"><?image-name 41597_2025_4826_Article_IEq10.gif?><?image-size 177?><?image-md5 67861f4b3ae241959a1fea010355e6e3?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 14?><?image-scaled-width 21?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/67861f4b3ae2/41597_2025_4826_Article_IEq10.gif?><?thumb-name 41597_2025_4826_Article_IEq10.gif?><?thumb-size 177?><?thumb-md5 67861f4b3ae241959a1fea010355e6e3?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 14?><?thumb-scaled-width 21?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/67861f4b3ae2/41597_2025_4826_Article_IEq10.gif?></inline-graphic></alternatives></inline-formula> is the matrix of spatial filters. <italic toggle="yes">var</italic>(<italic toggle="yes">X</italic><sub><italic toggle="yes">i</italic></sub>
<italic toggle="yes">W</italic>) and <italic toggle="yes">var</italic>(<italic toggle="yes">X</italic><sub><italic toggle="yes">j</italic></sub>
<italic toggle="yes">W</italic>) are the variance of the projected signals for the respective classes.</p><p id="Par42">The <inline-formula id="IEq11"><alternatives><tex-math id="d33e887"><?equation-image-name d33e887.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e887.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$$W$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e892"><mml:mi>W</mml:mi></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41597_2025_4826_Article_IEq11.gif"><?image-name 41597_2025_4826_Article_IEq11.gif?><?image-size 177?><?image-md5 67861f4b3ae241959a1fea010355e6e3?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 14?><?image-scaled-width 21?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/67861f4b3ae2/41597_2025_4826_Article_IEq11.gif?><?thumb-name 41597_2025_4826_Article_IEq11.gif?><?thumb-size 177?><?thumb-md5 67861f4b3ae241959a1fea010355e6e3?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 14?><?thumb-scaled-width 21?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/67861f4b3ae2/41597_2025_4826_Article_IEq11.gif?></inline-graphic></alternatives></inline-formula> resulting spatial filters enhance or suppress specific spatial patterns that are most useful for discriminating between classes. These spatial components are then used as features for classification, which helps to improve the performance of the BCI system by focusing on the brain areas most relevant to the MI tasks. This method of spatial feature extraction enhances the discriminability of the brain states, making it a powerful tool for MI-BCI applications.</p></sec><sec id="Sec15"><title>Visualization results</title><p id="Par43">Figures <xref rid="Fig5" ref-type="fig">5</xref>, <xref rid="Fig6" ref-type="fig">6</xref> display the visualization of temporal-spectral-spatial domains. Figure <xref rid="Fig5" ref-type="fig">5</xref> illustrates the visualization results of the 2 C dataset. Figure <xref rid="Fig5" ref-type="fig">5(a)</xref> depicts the ERD/ERS phenomenon in the time domain. The result is the average across all participants, with the baseline obtained during the 1-second period preceding the onset of the MI task. From Fig. <xref rid="Fig5" ref-type="fig">5(a)</xref>, it can be observed that the 2 C dataset exhibits a distinct ERD/ERS phenomenon. When imagining left hand-grasping, there is an increase in amplitude at electrode C3 and a decrease at C4, while imagining right hand-grasping shows the opposite pattern.<fig id="Fig5" position="float" orientation="portrait"><label>Fig. 5</label><caption><p>The visualization results of the 2 C dataset. (<bold>a</bold>) ERD/ERS. (<bold>b</bold>) Topography map, the colorbar represents the level of activation, with “+” indicating activation and “−” indicating deactivation. (<bold>c</bold>) ERSP.</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" id="d33e932" position="float" orientation="portrait" xlink:href="41597_2025_4826_Fig5_HTML.jpg"><?image-name 41597_2025_4826_Fig5_HTML.jpg?><?image-size 115762?><?image-md5 38255828ed418c7d7aeb356929146a9e?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 1068?><?image-original-width 1897?><?image-scaled-height 427?><?image-scaled-width 758?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/38255828ed41/41597_2025_4826_Fig5_HTML.jpg?><?thumb-name 41597_2025_4826_Fig5_HTML.gif?><?thumb-size 6393?><?thumb-md5 2ae6b27efc7511438a34db640c312ea4?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 80?><?thumb-scaled-width 142?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/2ae6b27efc75/41597_2025_4826_Fig5_HTML.gif?></graphic></fig><fig id="Fig6" position="float" orientation="portrait"><label>Fig. 6</label><caption><p>The visualization results of the 3 C dataset. (<bold>a</bold>) ERD/ERS. (<bold>b</bold>) Topography map, the colorbar represents the level of activation, with “+” indicating activation and “−” indicating deactivation. (<bold>c</bold>) ERSP.</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" id="d33e949" position="float" orientation="portrait" xlink:href="41597_2025_4826_Fig6_HTML.jpg"><?image-name 41597_2025_4826_Fig6_HTML.jpg?><?image-size 96661?><?image-md5 b0d7104d74e05134d01a07bf89cbb4a7?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 805?><?image-original-width 1900?><?image-scaled-height 322?><?image-scaled-width 760?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/b0d7104d74e0/41597_2025_4826_Fig6_HTML.jpg?><?thumb-name 41597_2025_4826_Fig6_HTML.gif?><?thumb-size 7671?><?thumb-md5 cd58e631a892166e9611c5499d57eb91?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 80?><?thumb-scaled-width 188?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/cd58e631a892/41597_2025_4826_Fig6_HTML.gif?></graphic></fig></p><p id="Par44">The ERD phenomenon is more pronounced than ERS, as depicted in Fig. <xref rid="Fig5" ref-type="fig">5(c)</xref>, which shows the ERSP for the C4 channel during the left hand-grasping task and the C3 channel during the right hand-grasping. The ERSP in Fig. <xref rid="Fig5" ref-type="fig">5(c)</xref> is consistent with the ERD/ERS observed in 5(a). The ERSP plot illustrates spectral variability according to the time epoch in the C3 and C4 channels, which reflect sensorimotor activation and deactivation. The reduction in energy during left and right hand-grasping occurs within the 8–30 Hz range. Additionally, it is observed that the reaction time for imagining the right hand is faster than the left hand, which may be related to the fact that all participants are right-handed.</p><p id="Par45">Further analysis is performed by plotting selected spatial patterns of the CSP feature pairs (mu-rhythm) from all subjects in Fig. <xref rid="Fig5" ref-type="fig">5(b)</xref>. The left (right) hand MI resulted in the activation of the region around the right (left) motor cortex. Figure <xref rid="Fig5" ref-type="fig">5(b)</xref> validates this statement. At the same time, it can be observed from Fig. <xref rid="Fig5" ref-type="fig">5(b)</xref> that the MI task not only activates the motor area but also elicits activation in the visual area.</p><p id="Par46">Figure <xref rid="Fig6" ref-type="fig">6</xref> presents the visualization results of the 3 C dataset. Unlike the 2 C dataset, the 3 C dataset includes a foot-hooking task. The analysis results for the ERD/ERS, ERSP, and topography maps for left and right hand tasks are consistent with those of the 2 C dataset. It is noteworthy to mention the dual-foot task. From Fig. <xref rid="Fig6" ref-type="fig">6(a)</xref>, it can be observed that the dual-foot task exhibits an ERS phenomenon in the Cz channel. Figure <xref rid="Fig6" ref-type="fig">6(c)</xref> reflects the reduction in energy in the 8–30 Hz range for the foot-hooking task in the Cz channel. During the imagination of dual-foot movement, the visual area is also activated, as shown in Fig. <xref rid="Fig6" ref-type="fig">6(b)</xref>.</p></sec><sec id="Sec16"><title>Classification performance</title><p id="Par47">In assessing the classification performance of EEG signals, we employ traditional machine learning and deep learning methods. To uphold the standards of fairness and accuracy in our evaluation, a 10-fold cross-validation (CV) method is rigorously implemented<sup><xref ref-type="bibr" rid="CR32">32</xref></sup>. The 10-fold CV facilitates a more comprehensive assessment of both the 2 C dataset and the 3 C dataset. This approach not only provides insights into the strengths and limitations of each dataset but also guarantees that our evaluation is robust and representative of diverse data scenarios.</p><p id="Par48">In our study, traditional machine learning algorithms are employed, specifically the CSP<sup><xref ref-type="bibr" rid="CR31">31</xref></sup> and filter bank common spatial pattern (FBCSP)<sup><xref ref-type="bibr" rid="CR33">33</xref></sup> for feature extraction, paired with support vector machine (SVM)<sup><xref ref-type="bibr" rid="CR33">33</xref></sup> for classification. These methods are widely recognized as the benchmark algorithms in the field of MI-BCI<sup><xref ref-type="bibr" rid="CR34">34</xref></sup>.<list list-type="bullet"><list-item><p id="Par49">CSP is adept at extracting spatial distribution components from multi-channel EEG data. Its core principle involves using matrix diagonalization to identify optimal spatial filters. This process maximizes the variance between two-class of signals, thereby yielding highly discriminative feature vectors. When task complexity increases (e.g., in multi-class classification), the performance of the CSP tends to decrease.</p></list-item><list-item><p id="Par50">FBCSP is proposed on the basis of CSP for processing MI-EEG data. This approach computes spatial filters in a supervised manner, focusing on band power features within the EEG signals for improved classification. FBCSP involves subdividing the input signal into multiple frequency bands using band-pass filters, with SVM serving as the classifier. The FBCSP typically performs better when handling more complex tasks and multi-class problems.</p></list-item></list></p><p id="Par51">In the evolving landscape of EEG-BCI research, several deep learning architectures have gained prominence in recent years<sup><xref ref-type="bibr" rid="CR35">35</xref></sup>. Notably, deepConvNet<sup><xref ref-type="bibr" rid="CR36">36</xref></sup>, EEGNet<sup><xref ref-type="bibr" rid="CR37">37</xref></sup> and FBCNet<sup><xref ref-type="bibr" rid="CR16">16</xref></sup> are three architectures that have been widely adopted within the EEG research. Their popularity is partly attributed to the availability of open-source code implementations, which has facilitated their widespread use and application in various EEG-BCI studies.<list list-type="bullet"><list-item><p id="Par52">The EEGNet is a specialized, compact convolutional neural network (CNN) architecture, explicitly designed for EEG-BCI. Its compact design allows for effective learning from relatively small datasets common in BCI research, while its convolutional layers are adept at capturing both temporal dynamics and spatial patterns inherent in EEG signals.</p></list-item><list-item><p id="Par53">The deepConvNet represents an advanced deep learning architecture, specifically designed to directly learn and interpret both temporal-domain and spectral-domain features of EEG signals. By integrating learning from both domains, the deepConvNet offers a comprehensive understanding of EEG data, enabling more nuanced and accurate EEG signal interpretation.</p></list-item><list-item><p id="Par54">The FBCNet introduces an innovative variance layer within its architecture, specifically engineered to aggregate temporal-domain information from EEG signals effectively. The variance layer operates by computing statistical measures across time, emphasizing changes and patterns in the EEG signal over specific intervals. This novel feature positions FBCNet as a potent tool in the domain of EEG-BCI research, enhancing the depth and precision of EEG data analysis.</p></list-item></list></p><p id="Par55">In order to analyze the classification performance of dataset more effectively and reasonably, the three deep learning algorithms adopt the same training parameters. The chosen parameters for each algorithm included a batch size of 16, a learning rate of 0.001, a loss function of NLLLoss, and the Adam optimizer. The simultaneous validation of these deep learning methods on both datasets further provided a comprehensive view of their applicability and effectiveness in varied data scenarios.</p><p id="Par56">To ensure uniformity in our evaluation, we employed the same training procedure for all deep learning algorithms. A two-stage training strategy was used<sup><xref ref-type="bibr" rid="CR16">16</xref></sup>, where the training data was further split into training and validation sets. Specifically, during the training process, 80% of the data is used for training the model, 10% is used for validation to tune hyperparameters and monitor performance, and the remaining 10% is reserved for testing to assess the final model’s generalization capability. During the first stage, the model was exclusively trained on the training set, with its performance continuously monitored using the validation set accuracy. The training process was halted if the validation set accuracy did not improve for 200 consecutive epochs, and the network parameters corresponding to the highest validation set accuracy were restored. This approach ensured that the model did not overfit and retained the best-performing parameters. Subsequently, the second stage of training commenced using the restored model as the starting point. In this stage, the model was trained on a combined dataset comprising both the training set and the validation set (referred to as the training data). The second stage of training was terminated when the test set loss fell below the loss achieved during the first stage. This two-stage strategy allowed the model to further refine its parameters while maintaining robust generalization performance. The maximum number of training epochs was restricted to 1500 and 600 for training stages 1 and 2, respectively. We performed cross-validation to assess the performance of all algorithms.</p><p id="Par57">Accuracy is indeed a very effective and intuitive evaluation metric, and it is the most commonly used one. The formula is as follows:<disp-formula id="Equ4"><label>4</label><alternatives><tex-math id="d33e1054"><?equation-image-name d33e1054.gif?><?equation-image-status EMPTY?><?equation-image-md5 4f703454a99573dc72ad221ce3a6f4f1?><?equation-image-cloudpmc-urn urn:cdn:blobs/238e/11930978/4f703454a995/d33e1054.gif?>\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$${\rm{Accuracy}}\left( \% \right)=\frac{{TP}+{TN}}{{TP}+{TN}+{FP}+{FN}}\times 100 \% $$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="d33e1060" display="block"><mml:mi mathvariant="normal">Accuracy</mml:mi><mml:mrow><mml:mfenced close=")" open="("><mml:mrow><mml:mo>%</mml:mo></mml:mrow></mml:mfenced></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="italic">TP</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="italic">TN</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">TP</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="italic">TN</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="italic">FP</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="italic">FN</mml:mi></mml:mrow></mml:mfrac><mml:mo>×</mml:mo><mml:mn>100</mml:mn><mml:mo>%</mml:mo></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" position="anchor" orientation="portrait" xlink:href="41597_2025_4826_Article_Equ4.gif"><?image-name 41597_2025_4826_Article_Equ4.gif?><?image-size 1624?><?image-md5 069f501339dc674ef5da09eedcf6a2db?><?image-image-server-status NEVER_LOAD?><?image-scaled-height 22?><?image-scaled-width 200?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/069f501339dc/41597_2025_4826_Article_Equ4.gif?><?thumb-name 41597_2025_4826_Article_Equ4.gif?><?thumb-size 1624?><?thumb-md5 069f501339dc674ef5da09eedcf6a2db?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 22?><?thumb-scaled-width 200?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/069f501339dc/41597_2025_4826_Article_Equ4.gif?></graphic></alternatives></disp-formula></p><p id="Par58">Here, <italic toggle="yes">TP</italic> represents the true positive, <italic toggle="yes">TN</italic> represents the true negative, <italic toggle="yes">FP</italic> stands as the false positive, and <italic toggle="yes">FN</italic> stands as the false negative.</p><p id="Par59">Figure <xref rid="Fig7" ref-type="fig">7</xref> shows the average classification accuracy of the two datasets under different benchmark algorithms, with the input data consisting of preprocessed 58-channel recordings. Figure <xref rid="Fig7" ref-type="fig">7(a)</xref> in our study illustrates the average classification accuracy across 153 independent recording sessions of the 2 C dataset, utilizing five different algorithms. In contrast, Fig. <xref rid="Fig7" ref-type="fig">7(b)</xref> depicts the average classification accuracy for 33 independent sessions of the 3 C dataset, analyzed using four algorithms. In the analysis conducted on the 2 C dataset, the classification accuracies achieved by each algorithm are notably distinct, with 61.12% (CSP + SVM), 67.46% (FBCSP + SVM), 85.32% (EEGNet), 84.47% (deepConvNet) and 78.40% (FBCNet). The classification accuracies achieved by each algorithm on 3 C dataset are 58.40% (FBCSP + SVM), 75.34% (EEGNet), 76.90% (deepConvNet) and 74.77% (FBCNet), respectively.<fig id="Fig7" position="float" orientation="portrait"><label>Fig. 7</label><caption><p>Classification accuracy of 2 C and 3 C dataset. The red dash-dotted line indicates chance level with p = 0.01<sup><xref ref-type="bibr" rid="CR38">38</xref></sup>. (<bold>a</bold>) Classification accuracy of 2 C dataset. (<bold>b</bold>) Classification accuracy of the 3 C dataset.</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" id="d33e1133" position="float" orientation="portrait" xlink:href="41597_2025_4826_Fig7_HTML.jpg"><?image-name 41597_2025_4826_Fig7_HTML.jpg?><?image-size 46566?><?image-md5 eccaec55fa81491ebc19c3c005b792b8?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 792?><?image-original-width 1900?><?image-scaled-height 317?><?image-scaled-width 760?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/eccaec55fa81/41597_2025_4826_Fig7_HTML.jpg?><?thumb-name 41597_2025_4826_Fig7_HTML.gif?><?thumb-size 4338?><?thumb-md5 7b7fb312dd485ef5f639a5044e11a916?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 80?><?thumb-scaled-width 191?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/7b7fb312dd48/41597_2025_4826_Fig7_HTML.gif?></graphic></fig></p><p id="Par60">It can be seen that EEGNet exhibits superior classification performance on both datasets. It is important to note that each recording session comprised only 200 trials (2 C dataset) or 300 trials (3 C dataset), a relatively small dataset for deep learning algorithms. However, EEGNet’s performance underlines its effectiveness in handling limited training data, setting it apart as a robust choice for scenarios where data availability is constrained. These results emphasize the adaptability of EEGNet for efficiently processing smaller datasets, a common challenge in EEG-based BCI research.</p><p id="Par61">Analysis of the classification accuracy across different recording sessions revealed a distinct trend related to participant experience with BCI systems. Table <xref rid="Tab2" ref-type="table">2</xref> shows the average classification accuracy across three sessions, obtained through EEGNet. From Table <xref rid="Tab2" ref-type="table">2</xref>, it can be seen that in both datasets, the classification accuracy of session 1 is the lowest (2 C dataset: 81.77%, 3 C dataset: 71.91%), while that of session 3 is the highest (2 C dataset: 88.90%, 3 C dataset: 83.27%).<table-wrap id="Tab2" position="float" orientation="portrait"><label>Table 2</label><caption><p>The average classification accuracy across three recording sessions on the 2 C dataset and 3 C dataset.</p></caption><table frame="hsides" rules="groups"><thead><tr><th colspan="4" rowspan="1">Average accuracy</th></tr><tr><th colspan="1" rowspan="1"/><th colspan="1" rowspan="1">Session1</th><th colspan="1" rowspan="1">Session2</th><th colspan="1" rowspan="1">Session3</th></tr></thead><tbody><tr><td colspan="1" rowspan="1">2 C dataset</td><td colspan="1" rowspan="1">81.77%</td><td colspan="1" rowspan="1">86.63%</td><td colspan="1" rowspan="1">88.90%</td></tr><tr><td colspan="1" rowspan="1">3 C dataset</td><td colspan="1" rowspan="1">71.91%</td><td colspan="1" rowspan="1">75.52%</td><td colspan="1" rowspan="1">83.27%</td></tr></tbody></table></table-wrap></p><p id="Par62">Furthermore, Fig. <xref rid="Fig8" ref-type="fig">8</xref> displays the classification accuracy of all subjects across three recording sessions. As depicted in Fig. <xref rid="Fig8" ref-type="fig">8(a)</xref>, the classification accuracy achieved for 51 subjects generally increased from the first to the third recording session. This pattern is indicative of the subjects’ growing familiarity and proficiency with MI tasks. Most subjects have higher accuracy in the third recording session, indicating that subjects had gained MI experience in the first two recording sessions (such as S1, S2, S4, S10, S19 and so on). There are a small number of subjects with high data classification performance for all three recording sessions (S3, S6, S20, S24, S26 <italic toggle="yes">et al</italic>.). This could reflect a natural aptitude. However, there are exceptions, such as Subjects S9 and S16, who showed poor performance in the third session, indicating variability in individual learning curves.<fig id="Fig8" position="float" orientation="portrait"><label>Fig. 8</label><caption><p>Scatter plot of classification accuracy for three recording sessions of the 2 C dataset and 3 C dataset. (<bold>a</bold>) Classification accuracy of 2 C dataset. (<bold>b</bold>) Classification accuracy of the 3 C dataset.</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" id="d33e1210" position="float" orientation="portrait" xlink:href="41597_2025_4826_Fig8_HTML.jpg"><?image-name 41597_2025_4826_Fig8_HTML.jpg?><?image-size 100666?><?image-md5 525729c1ee22cf55b66c9b2e88f84696?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 1673?><?image-original-width 1900?><?image-scaled-height 669?><?image-scaled-width 760?><?image-cloudpmc-urn urn:cdn:blobs/238e/11930978/525729c1ee22/41597_2025_4826_Fig8_HTML.jpg?><?thumb-name 41597_2025_4826_Fig8_HTML.gif?><?thumb-size 2730?><?thumb-md5 eb4579fa02b97316f33d0177bc791c38?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 88?><?thumb-scaled-width 100?><?thumb-cloudpmc-urn urn:cdn:blobs/238e/11930978/eb4579fa02b9/41597_2025_4826_Fig8_HTML.gif?></graphic></fig></p><p id="Par63">Similarly, the 3 C dataset, as illustrated in Fig. <xref rid="Fig8" ref-type="fig">8(b)</xref>, exhibited comparable characteristics. These observations provide valuable insights for researchers utilizing this dataset, offering a unique opportunity to delve deeper into factors influencing learning and adaptation in BCI tasks.</p></sec></sec><sec id="Sec17" sec-type="discussion"><title>Discussion</title><p id="Par64">To further assess the quality and applicability of the dataset, we compare its classification performance with two widely used EEG datasets: the BCI IV-2a dataset<sup><xref ref-type="bibr" rid="CR17">17</xref></sup> and the OpenBMI dataset<sup><xref ref-type="bibr" rid="CR15">15</xref></sup>. These datasets were chosen for their similarity in experimental design and task paradigms. The most important dataset characteristics are summarized in Table <xref rid="Tab3" ref-type="table">3</xref>.<table-wrap id="Tab3" position="float" orientation="portrait"><label>Table 3</label><caption><p>Comparative summary of selected dataset’s characteristics from the literature.</p></caption><table frame="hsides" rules="groups"><thead><tr><th colspan="1" rowspan="1"/><th colspan="1" rowspan="1">Dataset</th><th colspan="1" rowspan="1"># of subjects</th><th colspan="1" rowspan="1"># of session</th><th colspan="1" rowspan="1"># of classes</th><th colspan="1" rowspan="1"># of channels</th></tr></thead><tbody><tr><td rowspan="2" colspan="1">Existing</td><td colspan="1" rowspan="1">BCI IV-2a</td><td colspan="1" rowspan="1">9</td><td colspan="1" rowspan="1">2</td><td colspan="1" rowspan="1">4</td><td colspan="1" rowspan="1">22</td></tr><tr><td colspan="1" rowspan="1">OpenBMI</td><td colspan="1" rowspan="1">54</td><td colspan="1" rowspan="1">2</td><td colspan="1" rowspan="1">2</td><td colspan="1" rowspan="1">20</td></tr><tr><td rowspan="2" colspan="1">This paper</td><td colspan="1" rowspan="1">2 C</td><td colspan="1" rowspan="1">51</td><td colspan="1" rowspan="1">3</td><td colspan="1" rowspan="1">2</td><td colspan="1" rowspan="1">58</td></tr><tr><td colspan="1" rowspan="1">3 C</td><td colspan="1" rowspan="1">11</td><td colspan="1" rowspan="1">3</td><td colspan="1" rowspan="1">3</td><td colspan="1" rowspan="1">58</td></tr></tbody></table></table-wrap></p><p id="Par65">For this comparison, we employed the same preprocessing and classification algorithms across all datasets. The classification accuracies of the datasets were then evaluated using a consistent evaluation framework. Table <xref rid="Tab4" ref-type="table">4</xref> shows the average classification accuracies for the three datasets using the same algorithms. Our dataset achieved an average classification accuracy of 85.31% for the 2 C dataset and 76.90% for the 3 C dataset. In comparison, the BCI IV-2a dataset achieved 79.03% (four-class), while the OpenBMI dataset achieved 74.70% (two-class).<table-wrap id="Tab4" position="float" orientation="portrait"><label>Table 4</label><caption><p>The average decoding accuracies across all subjects and sessions by using data from selected datasets.</p></caption><table frame="hsides" rules="groups"><thead><tr><th colspan="1" rowspan="1">Dataset</th><th colspan="1" rowspan="1">EEGNet</th><th colspan="1" rowspan="1">deepConvNet</th><th colspan="1" rowspan="1">FBCNet</th></tr></thead><tbody><tr><td colspan="1" rowspan="1">BCI IV-2a</td><td colspan="1" rowspan="1">73.13%</td><td colspan="1" rowspan="1">72.20%</td><td colspan="1" rowspan="1">79.03%</td></tr><tr><td colspan="1" rowspan="1">OpenBMI</td><td colspan="1" rowspan="1">70.89%</td><td colspan="1" rowspan="1">68.33%</td><td colspan="1" rowspan="1">74.70%</td></tr><tr><td colspan="1" rowspan="1">2 C</td><td colspan="1" rowspan="1">85.31%</td><td colspan="1" rowspan="1">84.47%</td><td colspan="1" rowspan="1">78.40%</td></tr><tr><td colspan="1" rowspan="1">3 C</td><td colspan="1" rowspan="1">75.34%</td><td colspan="1" rowspan="1">76.90%</td><td colspan="1" rowspan="1">74.77%</td></tr></tbody></table></table-wrap></p><p id="Par66">The comparison demonstrates that our dataset outperforms the BCI IV-2a and OpenBMI datasets in terms of overall evaluation, including the number of subjects, the number of recording sessions, the number of channels, and classification accuracy. This indicates that our dataset not only provides higher-quality data but also has greater potential for supporting the development of robust MI-BCI systems. The superior performance may be attributed to the larger number of subjects, the inclusion of multiple tasks, and the high-quality signal recording across three sessions.</p><p id="Par67">The technical validation through comparison with existing datasets confirms the high quality and potential of our dataset for MI-BCI research. Future studies will further explore how this dataset can contribute to advancing classification algorithms and improving the robustness of MI-BCI systems.</p></sec><sec id="Sec18"><title>Usage Notes</title><p id="Par68">This comprehensive MI-EEG dataset comprises two subsets: the 2 C dataset and the 3 C dataset. Users can readily download both the datasets and the accompanying code. The ‘code.rar’ file encompasses five benchmark algorithms along with classification results for all subjects and sessions. The ‘2 C dataset.rar’ and ‘3 C dataset.rar’ files contain both raw and preprocessed data.</p><p id="Par69">For effective utilization of this dataset and code, we propose the following guidelines:<list list-type="bullet"><list-item><p id="Par70">Users can load the ‘processeddata’ files and apply the algorithms in ‘code.rar’ to decode this data. The results should align with those reported in our paper.</p></list-item><list-item><p id="Par71">Users can start by loading the ‘rawdata’ files and processing them using EEGLAB in MATLAB. Subsequently, the ‘code.zip’ algorithms can be used to decode this processed data, yielding results similar to those in our study.</p></list-item><list-item><p id="Par72">For further BCI research, users may load the ‘rawdata’ files and apply their own preprocessing and decoding codes.</p></list-item></list></p></sec><sec id="Sec19" sec-type="supplementary-material"><title>Supplementary information</title><p>
<supplementary-material content-type="local-data" id="MOESM1" position="float" orientation="portrait"><media xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41597_2025_4826_MOESM1_ESM.docx" position="float" orientation="portrait"><?suppdata-name 41597_2025_4826_MOESM1_ESM.docx?><?suppdata-size 14844?><?suppdata-md5 37b1aa806d8c0ac89cfaf95c7915d0f9?><?suppdata-image-server-status NEVER_LOAD?><?suppdata-mime-type application?><?suppdata-mime-sub-type vnd.openxmlformats-officedocument.wordprocessingml.document?><?suppdata-cloudpmc-urn urn:app:238e/11930978/37b1aa806d8c/41597_2025_4826_MOESM1_ESM.docx?><caption><p>Supplementary-data anonymization</p></caption></media></supplementary-material>
</p></sec></body><back><fn-group><fn><p><bold>Publisher’s note</bold> Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.</p></fn><fn><p>These authors contributed equally: Banghua Yang, Fenqi Rong.</p></fn></fn-group><sec><title>Supplementary information</title><p>The online version contains supplementary material available at 10.1038/s41597-025-04826-y.</p></sec><ack><title>Acknowledgements</title><p>This work was supported in part by the National Key Research and Development Program of China (2024YFF1206500, 2024YFF1206502); the National Natural Science Foundation of China (62376149); the Shanghai science and technology Project (24DZ2201500); the Shanghai Major Science and Technology Project (2021SHZDZX).</p></ack><notes notes-type="author-contribution"><title>Author contributions</title><p>Resources, supervision, Banghua Yang; conceptualization, formal analysis, writing, Fenqi Rong; software, data curation, Yunlong Xie, Bo Li, Jiayang Zhang; investigation, Fu Li, Guangming Shi, Xiaorong Gao.</p></notes><notes notes-type="data-availability"><title>Code availability</title><p>A script containing all the algorithms in this paper stored in ‘code.zip’ is provided with the dataset. All the code is implemented in Python 3.7.</p></notes><notes id="FPar1" notes-type="COI-statement"><title>Competing interests</title><p id="Par74">The authors declare no competing interests.</p></notes><ref-list id="Bib1"><title>References</title><ref id="CR1"><label>1.</label><citation-alternatives><element-citation id="ec-CR1" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Mane</surname><given-names>R</given-names></name><name name-style="western"><surname>Chouhan</surname><given-names>T</given-names></name><name name-style="western"><surname>Guan</surname><given-names>C</given-names></name></person-group><article-title>BCI for stroke rehabilitation: motor and beyond</article-title><source>J. Neural Eng.</source><year>2020</year><volume>17</volume><fpage>041001</fpage><pub-id pub-id-type="pmid">32613947</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2552/aba162</pub-id></element-citation><mixed-citation id="mc-CR1" publication-type="journal">Mane, R., Chouhan, T. &amp; Guan, C. BCI for stroke rehabilitation: motor and beyond. <italic toggle="yes">J. Neural Eng.</italic><bold>17</bold>, 041001 (2020).<pub-id pub-id-type="pmid">32613947</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2552/aba162</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR2"><label>2.</label><citation-alternatives><element-citation id="ec-CR2" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Nourmohammadi</surname><given-names>A</given-names></name><name name-style="western"><surname>Jafari</surname><given-names>M</given-names></name><name name-style="western"><surname>Zander</surname><given-names>TO</given-names></name></person-group><article-title>A survey on unmanned aerial vehicle remote control using brain–computer interface</article-title><source>IEEE Trans. Hum-Mach. Syst.</source><year>2018</year><volume>48</volume><fpage>337</fpage><lpage>348</lpage></element-citation><mixed-citation id="mc-CR2" publication-type="journal">Nourmohammadi, A., Jafari, M. &amp; Zander, T. O. A survey on unmanned aerial vehicle remote control using brain–computer interface. <italic toggle="yes">IEEE Trans. Hum-Mach. Syst.</italic><bold>48</bold>, 337–348 (2018).</mixed-citation></citation-alternatives></ref><ref id="CR3"><label>3.</label><citation-alternatives><element-citation id="ec-CR3" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Fleury</surname><given-names>M</given-names></name><name name-style="western"><surname>Figueiredo</surname><given-names>P</given-names></name><name name-style="western"><surname>Vourvopoulos</surname><given-names>A</given-names></name><name name-style="western"><surname>Lecuyer</surname><given-names>A</given-names></name></person-group><article-title>Two is better? Combining EEG and fMRI for BCI and neurofeedback: A systematic review</article-title><source>J. Neural Eng.</source><year>2023</year><volume>20</volume><fpage>051003</fpage><pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2552/ad06e1</pub-id><pub-id pub-id-type="pmid">37879343</pub-id></element-citation><mixed-citation id="mc-CR3" publication-type="journal">Fleury, M., Figueiredo, P., Vourvopoulos, A. &amp; Lecuyer, A. Two is better? Combining EEG and fMRI for BCI and neurofeedback: A systematic review. <italic toggle="yes">J. Neural Eng.</italic><bold>20</bold>, 051003 (2023).<pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2552/ad06e1</pub-id><pub-id pub-id-type="pmid">37879343</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR4"><label>4.</label><citation-alternatives><element-citation id="ec-CR4" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Hosni</surname><given-names>SM</given-names></name><name name-style="western"><surname>Borgheai</surname><given-names>SB</given-names></name><name name-style="western"><surname>Mclinden</surname><given-names>J</given-names></name><name name-style="western"><surname>Shahriari</surname><given-names>Y</given-names></name></person-group><article-title>An fNIRS-based motor imagery BCI for ALS: A subject-specific data-driven approach</article-title><source>IEEE Trans. Neural Syst. Rehabil. Eng.</source><year>2020</year><volume>28</volume><fpage>3063</fpage><lpage>3073</lpage><pub-id pub-id-type="pmid">33206606</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1109/TNSRE.2020.3038717</pub-id></element-citation><mixed-citation id="mc-CR4" publication-type="journal">Hosni, S. M., Borgheai, S. B., Mclinden, J. &amp; Shahriari, Y. An fNIRS-based motor imagery BCI for ALS: A subject-specific data-driven approach. <italic toggle="yes">IEEE Trans. Neural Syst. Rehabil. Eng.</italic><bold>28</bold>, 3063–3073 (2020).<pub-id pub-id-type="pmid">33206606</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1109/TNSRE.2020.3038717</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR5"><label>5.</label><citation-alternatives><element-citation id="ec-CR5" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Abiri</surname><given-names>R</given-names></name><name name-style="western"><surname>Borhani</surname><given-names>S</given-names></name><name name-style="western"><surname>Sellers</surname><given-names>EW</given-names></name><name name-style="western"><surname>Jiang</surname><given-names>Y</given-names></name><name name-style="western"><surname>Zhao</surname><given-names>X</given-names></name></person-group><article-title>A comprehensive review of EEG-based brain–computer interface paradigms</article-title><source>J. Neural Eng.</source><year>2019</year><volume>16</volume><fpage>011001</fpage><pub-id pub-id-type="pmid">30523919</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2552/aaf12e</pub-id></element-citation><mixed-citation id="mc-CR5" publication-type="journal">Abiri, R., Borhani, S., Sellers, E. W., Jiang, Y. &amp; Zhao, X. A comprehensive review of EEG-based brain–computer interface paradigms. <italic toggle="yes">J. Neural Eng.</italic><bold>16</bold>, 011001 (2019).<pub-id pub-id-type="pmid">30523919</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2552/aaf12e</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR6"><label>6.</label><citation-alternatives><element-citation id="ec-CR6" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Craik</surname><given-names>A</given-names></name><name name-style="western"><surname>He</surname><given-names>Y</given-names></name><name name-style="western"><surname>Contreras-Vidal</surname><given-names>JL</given-names></name></person-group><article-title>Deep learning for electroencephalogram (EEG) classification tasks: a review</article-title><source>J. Neural Eng.</source><year>2019</year><volume>16</volume><fpage>031001</fpage><pub-id pub-id-type="pmid">30808014</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2552/ab0ab5</pub-id></element-citation><mixed-citation id="mc-CR6" publication-type="journal">Craik, A., He, Y. &amp; Contreras-Vidal, J. L. Deep learning for electroencephalogram (EEG) classification tasks: a review. <italic toggle="yes">J. Neural Eng.</italic><bold>16</bold>, 031001 (2019).<pub-id pub-id-type="pmid">30808014</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2552/ab0ab5</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR7"><label>7.</label><citation-alternatives><element-citation id="ec-CR7" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Kwak</surname><given-names>NS</given-names></name><name name-style="western"><surname>Müller</surname><given-names>KR</given-names></name><name name-style="western"><surname>Lee</surname><given-names>SW</given-names></name></person-group><article-title>A convolutional neural network for steady state visual evoked potential classification under ambulatory environment</article-title><source>PloS One.</source><year>2017</year><volume>12</volume><fpage>e0172578</fpage><pub-id pub-id-type="pmid">28225827</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1371/journal.pone.0172578</pub-id><pub-id pub-id-type="pmcid">PMC5321422</pub-id></element-citation><mixed-citation id="mc-CR7" publication-type="journal">Kwak, N. S., Müller, K. R. &amp; Lee, S. W. A convolutional neural network for steady state visual evoked potential classification under ambulatory environment. <italic toggle="yes">PloS One.</italic><bold>12</bold>, e0172578 (2017).<pub-id pub-id-type="pmid">28225827</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1371/journal.pone.0172578</pub-id><pub-id pub-id-type="pmcid">PMC5321422</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR8"><label>8.</label><citation-alternatives><element-citation id="ec-CR8" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Yeom</surname><given-names>SK</given-names></name><name name-style="western"><surname>Fazli</surname><given-names>S</given-names></name><name name-style="western"><surname>Müller</surname><given-names>KR</given-names></name><name name-style="western"><surname>Lee</surname><given-names>SW</given-names></name></person-group><article-title>An efficient ERP-based brain-computer interface using random set presentation and face familiarity</article-title><source>PloS One.</source><year>2014</year><volume>9</volume><fpage>e111157</fpage><pub-id pub-id-type="pmid">25384045</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1371/journal.pone.0111157</pub-id><pub-id pub-id-type="pmcid">PMC4226481</pub-id></element-citation><mixed-citation id="mc-CR8" publication-type="journal">Yeom, S. K., Fazli, S., Müller, K. R. &amp; Lee, S. W. An efficient ERP-based brain-computer interface using random set presentation and face familiarity. <italic toggle="yes">PloS One.</italic><bold>9</bold>, e111157 (2014).<pub-id pub-id-type="pmid">25384045</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1371/journal.pone.0111157</pub-id><pub-id pub-id-type="pmcid">PMC4226481</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR9"><label>9.</label><citation-alternatives><element-citation id="ec-CR9" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Gaur</surname><given-names>P</given-names></name><etal/></person-group><article-title>A sliding window common spatial pattern for enhancing motor imagery classification in EEG-BCI</article-title><source>IEEE Trans. Instrum. Meas.</source><year>2021</year><volume>70</volume><fpage>1</fpage><lpage>9</lpage></element-citation><mixed-citation id="mc-CR9" publication-type="journal">Gaur, P. <italic toggle="yes">et al</italic>. A sliding window common spatial pattern for enhancing motor imagery classification in EEG-BCI. <italic toggle="yes">IEEE Trans. Instrum. Meas.</italic><bold>70</bold>, 1–9 (2021).33776080
</mixed-citation></citation-alternatives></ref><ref id="CR10"><label>10.</label><citation-alternatives><element-citation id="ec-CR10" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Rong</surname><given-names>F</given-names></name><name name-style="western"><surname>Yang</surname><given-names>B</given-names></name><name name-style="western"><surname>Guan</surname><given-names>C</given-names></name></person-group><article-title>Decoding multi-class motor imagery from unilateral limbs using EEG signals</article-title><source>IEEE Trans. Neural Syst. Rehabil. Eng.</source><year>2024</year><volume>32</volume><fpage>3399</fpage><lpage>3409</lpage><pub-id pub-id-type="pmid">39236133</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1109/TNSRE.2024.3454088</pub-id></element-citation><mixed-citation id="mc-CR10" publication-type="journal">Rong, F., Yang, B. &amp; Guan, C. Decoding multi-class motor imagery from unilateral limbs using EEG signals. <italic toggle="yes">IEEE Trans. Neural Syst. Rehabil. Eng.</italic><bold>32</bold>, 3399–3409 (2024).<pub-id pub-id-type="pmid">39236133</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1109/TNSRE.2024.3454088</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR11"><label>11.</label><citation-alternatives><element-citation id="ec-CR11" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Benzy</surname><given-names>VK</given-names></name><name name-style="western"><surname>Vinod</surname><given-names>AP</given-names></name><name name-style="western"><surname>Subasree</surname><given-names>R</given-names></name><name name-style="western"><surname>Alladi</surname><given-names>S</given-names></name><name name-style="western"><surname>Raghavendra</surname><given-names>K</given-names></name></person-group><article-title>Motor imagery hand movement direction decoding using brain computer interface to aid stroke recovery and rehabilitation</article-title><source>IEEE Trans. Neural Syst. Rehabil. Eng.</source><year>2020</year><volume>28</volume><fpage>3051</fpage><lpage>3062</lpage><pub-id pub-id-type="pmid">33211662</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1109/TNSRE.2020.3039331</pub-id></element-citation><mixed-citation id="mc-CR11" publication-type="journal">Benzy, V. K., Vinod, A. P., Subasree, R., Alladi, S. &amp; Raghavendra, K. Motor imagery hand movement direction decoding using brain computer interface to aid stroke recovery and rehabilitation. <italic toggle="yes">IEEE Trans. Neural Syst. Rehabil. Eng.</italic><bold>28</bold>, 3051–3062 (2020).<pub-id pub-id-type="pmid">33211662</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1109/TNSRE.2020.3039331</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR12"><label>12.</label><citation-alternatives><element-citation id="ec-CR12" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Khan</surname><given-names>MA</given-names></name><name name-style="western"><surname>Das</surname><given-names>R</given-names></name><name name-style="western"><surname>Iversen</surname><given-names>HK</given-names></name><name name-style="western"><surname>Puthusserypady</surname><given-names>S</given-names></name></person-group><article-title>Review on motor imagery based BCI systems for upper limb post-stroke neurorehabilitation: From designing to application</article-title><source>Comput. Biol. Med.</source><year>2020</year><volume>123</volume><fpage>103843</fpage><pub-id pub-id-type="pmid">32768038</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1016/j.compbiomed.2020.103843</pub-id></element-citation><mixed-citation id="mc-CR12" publication-type="journal">Khan, M. A., Das, R., Iversen, H. K. &amp; Puthusserypady, S. Review on motor imagery based BCI systems for upper limb post-stroke neurorehabilitation: From designing to application. <italic toggle="yes">Comput. Biol. Med.</italic><bold>123</bold>, 103843 (2020).<pub-id pub-id-type="pmid">32768038</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1016/j.compbiomed.2020.103843</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR13"><label>13.</label><citation-alternatives><element-citation id="ec-CR13" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Lee</surname><given-names>M</given-names></name><name name-style="western"><surname>Kim</surname><given-names>YH</given-names></name><name name-style="western"><surname>Lee</surname><given-names>SW</given-names></name></person-group><article-title>Motor impairment in stroke patients is associated with network properties during consecutive motor imagery</article-title><source>IEEE Trans. Biomed. Eng.</source><year>2022</year><volume>69</volume><fpage>2604</fpage><lpage>2615</lpage><pub-id pub-id-type="pmid">35171761</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1109/TBME.2022.3151742</pub-id></element-citation><mixed-citation id="mc-CR13" publication-type="journal">Lee, M., Kim, Y. H. &amp; Lee, S. W. Motor impairment in stroke patients is associated with network properties during consecutive motor imagery. <italic toggle="yes">IEEE Trans. Biomed. Eng.</italic><bold>69</bold>, 2604–2615 (2022).<pub-id pub-id-type="pmid">35171761</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1109/TBME.2022.3151742</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR14"><label>14.</label><mixed-citation publication-type="other">Leeb, R., Brunner, C., Müller-Putz, G. R., Schlogl, A. &amp; Pfurtscheller, G. BCI competition 2008–Graz data set B. Graz University of Technology, Austria. <bold>16</bold>, 1–6 (2008).</mixed-citation></ref><ref id="CR15"><label>15.</label><citation-alternatives><element-citation id="ec-CR15" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Lee</surname><given-names>MH</given-names></name><etal/></person-group><article-title>EEG dataset and OpenBMI toolbox for three BCI paradigms: An investigation into BCI illiteracy</article-title><source>GigaScience.</source><year>2019</year><volume>8</volume><fpage>giz002</fpage><pub-id pub-id-type="pmid">30698704</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1093/gigascience/giz002</pub-id><pub-id pub-id-type="pmcid">PMC6501944</pub-id></element-citation><mixed-citation id="mc-CR15" publication-type="journal">Lee, M. H. <italic toggle="yes">et al</italic>. EEG dataset and OpenBMI toolbox for three BCI paradigms: An investigation into BCI illiteracy. <italic toggle="yes">GigaScience.</italic><bold>8</bold>, giz002 (2019).<pub-id pub-id-type="pmid">30698704</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1093/gigascience/giz002</pub-id><pub-id pub-id-type="pmcid">PMC6501944</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR16"><label>16.</label><mixed-citation publication-type="other">Mane, R. <italic toggle="yes">et al</italic>. FBCNet: A multi-view convolutional neural network for brain-computer interface. Preprint at 10.48550/arXiv.2104.01233 (2021).</mixed-citation></ref><ref id="CR17"><label>17.</label><citation-alternatives><element-citation id="ec-CR17" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Brunner</surname><given-names>C</given-names></name><name name-style="western"><surname>Leeb</surname><given-names>R</given-names></name><name name-style="western"><surname>Müller-Putz</surname><given-names>GR</given-names></name><name name-style="western"><surname>Schlogl</surname><given-names>A</given-names></name><name name-style="western"><surname>Pfurtscheller</surname><given-names>G</given-names></name></person-group><article-title>BCI Competition 2008–Graz data set A</article-title><source>Institute for knowledge discovery (laboratory of brain-computer interfaces), Graz University of Technology.</source><year>2008</year><volume>16</volume><fpage>1</fpage><lpage>6</lpage></element-citation><mixed-citation id="mc-CR17" publication-type="journal">Brunner, C., Leeb, R., Müller-Putz, G. R., Schlogl, A. &amp; Pfurtscheller, G. BCI Competition 2008–Graz data set A. <italic toggle="yes">Institute for knowledge discovery (laboratory of brain-computer interfaces), Graz University of Technology.</italic><bold>16</bold>, 1–6 (2008).</mixed-citation></citation-alternatives></ref><ref id="CR18"><label>18.</label><citation-alternatives><element-citation id="ec-CR18" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Zhang</surname><given-names>K</given-names></name><name name-style="western"><surname>Robinson</surname><given-names>N</given-names></name><name name-style="western"><surname>Lee</surname><given-names>S-W</given-names></name><name name-style="western"><surname>Guan</surname><given-names>C</given-names></name></person-group><article-title>Adaptive transfer learning for EEG motor imagery classification with deep Convolutional Neural Network</article-title><source>Neural Netw.</source><year>2021</year><volume>136</volume><fpage>1</fpage><pub-id pub-id-type="pmid">33401114</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1016/j.neunet.2020.12.013</pub-id></element-citation><mixed-citation id="mc-CR18" publication-type="journal">Zhang, K., Robinson, N., Lee, S.-W. &amp; Guan, C. Adaptive transfer learning for EEG motor imagery classification with deep Convolutional Neural Network. <italic toggle="yes">Neural Netw.</italic><bold>136</bold>, 1 (2021).<pub-id pub-id-type="pmid">33401114</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1016/j.neunet.2020.12.013</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR19"><label>19.</label><citation-alternatives><element-citation id="ec-CR19" publication-type="data"><name name-style="western"><surname>Yang</surname><given-names>B</given-names></name><name name-style="western"><surname>Fenqi</surname><given-names>R</given-names></name><year>2023</year><data-title>Source code for: WBCIC-SHU motor imagery dataset</data-title><source>Figshare</source><pub-id pub-id-type="doi">10.25452/figshare.plus.22671172</pub-id></element-citation><mixed-citation id="mc-CR19" publication-type="data">Yang, B. &amp; Fenqi, R. Source code for: WBCIC-SHU motor imagery dataset. <italic toggle="yes">Figshare</italic>10.25452/figshare.plus.22671172 (2023).</mixed-citation></citation-alternatives></ref><ref id="CR20"><label>20.</label><citation-alternatives><element-citation id="ec-CR20" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Sadiq</surname><given-names>MT</given-names></name><etal/></person-group><article-title>A matrix determinant feature extraction approach for decoding motor and mental imagery EEG in subject-specific tasks</article-title><source>IEEE Trans. Cogn. Dev. Syst.</source><year>2020</year><volume>14</volume><issue>2</issue><fpage>375</fpage><lpage>387</lpage></element-citation><mixed-citation id="mc-CR20" publication-type="journal">Sadiq, M. T. <italic toggle="yes">et al</italic>. A matrix determinant feature extraction approach for decoding motor and mental imagery EEG in subject-specific tasks. <italic toggle="yes">IEEE Trans. Cogn. Dev. Syst.</italic><bold>14</bold>(2), 375–387 (2020).</mixed-citation></citation-alternatives></ref><ref id="CR21"><label>21.</label><citation-alternatives><element-citation id="ec-CR21" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Kwon</surname><given-names>OY</given-names></name><name name-style="western"><surname>Lee</surname><given-names>MH</given-names></name><name name-style="western"><surname>Guan</surname><given-names>C</given-names></name><name name-style="western"><surname>Lee</surname><given-names>SW</given-names></name></person-group><article-title>Subject-independent brain–computer interfaces based on deep convolutional neural networks</article-title><source>IEEE Trans. Cogn. Dev. Syst.</source><year>2019</year><volume>31</volume><fpage>3839</fpage><lpage>3852</lpage><pub-id pub-id-type="doi" assigning-authority="pmc">10.1109/TNNLS.2019.2946869</pub-id><pub-id pub-id-type="pmid">31725394</pub-id></element-citation><mixed-citation id="mc-CR21" publication-type="journal">Kwon, O. Y., Lee, M. H., Guan, C. &amp; Lee, S. W. Subject-independent brain–computer interfaces based on deep convolutional neural networks. <italic toggle="yes">IEEE Trans. Cogn. Dev. Syst.</italic><bold>31</bold>, 3839–3852 (2019).<pub-id pub-id-type="doi" assigning-authority="pmc">10.1109/TNNLS.2019.2946869</pub-id><pub-id pub-id-type="pmid">31725394</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR22"><label>22.</label><mixed-citation publication-type="other">Zhang, S. <italic toggle="yes">et al</italic>. Online adaptive CNN: A session-to-session transfer learning approach for non-stationary EEG. <italic toggle="yes">2022 IEEE Symp. Ser. Comput. Intell. (SSCI)</italic>. 164–170 (2022).</mixed-citation></ref><ref id="CR23"><label>23.</label><citation-alternatives><element-citation id="ec-CR23" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Fan</surname><given-names>Z</given-names></name><etal/></person-group><article-title>Joint filter-band-combination and multi-view CNN for electroencephalogram decoding</article-title><source>IEEE Trans. Neural Syst. Rehabil. Eng.</source><year>2023</year><volume>31</volume><fpage>2101</fpage><lpage>2110</lpage><pub-id pub-id-type="pmid">37083516</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1109/TNSRE.2023.3269055</pub-id></element-citation><mixed-citation id="mc-CR23" publication-type="journal">Fan, Z. <italic toggle="yes">et al</italic>. Joint filter-band-combination and multi-view CNN for electroencephalogram decoding. <italic toggle="yes">IEEE Trans. Neural Syst. Rehabil. Eng.</italic><bold>31</bold>, 2101–2110 (2023).<pub-id pub-id-type="pmid">37083516</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1109/TNSRE.2023.3269055</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR24"><label>24.</label><citation-alternatives><element-citation id="ec-CR24" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Wang</surname><given-names>J</given-names></name><name name-style="western"><surname>Cheng</surname><given-names>S</given-names></name><name name-style="western"><surname>Tian</surname><given-names>J</given-names></name><name name-style="western"><surname>Gao</surname><given-names>Y</given-names></name></person-group><article-title>A 2d CNN-LSTM hybrid algorithm using time series segments of EEG data for motor imagery classification</article-title><source>Biomed. Signal Process. Control.</source><year>2023</year><volume>83</volume><fpage>104627</fpage></element-citation><mixed-citation id="mc-CR24" publication-type="journal">Wang, J., Cheng, S., Tian, J. &amp; Gao, Y. A 2d CNN-LSTM hybrid algorithm using time series segments of EEG data for motor imagery classification. <italic toggle="yes">Biomed. Signal Process. Control.</italic><bold>83</bold>, 104627 (2023).</mixed-citation></citation-alternatives></ref><ref id="CR25"><label>25.</label><citation-alternatives><element-citation id="ec-CR25" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Cui</surname><given-names>Y</given-names></name><etal/></person-group><article-title>Lder: A classification framework based on ERP enhancement in RSVP task</article-title><source>J. Neural Eng.</source><year>2023</year><volume>20</volume><fpage>036029</fpage><pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2552/acd95d</pub-id><pub-id pub-id-type="pmid">37236176</pub-id></element-citation><mixed-citation id="mc-CR25" publication-type="journal">Cui, Y. <italic toggle="yes">et al</italic>. Lder: A classification framework based on ERP enhancement in RSVP task. <italic toggle="yes">J. Neural Eng.</italic><bold>20</bold>, 036029 (2023).<pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2552/acd95d</pub-id><pub-id pub-id-type="pmid">37236176</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR26"><label>26.</label><mixed-citation publication-type="other">van Steenbergen, H., Spapé, R. &amp; Verdonschot, M. The E-Primer: An Introduction to Creating Psychological Experiments in E-Prime (2019).</mixed-citation></ref><ref id="CR27"><label>27.</label><citation-alternatives><element-citation id="ec-CR27" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Pernet</surname><given-names>CR</given-names></name><etal/></person-group><article-title>EEG-BIDS, an extension to the brain imaging data structure for electroencephalography</article-title><source>Sci. Data</source><year>2019</year><volume>6</volume><fpage>103</fpage><pub-id pub-id-type="pmid">31239435</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1038/s41597-019-0104-8</pub-id><pub-id pub-id-type="pmcid">PMC6592877</pub-id></element-citation><mixed-citation id="mc-CR27" publication-type="journal">Pernet, C. R. <italic toggle="yes">et al</italic>. EEG-BIDS, an extension to the brain imaging data structure for electroencephalography. <italic toggle="yes">Sci. Data</italic><bold>6</bold>, 103 (2019).<pub-id pub-id-type="pmid">31239435</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1038/s41597-019-0104-8</pub-id><pub-id pub-id-type="pmcid">PMC6592877</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR28"><label>28.</label><citation-alternatives><element-citation id="ec-CR28" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Pfurtscheller</surname><given-names>G</given-names></name><name name-style="western"><surname>Neuper</surname><given-names>C</given-names></name><name name-style="western"><surname>Andrew</surname><given-names>C</given-names></name><name name-style="western"><surname>Edlinger</surname><given-names>G</given-names></name></person-group><article-title>Foot and hand area mu rhythms</article-title><source>Int. J. Psychophysiol.</source><year>1997</year><volume>26</volume><fpage>121</fpage><lpage>135</lpage><pub-id pub-id-type="pmid">9202999</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1016/s0167-8760(97)00760-5</pub-id></element-citation><mixed-citation id="mc-CR28" publication-type="journal">Pfurtscheller, G., Neuper, C., Andrew, C. &amp; Edlinger, G. Foot and hand area mu rhythms. <italic toggle="yes">Int. J. Psychophysiol.</italic><bold>26</bold>, 121–135 (1997).<pub-id pub-id-type="pmid">9202999</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1016/s0167-8760(97)00760-5</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR29"><label>29.</label><citation-alternatives><element-citation id="ec-CR29" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Baniqued</surname><given-names>PDE</given-names></name><etal/></person-group><article-title>Brain–computer interface robotics for hand rehabilitation after stroke: a systematic review</article-title><source>J. NeuroEngineering Rehabil.</source><year>2021</year><volume>18</volume><fpage>1</fpage><lpage>25</lpage><pub-id pub-id-type="doi" assigning-authority="pmc">10.1186/s12984-021-00820-8</pub-id><pub-id pub-id-type="pmcid">PMC7825186</pub-id><pub-id pub-id-type="pmid">33485365</pub-id></element-citation><mixed-citation id="mc-CR29" publication-type="journal">Baniqued, P. D. E. <italic toggle="yes">et al</italic>. Brain–computer interface robotics for hand rehabilitation after stroke: a systematic review. <italic toggle="yes">J. NeuroEngineering Rehabil.</italic><bold>18</bold>, 1–25 (2021).<pub-id pub-id-type="doi" assigning-authority="pmc">10.1186/s12984-021-00820-8</pub-id><pub-id pub-id-type="pmcid">PMC7825186</pub-id><pub-id pub-id-type="pmid">33485365</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR30"><label>30.</label><citation-alternatives><element-citation id="ec-CR30" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Grosse-Wentrup</surname><given-names>M</given-names></name><name name-style="western"><surname>Schölkopf</surname><given-names>B</given-names></name></person-group><article-title>High gamma-power predicts performance in sensorimotor-rhythm brain–computer interfaces</article-title><source>J. Neural Eng.</source><year>2012</year><volume>9</volume><fpage>046001</fpage><pub-id pub-id-type="pmid">22713543</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2560/9/4/046001</pub-id></element-citation><mixed-citation id="mc-CR30" publication-type="journal">Grosse-Wentrup, M. &amp; Schölkopf, B. High gamma-power predicts performance in sensorimotor-rhythm brain–computer interfaces. <italic toggle="yes">J. Neural Eng.</italic><bold>9</bold>, 046001 (2012).<pub-id pub-id-type="pmid">22713543</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2560/9/4/046001</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR31"><label>31.</label><citation-alternatives><element-citation id="ec-CR31" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Zhang</surname><given-names>Z</given-names></name><name name-style="western"><surname>Koike</surname><given-names>Y</given-names></name></person-group><article-title>Clustered event related spectral perturbation (ERSP) feature in right hand motor imagery classification</article-title><source>Front. Neurosci.</source><year>2022</year><volume>16</volume><fpage>867480</fpage><pub-id pub-id-type="pmid">36051649</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.3389/fnins.2022.867480</pub-id><pub-id pub-id-type="pmcid">PMC9424899</pub-id></element-citation><mixed-citation id="mc-CR31" publication-type="journal">Zhang, Z. &amp; Koike, Y. Clustered event related spectral perturbation (ERSP) feature in right hand motor imagery classification. <italic toggle="yes">Front. Neurosci.</italic><bold>16</bold>, 867480 (2022).<pub-id pub-id-type="pmid">36051649</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.3389/fnins.2022.867480</pub-id><pub-id pub-id-type="pmcid">PMC9424899</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR32"><label>32.</label><citation-alternatives><element-citation id="ec-CR32" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Fushiki</surname><given-names>T</given-names></name></person-group><article-title>Estimation of prediction error by using k-fold cross-validation</article-title><source>Stat. Comput.</source><year>2011</year><volume>21</volume><fpage>137</fpage><lpage>146</lpage></element-citation><mixed-citation id="mc-CR32" publication-type="journal">Fushiki, T. Estimation of prediction error by using k-fold cross-validation. <italic toggle="yes">Stat. Comput.</italic><bold>21</bold>, 137–146 (2011).</mixed-citation></citation-alternatives></ref><ref id="CR33"><label>33.</label><mixed-citation publication-type="other">Ang, K. K., Chin, Z. Y., Zhang, H. &amp; Guan, C. Filter bank common spatial pattern (FBCSP) in brain-computer interface. <italic toggle="yes">2008 IEEE Int. Joint Conf. Neural Networks</italic>. 2390–2397 (2008).</mixed-citation></ref><ref id="CR34"><label>34.</label><citation-alternatives><element-citation id="ec-CR34" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>An</surname><given-names>Y</given-names></name><name name-style="western"><surname>Lam</surname><given-names>HK</given-names></name><name name-style="western"><surname>Ling</surname><given-names>SH</given-names></name></person-group><article-title>Multi-classification for EEG motor imagery signals using data evaluation-based auto-selected regularized FBCSP and convolutional neural network</article-title><source>Neural Comput. Appl.</source><year>2023</year><volume>35</volume><fpage>12001</fpage><lpage>12027</lpage></element-citation><mixed-citation id="mc-CR34" publication-type="journal">An, Y., Lam, H. K. &amp; Ling, S. H. Multi-classification for EEG motor imagery signals using data evaluation-based auto-selected regularized FBCSP and convolutional neural network. <italic toggle="yes">Neural Comput. Appl.</italic><bold>35</bold>, 12001–12027 (2023).</mixed-citation></citation-alternatives></ref><ref id="CR35"><label>35.</label><mixed-citation publication-type="other">Robinson, N., Lee, S.-W. &amp; Guan, C. EEG representation in deep convolutional neural networks for classification of motor imagery. <italic toggle="yes">2019 IEEE Int. Conf. Syst. Man Cybern</italic>. 1322–1326 (2019).</mixed-citation></ref><ref id="CR36"><label>36.</label><citation-alternatives><element-citation id="ec-CR36" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Schirrmeister</surname><given-names>RT</given-names></name><etal/></person-group><article-title>Deep learning with convolutional neural networks for EEG decoding and visualization</article-title><source>Hum. Brain Mapp.</source><year>2017</year><volume>38</volume><fpage>5391</fpage><lpage>5420</lpage><pub-id pub-id-type="pmid">28782865</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1002/hbm.23730</pub-id><pub-id pub-id-type="pmcid">PMC5655781</pub-id></element-citation><mixed-citation id="mc-CR36" publication-type="journal">Schirrmeister, R. T. <italic toggle="yes">et al</italic>. Deep learning with convolutional neural networks for EEG decoding and visualization. <italic toggle="yes">Hum. Brain Mapp.</italic><bold>38</bold>, 5391–5420 (2017).<pub-id pub-id-type="pmid">28782865</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1002/hbm.23730</pub-id><pub-id pub-id-type="pmcid">PMC5655781</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR37"><label>37.</label><citation-alternatives><element-citation id="ec-CR37" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Lawhern</surname><given-names>VJ</given-names></name><etal/></person-group><article-title>EEGNet: a compact convolutional neural network for EEG-based brain–computer interfaces</article-title><source>J. Neural Eng.</source><year>2018</year><volume>15</volume><fpage>056013</fpage><pub-id pub-id-type="pmid">29932424</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2552/aace8c</pub-id></element-citation><mixed-citation id="mc-CR37" publication-type="journal">Lawhern, V. J. <italic toggle="yes">et al</italic>. EEGNet: a compact convolutional neural network for EEG-based brain–computer interfaces. <italic toggle="yes">J. Neural Eng.</italic><bold>15</bold>, 056013 (2018).<pub-id pub-id-type="pmid">29932424</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1088/1741-2552/aace8c</pub-id></mixed-citation></citation-alternatives></ref><ref id="CR38"><label>38.</label><citation-alternatives><element-citation id="ec-CR38" publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Combrisson</surname><given-names>E</given-names></name><name name-style="western"><surname>Jerbi</surname><given-names>K</given-names></name></person-group><article-title>Exceeding chance level by chance: The caveat of theoretical chance levels in brain signal classification and statistical assessment of decoding accuracy</article-title><source>J. Neurosci. Methods.</source><year>2015</year><volume>250</volume><fpage>126</fpage><lpage>136</lpage><pub-id pub-id-type="pmid">25596422</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1016/j.jneumeth.2015.01.010</pub-id></element-citation><mixed-citation id="mc-CR38" publication-type="journal">Combrisson, E. &amp; Jerbi, K. Exceeding chance level by chance: The caveat of theoretical chance levels in brain signal classification and statistical assessment of decoding accuracy. <italic toggle="yes">J. Neurosci. Methods.</italic><bold>250</bold>, 126–136 (2015).<pub-id pub-id-type="pmid">25596422</pub-id>
<pub-id pub-id-type="doi" assigning-authority="pmc">10.1016/j.jneumeth.2015.01.010</pub-id></mixed-citation></citation-alternatives></ref></ref-list></back></article>