<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Neurosci.</journal-id>
<journal-title>Frontiers in Neuroscience</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Neurosci.</abbrev-journal-title>
<issn pub-type="epub">1662-453X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fnins.2021.760979</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Neuroscience</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>A Generalizable and Discriminative Learning Method for Deep EEG-Based Motor Imagery Classification</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Huang</surname> <given-names>Xiuyu</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1096150/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Zhou</surname> <given-names>Nan</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1505150/overview"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Choi</surname> <given-names>Kup-Sze</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="corresp" rid="c002"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1128066/overview"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Centre for Smart Health, The Hong Kong Polytechnic University, Hong Kong</institution>, <addr-line>Hong Kong SAR</addr-line>, <country>China</country></aff>
<aff id="aff2"><sup>2</sup><institution>College of Control Engineering, Chengdu University of Information Technology</institution>, <addr-line>Chengdu</addr-line>, <country>China</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Yuanpeng Zhang, Nantong University, China</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Hongru Zhao, Soochow University, China; Yufeng Yao, Changshu Institute of Technology, China</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Xiuyu Huang <email>xiuyu.huang&#x00040;connect.polyu.hk</email></corresp>
<corresp id="c002">Kup-Sze Choi <email>thomasks.choi&#x00040;polyu.edu.hk</email></corresp>
<fn fn-type="other" id="fn001"><p>This article was submitted to Brain Imaging Methods, a section of the journal Frontiers in Neuroscience</p></fn></author-notes>
<pub-date pub-type="epub">
<day>22</day>
<month>10</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="collection">
<year>2021</year>
</pub-date>
<volume>15</volume>
<elocation-id>760979</elocation-id>
<history>
<date date-type="received">
<day>19</day>
<month>08</month>
<year>2021</year>
</date>
<date date-type="accepted">
<day>06</day>
<month>09</month>
<year>2021</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2021 Huang, Zhou and Choi.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Huang, Zhou and Choi</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license> 
</permissions>
<abstract><p>Convolutional neural networks (CNNs) have been widely applied to the motor imagery (MI) classification field, significantly improving the state-of-the-art (SoA) performance in terms of classification accuracy. Although innovative model structures are thoroughly explored, little attention was drawn toward the objective function. In most of the available CNNs in the MI area, the standard cross-entropy loss is usually performed as the objective function, which only ensures deep feature separability. Corresponding to the limitation of current objective functions, a new loss function with a combination of smoothed cross-entropy (with label smoothing) and center loss is proposed as the supervision signal for the model in the MI recognition task. Specifically, the smoothed cross-entropy is calculated by the entropy between the predicted labels and the one-hot hard labels regularized by a noise of uniform distribution. The center loss learns a deep feature center for each class and minimizes the distance between deep features and their corresponding centers. The proposed loss tries to optimize the model in two learning objectives, preventing overconfident predictions and increasing deep feature discriminative capacity (interclass separability and intraclass invariant), which guarantee the effectiveness of MI recognition models. We conduct extensive experiments on two well-known benchmarks (BCI competition IV-2a and IV-2b) to evaluate our method. The result indicates that the proposed approach achieves better performance than other SoA models on both datasets. The proposed learning scheme offers a more robust optimization for the CNN model in the MI classification task, simultaneously decreasing the risk of overfitting and increasing the discriminative power of deeply learned features.</p></abstract>
<kwd-group>
<kwd>electroencephalogram</kwd>
<kwd>motor imagery</kwd>
<kwd>convolutional neural networks</kwd>
<kwd>label smoothing</kwd>
<kwd>center loss</kwd>
</kwd-group>
<counts>
<fig-count count="4"/>
<table-count count="7"/>
<equation-count count="9"/>
<ref-count count="40"/>
<page-count count="10"/>
<word-count count="6620"/>
</counts>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1. Introduction</title>
<p>Brain&#x02013;computer interface (BCI) has been raising interest from the research community. It provides an important way for the disabled to interact with the outside world without using any muscular movements (Wolpaw et al., <xref ref-type="bibr" rid="B34">2002</xref>). This technology aims to recognize the user intentions based on the distinct patterns of neural events. Motor imagery (MI) is one of the crucial topics in the area of BCI, referring to a cognitive procedure of the motion imagination such as lifting left or right leg, without any actual moving actions (Ahn and Jun, <xref ref-type="bibr" rid="B1">2015</xref>). The most popular technology to signalize such cognitive procedures is the electroencephalogram (EEG), being noninvasive and relatively easy to set up (Ahn and Jun, <xref ref-type="bibr" rid="B1">2015</xref>; Ni et al., <xref ref-type="bibr" rid="B20">2020</xref>; Zhang et al., <xref ref-type="bibr" rid="B37">2020</xref>). The principle of the EEG-based MI-BCI system is to match the type of motion imagination and its corresponding EEG signals. Such matching systems have been practiced in a variety of applications, including speller (Rezeika et al., <xref ref-type="bibr" rid="B23">2018</xref>), wheelchair (Kaufmann et al., <xref ref-type="bibr" rid="B12">2014</xref>), and prosthesis (Vidaurre et al., <xref ref-type="bibr" rid="B31">2016</xref>).</p>
<p>Accurate classification of EEG-MI pattern is one of the most decisive factors to the BCI performance but remains a significant challenge due to the low signal-to-noise ratio (SNR) characteristics of the EEG signal (Goldenholz et al., <xref ref-type="bibr" rid="B7">2009</xref>; Zhang et al., <xref ref-type="bibr" rid="B36">2019</xref>). Convolutional neural networks (CNNs) have been widely explored and achieved great success in the MI recognition area (Bashivan et al., <xref ref-type="bibr" rid="B3">2015</xref>; Roy et al., <xref ref-type="bibr" rid="B24">2019</xref>). It significantly pushes the boundary of the state-of-the-art (SoA) in classification accuracy compared to the conventional methods such as band power analysis (Martinez-Leon et al., <xref ref-type="bibr" rid="B18">2015</xref>), independent component analysis (ICA) (Lee et al., <xref ref-type="bibr" rid="B17">1999</xref>), and common spatial filter (CSP) (Ramoser et al., <xref ref-type="bibr" rid="B22">2000</xref>). The most common framework of CNN is to perform feature generation and label prediction, learning deep features from raw EEG data by the CNN pipeline, then making label predictions based on the learned features (see <xref ref-type="fig" rid="F1">Figure 1A</xref>).</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Illustration of the concepts in the study. <bold>(A)</bold> The common framework of convolutional neural network (CNN). <bold>(B)</bold> Label smoothing. <bold>(C)</bold> Deep feature distributions. The CE denotes the cross-entropy calculation. The &#x003B1; denotes the weight of the CE between predicted label and uniform distribution.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-15-760979-g0001.tif"/>
</fig>
<p>The training of CNNs in the MI classification task is mainly guided by minimizing the cross-entropy (Hertz et al., <xref ref-type="bibr" rid="B9">2018</xref>). This objective function is &#x0201C;greedy&#x0201D; and encourages the largest possible logit gaps, making the model less adaptive, and sometimes overconfident to its predictions (Szegedy et al., <xref ref-type="bibr" rid="B27">2016</xref>). The model learns to assign a full probability to the ground-truth label for each training example, even though some noisy data are mixed in the training set (M&#x000FC;ller et al., <xref ref-type="bibr" rid="B19">2019</xref>). This overfitting phenomenon incredibly easily occurs when the training sample size is small. Coincidentally, the EEG data have a low SNR and contains much noise. In addition, the MI-BCI system is usually designated as subject dependent, so it usually has limited training data. To reduce the risk of overfitting (overconfidence) issue, we adopt a label smoothing technique introduced by Szegedy et al. (<xref ref-type="bibr" rid="B27">2016</xref>) in the training scheme of the MI classification. It computes a modified cross-entropy, called smoothed cross-entropy, not by using &#x0201C;hard&#x0201D; one-hot encoded labels such as [0, 0, 1, 0] from training data, but a weighted mixture of these hard labels with the uniform distribution (<xref ref-type="fig" rid="F1">Figure 1B</xref>). Label smoothing alternatively encourages small logit gaps and prevent overconfident predictions. This technology has successfully increased the performance of CNN models across multiple tasks, including image classification (Szegedy et al., <xref ref-type="bibr" rid="B27">2016</xref>), speech recognition (Chorowski and Jaitly, <xref ref-type="bibr" rid="B5">2016</xref>), and machine translation (Vaswani et al., <xref ref-type="bibr" rid="B30">2017</xref>). It is expected to benefit the model training in MI classification by tackling the overfitting problem, leading to a generalizable and adaptive CNN model.</p>
<p>In addition to ensuring the model&#x00027;s generalizability, we also aim to increase its discriminative power. As shown in the common framework of CNN (<xref ref-type="fig" rid="F1">Figure 1A</xref>), the last fully connected layer acts as a linear classifier, and the cross-entropy only encourages the separability (Hertz et al., <xref ref-type="bibr" rid="B9">2018</xref>) but does not guarantee the high discriminative characteristics, where features have both a large inter-class difference and a tight intra-class variation (<xref ref-type="fig" rid="F1">Figure 1C</xref>). Therefore, the resulting features generated by the model trained via the cross-entropy are not sufficiently effective for the MI classification. To enhance the discriminative capacity of the deep features, we apply a center loss (Wen et al., <xref ref-type="bibr" rid="B32">2016</xref>) for the model training. Specifically, the center of deep features is computed by their means in each class and updated across every epoch. The distances between deep features with their corresponding class centers are minimized at each training iteration. The parameters are optimized by jointly minimizing the cross-entropy and center loss. Intuitively, the cross-entropy forces the deep features from different classes to stay apart, and the center loss pulls the features belonging to the same class toward their centers. With joint supervision, we can concurrently enlarge the inter-class difference and reduce the intra-class variation so as to improve the discriminative power of deep features.</p>
<p>In this paper, we propose a novel training scheme for CNN-based model in the MI classification by using a combined loss with smoothed cross-entropy and center loss. The main contributions are as follows:</p>
<list list-type="order">
<list-item><p>To our best knowledge, although structures of the CNN model are heavily investigated, this is the first attempt to use the proposed loss to help supervise training in the context of MI classification. With joint supervision of the smoothed cross-entropy and the center loss, both generalizable and discriminative model can be obtained for robust MI recognition.</p></list-item>
<list-item><p>We present extensive experiments on two famous MI public datasets, called BCI-competition IV-2a and IV-2b. Our new approach achieves superior performance compared to other SoA methods.</p></list-item>
<list-item><p>We also conduct an ablation study to demonstrate the effectiveness of the label smoothing and the center loss.</p></list-item>
</list>
<p>The remainder of the paper is organized as follows. In section 2, conventional and deep learning methods on MI classification are introduced. Section 3 describes the proposed approach. Sections 4 and 5 present the experiment result and analysis. Section 6 concludes the current study.</p></sec>
<sec id="s2">
<title>2. Related Works</title>
<p>A sophisticated feature extractor is the key to success in conventional methods for the MI classification task. One of the most frequently and widely used approaches is the common spatial pattern (CSP) (Pfurtscheller and Neuper, <xref ref-type="bibr" rid="B21">2001</xref>; Yu et al., <xref ref-type="bibr" rid="B35">2019</xref>). It tries to generate optimal spatial filters that have minimum or maximum variance between classes in a particular frequency band. The features used in the winner algorithm of the BCI competition IV are based on the filter bank CSP (FBCSP) (Ang et al., <xref ref-type="bibr" rid="B2">2008</xref>) that finds a set of optimal spatial filters in multiple frequency bands. The Naive Bayes Parzen Window classifier using these features achieved an outstanding classification performance with an accuracy of 67.75% on the dataset IV-2a (Ang et al., <xref ref-type="bibr" rid="B2">2008</xref>). After the competition, a novel method based on the support vector machine (SVM) with Riemannian covariance achieved a better performance (75.74%) for the same database (Hersche et al., <xref ref-type="bibr" rid="B8">2018</xref>). In addition to these vector-based methods, matrix-form strategies such as the logistics regression classifier with a nuclear norm regularization (Zhou and Li, <xref ref-type="bibr" rid="B40">2014</xref>), the rank-k SVM (Lal et al., <xref ref-type="bibr" rid="B15">2004</xref>), and the support matrix machine (SMM) (Zheng et al., <xref ref-type="bibr" rid="B39">2018</xref>) were also developed by multiple research groups. The leading edge of these methods is to directly process the 2-D MI EEG data on a matrix basis instead of stacking features as a vector input to a classifier, which preserves the informative structural patterns.</p>
<p>Deep learning (DL) models were also exploited to tackle the MI classification challenge. For instance, the multilayer perceptron (MLP) was proposed to generate nonlinear patterns from CSP features and also to substitute the SVM as a classifier for MI recognition (Kumar et al., <xref ref-type="bibr" rid="B14">2016</xref>). Similarly, a channel-wise convolution with channel mixing (C2CM) was introduced to classify the spatial-temporal features generated by FBCSP (Sakhavi et al., <xref ref-type="bibr" rid="B25">2018</xref>). Bashivan et al. (<xref ref-type="bibr" rid="B3">2015</xref>) converted the EEG waves into spectral topographies via short-time Fourier transform (STFT). These topographies were then fitted into CNNs for further transformation and classification. Tabar and Halici (<xref ref-type="bibr" rid="B28">2016</xref>) also used the STFT approach to extract spatial-temporal images as the feature input to the CNN-SAE model for classification. These feature input (FI) models still require complex feature generation from raw EEG data prior to the DL modeling. Several research groups investigate raw signal input (RSI) models to provide an end-to-end scheme for MI recognition to address this limitation. For example, the two most well-known RSI networks, EEGNet (Lawhern et al., <xref ref-type="bibr" rid="B16">2018</xref>), and ConvNet (Schirrmeister et al., <xref ref-type="bibr" rid="B26">2017</xref>), achieved competitive classification performance without using any pre-processing techniques. In general, although model architectures were heavily investigated, the neural network learning process did not receive too much attention from the MI community. Rather than figuring out a more sophisticated architecture, we propose a potentially efficient objective function for both generalizable and discriminative learning in the CNN-based model.</p></sec>
<sec id="s3">
<title>3. Method</title>
<p>This section first introduces the notations and definitions used in this work and describes the CNN architecture. Then, the novel proposed loss is presented in detail.</p>
<sec>
<title>3.1. Definition and Notations</title>
<p>Assuming that the DL model input is on a per-trial basis, where the continuous EEG is segmented into labeled trials, we define the segmented trials of a subject as <inline-formula><mml:math id="M1"><mml:msubsup><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mrow><mml:mo>[</mml:mo><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:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, where <inline-formula><mml:math id="M2"><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mi>&#x0211D;</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> represents <italic>ith</italic> of EEG trials recorded by <italic>E</italic> electrodes and <italic>T</italic> sampling time points. <inline-formula><mml:math id="M3"><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mi>&#x0211D;</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> denotes the corresponding <italic>i</italic><sup><italic>th</italic></sup> labels of <italic>M</italic> classes. Let the ground truth distribution <italic>p</italic> over labels <italic>p</italic>(<italic>y</italic>|<italic>x</italic><sub><italic>i</italic></sub>), and <inline-formula><mml:math id="M4"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover><mml:mi>p</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>. We also define a CNN-based model with &#x003B8; that predicts label distribution <italic>q</italic><sub>&#x003B8;</sub>(<italic>y</italic>|<italic>x</italic><sub><italic>i</italic></sub>), and certainly <inline-formula><mml:math id="M5"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mrow><mml:mi>q</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>. We are motivated to adopt the label smoothing technology and center loss to improve the generalizable and discriminative power of the CNN-based model.</p></sec>
<sec>
<title>3.2. Network Architecture</title>
<p>In the current study, we inherit the CNN architecture of the EEGNet (Lawhern et al., <xref ref-type="bibr" rid="B16">2018</xref>) but make two modifications, where the kernel size of the first temporal CNN filter (<italic>LA</italic><sup>1</sup>) is decreased to attain temporal information above 8 Hz, as the alpha (8&#x02013;12 Hz) and beta (12.5&#x02013;30 Hz) band contain most relevant information of the motor imagery task (Wierzga&#x00142;a et al., <xref ref-type="bibr" rid="B33">2018</xref>). The illustration of the network is displayed in <xref ref-type="fig" rid="F2">Figure 2</xref>, and the details of each layer are presented in <xref ref-type="table" rid="T1">Table 1</xref>. The model begins with a 2D-CNN directly linked to the raw EEG data with a kernel size in (<italic>K</italic><sub>1</sub>, 1) to capture temporal patterns in each electrode. A depthwise convolution layer with a kernel size of (1, <italic>E</italic>) is followed and utilized for spatial feature extraction. The separableConv2D with a kernel size in (<italic>K</italic><sub>2</sub>,1) is then performed to gain deeper and more abstract temporal information across all electrodes. As shown in <xref ref-type="table" rid="T1">Table 1</xref>, it is noted that batch normalization (Ioffe and Szegedy, <xref ref-type="bibr" rid="B10">2015</xref>), exponential linear unit (ELU) (Clevert et al., <xref ref-type="bibr" rid="B6">2015</xref>) activation, and average pooling are sequentially followed after some of these convolutions for covariate shift avoidance (Bickel et al., <xref ref-type="bibr" rid="B4">2009</xref>), nonlinear transformation, and dimension reduction, respectively. The deep feature generated by the CNN pipeline is then flattened as a vector (nodes) by a flatten layer. The vectors of each training batch are used to compute the center loss. The dense layer is subsequently connected to these nodes and acts as a classifier. The <italic>softmax</italic> function finally performs the estimation of the probability for each MI class. The cross-entropy between the probability estimation and the smoothed label represents the classification loss (standard cross-entropy &#x0002B; label smoothing regularization). The weighted sum of the classification and center losses supervises the training of the entire network.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>Illustration of the convolutional neural network (CNN)-based model. <italic>T</italic> = number of the timestamps, <italic>E</italic> = number of electricodes, <italic>F</italic><sub>1</sub> = number of filters in the temporal CNN, <italic>D</italic> = number of depthwise convolution output channels, <italic>F</italic><sub>2</sub> = number of spatial filters, <italic>P</italic><sub>1</sub> and <italic>P</italic><sub>2</sub> are sizes of the average pooling kernel, and &#x003B1;<sub><italic>lsr</italic></sub> and &#x003B1;<sub><italic>ct</italic></sub> are weights of label smoothing regularization and center loss.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-15-760979-g0002.tif"/>
</fig>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Architecture setting.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th valign="top" align="left"><bold>Layer</bold></th>
<th valign="top" align="left"><bold>Function</bold></th>
<th valign="top" align="left"><bold>Filter</bold></th>
<th valign="top" align="left"><bold>Kernel</bold></th>
<th valign="top" align="left"><bold>Output shape</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left"><italic>LA</italic><sup>1</sup></td>
<td valign="top" align="left">Input</td>
<td/>
<td/>
<td valign="top" align="left"><italic>T, E</italic>, 1</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">Conv2d</td>
<td valign="top" align="left"><italic>F</italic><sub>1</sub></td>
<td valign="top" align="left">(<italic>K</italic><sub>1</sub>, 1)</td>
<td valign="top" align="left"><italic>T, C, F</italic><sub>1</sub></td>
</tr>
<tr>
<td/>
<td valign="top" align="left">BatchNorm</td>
<td/>
<td/>
<td/>
</tr>
<tr>
<td valign="top" align="left"><italic>LA</italic><sup>2</sup></td>
<td valign="top" align="left">DepthwiseConv2d</td>
<td valign="top" align="left"><italic>F</italic><sub>1</sub>&#x0002A;<italic>D</italic></td>
<td valign="top" align="left">(1, <italic>E</italic>)</td>
<td valign="top" align="left"><italic>T</italic>, 1, <italic>F</italic><sub>1</sub>&#x0002A;<italic>D</italic></td>
</tr>
<tr>
<td/>
<td valign="top" align="left">BatchNorm</td>
<td/>
<td/>
<td/>
</tr>
<tr>
<td/>
<td valign="top" align="left">ELU Activation</td>
<td/>
<td/>
<td/>
</tr>
<tr>
<td/>
<td valign="top" align="left">Average pooling</td>
<td/>
<td valign="top" align="left">(<italic>P</italic><sub>1</sub>, 1)</td>
<td valign="top" align="left"><italic>T</italic>/<italic>P</italic><sub>1</sub>, 1, <italic>F</italic><sub>1</sub>&#x0002A;<italic>D</italic></td>
</tr>
<tr>
<td valign="top" align="left"><italic>LA</italic><sup>3</sup></td>
<td valign="top" align="left">SparableConv2d</td>
<td valign="top" align="left"><italic>F</italic><sub>2</sub></td>
<td valign="top" align="left">(<italic>K</italic><sub>2</sub>, 1)</td>
<td valign="top" align="left"><italic>T</italic>/<italic>P</italic><sub>1</sub>, 1, <italic>F</italic><sub>2</sub></td>
</tr>
<tr>
<td/>
<td valign="top" align="left">BatchNorm</td>
<td/>
<td/>
<td/>
</tr>
<tr>
<td/>
<td valign="top" align="left">ELU Activation</td>
<td/>
<td/>
<td/>
</tr>
<tr>
<td/>
<td valign="top" align="left">Average pooling</td>
<td/>
<td valign="top" align="left">(<italic>P</italic><sub>2</sub>, 1)</td>
<td valign="top" align="left"><italic>T</italic>/(<italic>P</italic><sub>1</sub>&#x0002A;<italic>P</italic><sub>2</sub>), 1, <italic>F</italic><sub>2</sub></td>
</tr>
<tr>
<td valign="top" align="left"><italic>LA</italic><sup>4</sup></td>
<td valign="top" align="left">Flatten</td>
<td/>
<td/>
<td valign="top" align="left">(<italic>T</italic>&#x0002A;<italic>F</italic><sub>2</sub>)/(<italic>P</italic><sub>1</sub>&#x0002A;<italic>P</italic><sub>2</sub>)</td>
</tr>
<tr>
<td valign="top" align="left"><italic>LA</italic><sup>5</sup></td>
<td valign="top" align="left">Fully connected</td>
<td/>
<td/>
<td valign="top" align="left"><italic>number of classes</italic></td>
</tr>
<tr>
<td valign="top" align="left"><italic>LA</italic><sup>6</sup></td>
<td valign="top" align="left">Softmax (CEL)</td>
<td/>
<td/>
<td/>
</tr>
<tr>
<td valign="top" align="left"><italic>LA</italic><sup>7</sup></td>
<td valign="top" align="left">Lambda (CL)</td>
<td/>
<td/>
<td valign="top" align="left">1</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p><italic>(1) T =number of the timestamps, E =number of electricodes, K<sub>1</sub> = kernel size of the first CNN, D =number of depthwise convolution output channels, F<sub>1</sub> = number of temporal filters, F<sub>2</sub> = number of spatial filters, K<sub>2</sub> = size of th kernel in the spatial filer, and P<sub>1</sub> and P<sub>2</sub> are sizes of average pooling kernels</italic>.</p>
<p><italic>(2) CEL stands for cross-entropy computed by smoothed labels. CL stands for center loss. Lamda layer is a self-customize layer for the calculation of the center loss</italic>.</p>
</table-wrap-foot>
</table-wrap></sec>
<sec>
<title>3.3. Proposed Loss</title>
<p>To ensure both generability and discriminative power of the CNN-based model in the context of MI classification, we propose a combined loss that jointly optimizes the classification loss (e.g., cross-entropy computed by smoothed labels) and the center loss. Most models in previous studies performed the standard cross-entropy for the objective function defined as</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M6"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mstyle><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mi>&#x003B8;</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mo>=</mml:mo><mml:mo>&#x02212;</mml:mo><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>M</mml:mi></mml:munderover><mml:mi>p</mml:mi></mml:mstyle></mml:mrow></mml:mstyle><mml:mo stretchy='false'>(</mml:mo><mml:mi>y</mml:mi><mml:mo>&#x0007C;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mtext>&#x02009;</mml:mtext><mml:msub><mml:mi>q</mml:mi><mml:mi>&#x003B8;</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>y</mml:mi><mml:mo>&#x0007C;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Given the <italic>p</italic>(<italic>y</italic>|<italic>x</italic><sub><italic>i</italic></sub>) is one-hot encoded in classification task where</p>
<disp-formula id="E2"><label>(2)</label><mml:math id="M7"><mml:mrow><mml:mi>p</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>y</mml:mi><mml:mo>|</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>We can further reduce (1) as</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M8"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mrow><mml:mi>q</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>For each training sample <italic>i</italic>, the <italic>q</italic><sub>&#x003B8;</sub>(<italic>y</italic><sub><italic>i</italic></sub>|<italic>x</italic><sub><italic>i</italic></sub>) is usually calculated by the <italic>softmax</italic> function as follows:</p>
<disp-formula id="E4"><label>(4)</label><mml:math id="M9"><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mi>&#x003B8;</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>|</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mstyle displaystyle='true'><mml:msubsup><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>m</mml:mi></mml:msubsup><mml:mrow><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mstyle></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
<p>Here, <italic>z</italic><sub><italic>j</italic></sub> is the logit value or unnormalized log-probability for each label <italic>j</italic>. By using the one-hot ground-truth label, minimizing the objective function <italic>L</italic><sub><italic>cl</italic></sub> is equivalent to do the log-likelihood maximum. The maximum is not achievable with finite data, so it can only be estimated in the case when <italic>z</italic><sub><italic>y</italic></sub><sub><italic>i</italic></sub> &#x0003E;&#x0003E; <italic>z</italic><sub><italic>j</italic></sub> for all <italic>j</italic> &#x02260; <italic>y</italic><sub><italic>i</italic></sub> (e.g., the logit of the ground-truth label is much larger than all other logits) over the training dataset (Szegedy et al., <xref ref-type="bibr" rid="B27">2016</xref>). In such a case, the model learns to classify every training sample correctly with a confidence of nearly 1, which is the signal of overfitting. This phenomenon relatively easily occurs in the scenario that the MI EEG task often only contains a small sample size of training data.</p>
<p>We adopt the label smoothing mechanism where a noise distribution <italic>u</italic>(<italic>y</italic>|<italic>x</italic>) is added to the one-hot ground truth label to prevent the model from having overconfidence and to reduce the risk of overfitting. Then, the new ground truth label distribution is <inline-formula><mml:math id="M10"><mml:msup><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mi>&#x003B5;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x003B5;</mml:mi><mml:mi>u</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>, where &#x003B5; is a weight factor, &#x003B5;<italic> &#x003F5;</italic> [0, 1]. By replacing <italic>p</italic>(<italic>y</italic>|<italic>x</italic><sub><italic>i</italic></sub>) with <inline-formula><mml:math id="M11"><mml:msup><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> in (1) and (2), the new classification loss <inline-formula><mml:math id="M12"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> computed by smoothed labels can be written as</p>
<disp-formula id="E5"><label>(5)</label><mml:math id="M13"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:msup><mml:mi>L</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:msub><mml:mrow></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>M</mml:mi></mml:munderover><mml:mrow><mml:msup><mml:mi>p</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>y</mml:mi><mml:mo>|</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mi>log</mml:mi><mml:msub><mml:mi>q</mml:mi><mml:mi>&#x003B8;</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>y</mml:mi><mml:mo>|</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mstyle></mml:mrow></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mo>=</mml:mo><mml:mo>&#x02212;</mml:mo><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>M</mml:mi></mml:munderover><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x02212;</mml:mo><mml:mi>&#x003B5;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>y</mml:mi><mml:mo>|</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:mi>&#x003B5;</mml:mi><mml:mi>u</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>y</mml:mi><mml:mo>|</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>]</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mi>&#x003B8;</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>y</mml:mi><mml:mo>|</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mstyle></mml:mrow></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mo>=</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x02212;</mml:mo><mml:mi>&#x003B5;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mi>&#x003B8;</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:mi>&#x003B5;</mml:mi></mml:mrow></mml:mstyle><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mi>&#x003B8;</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The first half of (5) is the weighted standard cross-entropy <italic>L</italic><sub><italic>cl</italic></sub>. Let the second half is weighted loss of label-smoothing regularization (<italic>L</italic><sub><italic>lsr</italic></sub>), which penalizes the deviation of predicted label distribution <italic>p</italic> from noise distribution <italic>u</italic> with a relative weight &#x003B5;/(1&#x02212;&#x003B5;). We set the noise as the uniform distribution <italic>u</italic>(<italic>y</italic>|<italic>x</italic>) &#x0003D; 1/<italic>M</italic> (Szegedy et al., <xref ref-type="bibr" rid="B27">2016</xref>). Then, the <italic>H</italic><sub><italic>i</italic></sub>(<italic>u, q</italic><sub>&#x003B8;</sub>) measures the dissimilarity between predicted label distribution <italic>p</italic> to uniform. Therefore, <italic>L</italic><sub><italic>lsr</italic></sub> heavily penalizes overconfident predictions and prevents poor generalization during the training.</p>
<p>Let the weight of <italic>L</italic><sub><italic>cl</italic></sub> is fixed as 1, and the relative weight &#x003B5;/(1&#x02212;&#x003B5;) of <italic>L</italic><sub><italic>lsr</italic></sub> is redefined as &#x003B1;<sub><italic>lsr</italic></sub>. Therefore, <inline-formula><mml:math id="M14"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> can be elaborated as</p>
<disp-formula id="E6"><label>(6)</label><mml:math id="M15"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B1;</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mi>s</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mi>s</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>In addition to the generalizability, we also try to ensure the discriminative ability of the deep learned features extracted by the CNN pipeline. Intuitively, simultaneously maximizing the inter-class distance and minimizing the intra-class variation is the fundamental strategy to keep features of different classes divisible. The cross-entropy minimization only assures to enlarge the inter-class distance, so we further employ a center loss to achieve intra-class variation reduction. We follow the equation proposed by Wen et al. (<xref ref-type="bibr" rid="B32">2016</xref>), and the center loss is defined as</p>
<disp-formula id="E7"><label>(7)</label><mml:math id="M16"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo>|</mml:mo><mml:msubsup><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>c</italic><sub><italic>y</italic><sub><italic>i</italic></sub></sub> denotes the <italic>y</italic><sub><italic>i</italic></sub> center of the feature extracted by the CNN pipeline. Minimizing the distance between each deeply learned feature and its class center naturally decreases the intra-class variation. Finally, the objective function <italic>L</italic> is to jointly optimize the classification loss <inline-formula><mml:math id="M17"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <italic>L</italic><sub><italic>ct</italic></sub>, defined as</p>
<disp-formula id="E8"><label>(8)</label><mml:math id="M18"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>L</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B1;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where &#x003B1;<sub><italic>ct</italic></sub> is the weight of center loss. Based on (6), <italic>L</italic> can be re-defined as,</p>
<disp-formula id="E9"><label>(9)</label><mml:math id="M19"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>L</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B1;</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mi>s</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mi>s</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B1;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></sec></sec>
<sec id="s4">
<title>4. Experiments</title>
<p>The BCI competition IV-2a and IV-2b datasets are used to evaluate the proposed approach. These two datasets are publicly available. The people involved in the datasets have obtained ethic approval. Users can download the data for free for research and publish relevant articles, so the ethical review and approval were waived for the current study.</p>
<sec>
<title>4.1. Dataset Description</title>
<p>The BCI competition IV-2a (Tangermann et al., <xref ref-type="bibr" rid="B29">2012</xref>) was recorded from 9 healthy individuals (A01-A09) by 22 EEG and 3 EOG channels in a sample rate of 250 Hz. The cue-based paradigm is used during the data collection. It consists of four MI classes, including the imagination motions of the left hand, right hand, tongue, and both feet. Two separate sessions were implemented for each subject. Each session comprises a total of 4&#x0002A;72 (a single MI class) = 288 trials. For fair comparisons with other approaches, the same data division scheme as that in the competition was used in our experiment. The first section is for model training and the second for model testing. Only the 4-s temporal segment (from the start of the cue until the end of the MI) in each trial is used in our model. Given the 250 Hz sample rate, our experiment&#x00027;s training and testing data are on a 1,000-sample series basis.</p>
<p>The BCI competition IV-2b (Tangermann et al., <xref ref-type="bibr" rid="B29">2012</xref>) was also collected from nine healthy people (B01&#x02013;B09) but only with 3 EEG channels (C3, Cz, and C4) attached to the frontal cortex. The dataset comprises two MI classes, including left-hand and right-hand movement imagination based on a cue-based BCI paradigm. Five independent sessions were recorded for each individual. We also keep using the same data division as that in the competition. The first three sessions are for training, and the remaining two are for evaluation. The 4-s temporal interval, from the starting point of the cue until the end of the MI, is used as a trial in our experiment. Given the recording frequency of 250 Hz, each training or testing trial is also on a 1,000-point basis.</p></sec>
<sec>
<title>4.2. Experimental Setup</title>
<p>Our approach is performed on a Tesla V100-SXM2 GPU running on Google online platform (Colab). The CNN network and the proposed loss function are implemented by Keras. The model is trained with Adam (Kingma and Ba, <xref ref-type="bibr" rid="B13">2014</xref>) optimizer using a learning rate of 0.001, mini-batch size of 64, and 750 epochs. According to the result of the ablation study stated in section 5.2, the loss weights &#x003B1;<sub><italic>lsr</italic></sub> and &#x003B1;<sub><italic>ct</italic></sub> are set as 0.5 and 0.5, respectively. Other hyperparameters of the model architecture are shown in <xref ref-type="table" rid="T2">Table 2</xref>.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Hyperparameter settings.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th valign="top" align="left"><bold>Hyperparameter</bold></th>
<th valign="top" align="center"><bold>CNN for IV-2a</bold></th>
<th valign="top" align="center"><bold>CNN for IV-2b</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left"><italic>T</italic></td>
<td valign="top" align="center">1,000</td>
<td valign="top" align="center">1,000</td>
</tr>
<tr>
<td valign="top" align="left"><italic>E</italic></td>
<td valign="top" align="center">22</td>
<td valign="top" align="center">3</td>
</tr>
<tr>
<td valign="top" align="left"><italic>F</italic><sub>1</sub></td>
<td valign="top" align="center">8</td>
<td valign="top" align="center">8</td>
</tr>
<tr>
<td valign="top" align="left"><italic>F</italic><sub>2</sub></td>
<td valign="top" align="center">16</td>
<td valign="top" align="center">16</td>
</tr>
<tr>
<td valign="top" align="left"><italic>K</italic><sub>1</sub></td>
<td valign="top" align="center">32</td>
<td valign="top" align="center">32</td>
</tr>
<tr>
<td valign="top" align="left"><italic>K</italic><sub>2</sub></td>
<td valign="top" align="center">16</td>
<td valign="top" align="center">16</td>
</tr>
<tr>
<td valign="top" align="left"><italic>D</italic></td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">2</td>
</tr>
<tr>
<td valign="top" align="left"><italic>P</italic><sub>1</sub></td>
<td valign="top" align="center">8</td>
<td valign="top" align="center">8</td>
</tr>
<tr>
<td valign="top" align="left"><italic>P</italic><sub>2</sub></td>
<td valign="top" align="center">8</td>
<td valign="top" align="center">8</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>To evaluate the effectiveness of the proposed approach, we compare our strategy against existing SoA methods, including two conventional approaches [a vector-based method, e.g., the competition winner algorithm FBCSP (Ang et al., <xref ref-type="bibr" rid="B2">2008</xref>), and a matrix-based method, SMM (Zheng et al., <xref ref-type="bibr" rid="B39">2018</xref>)], two compact well-known DNN methods [EEGNet (Lawhern et al., <xref ref-type="bibr" rid="B16">2018</xref>) and shallow ConNet (Schirrmeister et al., <xref ref-type="bibr" rid="B26">2017</xref>)], and one more DNN methods (DRDA, Zhao et al., <xref ref-type="bibr" rid="B38">2020</xref>) with complex architecture. The evaluation metric is the classification accuracy (<italic>acc</italic>).</p></sec></sec>
<sec sec-type="results" id="s5">
<title>5. Results</title>
<sec>
<title>5.1. Comparison With State-Of-The-Art Methods</title>
<p>The comparisons between the proposed methods and other models on the BCI competition IV-2a and IV-2b datasets are shown in <xref ref-type="table" rid="T3">Tables 3</xref>, <xref ref-type="table" rid="T4">4</xref>, respectively. The classification accuracy of each subject and the average accuracy are reported in a subject-dependent basis (e.g., training and testing data are from the same subject) as the same as the competition data division scheme. The model that has the best performance for each subject is highlighted in boldface. <xref ref-type="table" rid="T3">Tables 3</xref>, <xref ref-type="table" rid="T4">4</xref> clearly show that the proposed strategy has the best classification accuracy for nearly all subjects on both datasets with a maximum of 14.16% (subject A05) better than the second-best on IV-2a and of 11.43% (B02) better than second-best on IV-2b. On the average level, the classification average accuracies of our method have improvements of around 5.33 and 3.54% on IV-2a and IV-2b compared to other SoAs. We conduct paired <italic>t</italic>-tests between our approach and other SoA strategies to verify if the improvements are statistically significant. The <italic>p</italic> values obtained from the tests are indicated in <xref ref-type="table" rid="T5">Table 5</xref>. We can see that all <italic>p</italic> values are &#x0003C;0.05, which advises that the performance improvements of our method against others are statistically significant. In addition, it also can be seen that the corresponding standard deviations (SDs) of our method are 10.07 and 8.54%, which are both the smallest SD on the respective datasets. This result suggests that our method is a more robust classifier in a subject-independent manner than other models. All these results, as mentioned earlier, demonstrate that the CNN model trained using the proposed loss provides a more accurate and stable classification outcome for the MI recognition task.</p>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p>Classification accuracies (%) obtained with the dataset BCI competition IV-2a.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th valign="top" align="left"><bold>Methods</bold></th>
<th valign="top" align="center" style="border-bottom: thin solid #000000;" colspan="9"><bold>Subject</bold></th>
<th valign="top" align="center"><bold>Average (SD)</bold></th>
</tr>
<tr>
<th/>
<th valign="top" align="center"><bold>A01</bold></th>
<th valign="top" align="center"><bold>A02</bold></th>
<th valign="top" align="center"><bold>A03</bold></th>
<th valign="top" align="center"><bold>A04</bold></th>
<th valign="top" align="center"><bold>A05</bold></th>
<th valign="top" align="center"><bold>A06</bold></th>
<th valign="top" align="center"><bold>A07</bold></th>
<th valign="top" align="center"><bold>A08</bold></th>
<th valign="top" align="center"><bold>A09</bold></th>
<th/>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">FBCSP</td>
<td valign="top" align="center">76.00</td>
<td valign="top" align="center">56.50</td>
<td valign="top" align="center">81.25</td>
<td valign="top" align="center">61.00</td>
<td valign="top" align="center">55.00</td>
<td valign="top" align="center">45.25</td>
<td valign="top" align="center">82.75</td>
<td valign="top" align="center">81.25</td>
<td valign="top" align="center">70.75</td>
<td valign="top" align="center">67.75 (12.94)</td>
</tr>
<tr>
<td valign="top" align="left">SMM</td>
<td valign="top" align="center">81.94</td>
<td valign="top" align="center">59.38</td>
<td valign="top" align="center">81.60</td>
<td valign="top" align="center">62.85</td>
<td valign="top" align="center">59.03</td>
<td valign="top" align="center">49.36</td>
<td valign="top" align="center">86.11</td>
<td valign="top" align="center">77.78</td>
<td valign="top" align="center">78.47</td>
<td valign="top" align="center">70.72 (12.35)</td>
</tr>
<tr>
<td valign="top" align="left">EEGNet</td>
<td valign="top" align="center">85.76</td>
<td valign="top" align="center">61.46</td>
<td valign="top" align="center">88.54</td>
<td valign="top" align="center">67.01</td>
<td valign="top" align="center">55.90</td>
<td valign="top" align="center">52.08</td>
<td valign="top" align="center">89.58</td>
<td valign="top" align="center">83.33</td>
<td valign="top" align="center"><bold>86.81</bold></td>
<td valign="top" align="center">74.50 (14.36)</td>
</tr>
<tr>
<td valign="top" align="left">ConNet</td>
<td valign="top" align="center">76.39</td>
<td valign="top" align="center">55.21</td>
<td valign="top" align="center">89.24</td>
<td valign="top" align="center">74.65</td>
<td valign="top" align="center">56.94</td>
<td valign="top" align="center">54.17</td>
<td valign="top" align="center"><bold>92.71</bold></td>
<td valign="top" align="center">77.08</td>
<td valign="top" align="center">76.39</td>
<td valign="top" align="center">72.53 (13.42)</td>
</tr>
<tr>
<td valign="top" align="left">DRDA</td>
<td valign="top" align="center">83.19</td>
<td valign="top" align="center">55.14</td>
<td valign="top" align="center">87.43</td>
<td valign="top" align="center"><bold>75.28</bold></td>
<td valign="top" align="center">62.29</td>
<td valign="top" align="center">57.15</td>
<td valign="top" align="center">86.18</td>
<td valign="top" align="center">83.61</td>
<td valign="top" align="center">82.00</td>
<td valign="top" align="center">74.75 (12.22)</td>
</tr>
<tr>
<td valign="top" align="left"><bold>Ours</bold></td>
<td valign="top" align="center"><bold>89.32</bold></td>
<td valign="top" align="center"><bold>66.78</bold></td>
<td valign="top" align="center"><bold>94.14</bold></td>
<td valign="top" align="center">74.56</td>
<td valign="top" align="center"><bold>76.45</bold></td>
<td valign="top" align="center"><bold>62.33</bold></td>
<td valign="top" align="center">86.28</td>
<td valign="top" align="center"><bold>85.61</bold></td>
<td valign="top" align="center">85.23</td>
<td valign="top" align="center"><bold>80.08 (10.07)</bold></td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p><italic>Highest values are highlighted in boldface</italic>.</p>
</table-wrap-foot>
</table-wrap>
<table-wrap position="float" id="T4">
<label>Table 4</label>
<caption><p>Classification accuracies (%) obtained with the dataset BCI competition IV-2b.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th valign="top" align="left"><bold>Methods</bold></th>
<th valign="top" align="center" style="border-bottom: thin solid #000000;" colspan="9"><bold>Subject</bold></th>
<th valign="top" align="center"><bold>Average (SD)</bold></th>
</tr>
<tr>
<th/>
<th valign="top" align="center"><bold>B01</bold></th>
<th valign="top" align="center"><bold>B02</bold></th>
<th valign="top" align="center"><bold>B03</bold></th>
<th valign="top" align="center"><bold>B04</bold></th>
<th valign="top" align="center"><bold>B05</bold></th>
<th valign="top" align="center"><bold>B06</bold></th>
<th valign="top" align="center"><bold>B07</bold></th>
<th valign="top" align="center"><bold>B08</bold></th>
<th valign="top" align="center"><bold>B09</bold></th>
<th/>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">FBCSP</td>
<td valign="top" align="center">70.00</td>
<td valign="top" align="center">60.36</td>
<td valign="top" align="center">60.94</td>
<td valign="top" align="center"><bold>97.50</bold></td>
<td valign="top" align="center">93.12</td>
<td valign="top" align="center">80.63</td>
<td valign="top" align="center">78.13</td>
<td valign="top" align="center">92.50</td>
<td valign="top" align="center">86.88</td>
<td valign="top" align="center">80.01 (13.06)</td>
</tr>
<tr>
<td valign="top" align="left">SMM</td>
<td valign="top" align="center">67.81</td>
<td valign="top" align="center">51.79</td>
<td valign="top" align="center">53.44</td>
<td valign="top" align="center">93.31</td>
<td valign="top" align="center">82.81</td>
<td valign="top" align="center">74.69</td>
<td valign="top" align="center">72.19</td>
<td valign="top" align="center">82.50</td>
<td valign="top" align="center">75.62</td>
<td valign="top" align="center">72.68 (12.77)</td>
</tr>
<tr>
<td valign="top" align="left">EEGNet</td>
<td valign="top" align="center">68.44</td>
<td valign="top" align="center">57.86</td>
<td valign="top" align="center">61.25</td>
<td valign="top" align="center">90.63</td>
<td valign="top" align="center">80.94</td>
<td valign="top" align="center">63.13</td>
<td valign="top" align="center">84.38</td>
<td valign="top" align="center">93.13</td>
<td valign="top" align="center">83.13</td>
<td valign="top" align="center">75.88 (12.57)</td>
</tr>
<tr>
<td valign="top" align="left">ConNet</td>
<td valign="top" align="center">76.56</td>
<td valign="top" align="center">50.00</td>
<td valign="top" align="center">51.56</td>
<td valign="top" align="center">96.88</td>
<td valign="top" align="center">93.13</td>
<td valign="top" align="center">85.31</td>
<td valign="top" align="center">83.75</td>
<td valign="top" align="center">91.56</td>
<td valign="top" align="center">85.62</td>
<td valign="top" align="center">79.37 (16.27)</td>
</tr>
<tr>
<td valign="top" align="left">DRDA</td>
<td valign="top" align="center">81.37</td>
<td valign="top" align="center">62.86</td>
<td valign="top" align="center">63.63</td>
<td valign="top" align="center">95.94</td>
<td valign="top" align="center">93.56</td>
<td valign="top" align="center">88.19</td>
<td valign="top" align="center">85.00</td>
<td valign="top" align="center">95.25</td>
<td valign="top" align="center"><bold>90.00</bold></td>
<td valign="top" align="center">83.98 (11.94)</td>
</tr>
<tr>
<td valign="top" align="left"><bold>Ours</bold></td>
<td valign="top" align="center"><bold>83.33</bold></td>
<td valign="top" align="center"><bold>74.29</bold></td>
<td valign="top" align="center"><bold>72.65</bold></td>
<td valign="top" align="center">96.09</td>
<td valign="top" align="center"><bold>95.97</bold></td>
<td valign="top" align="center"><bold>88.84</bold></td>
<td valign="top" align="center"><bold>92.24</bold></td>
<td valign="top" align="center"><bold>96.09</bold></td>
<td valign="top" align="center">88.16</td>
<td valign="top" align="center"><bold>87.52 (8.54)</bold></td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p><italic>Highest values are highlighted in boldface</italic>.</p>
</table-wrap-foot>
</table-wrap> 
<table-wrap position="float" id="T5">
<label>Table 5</label>
<caption><p>Paired <italic>t-</italic>test (<italic>p</italic>-values) between our method and others.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th valign="top" align="left"><bold>Model</bold></th>
<th valign="top" align="center"><bold>IV-2a</bold></th>
<th valign="top" align="center"><bold>IV-2b</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">FBCSP</td>
<td valign="top" align="center">0.0002</td>
<td valign="top" align="center">0.0058</td>
</tr>
<tr>
<td valign="top" align="left">SMM</td>
<td valign="top" align="center">0.0005</td>
<td valign="top" align="center">0.0001</td>
</tr>
<tr>
<td valign="top" align="left">EEGNet</td>
<td valign="top" align="center">0.0443</td>
<td valign="top" align="center">0.0013</td>
</tr>
<tr>
<td valign="top" align="left">ConNet</td>
<td valign="top" align="center">0.0168</td>
<td valign="top" align="center">0.0228</td>
</tr>
<tr>
<td valign="top" align="left">DRDA</td>
<td valign="top" align="center">0.0120</td>
<td valign="top" align="center">0.0479</td>
</tr>
</tbody>
</table>
</table-wrap></sec>
<sec>
<title>5.2. Ablation Result Analysis</title>
<p>Ablation studies are carried out to study the contributions of the label smoothing technique and center loss to the CNN modeling. The hyperparameter &#x003B1;<sub><italic>lsr</italic></sub> controls the degree of the smoothness on the label, and &#x003B1;<sub><italic>ct</italic></sub> dominates the intra-class variations of the deep features. They are both significant. Therefore, two experiments on dataset IV-2a are explored to investigate the sensitiveness of these two hyperparameters.</p>
<sec>
<title>5.2.1. Label-Smoothing Regularization</title>
<p>In the first experiment, we fix the &#x003B1;<sub><italic>ct</italic></sub> as 0, where no center loss is applied, and vary &#x003B1;<sub><italic>lsr</italic></sub> from 0 to 1 (inclusive) to train different models. The verification accuracy for each subject and the averaged accuracy across these models are displayed in <xref ref-type="table" rid="T6">Table 6</xref>. From the average accuracy column, it is clear that only using the standard cross-entropy (in the case of &#x003B1;<sub><italic>lsr</italic></sub> &#x0003D; 0) for the model training is not an excellent choice. Proper selection of &#x003B1;<sub><italic>lsr</italic></sub> can improve the CNN-based model&#x00027;s verification accuracy on the MI recognition. Second, we also observe that the model performance remains relatively stable across different values of &#x003B1;<sub><italic>lsr</italic></sub> in a range of [0.25, 1]. This phenomenon suggests that different levels of smoothness on labels may have a similar effect on the model performance in the MI area. Finally, it can be seen that the model has the most remarkable improvements on subjects A02 and A05, who have low predicting accuracy, by using the smoothed cross-entropy compared to using the standard one. We further visualize the training and testing loss during the optimization of these two subjects in <xref ref-type="fig" rid="F3">Figure 3</xref>. It is recognized that the models using standard cross-entropy suffer from an overfitting issue where the training loss decreases at the beginning and flattens gradually, but the testing loss decreases at the beginning while increases after several epochs. On the contrary, the models using smoothed cross-entropy have a good learning curve. Both training and testing errors decrease at the beginning and then flatten until the end of optimization. Together with the verification accuracy improvement, this finding suggests that the label smoothing technique can degrade the influence of the overfitting on the CNN model in the MI classification.</p>
<table-wrap position="float" id="T6">
<label>Table 6</label>
<caption><p>Classification accuracies (%) of models with different &#x003B1;<sub><italic>lsr</italic></sub> values on the BCI competition IV-2a.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th valign="top" align="left"><bold>&#x003B1;</bold><sub><italic><bold>lsr</bold></italic></sub></th>
<th valign="top" align="center"><bold>A01</bold></th>
<th valign="top" align="center"><bold>A02</bold></th>
<th valign="top" align="center"><bold>A03</bold></th>
<th valign="top" align="center"><bold>A04</bold></th>
<th valign="top" align="center"><bold>A05</bold></th>
<th valign="top" align="center"><bold>A06</bold></th>
<th valign="top" align="center"><bold>A07</bold></th>
<th valign="top" align="center"><bold>A0</bold></th>
<th valign="top" align="center"><bold>A09</bold></th>
<th valign="top" align="center"><bold>Average</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">0</td>
<td valign="top" align="center">84.34</td>
<td valign="top" align="center">52.65</td>
<td valign="top" align="center"><bold>93.04</bold></td>
<td valign="top" align="center">66.67</td>
<td valign="top" align="center">52.90</td>
<td valign="top" align="center">57.00</td>
<td valign="top" align="center">87.73</td>
<td valign="top" align="center">81.55</td>
<td valign="top" align="center">80.3</td>
<td valign="top" align="center">72.91</td>
</tr>
<tr>
<td valign="top" align="left">0.25</td>
<td valign="top" align="center">80.78</td>
<td valign="top" align="center"><bold>64.66</bold></td>
<td valign="top" align="center">92.67</td>
<td valign="top" align="center">67.54</td>
<td valign="top" align="center">69.57</td>
<td valign="top" align="center"><bold>60.00</bold></td>
<td valign="top" align="center">85.92</td>
<td valign="top" align="center">80.07</td>
<td valign="top" align="center">78.79</td>
<td valign="top" align="center">75.58</td>
</tr>
<tr>
<td valign="top" align="left">0.5</td>
<td valign="top" align="center"><bold>84.34</bold></td>
<td valign="top" align="center">61.48</td>
<td valign="top" align="center">90.84</td>
<td valign="top" align="center"><bold>72.37</bold></td>
<td valign="top" align="center"><bold>73.19</bold></td>
<td valign="top" align="center">59.53</td>
<td valign="top" align="center">85.56</td>
<td valign="top" align="center"><bold>82.66</bold></td>
<td valign="top" align="center"><bold>81.44</bold></td>
<td valign="top" align="center"><bold>76.82</bold></td>
</tr>
<tr>
<td valign="top" align="left">0.75</td>
<td valign="top" align="center">82.92</td>
<td valign="top" align="center">63.60</td>
<td valign="top" align="center">90.11</td>
<td valign="top" align="center">66.23</td>
<td valign="top" align="center">72.46</td>
<td valign="top" align="center">53.49</td>
<td valign="top" align="center">85.92</td>
<td valign="top" align="center">82.29</td>
<td valign="top" align="center">81.44</td>
<td valign="top" align="center">75.39</td>
</tr>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="center">81.14</td>
<td valign="top" align="center">62.19</td>
<td valign="top" align="center">91.94</td>
<td valign="top" align="center">64.04</td>
<td valign="top" align="center">69.20</td>
<td valign="top" align="center">58.14</td>
<td valign="top" align="center"><bold>89.53</bold></td>
<td valign="top" align="center">80.07</td>
<td valign="top" align="center">82.58</td>
<td valign="top" align="center">75.43</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p><italic>The &#x003B1;<sub>ct</sub> is fixed as 0. The best accuracy for each subject is highlighted in boldface</italic>.</p>
</table-wrap-foot>
</table-wrap>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Training and testing losses of the models using standard cross-entropy (top) and smoothed cross-entropy (bottom). <bold>(A)</bold> Learning curve of the model on A02. <bold>(B)</bold> Learning curve of the model on A05.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-15-760979-g0003.tif"/>
</fig></sec>
<sec>
<title>5.2.2. Center Loss</title>
<p>In the second experiment, we fix the &#x003B1;<sub><italic>lsr</italic></sub> as 0.5 (performing the best in the first experiment) and vary &#x003B1;<sub><italic>ct</italic></sub> in a range from 0 to 1 (inclusive) to train different models. The performances of these models are displayed in <xref ref-type="table" rid="T7">Table 7</xref>. When the &#x003B1;<sub><italic>ct</italic></sub> is larger than zero, the center loss is activated, and the performance improves across almost all subjects and in the averaged level. This result suggests that the involvement of the center loss increases the discriminative power of the model. For a clear illustration and intuition, the principal component analysis (PCA) (Jolliffe and Cadima, <xref ref-type="bibr" rid="B11">2016</xref>) is further employed to convert the high dimensional features of the second last layer in the model for subject A07 (randomly selected) into 2-D vectors. The distributions of these vectors are shown in <xref ref-type="fig" rid="F4">Figure 4</xref>. It is clear that, without the center loss (<xref ref-type="fig" rid="F4">Figure 4A</xref>), the deep features within each class are dispersive and have a larger intra-class variation. Alternatively, with the center loss in the joint supervision (<xref ref-type="fig" rid="F4">Figure 4B</xref>), the features have both a compact intraclass distance and a clear interclass boundary. These results suggest that the center loss is beneficial to the discriminative feature learning for MI classification modeling.</p>
<table-wrap position="float" id="T7">
<label>Table 7</label>
<caption><p>Classification accuracies (%) of models with different &#x003B1;<sub><italic>ct</italic></sub> values on the BCI competition IV-2a.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th valign="top" align="left"><bold>&#x003B1;</bold><sub><italic><bold>ct</bold></italic></sub></th>
<th valign="top" align="center"><bold>A01</bold></th>
<th valign="top" align="center"><bold>A02</bold></th>
<th valign="top" align="center"><bold>A03</bold></th>
<th valign="top" align="center"><bold>A04</bold></th>
<th valign="top" align="center"><bold>A05</bold></th>
<th valign="top" align="center"><bold>A06</bold></th>
<th valign="top" align="center"><bold>A07</bold></th>
<th valign="top" align="center"><bold>A08</bold></th>
<th valign="top" align="center"><bold>A09</bold></th>
<th valign="top" align="center"><bold>Average</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">0</td>
<td valign="top" align="center">84.34</td>
<td valign="top" align="center">61.48</td>
<td valign="top" align="center">90.84</td>
<td valign="top" align="center">72.37</td>
<td valign="top" align="center">73.19</td>
<td valign="top" align="center">59.53</td>
<td valign="top" align="center">85.56</td>
<td valign="top" align="center">82.66</td>
<td valign="top" align="center">81.44</td>
<td valign="top" align="center">76.82</td>
</tr>
<tr>
<td valign="top" align="left">0.25</td>
<td valign="top" align="center">87.54</td>
<td valign="top" align="center">64.31</td>
<td valign="top" align="center">94.14</td>
<td valign="top" align="center">73.25</td>
<td valign="top" align="center">74.64</td>
<td valign="top" align="center"><bold>63.26</bold></td>
<td valign="top" align="center">86.64</td>
<td valign="top" align="center">80.07</td>
<td valign="top" align="center">81.82</td>
<td valign="top" align="center">78.41</td>
</tr>
<tr>
<td valign="top" align="left">0.5</td>
<td valign="top" align="center"><bold>89.32</bold></td>
<td valign="top" align="center"><bold>66.78</bold></td>
<td valign="top" align="center"><bold>94.14</bold></td>
<td valign="top" align="center"><bold>74.56</bold></td>
<td valign="top" align="center"><bold>76.45</bold></td>
<td valign="top" align="center">62.33</td>
<td valign="top" align="center">86.28</td>
<td valign="top" align="center"><bold>85.61</bold></td>
<td valign="top" align="center"><bold>85.23</bold></td>
<td valign="top" align="center"><bold>80.08</bold></td>
</tr>
<tr>
<td valign="top" align="left">0.75</td>
<td valign="top" align="center">89.32</td>
<td valign="top" align="center">66.43</td>
<td valign="top" align="center">93.77</td>
<td valign="top" align="center">73.68</td>
<td valign="top" align="center">71.38</td>
<td valign="top" align="center">60.47</td>
<td valign="top" align="center">89.17</td>
<td valign="top" align="center">84.5 0</td>
<td valign="top" align="center">85.23</td>
<td valign="top" align="center">79.33</td>
</tr>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="center">87.9</td>
<td valign="top" align="center">59.72</td>
<td valign="top" align="center">93.77</td>
<td valign="top" align="center">71.49</td>
<td valign="top" align="center">74.64</td>
<td valign="top" align="center">57.67</td>
<td valign="top" align="center"><bold>89.89</bold></td>
<td valign="top" align="center">83.39</td>
<td valign="top" align="center">81.82</td>
<td valign="top" align="center">77.81</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p><italic>The &#x003B1;<sub>lsr</sub> is fixed as 0.5. The best accuracy for each subject is highlighted in boldface</italic>.</p>
</table-wrap-foot>
</table-wrap>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p>Visualization of deep feature distributions of subject A07 on dataset IV-2a under two conditions. <bold>(A)</bold> Model with &#x003B1;<sub><italic>lsr</italic></sub> &#x0003D; 0.5 and &#x003B1;<sub><italic>ct</italic></sub> &#x0003D; 0. <bold>(B)</bold> Model with &#x003B1;<sub><italic>lsr</italic></sub> &#x0003D; 0.5 and &#x003B1;<sub><italic>ct</italic></sub> &#x0003D; 0.5.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-15-760979-g0004.tif"/>
</fig></sec></sec></sec>
<sec sec-type="conclusions" id="s6">
<title>6. Conclusion</title>
<p>This paper proposes a new deep learning scheme for the CNN-based model in the MI classification. By jointly combining the smoothed cross-entropy with center loss, the robustness and discriminative power of the model can be highly enhanced for the classification. Extensive and systematic experiments are conducted to validate our strategy on two well-known benchmarks. Several suggestions have been made based on experimental findings. First, the label smoothing technique can degrade the overfitting issue caused by the scarcity and low SNR of the EEG data on the CNN model training. Second, the center loss along with the cross-entropy efficiently decreases the intra-class variance and thus increases the discriminative ability of the deep features by pulling them toward their corresponding latent class centers. It reduces the negative impact of the non-stationary characteristics of the EEG data on the MI classification task. Finally, the proposed loss offers a robust and discriminative training scheme for CNN-based modeling in the MI area. This phenomenon uncovers the fact that, in addition to sophisticated model structure development, implementing an efficient loss function for the learning guidance is also beneficial to model performance in MI recognition. This research has thus encouraged more attempts on the objective function innovation for the deep learning model in the MI field. It can be an interesting alternative for overcoming the bottleneck performance to the model architecture that has been heavily investigated.</p></sec>
<sec sec-type="data-availability" id="s7">
<title>Data Availability Statement</title>
<p>Publicly available datasets were analyzed in this study. This data can be found at: <ext-link ext-link-type="uri" xlink:href="http://www.bbci.de/competition/iv/">http://www.bbci.de/competition/iv/</ext-link>.</p></sec>
<sec id="s8">
<title>Ethics Statement</title>
<p>Ethical review and approval was not required for the study on human participants in accordance with the local legislation and institutional requirements. Written informed consent for participation was not required for this study in accordance with the national legislation and the institutional requirements.</p></sec>
<sec id="s9">
<title>Author Contributions</title>
<p>XH conceptualized the study, performed the majority of the experiments and analyses, made the figures, and wrote the first draft of the manuscript. NZ and K-SC performed some experiments, updated the figures, performed the statistics, and edited the manuscript. All authors approved the submitted version.</p></sec>
<sec sec-type="funding-information" id="s10">
<title>Funding</title>
<p>The work in this paper was supported in part by the Hong Kong Innovation and Technology Fund (MRP/015/18), the Hong Kong Research Grants Council (PolyU 152006/19E), and National Nature Science Foundation of China (Nos. 61802036 and 11901063).</p></sec>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of Interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p></sec>
<sec sec-type="disclaimer" id="s11">
<title>Publisher&#x00027;s Note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p></sec> 
</body>
<back>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ahn</surname> <given-names>M.</given-names></name> <name><surname>Jun</surname> <given-names>S. C.</given-names></name></person-group> (<year>2015</year>). <article-title>Performance variation in motor imagery brain-computer interface: a brief review</article-title>. <source>J. Neurosci. Methods</source> <volume>243</volume>, <fpage>103</fpage>&#x02013;<lpage>110</lpage>. <pub-id pub-id-type="doi">10.1016/j.jneumeth.2015.01.033</pub-id><pub-id pub-id-type="pmid">25668430</pub-id></citation></ref>
<ref id="B2">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ang</surname> <given-names>K. K.</given-names></name> <name><surname>Chin</surname> <given-names>Z. Y.</given-names></name> <name><surname>Zhang</surname> <given-names>H.</given-names></name> <name><surname>Guan</surname> <given-names>C.</given-names></name></person-group> (<year>2008</year>). <article-title>Filter bank common spatial pattern (FBCSP) in brain-computer interface</article-title>, in <source>2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)</source> (<publisher-loc>Hong Kong</publisher-loc>), <fpage>2390</fpage>&#x02013;<lpage>2397</lpage>.</citation>
</ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bashivan</surname> <given-names>P.</given-names></name> <name><surname>Rish</surname> <given-names>I.</given-names></name> <name><surname>Yeasin</surname> <given-names>M.</given-names></name> <name><surname>Codella</surname> <given-names>N.</given-names></name></person-group> (<year>2015</year>). <article-title>Learning representations from EEG with deep recurrent-convolutional neural networks</article-title>. <source>arXiv [Preprint]. arXiv:1511.06448</source>.</citation>
</ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bickel</surname> <given-names>S.</given-names></name> <name><surname>Br&#x000FC;ckner</surname> <given-names>M.</given-names></name> <name><surname>Scheffer</surname> <given-names>T.</given-names></name></person-group> (<year>2009</year>). <article-title>Discriminative learning under covariate shift</article-title>. <source>J. Mach. Learn. Res</source>. <volume>10</volume>, <fpage>2137</fpage>&#x02013;<lpage>2155</lpage>. <pub-id pub-id-type="doi">10.1145/1577069.1755858</pub-id></citation>
</ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chorowski</surname> <given-names>J.</given-names></name> <name><surname>Jaitly</surname> <given-names>N.</given-names></name></person-group> (<year>2016</year>). <article-title>Towards better decoding and language model integration in sequence to sequence models</article-title>. <source>arXiv [Preprint]. arXiv:1612.02695</source>. <pub-id pub-id-type="doi">10.21437/Interspeech.2017-343</pub-id></citation>
</ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Clevert</surname> <given-names>D.-A.</given-names></name> <name><surname>Unterthiner</surname> <given-names>T.</given-names></name> <name><surname>Hochreiter</surname> <given-names>S.</given-names></name></person-group> (<year>2015</year>). <article-title>Fast and accurate deep network learning by exponential linear units (elus)</article-title>. <source>arXiv [Preprint]. arXiv:1511.07289</source>.</citation>
</ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Goldenholz</surname> <given-names>D. M.</given-names></name> <name><surname>Ahlfors</surname> <given-names>S. P.</given-names></name> <name><surname>H&#x000E4;m&#x000E4;l&#x000E4;inen</surname> <given-names>M. S.</given-names></name> <name><surname>Sharon</surname> <given-names>D.</given-names></name> <name><surname>Ishitobi</surname> <given-names>M.</given-names></name> <name><surname>Vaina</surname> <given-names>L. M.</given-names></name> <etal/></person-group>. (<year>2009</year>). <article-title>Mapping the signal-to-noise-ratios of cortical sources in magnetoencephalography and electroencephalography</article-title>. <source>Hum. Brain Mapp</source>. <volume>30</volume>, <fpage>1077</fpage>&#x02013;<lpage>1086</lpage>. <pub-id pub-id-type="doi">10.1002/hbm.20571</pub-id><pub-id pub-id-type="pmid">18465745</pub-id></citation></ref>
<ref id="B8">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Hersche</surname> <given-names>M.</given-names></name> <name><surname>Rellstab</surname> <given-names>T.</given-names></name> <name><surname>Schiavone</surname> <given-names>P. D.</given-names></name> <name><surname>Cavigelli</surname> <given-names>L.</given-names></name> <name><surname>Benini</surname> <given-names>L.</given-names></name> <name><surname>Rahimi</surname> <given-names>A.</given-names></name></person-group> (<year>2018</year>). <article-title>Fast and accurate multiclass inference for mi-bcis using large multiscale temporal and spectral features</article-title>, in <source>2018 26th European Signal Processing Conference (EUSIPCO)</source> (<publisher-loc>Rome</publisher-loc>), <fpage>1690</fpage>&#x02013;<lpage>1694</lpage>. <pub-id pub-id-type="doi">10.23919/EUSIPCO.2018.8553378</pub-id></citation>
</ref>
<ref id="B9">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Hertz</surname> <given-names>J.</given-names></name> <name><surname>Krogh</surname> <given-names>A.</given-names></name> <name><surname>Palmer</surname> <given-names>R. G.</given-names></name></person-group> (<year>2018</year>). <source>Introduction to the Theory of Neural Computation</source>. <publisher-loc>Redwood City</publisher-loc>: <publisher-name>CRC Press</publisher-name>. <pub-id pub-id-type="doi">10.1201/9780429499661</pub-id></citation>
</ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ioffe</surname> <given-names>S.</given-names></name> <name><surname>Szegedy</surname> <given-names>C.</given-names></name></person-group> (<year>2015</year>). <article-title>Batch normalization: accelerating deep network training by reducing internal covariate shift</article-title>, in <source>International Conference on Machine Learning</source> (<publisher-loc>Lille</publisher-loc>), <fpage>448</fpage>&#x02013;<lpage>456</lpage>.</citation>
</ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jolliffe</surname> <given-names>I. T.</given-names></name> <name><surname>Cadima</surname> <given-names>J.</given-names></name></person-group> (<year>2016</year>). <article-title>Principal component analysis: a review and recent developments</article-title>. <source>Philos. Trans. R. Soc. A</source> <volume>374</volume>:<fpage>20150202</fpage>. <pub-id pub-id-type="doi">10.1098/rsta.2015.0202</pub-id><pub-id pub-id-type="pmid">26953178</pub-id></citation></ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kaufmann</surname> <given-names>T.</given-names></name> <name><surname>Herweg</surname> <given-names>A.</given-names></name> <name><surname>K&#x000FC;bler</surname> <given-names>A.</given-names></name></person-group> (<year>2014</year>). <article-title>Toward brain-computer interface based wheelchair control utilizing tactually-evoked event-related potentials</article-title>. <source>J. Neuroeng. Rehabil</source>. <volume>11</volume>, <fpage>1</fpage>&#x02013;<lpage>17</lpage>. <pub-id pub-id-type="doi">10.1186/1743-0003-11-7</pub-id><pub-id pub-id-type="pmid">24428900</pub-id></citation></ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kingma</surname> <given-names>D. P.</given-names></name> <name><surname>Ba</surname> <given-names>J.</given-names></name></person-group> (<year>2014</year>). <article-title>Adam: a method for stochastic optimization</article-title>. <source>arXiv [Preprint]. arXiv:1412.6980</source>.</citation>
</ref>
<ref id="B14">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Kumar</surname> <given-names>S.</given-names></name> <name><surname>Sharma</surname> <given-names>A.</given-names></name> <name><surname>Mamun</surname> <given-names>K.</given-names></name> <name><surname>Tsunoda</surname> <given-names>T.</given-names></name></person-group> (<year>2016</year>). <article-title>A deep learning approach for motor imagery EEG signal classification</article-title>, in <source>2016 3rd Asia-Pacific World Congress on Computer Science and Engineering (APWC on CSE)</source> (<publisher-loc>Nadi</publisher-loc>), <fpage>34</fpage>&#x02013;<lpage>39</lpage>. <pub-id pub-id-type="doi">10.1109/APWC-on-CSE.2016.017</pub-id><pub-id pub-id-type="pmid">33018646</pub-id></citation></ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lal</surname> <given-names>T. N.</given-names></name> <name><surname>Schroder</surname> <given-names>M.</given-names></name> <name><surname>Hinterberger</surname> <given-names>T.</given-names></name> <name><surname>Weston</surname> <given-names>J.</given-names></name> <name><surname>Bogdan</surname> <given-names>M.</given-names></name> <name><surname>Birbaumer</surname> <given-names>N.</given-names></name> <etal/></person-group>. (<year>2004</year>). <article-title>Support vector channel selection in BCI</article-title>. <source>IEEE Trans. Biomed. Eng</source>. <volume>51</volume>, <fpage>1003</fpage>&#x02013;<lpage>1010</lpage>. <pub-id pub-id-type="doi">10.1109/TBME.2004.827827</pub-id><pub-id pub-id-type="pmid">15188871</pub-id></citation></ref>
<ref id="B16">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lawhern</surname> <given-names>V. J.</given-names></name> <name><surname>Solon</surname> <given-names>A. J.</given-names></name> <name><surname>Waytowich</surname> <given-names>N. R.</given-names></name> <name><surname>Gordon</surname> <given-names>S. M.</given-names></name> <name><surname>Hung</surname> <given-names>C. P.</given-names></name> <name><surname>Lance</surname> <given-names>B. J.</given-names></name></person-group> (<year>2018</year>). <article-title>Eegnet: a compact convolutional neural network for EEG-based brain-computer interfaces</article-title>. <source>J. Neural Eng</source>. <volume>15</volume>:<fpage>056013</fpage>. <pub-id pub-id-type="doi">10.1088/1741-2552/aace8c</pub-id><pub-id pub-id-type="pmid">29932424</pub-id></citation></ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lee</surname> <given-names>T.-W.</given-names></name> <name><surname>Girolami</surname> <given-names>M.</given-names></name> <name><surname>Sejnowski</surname> <given-names>T. J.</given-names></name></person-group> (<year>1999</year>). <article-title>Independent component analysis using an extended infomax algorithm for mixed subgaussian and supergaussian sources</article-title>. <source>Neural Comput</source>. <volume>11</volume>, <fpage>417</fpage>&#x02013;<lpage>441</lpage>. <pub-id pub-id-type="doi">10.1162/089976699300016719</pub-id><pub-id pub-id-type="pmid">9950738</pub-id></citation></ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Martinez-Leon</surname> <given-names>J.-A.</given-names></name> <name><surname>Cano-Izquierdo</surname> <given-names>J.-M.</given-names></name> <name><surname>Ibarrola</surname> <given-names>J.</given-names></name></person-group> (<year>2015</year>). <article-title>Feature selection applying statistical and neurofuzzy methods to EEG-based BCI</article-title>. <source>Comput. Intell. Neurosci</source>. <volume>2015</volume>:<fpage>781207</fpage>. <pub-id pub-id-type="doi">10.1155/2015/781207</pub-id><pub-id pub-id-type="pmid">25977685</pub-id></citation></ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>M&#x000FC;ller</surname> <given-names>R.</given-names></name> <name><surname>Kornblith</surname> <given-names>S.</given-names></name> <name><surname>Hinton</surname> <given-names>G.</given-names></name></person-group> (<year>2019</year>). <article-title>When does label smoothing help?</article-title> <source>arXiv [Preprint]. arXiv:1906.02629</source>.</citation>
</ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ni</surname> <given-names>T.</given-names></name> <name><surname>Gu</surname> <given-names>X.</given-names></name> <name><surname>Jiang</surname> <given-names>Y.</given-names></name></person-group> (<year>2020</year>). <article-title>Transfer discriminative dictionary learning with label consistency for classification of EEG signals of epilepsy</article-title>. <source>J. Ambient Intell. Human. Comput</source>. <fpage>1</fpage>&#x02013;<lpage>12</lpage>. <pub-id pub-id-type="doi">10.1007/s12652-020-02620-9</pub-id></citation>
</ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pfurtscheller</surname> <given-names>G.</given-names></name> <name><surname>Neuper</surname> <given-names>C.</given-names></name></person-group> (<year>2001</year>). <article-title>Motor imagery and direct brain-computer communication</article-title>. <source>Proc. IEEE</source> <volume>89</volume>, <fpage>1123</fpage>&#x02013;<lpage>1134</lpage>. <pub-id pub-id-type="doi">10.1109/5.939829</pub-id></citation>
</ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ramoser</surname> <given-names>H.</given-names></name> <name><surname>Muller-Gerking</surname> <given-names>J.</given-names></name> <name><surname>Pfurtscheller</surname> <given-names>G.</given-names></name></person-group> (<year>2000</year>). <article-title>Optimal spatial filtering of single trial EEG during imagined hand movement</article-title>. <source>IEEE Trans. Rehabil. Eng</source>. <volume>8</volume>, <fpage>441</fpage>&#x02013;<lpage>446</lpage>. <pub-id pub-id-type="doi">10.1109/86.895946</pub-id><pub-id pub-id-type="pmid">11204034</pub-id></citation></ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rezeika</surname> <given-names>A.</given-names></name> <name><surname>Benda</surname> <given-names>M.</given-names></name> <name><surname>Stawicki</surname> <given-names>P.</given-names></name> <name><surname>Gembler</surname> <given-names>F.</given-names></name> <name><surname>Saboor</surname> <given-names>A.</given-names></name> <name><surname>Volosyak</surname> <given-names>I.</given-names></name></person-group> (<year>2018</year>). <article-title>Brain-computer interface spellers: a review</article-title>. <source>Brain Sci</source>. <volume>8</volume>:<fpage>57</fpage>. <pub-id pub-id-type="doi">10.3390/brainsci8040057</pub-id><pub-id pub-id-type="pmid">29601538</pub-id></citation></ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Roy</surname> <given-names>Y.</given-names></name> <name><surname>Banville</surname> <given-names>H.</given-names></name> <name><surname>Albuquerque</surname> <given-names>I.</given-names></name> <name><surname>Gramfort</surname> <given-names>A.</given-names></name> <name><surname>Falk</surname> <given-names>T. H.</given-names></name> <name><surname>Faubert</surname> <given-names>J.</given-names></name></person-group> (<year>2019</year>). <article-title>Deep learning-based electroencephalography analysis: a systematic review</article-title>. <source>J. Neural Eng</source>. <volume>16</volume>:<fpage>051001</fpage>. <pub-id pub-id-type="doi">10.1088/1741-2552/ab260c</pub-id><pub-id pub-id-type="pmid">31151119</pub-id></citation></ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sakhavi</surname> <given-names>S.</given-names></name> <name><surname>Guan</surname> <given-names>C.</given-names></name> <name><surname>Yan</surname> <given-names>S.</given-names></name></person-group> (<year>2018</year>). <article-title>Learning temporal information for brain-computer interface using convolutional neural networks</article-title>. <source>IEEE Trans. Neural Netw. Learn. Syst</source>. <volume>29</volume>, <fpage>5619</fpage>&#x02013;<lpage>5629</lpage>. <pub-id pub-id-type="doi">10.1109/TNNLS.2018.2789927</pub-id><pub-id pub-id-type="pmid">29994075</pub-id></citation></ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schirrmeister</surname> <given-names>R. T.</given-names></name> <name><surname>Springenberg</surname> <given-names>J. T.</given-names></name> <name><surname>Fiederer</surname> <given-names>L. D. J.</given-names></name> <name><surname>Glasstetter</surname> <given-names>M.</given-names></name> <name><surname>Eggensperger</surname> <given-names>K.</given-names></name> <name><surname>Tangermann</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2017</year>). <article-title>Deep learning with convolutional neural networks for EEG decoding and visualization</article-title>. <source>Hum. Brain Mapp</source>. <volume>38</volume>, <fpage>5391</fpage>&#x02013;<lpage>5420</lpage>. <pub-id pub-id-type="doi">10.1002/hbm.23730</pub-id><pub-id pub-id-type="pmid">28782865</pub-id></citation></ref>
<ref id="B27">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Szegedy</surname> <given-names>C.</given-names></name> <name><surname>Vanhoucke</surname> <given-names>V.</given-names></name> <name><surname>Ioffe</surname> <given-names>S.</given-names></name> <name><surname>Shlens</surname> <given-names>J.</given-names></name> <name><surname>Wojna</surname> <given-names>Z.</given-names></name></person-group> (<year>2016</year>). <article-title>Rethinking the inception architecture for computer vision</article-title>, in <source>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Las Vegas</publisher-loc>), <fpage>2818</fpage>&#x02013;<lpage>2826</lpage>. <pub-id pub-id-type="doi">10.1109/CVPR.2016.308</pub-id></citation>
</ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tabar</surname> <given-names>Y. R.</given-names></name> <name><surname>Halici</surname> <given-names>U.</given-names></name></person-group> (<year>2016</year>). <article-title>A novel deep learning approach for classification of EEG motor imagery signals</article-title>. <source>J. Neural Eng</source>. <volume>14</volume>:<fpage>016003</fpage>. <pub-id pub-id-type="doi">10.1088/1741-2560/14/1/016003</pub-id><pub-id pub-id-type="pmid">27900952</pub-id></citation></ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tangermann</surname> <given-names>M.</given-names></name> <name><surname>M&#x000FC;ller</surname> <given-names>K.-R.</given-names></name> <name><surname>Aertsen</surname> <given-names>A.</given-names></name> <name><surname>Birbaumer</surname> <given-names>N.</given-names></name> <name><surname>Braun</surname> <given-names>C.</given-names></name> <name><surname>Brunner</surname> <given-names>C.</given-names></name> <etal/></person-group>. (<year>2012</year>). <article-title>Review of the BCI competition IV</article-title>. <source>Front. Neurosci</source>. <volume>6</volume>:<fpage>55</fpage>. <pub-id pub-id-type="doi">10.3389/fnins.2012.00055</pub-id><pub-id pub-id-type="pmid">22811657</pub-id></citation></ref>
<ref id="B30">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Vaswani</surname> <given-names>A.</given-names></name> <name><surname>Shazeer</surname> <given-names>N.</given-names></name> <name><surname>Parmar</surname> <given-names>N.</given-names></name> <name><surname>Uszkoreit</surname> <given-names>J.</given-names></name> <name><surname>Jones</surname> <given-names>L.</given-names></name> <name><surname>Gomez</surname> <given-names>A. N.</given-names></name> <etal/></person-group>. (<year>2017</year>). <article-title>Attention is all you need</article-title>, in <source>Advances in Neural Information Processing Systems</source> (<publisher-loc>Long Beach</publisher-loc>), <fpage>5998</fpage>&#x02013;<lpage>6008</lpage>.</citation>
</ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vidaurre</surname> <given-names>C.</given-names></name> <name><surname>Klauer</surname> <given-names>C.</given-names></name> <name><surname>Schauer</surname> <given-names>T.</given-names></name> <name><surname>Ramos-Murguialday</surname> <given-names>A.</given-names></name> <name><surname>M&#x000FC;ller</surname> <given-names>K.-R.</given-names></name></person-group> (<year>2016</year>). <article-title>Eeg-based bci for the linear control of an upper-limb neuroprosthesis</article-title>. <source>Med. Eng. Phys</source>. <volume>38</volume>, <fpage>1195</fpage>&#x02013;<lpage>1204</lpage>. <pub-id pub-id-type="doi">10.1016/j.medengphy.2016.06.010</pub-id><pub-id pub-id-type="pmid">27425203</pub-id></citation></ref>
<ref id="B32">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Wen</surname> <given-names>Y.</given-names></name> <name><surname>Zhang</surname> <given-names>K.</given-names></name> <name><surname>Li</surname> <given-names>Z.</given-names></name> <name><surname>Qiao</surname> <given-names>Y.</given-names></name></person-group> (<year>2016</year>). <article-title>A discriminative feature learning approach for deep face recognition</article-title>, in <source>European Conference on Computer Vision</source> (<publisher-loc>Amsterdam</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>499</fpage>&#x02013;<lpage>515</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-319-46478-7_31</pub-id></citation>
</ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wierzga&#x00142;a</surname> <given-names>P.</given-names></name> <name><surname>Zapa&#x00142;a</surname> <given-names>D.</given-names></name> <name><surname>Wojcik</surname> <given-names>G. M.</given-names></name> <name><surname>Masiak</surname> <given-names>J.</given-names></name></person-group> (<year>2018</year>). <article-title>Most popular signal processing methods in motor-imagery BCI: a review and meta-analysis</article-title>. <source>Front. Neuroinformatics</source> <volume>12</volume>:<fpage>78</fpage>. <pub-id pub-id-type="doi">10.3389/fninf.2018.00078</pub-id><pub-id pub-id-type="pmid">30459588</pub-id></citation></ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wolpaw</surname> <given-names>J. R.</given-names></name> <name><surname>Birbaumer</surname> <given-names>N.</given-names></name> <name><surname>McFarland</surname> <given-names>D. J.</given-names></name> <name><surname>Pfurtscheller</surname> <given-names>G.</given-names></name> <name><surname>Vaughan</surname> <given-names>T. M.</given-names></name></person-group> (<year>2002</year>). <article-title>Brain-computer interfaces for communication and control</article-title>. <source>Clin. Neurophysiol</source>. <volume>113</volume>, <fpage>767</fpage>&#x02013;<lpage>791</lpage>. <pub-id pub-id-type="doi">10.1016/S1388-2457(02)00057-3</pub-id><pub-id pub-id-type="pmid">12048038</pub-id></citation></ref>
<ref id="B35">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yu</surname> <given-names>H.</given-names></name> <name><surname>Lu</surname> <given-names>H.</given-names></name> <name><surname>Wang</surname> <given-names>S.</given-names></name> <name><surname>Xia</surname> <given-names>K.</given-names></name> <name><surname>Jiang</surname> <given-names>Y.</given-names></name> <name><surname>Qian</surname> <given-names>P.</given-names></name></person-group> (<year>2019</year>). <article-title>A general common spatial patterns for EEG analysis with applications to vigilance detection</article-title>. <source>IEEE Access</source> <volume>7</volume>, <fpage>111102</fpage>&#x02013;<lpage>111114</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2019.2934519</pub-id></citation>
</ref>
<ref id="B36">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>Y.</given-names></name> <name><surname>Li</surname> <given-names>X.</given-names></name> <name><surname>Zhu</surname> <given-names>J.</given-names></name> <name><surname>Wu</surname> <given-names>C.</given-names></name> <name><surname>Wu</surname> <given-names>Q.</given-names></name></person-group> (<year>2019</year>). <article-title>Epileptic EEG signals recognition using a deep view-reduction tsk fuzzy system with high interpretability</article-title>. <source>IEEE Access</source> <volume>7</volume>, <fpage>137344</fpage>&#x02013;<lpage>137354</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2019.2942641</pub-id></citation>
</ref>
<ref id="B37">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>Y.</given-names></name> <name><surname>Zhou</surname> <given-names>Z.</given-names></name> <name><surname>Bai</surname> <given-names>H.</given-names></name> <name><surname>Liu</surname> <given-names>W.</given-names></name> <name><surname>Wang</surname> <given-names>L.</given-names></name></person-group> (<year>2020</year>). <article-title>Seizure classification from EEG signals using an online selective transfer tsk fuzzy classifier with joint distribution adaption and manifold regularization</article-title>. <source>Front. Neurosci</source>. <volume>14</volume>:<fpage>496</fpage>. <pub-id pub-id-type="doi">10.3389/fnins.2020.00496</pub-id><pub-id pub-id-type="pmid">32595441</pub-id></citation></ref>
<ref id="B38">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhao</surname> <given-names>H.</given-names></name> <name><surname>Zheng</surname> <given-names>Q.</given-names></name> <name><surname>Ma</surname> <given-names>K.</given-names></name> <name><surname>Li</surname> <given-names>H.</given-names></name> <name><surname>Zheng</surname> <given-names>Y.</given-names></name></person-group> (<year>2020</year>). <article-title>Deep representation-based domain adaptation for nonstationary EEG classification</article-title>. <source>IEEE Trans. Neural Netw. Learn. Syst</source>. <volume>32</volume>, <fpage>535</fpage>&#x02013;<lpage>545</lpage>. <pub-id pub-id-type="doi">10.1109/TNNLS.2020.3010780</pub-id><pub-id pub-id-type="pmid">32745012</pub-id></citation></ref>
<ref id="B39">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zheng</surname> <given-names>Q.</given-names></name> <name><surname>Zhu</surname> <given-names>F.</given-names></name> <name><surname>Qin</surname> <given-names>J.</given-names></name> <name><surname>Chen</surname> <given-names>B.</given-names></name> <name><surname>Heng</surname> <given-names>P.-A.</given-names></name></person-group> (<year>2018</year>). <article-title>Sparse support matrix machine</article-title>. <source>Pattern Recogn</source>. <volume>76</volume>, <fpage>715</fpage>&#x02013;<lpage>726</lpage>. <pub-id pub-id-type="doi">10.1016/j.patcog.2017.10.003</pub-id></citation>
</ref>
<ref id="B40">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhou</surname> <given-names>H.</given-names></name> <name><surname>Li</surname> <given-names>L.</given-names></name></person-group> (<year>2014</year>). <article-title>Regularized matrix regression</article-title>. <source>J. R. Stat. Soc. Ser. B</source> <volume>76</volume>, <fpage>463</fpage>&#x02013;<lpage>483</lpage>. <pub-id pub-id-type="doi">10.1111/rssb.12031</pub-id><pub-id pub-id-type="pmid">24648830</pub-id></citation></ref>
</ref-list> 
</back>
</article> 