<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">14433</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2021.014433</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Brainwave Classification for Character-Writing Application Using EMD-Based GMM and KELM Approaches</article-title>
<alt-title alt-title-type="left-running-head">Brainwave Classification for Character-Writing Application Using EMD-Based GMM and KELM Approaches</alt-title>
<alt-title alt-title-type="right-running-head">Brainwave Classification for Character-Writing Application Using EMD-Based GMM and KELM Approaches</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western">
<surname>Phapatanaburi</surname>
<given-names>Khomdet</given-names>
</name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western">
<surname>kokkhunthod</surname>
<given-names>Kasidit</given-names>
</name>
<xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western">
<surname>Wang</surname>
<given-names>Longbiao</given-names>
</name>
<xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western">
<surname>Jumphoo</surname>
<given-names>Talit</given-names>
</name>
<xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western">
<surname>Uthansakul</surname>
<given-names>Monthippa</given-names>
</name>
<xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western">
<surname>Boonmahitthisud</surname>
<given-names>Anyaporn</given-names>
</name>
<xref ref-type="aff" rid="aff-4">4</xref></contrib>
<contrib id="author-7" contrib-type="author" corresp="yes">
<name name-style="western">
<surname>Uthansakul</surname>
<given-names>Peerapong</given-names>
</name>
<xref ref-type="aff" rid="aff-2">2</xref>
<email>uthansakul@sut.ac.th</email>
</contrib>
<aff id="aff-1"><label>1</label><institution>Department of Telecommunication Engineering, Rajamangala University of Technology Isan</institution>, <addr-line>Nakhon Ratchasima, 30000</addr-line>, <country>Thailand</country></aff>
<aff id="aff-2"><label>2</label><institution>School of Telecommunication Engineering, Suranaree University of Technology</institution>, <addr-line>Nakhon Ratchasima, 30000</addr-line>, <country>Thailand</country></aff>
<aff id="aff-3"><label>3</label><institution>Tianjin Key Laboratory of Cognitive Computing and Application, College of Intelligence and Computing, Tianjin University</institution>, <addr-line>Tianjin, 300350</addr-line>, <country>China</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Materials Science, Chulalongkorn University</institution>, <addr-line>Bangkok, 10330</addr-line>, <country>Thailand</country></aff>
</contrib-group>
<author-notes><corresp id="cor1">&#x002A;Corresponding Author: Peerapong Uthansakul. Email: <email>uthansakul@sut.ac.th</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2020-10-30">
<day>30</day>
<month>10</month>
<year>2020</year>
</pub-date>
<volume>66</volume>
<issue>3</issue>
<fpage>3029</fpage>
<lpage>3044</lpage>
<history>
<date date-type="received">
<day>20</day>
<month>09</month>
<year>2020</year>
</date>
<date date-type="accepted">
<day>18</day>
<month>10</month>
<year>2020</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2021 Phapatanaburi et al.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Phapatanaburi et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_14433.pdf"></self-uri>
<abstract>
<p>A brainwave classification, which does not involve any limb movement and stimulus for character-writing applications, benefits impaired people, in terms of practical communication, because it allows users to command a device/computer directly via electroencephalogram signals. In this paper, we propose a new framework based on Empirical Mode Decomposition (EMD) features along with the Gaussian Mixture Model (GMM) and Kernel Extreme Learning Machine (KELM)-based classifiers. For this purpose, firstly, we introduce EMD to decompose EEG signals into Intrinsic Mode Functions (IMFs), which actually are used as the input features of the brainwave classification for the character-writing application. We hypothesize that EMD along with the appropriate IMF is quite powerful for the brainwave classification, in terms of character applications, because of the wavelet-like decomposition without any down sampling process. Secondly, by getting motivated with shallow learning classifiers, we can provide promising performance for the classification of binary classes, GMM and KELM, which are applied for the learning of features along with the brainwave classification. Lastly, we propose a new method by combining GMM and KELM to fuse the merits of different classifiers. Moreover, the proposed methods are validated by using the volunteer-independent 5-fold cross-validation and accuracy as a standard measurement. The experimental results showed that EMD with the proper IMF achieved better results than the conventional discrete wavelet transform (DWT) feature. Moreover, we found that the EMD feature along with the GMM/KELM-based classifier provides the average accuracy of 77.40% and 80.10%, respectively, which could perform better than the conventional methods where we use DWT along with the artificial neural network classifier in order to get the average accuracy of 80.60%. Furthermore, we obtained the improved performance by combining GMM and KELM, i.e., average accuracy of 80.60%. These outcomes exhibit the usefulness of the EMD feature combining with GMM and KELM based classifiers for the brainwave classification in terms of the Character-Writing application, which do not require any limb movement and stimulus.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Brainwave classification</kwd>
<kwd>character-writing application</kwd>
<kwd>EMD</kwd>
<kwd>GMM</kwd>
<kwd>KELM</kwd>
<kwd>score combination</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Human communication is an essential activity of passing and interpreting information from one person to another, i.e., exchanges of opinions, emotions, ideas, or facts. Unfortunately, traditional communication is a challenging process for impaired people who does not possess speaking power along with the muscle movements. This motivates researchers to explore the alternative systems [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>] to help defective people in terms of communication.</p>
<p>So far, brain-computer interface (BCI) [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-4">4</xref>], which enables people to communicate with a computer, has been developed to help defective people to express their thoughts. The standard concept of BCI is to convert measured brain signals into actions such as texts and emotions [<xref ref-type="bibr" rid="ref-5">5</xref>]. Moreover, scholars have explored BCI-based researches based on three types of brain responses: Event-related potentials (ERP), steady-state visual evoked potential (SSVEP) and motor imagery (MI).</p>
<p>An ERP brain response is an electrophysiological response based on the direct effect of motor events. Normally, auditory [<xref ref-type="bibr" rid="ref-6">6</xref>], visual [<xref ref-type="bibr" rid="ref-7">7</xref>] and tactile stimulation [<xref ref-type="bibr" rid="ref-8">8</xref>] are introduced to evoke ERP signals. When the evoked ERP response was measuresd/analyzed, BCI system could convert the user&#x2019;s intention into several actions depending on the application. For example, in [<xref ref-type="bibr" rid="ref-9">9</xref>], the authors proposed to use P300 wave being an ERP component for communication, known as P300 speller. With this speller, defective users with motor disabilities could choose alphabets based on the changed P300 wave via visual perception with the stimulus on a computer screen.</p>
<p>Furthermore, an SSVEP brain response is another type of visually evoked brain response, which presents natural responses in terms of human visual perception at specific frequencies (i.e., flickering stimulus [<xref ref-type="bibr" rid="ref-10">10</xref>]). When a person focuses the visual stimulus on a monitor screen at a steady flickering frequency, the electrical signals with the same frequency as the stimulus signal can be generated by the human brain. For this reason, it is believed to detect what a user is focusing on the visual stimulus such as liquid crystal display (LCD) and cathode ray tube (CRT) monitors [<xref ref-type="bibr" rid="ref-11">11</xref>]. For example, in [<xref ref-type="bibr" rid="ref-12">12</xref>], the authors presented a spelling application based on the BCI technique by using the SSVEP response. With this speller system, the 45-target characters were introduced with flickers at different frequencies and a sinusoidal stimulation approach was applied to display visual stimuli via an LCD screen. The user could select the desired character by focusing on the designed position of each character.</p>
<p>The final format of brain response is MI response, which is based on the mental imagination of motor behavior/movement. A conventional concept in BCI using the MI response is to convert the user&#x2019;s intention based on the mental imagination. For example, in [<xref ref-type="bibr" rid="ref-13">13</xref>], a MI based BCI system was introduced for communication, known as a MI-speller. With this system, the users could perform the desired mental imagination in terms of controlling the arrow point to the specific hexagon of the desired character. In all the above mentioned BCI, a constant stimulation and limb movements are needed for generating brain responses, which may lead to non-practical applications especially for defective persons. Thus, the BCI system still requires a design where it does not require any stimulation and limb movements.</p>
<p>Different from the above mentioned studies, the brainwave classification without any limb movement and stimulus for character-writing applications were proposed in [<xref ref-type="bibr" rid="ref-14">14</xref>]. The aim of this system was to detect a multi-line and circle imagination characters. The experimental results showed that this method was useful to detect the circle/straight line imagination, where the estimated results could be transformed into self-designed Morse code symbols as shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. However, the system relied on the pair of EEG channels (third and fourth frontal lobes: F3 and F4), which leads to the indistinct detection due to the joint decision. To address this problem, the authors of [<xref ref-type="bibr" rid="ref-15">15</xref>] proposed a simple and effective system, where the effective architecture used a single EEG channel to replace the pair of EEG channels. By comparing the pair of EEG channels, the experimental results insisted that the system using the single effective EEG channel (F3) could give better performance in terms of the average accuracy. Although the above-mentioned systems could provide the convenient and convincing communication application between human brain and computer, the exploitation of alternative feature and classifier is required to improve the detection of imagined characters.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Morse code symbols based on circle and/or straight line characters</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-1.png"/>
</fig>
<p>In this paper, we propose a new method by using EMD feature along with GMM and KELM-based classifiers. For this purpose, firstly, we explore empirical mode decomposition (EMD) to decompose the EEG signal into intrinsic mode functions (IMFs), which are used via six statistical features as the input features of the brainwave classification for the character-writing application. Secondly, by getting inspired by [<xref ref-type="bibr" rid="ref-16">16</xref>,<xref ref-type="bibr" rid="ref-17">17</xref>] that the shallow learning classifiers provide the promising performance for the classification of binary classes, Gaussian mixture model (GMM) and kernel extreme learning machine (KELM) are applied to distinguish between a circle and straight line characters. Finally, the score combination of GMM and KELM is proposed to fuse the advantages based on different classifiers. The contributions and novelties are summarized as follows:
<list list-type="order">
<list-item><p>EMD is first introduced to decompose EEG signals into IMFs that are used as an input feature of the brainwave classification for the character-writing application without any limb movement and stimulus. With this feature extraction method, the brainwave classification system could provide better accuracy compared to the conventional DWT information.</p></list-item>
<list-item><p>We find that the GMM and KELM methods are better classifiers compared to the conventional ANN-based classifier for distinguishing between a circle and straight line characters.</p></list-item>
<list-item><p>The score combination of GMM and KLEM is proposed in this study. It can fuse the complementary information based on different classifiers to further improve the reliability of the detection decision.</p></list-item>
</list></p>
<p>The rest of this article is organized as follows: Section 2 introduces the proposed methodology, including data collection, feature extracted by EMD, GMM-based classifier, KELM-based classifier and the score combination of GMM and KELM. Section 3 describes the experimental setup and evaluation rule for our experiment. The performances of brainwave classification are investigated and discussed in Section 4. Finally, Section 5 summarizes the paper and describes the future work.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Proposed Methodology</title>
<p>In this section, we provide an overview of the data collection used for the experiment. In addition, the feature extraction and classifiers are described for the brainwave classification in terms of character-writing applications.</p>
<sec id="s2_1">
<label>2.1</label>
<title>Data Collection</title>
<p>For the data collection, Emotiv EPOC Neuroheadset [<xref ref-type="bibr" rid="ref-18">18</xref>], as shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, is used for imaging of neural activity of the lobes frontalis. The Raw EEG data were recorded from sixteen electrode positions, including AF3, AF4, F7, F3, F4, F8, FC5, FC6, T7, T8, P7, P3, P4, P8, O1 and O3 as seen in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. The signals are sent through the Bluetooth technology and are sampled with a 128 Hz sampling rate.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Emotiv EPOC neuroheadset used as EEG signal acquisition hardware</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-2.png"/>
</fig>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Electrode positions of Emotiv EPOC neuroheadset</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-3.png"/>
</fig>
<p>In terms of the recording data, five healthy volunteers participated in the study. Two characters, including a circle and straight line characters are used for the animation as shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. We followed the process as advised in [<xref ref-type="bibr" rid="ref-14">14</xref>]. <xref ref-type="fig" rid="fig-5">Fig. 5</xref> shows the procedure of the data collection. The setup is as follows: 1) A volunteer first wears Emotiv EPOC neuroheadset on his/her head and keeps on the meditation for around 60 sec as illustrated in <xref ref-type="fig" rid="fig-5">Fig. 5a</xref>. 2) The volunteer is then tested for imagining the circle/straight line characters as illustrated in <xref ref-type="fig" rid="fig-5">Fig. 5b</xref>. 3) the volunteer will rest for 120 s after imagining the characters for about 30 times.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Two characters used for the animation: (a) Circle and (b) Straight line</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-4.png"/>
</fig>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>The procedure of the data collection consisting of three parts: (a) Preparation, (b) Imagination, (c) relaxation</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-5.png"/>
</fig>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Feature Extraction</title>
<p>EMD has been proved to be effective for non-stationary time-series analysis [<xref ref-type="bibr" rid="ref-19">19</xref>], which is one of feature extraction methods that has attracted a lot of attention, in terms of the classification of brainwaves, because of its promising adaptability [<xref ref-type="bibr" rid="ref-20">20</xref>&#x2013;<xref ref-type="bibr" rid="ref-22">22</xref>]. EMD can be implemented to decompose the EEG signal into different IMFs that provide underlying intra-wave modulated components in the signal. IMFs must satisfy two conditions: 1) the difference between the total number of extreme and total number of zero-crossing is zero or one 2) the mean value of the envelope defined by the local maxima and local minima is (very close) zero.</p>
<p>The steps of EMD algorithm are calculated as follows:</p>
<p>Step 1: Detect the maximum and minimum values of the signal <inline-formula id="ieqn-1"><alternatives><inline-graphic xlink:href="ieqn-1.png"/><tex-math id="tex-ieqn-1"><![CDATA[$ s \left(n\right) $]]></tex-math><mml:math id="mml-ieqn-1"><mml:mi>s</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula>.</p>
<p>Step 2: Apply the cubic spline interpolation to obtain the envelopes <inline-formula id="ieqn-2"><alternatives><inline-graphic xlink:href="ieqn-2.png"/><tex-math id="tex-ieqn-2"><![CDATA[$ e_{\max } \left(n\right) $]]></tex-math><mml:math id="mml-ieqn-2"><mml:msub><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mo class="qopname">max</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> and <inline-formula id="ieqn-3"><alternatives><inline-graphic xlink:href="ieqn-3.png"/><tex-math id="tex-ieqn-3"><![CDATA[$ e_{\min } \left(n\right) $]]></tex-math><mml:math id="mml-ieqn-3"><mml:msub><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mo class="qopname">min</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula>.</p>
<p>Step 3: Compute the local mean as</p>
<p><disp-formula id="eqn-1">
<label>(1)</label><alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-1.png"/>
<tex-math id="tex-eqn-1"><![CDATA[$$\begin{equation}
m \left(n\right)=\frac{e_{\max } \left(n\right)+e_{\min } \left(n\right)}{2}\label{eqn-1}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-1" display="block"><mml:mi>m</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mo>max</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mo>min</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:math></alternatives></disp-formula></p>
<p>Step 4: Subtract <inline-formula id="ieqn-4"><alternatives><inline-graphic xlink:href="ieqn-4.png"/><tex-math id="tex-ieqn-4"><![CDATA[$ m \left(n\right) $]]></tex-math><mml:math id="mml-ieqn-4"><mml:mi>m</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> from <inline-formula id="ieqn-5"><alternatives><inline-graphic xlink:href="ieqn-5.png"/><tex-math id="tex-ieqn-5"><![CDATA[$ s \left(n\right) $]]></tex-math><mml:math id="mml-ieqn-5"><mml:mi>s</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> to get the modal function <inline-formula id="ieqn-6"><alternatives><inline-graphic xlink:href="ieqn-6.png"/><tex-math id="tex-ieqn-6"><![CDATA[$ c \left(n\right) $]]></tex-math><mml:math id="mml-ieqn-6"><mml:mi>c</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> as</p>
<p><disp-formula id="eqn-2">
<label>(2)</label><alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-2.png"/>
<tex-math id="tex-eqn-2"><![CDATA[$$\begin{equation}
c \left(n\right)=s \left(n\right)-m \left(n\right) \label{eqn-2}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-2" display="block"><mml:mi>c</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mi>m</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>Step 5: Acquire the residue as</p>
<p><disp-formula id="eqn-3">
<label>(3)</label><alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-3.png"/>
<tex-math id="tex-eqn-3"><![CDATA[$$\begin{equation}
r \left(n\right)=m \left(n\right)-c \left(n\right) \label{eqn-3}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-3" display="block"><mml:mi>r</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mi>c</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>Step 6: Decide whether <inline-formula id="ieqn-7"><alternatives><inline-graphic xlink:href="ieqn-7.png"/><tex-math id="tex-ieqn-7"><![CDATA[$ r \left(n\right) $]]></tex-math><mml:math id="mml-ieqn-7"><mml:mi>r</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> an IMF or not based on the two basic conditions for IMFs mentioned above.</p>
<p>Step 7: Repeat step 1 to 6 until <inline-formula id="ieqn-8"><alternatives><inline-graphic xlink:href="ieqn-8.png"/><tex-math id="tex-ieqn-8"><![CDATA[$ r \left(n\right) $]]></tex-math><mml:math id="mml-ieqn-8"><mml:mi>r</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> cannot be decomposed into the IMF. Finally, the original signal is decomposed into <italic>N</italic> IMFs and the residual component as follow:</p>
<p><disp-formula id="eqn-4">
<label>(4)</label><alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-4.png"/>
<tex-math id="tex-eqn-4"><![CDATA[$$\begin{equation}
 s \left(n\right)=\sum_{i=1}^{N}c_{i} \left(n\right)+r \left(n\right). \label{eqn-4}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-4" display="block"><mml:mi>s</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle='true'><mml:mstyle displaystyle='true'><mml:munderover><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo lspace='0pt' rspace='0pt'>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover></mml:mstyle></mml:mstyle><mml:msub><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></alternatives></disp-formula></p>
<p>In this paper, the IMFs are not directly used as an input of classifier because of the problem of variable-sized windows. If M is the length of a sub-band, <inline-formula id="ieqn-9"><alternatives><inline-graphic xlink:href="ieqn-9.png"/><tex-math id="tex-ieqn-9"><![CDATA[$ X \left\{x_{1}, x_{2}, \ldots , x_{M}\right\}$]]></tex-math><mml:math id="mml-ieqn-9"><mml:mi>X</mml:mi><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> and <inline-formula id="ieqn-10"><alternatives><inline-graphic xlink:href="ieqn-10.png"/><tex-math id="tex-ieqn-10"><![CDATA[$ Y \left\{y_{1}, y_{2}, \ldots , y_{M}\right\}$]]></tex-math><mml:math id="mml-ieqn-10"><mml:mi>Y</mml:mi><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> are two adjacent sub-bands (IMFs). The information can be defined by using six statistical features [<xref ref-type="bibr" rid="ref-14">14</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>] including mean, average power, standard deviation, ratio of the absolute mean values of adjacent sub bands, skewness and kurtosis. <xref ref-type="table" rid="table-1">Tab. 1</xref> shows the details of each statistical feature.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Six statistical features</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Statistical feature names</th>
<th>Formula</th>
</tr>
</thead>
<tbody>
<tr>
<td>Mean (<inline-formula id="ieqn-11"><alternatives><inline-graphic xlink:href="ieqn-11.png"/><tex-math id="tex-ieqn-11"><![CDATA[$ \mu $]]></tex-math><mml:math id="mml-ieqn-11"><mml:mi>&#x03BC;</mml:mi></mml:math></alternatives></inline-formula>)</td>
<td><inline-formula id="ieqn-12"><alternatives><inline-graphic xlink:href="ieqn-12.png"/><tex-math id="tex-ieqn-12"><![CDATA[$ \mu =\displaystyle\frac{1}{M}\sum_{j=1}^{M}|x_{j}| $]]></tex-math><mml:math id="mml-ieqn-12"><mml:mi>&#x03BC;</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle='true'><mml:munderover><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo lspace='0pt' rspace='0pt'>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:math></alternatives></inline-formula></td>
</tr>
<tr>
<td>Average power (<inline-formula id="ieqn-13"><alternatives><inline-graphic xlink:href="ieqn-13.png"/><tex-math id="tex-ieqn-13"><![CDATA[$\overline{\mu }$]]></tex-math><mml:math id="mml-ieqn-13"><mml:mover accent="false" class="mml-overline"><mml:mrow><mml:mi>&#x03BC;</mml:mi></mml:mrow><mml:mo accent="true">&#x00AF;</mml:mo></mml:mover></mml:math></alternatives></inline-formula>)</td>
<td><inline-formula id="ieqn-14"><alternatives><inline-graphic xlink:href="ieqn-14.png"/><tex-math id="tex-ieqn-14"><![CDATA[$ \overline{\mu }=\sqrt{\displaystyle\frac{1}{M}\sum_{j=1}^{M}x_{j}^{2}}$]]></tex-math><mml:math id="mml-ieqn-14"><mml:mover accent="false" class="mml-overline"><mml:mrow><mml:mi>&#x03BC;</mml:mi></mml:mrow><mml:mo accent="true">&#x00AF;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle='true'><mml:munderover><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo lspace='0pt' rspace='0pt'>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mstyle displaystyle='true'><mml:munderover><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:munderover></mml:mstyle></mml:mrow></mml:msqrt></mml:math></alternatives></inline-formula></td>
</tr>
<tr>
<td>Standard deviation (<inline-formula id="ieqn-15"><alternatives><inline-graphic xlink:href="ieqn-15.png"/><tex-math id="tex-ieqn-15"><![CDATA[$ \sigma $]]></tex-math><mml:math id="mml-ieqn-15"><mml:mi>&#x03C3;</mml:mi></mml:math></alternatives></inline-formula>)</td>
<td><inline-formula id="ieqn-16"><alternatives><inline-graphic xlink:href="ieqn-16.png"/><tex-math id="tex-ieqn-16"><![CDATA[$ \sigma =\sqrt{\displaystyle\frac{1}{M}\displaystyle\sum_{j=1}^{M} \left(x_{j}-\mu \right)}$]]></tex-math><mml:math id="mml-ieqn-16"><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle='true'><mml:munderover><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo lspace='0pt' rspace='0pt'>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:mi>&#x03BC;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msqrt></mml:math></alternatives></inline-formula></td>
</tr>
<tr>
<td>Ratio of the absolute mean values of adjacent sub bands ( <italic>Ra</italic> )</td>
<td><inline-formula id="ieqn-17"><alternatives><inline-graphic xlink:href="ieqn-17.png"/><tex-math id="tex-ieqn-17"><![CDATA[$ Ra=\displaystyle\frac{\sum_{j=1}^{M} \left| x_{j}\right| }{\sum_{j=1}^{M} \left| y_{j}\right| }$]]></tex-math><mml:math id="mml-ieqn-17"><mml:mi>R</mml:mi><mml:mi>a</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo lspace='0pt' rspace='0pt'>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo lspace='0pt' rspace='0pt'>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></alternatives></inline-formula></td>
</tr>
<tr>
<td>Skewness ( <italic>Sk</italic> )</td>
<td><inline-formula id="ieqn-18"><alternatives><inline-graphic xlink:href="ieqn-18.png"/><tex-math id="tex-ieqn-18"><![CDATA[$ Sk=\sqrt{\displaystyle\frac{1}{M}\displaystyle\sum_{j=1}^{M}\frac{ \left(x_{j}-\mu \right)^{3}}{\sigma ^{3}}}$]]></tex-math><mml:math id="mml-ieqn-18"><mml:mi>S</mml:mi><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle='true'><mml:munderover><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo lspace='0pt' rspace='0pt'>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mfrac><mml:mrow><mml:msup><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>j</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:mi>&#x03BC;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>&#x03C3;</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:msqrt></mml:math></alternatives></inline-formula></td>
</tr>
<tr>
<td>Kurtosis ( <italic>Ku</italic> )</td>
<td><inline-formula id="ieqn-19"><alternatives><inline-graphic xlink:href="ieqn-19.png"/><tex-math id="tex-ieqn-19"><![CDATA[$ Ku=\sqrt{\displaystyle\frac{1}{M}\sum_{j=1}^{M}\frac{ \left(x_{j}-\mu \right)^{4}}{\sigma ^{4}}}$]]></tex-math><mml:math id="mml-ieqn-19"><mml:mi>K</mml:mi><mml:mi>u</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle='true'><mml:munderover><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo lspace='0pt' rspace='0pt'>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mfrac><mml:mrow><mml:msup><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>j</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:mi>&#x03BC;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>&#x03C3;</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:msqrt></mml:math></alternatives></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Brainwave Classifiers</title>
<p>Although deep learning classifiers, such as deep neural network (DNN) [<xref ref-type="bibr" rid="ref-23">23</xref>], convolutional neural network (CNN) [<xref ref-type="bibr" rid="ref-24">24</xref>] and Long short-term memory (LSTM) [<xref ref-type="bibr" rid="ref-25">25</xref>], have been proved to be effective for the brainwave classification, it is well known that deep classifiers strongly depend on the training data. Moreover, we observe from [<xref ref-type="bibr" rid="ref-26">26</xref>] that deep neural network using multi layers cannot give convincing results for the binary classification. This motivates us to believe that shallow learning classifiers are more efficient than deep learning classifiers for the binary classification. In this paper, the GMM and KELM approaches are adopted for the brainwave classification. In addition to using the GMM/KELM approach alone, the combined scores of GMM and KELM are proposed to fuse the merits based on different classifiers. The details are described as follows.</p>
<sec id="s2_3_1">
<label>2.3.1</label>
<title>GMM-Based Classifier</title>
<p>GMM has received a great amount of attention, in terms of the brainwave classification, because of the Gaussian mixture-based ability to model complicated densities. It also provides promising results for the binary classification as suggested in [<xref ref-type="bibr" rid="ref-27">27</xref>]. In this paper, the GMM is implemented to discriminate the circle from the line imagination. It can represent each class as follow:</p>
<p><disp-formula id="eqn-5">
<label>(5)</label><alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-5.png"/>
<tex-math id="tex-eqn-5"><![CDATA[$$\begin{equation}
P \left(O \left| \lambda \right.\right)=\sum_{k=1}^{\wp }w_{k}g \left(O \left| \mu _{k},\sum_{k}\right),\right. \label{eqn-5}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-5" display="block"><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>O</mml:mi><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi>&#x03BB;</mml:mi></mml:mrow><mml:mo></mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle='true'><mml:mstyle displaystyle='true'><mml:munderover><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo lspace='0pt' rspace='0pt'>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>&#x2118;</mml:mi></mml:mrow></mml:munderover></mml:mstyle></mml:mstyle><mml:msub><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>O</mml:mi><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x03BC;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mstyle displaystyle='true'><mml:munder><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munder></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mrow><mml:mo></mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p><disp-formula id="eqn-6">
<label>(6)</label><alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-6.png"/>
<tex-math id="tex-eqn-6"><![CDATA[$$\begin{equation}
 \lambda = \left\{w_{k},\mu _{k},\sum_{k}\right\}_{k=1}^{\wp }, \label{eqn-6}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-6" display="block"><mml:mi>&#x03BB;</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>&#x03BC;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mstyle displaystyle='true'><mml:munder><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munder></mml:mstyle></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo lspace='0pt' rspace='0pt'>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>&#x2118;</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo></mml:math></alternatives></disp-formula></p>
<p>where <italic>O</italic> defends the feature vectors augmented by six statistical features, <italic>w<sub>k</sub></italic> is the <italic>k</italic><sup><italic>th</italic></sup> mixture weight, <inline-formula id="ieqn-20"><alternatives><inline-graphic xlink:href="ieqn-20.png"/><tex-math id="tex-ieqn-20"><![CDATA[$ g \left(O \left| \mu _{k}, \sum_{k}\right.\right) $]]></tex-math><mml:math id="mml-ieqn-20"><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>O</mml:mi><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x03BC;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo></mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> is a <italic>D</italic>-variate Gaussian density function with m and diagonal covariance matrix, <inline-formula id="ieqn-21"><alternatives><inline-graphic xlink:href="ieqn-21.png"/><tex-math id="tex-ieqn-21"><![CDATA[$ \sum $]]></tex-math><mml:math id="mml-ieqn-21"><mml:mo>&#x2211;</mml:mo> </mml:math></alternatives></inline-formula> and <inline-formula id="ieqn-22"><alternatives><inline-graphic xlink:href="ieqn-22.png"/><tex-math id="tex-ieqn-22"><![CDATA[$ \wp $]]></tex-math><mml:math id="mml-ieqn-22"><mml:mi>&#x2118;</mml:mi></mml:math></alternatives></inline-formula> is the number of Gaussians.</p>
<p>For the testing phase, the decision of circle/line imagination class is computed by the logarithmic likelihood ratio as:</p>
<p><disp-formula id="eqn-7">
<label>(7)</label><alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-7.png"/>
<tex-math id="tex-eqn-7"><![CDATA[$$\begin{equation}
\Lambda _{GMM} \left(\Upsilon\right)=log \left(\Upsilon \left| \lambda _{\mathit{circle}}\right.\right)-log \left(P \left(\Upsilon \left| \lambda _{line}\right.\right)\right), \label{eqn-7}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mrow><mml:mtext>&#x039B;</mml:mtext></mml:mrow><mml:mrow><mml:mi>G</mml:mi><mml:mi>M</mml:mi><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D2;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D2;</mml:mi><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x03BB;</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>r</mml:mi><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mstyle></mml:mrow></mml:msub></mml:mrow><mml:mo></mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D2;</mml:mi><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x03BB;</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>e</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:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></alternatives></disp-formula></p>
<p>where <inline-formula id="ieqn-23"><alternatives><inline-graphic xlink:href="ieqn-23.png"/><tex-math id="tex-ieqn-23"><![CDATA[$\Upsilon$]]></tex-math><mml:math id="mml-ieqn-23"><mml:mi>&#x03D2;</mml:mi></mml:math></alternatives></inline-formula> is the testing feature vectors, <inline-formula id="ieqn-24"><alternatives><inline-graphic xlink:href="ieqn-24.png"/><tex-math id="tex-ieqn-24"><![CDATA[$ \lambda _{\mathit{circle}}$]]></tex-math><mml:math id="mml-ieqn-24"><mml:msub><mml:mrow><mml:mi>&#x03BB;</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>r</mml:mi><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mstyle></mml:mrow></mml:msub></mml:math></alternatives></inline-formula> and <inline-formula id="ieqn-25"><alternatives><inline-graphic xlink:href="ieqn-25.png"/><tex-math id="tex-ieqn-25"><![CDATA[$ \lambda _{line}$]]></tex-math><mml:math id="mml-ieqn-25"><mml:msub><mml:mrow><mml:mi>&#x03BB;</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></alternatives></inline-formula> define the GMMs for circle and line imagination classes, respectively.</p>
</sec>
<sec id="s2_3_2">
<label>2.3.2</label>
<title>KELM-Based Classifier</title>
<p>KELM has been proved to be an efficient algorithm for many classification tasks and can also provide an expectable performance for the brainwave classification. This is because of the good generalization, based on the original extreme learning machine (ELM) [<xref ref-type="bibr" rid="ref-28">28</xref>] and the advantage of the kernel function [<xref ref-type="bibr" rid="ref-29">29</xref>], in terms of making effective classification tasks to map nonlinear features. KELM is based on ELM where the mapping kernel function is introduced to replace the hidden layer of ELM. It achieves higher efficiency compared to other methods.</p>
<p>In KELM, we can directly use kernel functions for the feature mapping. Kernel matrix can be represented by using the following equation:</p>
<p><disp-formula id="eqn-8">
<label>(8)</label><alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-8.png"/>
<tex-math id="tex-eqn-8"><![CDATA[$$\begin{equation}
\Omega _{KELM}=HH^{T}\label{eqn-8}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mrow><mml:mi>&#x03A9;</mml:mi></mml:mrow><mml:mrow><mml:mi>K</mml:mi><mml:mi>E</mml:mi><mml:mi>L</mml:mi><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>H</mml:mi><mml:msup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:math></alternatives></disp-formula></p>
<p>where <italic>H</italic> is the hidden layer output matrix. <inline-formula id="ieqn-26"><alternatives><inline-graphic xlink:href="ieqn-26.png"/><tex-math id="tex-ieqn-26"><![CDATA[$ \Omega _{KELM}$]]></tex-math><mml:math id="mml-ieqn-26"><mml:msub><mml:mrow><mml:mi>&#x03A9;</mml:mi></mml:mrow><mml:mrow><mml:mi>K</mml:mi><mml:mi>E</mml:mi><mml:mi>L</mml:mi><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:math></alternatives></inline-formula> is a kernel function: <inline-formula id="ieqn-27"><alternatives><inline-graphic xlink:href="ieqn-27.png"/><tex-math id="tex-ieqn-27"><![CDATA[$ \Omega _{KELM}=h \left(x_{r}\right)\cdot h \left(x_{s}\right)=K \left(x_{r}, x_{s}\right) $]]></tex-math><mml:math id="mml-ieqn-27"><mml:msub><mml:mrow><mml:mi>&#x03A9;</mml:mi></mml:mrow><mml:mrow><mml:mi>K</mml:mi><mml:mi>E</mml:mi><mml:mi>L</mml:mi><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>h</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>h</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>K</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>r</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>s</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula>.</p>
<p>Because the Moore&#x2013;Penrose generalized inverse is used to compute the output weights, the output function of the KELM-based classifier can be expressed as below:</p>
<p><disp-formula id="eqn-9">
<label>(9)</label><alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-9.png"/>
<tex-math id="tex-eqn-9"><![CDATA[$$\begin{equation}
f \left(x\right)= \left[\begin{array}{l}K \left(x,x_{1}\right) \\[8pt] K \left(x,x_{2}\right) \\[8pt] \vdots \\[8pt] K \left(x,x_{\mathrm{\mathbb{N}}}\right) \end{array}\right] \left(\frac{1}{C}+\Omega _{KELM}\right)^{-1}T \label{eqn-9}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-9" display="block"><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable equalrows="false" columnlines="" equalcolumns="false"><mml:mtr><mml:mtd columnalign="left"><mml:mi>K</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mi>K</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mi>K</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>&#x2115;</mml:mi></mml:mstyle></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr> </mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi>&#x03A9;</mml:mi></mml:mrow><mml:mrow><mml:mi>K</mml:mi><mml:mi>E</mml:mi><mml:mi>L</mml:mi><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mi>T</mml:mi></mml:math></alternatives></disp-formula></p>
<p>where <italic>T</italic> denotes the target (label) matrix, similar to SVM. <italic>I</italic> is the identity matrix. <italic>C</italic> denotes the regularization coefficient.</p>
<p>For the testing phase, the decision of circle/line imagination classes is based on the difference of two classes as below:</p>
<p><disp-formula id="eqn-10">
<label>(10)</label><alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-10.png"/>
<tex-math id="tex-eqn-10"><![CDATA[$$\begin{equation}
\Lambda _{KELM} \left(\Upsilon\right)=P \left(t_{\mathit{circle}} \left| f \left(\Upsilon\right)\right.\right)-P \left(t_{line} \left| f \left(\Upsilon\right)\right.\right) \label{eqn-10}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mrow><mml:mtext>&#x039B;</mml:mtext></mml:mrow><mml:mrow><mml:mi>K</mml:mi><mml:mi>E</mml:mi><mml:mi>L</mml:mi><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D2;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>r</mml:mi><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mstyle></mml:mrow></mml:msub><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D2;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo></mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D2;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo></mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>where <inline-formula id="ieqn-28"><alternatives><inline-graphic xlink:href="ieqn-28.png"/><tex-math id="tex-ieqn-28"><![CDATA[$ P \left(t_{\mathit{circle}} \left| f \left(\Upsilon\right)\right.\right) $]]></tex-math><mml:math id="mml-ieqn-28"><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>r</mml:mi><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mstyle></mml:mrow></mml:msub><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D2;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo></mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> and <inline-formula id="ieqn-29"><alternatives><inline-graphic xlink:href="ieqn-29.png"/><tex-math id="tex-ieqn-29"><![CDATA[$ P \left(t_{line} \left| f \left(\Upsilon\right)\right.\right) $]]></tex-math><mml:math id="mml-ieqn-29"><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D2;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo></mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> are the posterior probability of circle and line imagination. In this paper, we employ the radial basis function as an effective kernel function. Further details of KELM can be found in [<xref ref-type="bibr" rid="ref-29">29</xref>].</p>
</sec>
<sec id="s2_3_3">
<label>2.3.3</label>
<title>Score Combination of GMM and KELM</title>
<p>Score combination gives a mechanism to fuse the merits of different classifiers in order to increase the decision performance. It has been adopted in many applications [<xref ref-type="bibr" rid="ref-16">16</xref>,<xref ref-type="bibr" rid="ref-30">30</xref>,<xref ref-type="bibr" rid="ref-31">31</xref>]. In this paper, the score combination is also used in our experiment. <xref ref-type="fig" rid="fig-6">Fig. 6</xref> shows the block diagram of score combination of GMM and KELM. To achieve the combined score, the scores of GMM and KLEM are linearly coupled by the following equation:</p>
<p><disp-formula id="eqn-11">
<label>(11)</label><alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-11.png"/>
<tex-math id="tex-eqn-11"><![CDATA[$$\begin{equation}
 \Lambda _{COMB} \left(\Upsilon\right)=\alpha \Lambda _{GMM} \left(\Upsilon\right)+ \left(1-\alpha \right)\Lambda _{KELM} \left(\Upsilon\right) \label{eqn-11}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-11" display="block"><mml:msub><mml:mrow><mml:mtext>&#x039B;</mml:mtext></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>O</mml:mi><mml:mi>M</mml:mi><mml:mi>B</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D2;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mrow><mml:mtext>&#x039B;</mml:mtext></mml:mrow><mml:mrow><mml:mi>G</mml:mi><mml:mi>M</mml:mi><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D2;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mtext>&#x039B;</mml:mtext></mml:mrow><mml:mrow><mml:mi>K</mml:mi><mml:mi>E</mml:mi><mml:mi>L</mml:mi><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D2;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>where <inline-formula id="ieqn-30"><alternatives><inline-graphic xlink:href="ieqn-30.png"/><tex-math id="tex-ieqn-30"><![CDATA[$ \Lambda _{GMM} \left(\Upsilon\right) $]]></tex-math><mml:math id="mml-ieqn-30"><mml:msub><mml:mrow><mml:mtext>&#x039B;</mml:mtext></mml:mrow><mml:mrow><mml:mi>G</mml:mi><mml:mi>M</mml:mi><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D2;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> and <inline-formula id="ieqn-31"><alternatives><inline-graphic xlink:href="ieqn-31.png"/><tex-math id="tex-ieqn-31"><![CDATA[$ \Lambda _{KELM} \left(\Upsilon\right) $]]></tex-math><mml:math id="mml-ieqn-31"><mml:msub><mml:mrow><mml:mtext>&#x039B;</mml:mtext></mml:mrow><mml:mrow><mml:mi>K</mml:mi><mml:mi>E</mml:mi><mml:mi>L</mml:mi><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D2;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> are the scores of GMM and KELM model, respectively. Moreover, <inline-formula id="ieqn-32"><alternatives><inline-graphic xlink:href="ieqn-32.png"/><tex-math id="tex-ieqn-32"><![CDATA[$ \alpha $]]></tex-math><mml:math id="mml-ieqn-32"><mml:mi>&#x03B1;</mml:mi></mml:math></alternatives></inline-formula> is a weighing coefficient.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Block diagram of score combination of GMM and KELM</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-6.png"/>
</fig>
</sec>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Experimental Setup and Evaluation Rule</title>
<p>In terms of recording the data, since previous work showed that the signals from two electrodes which are positioned at F3 and F4 are the suitable electrodes for the character-writing application as summarized in [<xref ref-type="bibr" rid="ref-14">14</xref>], the data from two these electrodes positions are used in our experiment. Here, the evaluation data which used in the experiment follows previous studies [<xref ref-type="bibr" rid="ref-14">14</xref>,<xref ref-type="bibr" rid="ref-15">15</xref>]. Therefore, each volunteer is required to image circle characters by 100 times and straight line characters by 100 times so that we obtain 500 circle signals and 500 straight line signals to investigate the proposed methods.</p>
<p>In terms of the feature extracted with the help of EMD method, we used the cubic spline interpolation to interpolate maxima and minima in order to obtain the upper and lower envelope. The first 5 IMFs based on EMD was extracted by using the six statistical methods as explained in Section 2.2. <xref ref-type="fig" rid="fig-7">Fig. 7</xref> shows the first 5 IMFs before the statistical methods.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Signals of the first five IMFs/sub bands obtained through EMD method where (a) first columns are derived from circle characters and (b) second columns are derived from line characters</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-7.png"/>
</fig>
<p>In the GMM-based classifier, the two GMMs for a circle and line imagination classes have 256-components. Motivated by [<xref ref-type="bibr" rid="ref-27">27</xref>], the expectation maximization algorithm along with the likelihood estimation is adopted to train these GMMs. For the KELM-based classifier, we found that high values of regularization coefficient and kernel parameter perform a similar performance compared with low values of regularization coefficient and kernel parameter because high values of regularization coefficient and kernel parameter are suitable for the high-dimensional feature space. As a result, minimum low values of regularization coefficient and kernel parameter with the best performance are selected. Here, the regularization coefficient and kernel parameter of the KELM were set to 100. For the score combination, the uniformly-weighted average as summarized in [<xref ref-type="bibr" rid="ref-32">32</xref>] is applied in this study, so the weighing coefficient is set to 0.5.</p>
<p>All the proposed classifier models were evaluated by using the volunteer-independent 5-fold cross-validation. In each fold, the data sets from four different volunteers were used to train the model and the data sets from the remaining volunteers were used to evaluate the classifier model performance. From the volunteer-independent 5-fold cross-validation, 400 circle signals and 400 straight line signals were used to train the classifier model, while 100 circle signals and 100 straight line signals where the volunteer is different from the volunteers of training datasets were used to investigate the trained model. To investigate the performance of each fold, the accuracy performance is calculated as:</p>
<p><disp-formula id="eqn-12">
<label>(12)</label><alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-12.png"/>
<tex-math id="tex-eqn-12"><![CDATA[$$\begin{equation}
\mathit{Accuracy} \left(\% \right)=\frac{TC+TS}{TN}\times 100 \label{eqn-12}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-12" display="block"><mml:mstyle mathvariant="italic"><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>y</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>%</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>C</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mn>100</mml:mn></mml:math></alternatives></disp-formula></p>
<p>where <italic>TC</italic> and <italic>TS</italic> are the true circle and true straight line where the model correctly classifies the circle and straight line classes, respectively. <italic>TN</italic> is the total number of testing trials.</p>
</sec>
<sec id="s4">
<label>4</label>
<title>Results and Discussion</title>
<sec id="s4_1">
<label>4.1</label>
<title>Results of EMD Using Different IMF Information</title>
<p>Since EMD methods using different IMF information vary the accuracy of the brainwave classification system, we need to find out the suitable IMF representation. <xref ref-type="fig" rid="fig-8">Fig. 8</xref> shows the results of different IMF information based on the GMM-based classifier.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Performance of different IMF information</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-8.png"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>, based on the GMM-based classifier, we can see that IMF 1 provided the best average accuracy. This is because the IMF, obtained by the first time, has a wideband frequency, which can give the difference between the line and circle character as seen in <xref ref-type="fig" rid="fig-7">Fig. 7</xref> (second row). Therefore, EMD with IMF 1 was used for all the next experiments.</p>
<p>Although our previous work reported that the pair of F3 and F4 provide the best result, some study [<xref ref-type="bibr" rid="ref-15">15</xref>] showed that by using only one position could provide promising performance for the brainwave classification. The F3 and F4 positions were investigated to find out the suitable EEG position. <xref ref-type="fig" rid="fig-9">Fig. 9</xref> shows the comparison of F3 and F4 positions based on the EMD-GMM-based classifier.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Performance of different EEG channels in terms of accuracy (%)</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-9.png"/>
</fig>
<p>From <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, we can note that the F3 position significantly provided better average accuracy than the F4 position because the F3 position provided different information between the circle and line imagination signals. This leads to the obvious statistical features along with the efficient classifier. Similar trend can be found in [<xref ref-type="bibr" rid="ref-15">15</xref>]. Here, the best result with average accuracy has a high reliability for practical application. Therefore, the F3 position was used for all the next experiments.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Results of the Proposed Methods</title>
<p>In this subsection, the GMM, KELM-based classifier along with the fusion of GMM and KELM were compared for the brainwave classification. <xref ref-type="fig" rid="fig-10">Fig. 10</xref> shows the results of the KELM-based classifier along with the fusion of GMM and KELM.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Performance of GMM-based classifier, KELM-based classifier, the score combination of GMM and KELM in terms of accuracy (%)</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-10.png"/>
</fig>
<p>As it can be seen in <xref ref-type="fig" rid="fig-10">Fig. 10</xref>, the KELM-based classifier performed better than the GMM-based classifier because KELM has high ability to distinguish the circle and straight line characters accurately. Next, the score fusion of GMM and KELM provided an improved performance as compared to the individual GMM and KELM-based classifiers in term of average accuracy. However, in case of the second and fourth volunteers, the score fusion can give worse performance than single classifier because the scores of two classifiers are too different to combine the decision merits. Similar trend can also be found in [<xref ref-type="bibr" rid="ref-33">33</xref>,<xref ref-type="bibr" rid="ref-34">34</xref>]. Here, the score fusion of GMM and KELM did not perform according to our expectation since the fused score of GMM and KELM provided the slightly improved performance as compared to the single KELM-based classifier. This is due to using the same input feature as summarized in [<xref ref-type="bibr" rid="ref-35">35</xref>].</p>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Comparison with Some Previous Systems</title>
<p>In this subsection, our previous systems where the results of DWT feature with the ANN-based classifier was used as baseline systems [<xref ref-type="bibr" rid="ref-14">14</xref>,<xref ref-type="bibr" rid="ref-15">15</xref>] to compare the proposed system. In addition, the ANN using six statistical features extracted by EMD (IMF 1) was also used in the comparison. <xref ref-type="table" rid="table-2">Tab. 2</xref> reports the comparison of proposed systems with the referred systems.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Comparison with some previous systems in terms of accuracy (%)</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Feature extraction method at channel</th>
<th>Classifier</th>
<th colspan="6">Accuracy</th>
</tr>
<tr>
<th></th>
<th></th>
<th>Volunteer 1</th>
<th>Volunteer 2</th>
<th>Volunteer 3</th>
<th>Volunteer 4</th>
<th>Volunteer 5</th>
<th>Average</th>
</tr>
</thead>
<tbody>
<tr>
<td>DWT at <inline-formula id="ieqn-33"><alternatives><inline-graphic xlink:href="ieqn-33.png"/><tex-math id="tex-ieqn-33"><![CDATA[$\text{F3}=\text{F4}$]]></tex-math><mml:math id="mml-ieqn-33"><mml:mstyle class="text"><mml:mtext>F3</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:mstyle class="text"><mml:mtext>F4</mml:mtext></mml:mstyle></mml:math></alternatives></inline-formula> (our implement set as in [<xref ref-type="bibr" rid="ref-14">14</xref>])</td>
<td>ANN</td>
<td>70.50</td>
<td>69.50</td>
<td>62.00</td>
<td>66.00</td>
<td>73.00</td>
<td>68.20</td>
</tr>
<tr>
<td>DWT at F3 (result in [<xref ref-type="bibr" rid="ref-15">15</xref>])</td>
<td>ANN</td>
<td>77.50</td>
<td>63.00</td>
<td>76.00</td>
<td>66.50</td>
<td>87.50</td>
<td>74.10</td>
</tr>
<tr>
<td>DWT at F4 (result in [<xref ref-type="bibr" rid="ref-15">15</xref>])</td>
<td>ANN</td>
<td>60.50</td>
<td>52.00</td>
<td>45.00</td>
<td>53.00</td>
<td>57.00</td>
<td>53.50</td>
</tr>
<tr>
<td>EMD at F3</td>
<td>ANN</td>
<td>82.00</td>
<td>67.00</td>
<td>68.50</td>
<td>82.00</td>
<td>78.50</td>
<td>75.60</td>
</tr>
<tr>
<td>EMD at F3 (proposed)</td>
<td>GMM</td>
<td>78.50</td>
<td>65.00</td>
<td>72.00</td>
<td>89.00</td>
<td>82.50</td>
<td>77.40</td>
</tr>
<tr>
<td>EMD at F3 (proposed)</td>
<td>KELM</td>
<td>84.00</td>
<td>71.50</td>
<td>80.00</td>
<td>80.50</td>
<td>84.50</td>
<td>80.10</td>
</tr>
<tr>
<td>EMD at F3 (Proposed)</td>
<td><inline-formula id="ieqn-34"><alternatives><inline-graphic xlink:href="ieqn-34.png"/><tex-math id="tex-ieqn-34"><![CDATA[$\text{G}\text{M}\text{M}+\text{K}\text{E}\text{L}\text{M}$]]></tex-math><mml:math id="mml-ieqn-34"><mml:mstyle class="text"><mml:mtext>G</mml:mtext></mml:mstyle><mml:mstyle class="text"><mml:mtext>M</mml:mtext></mml:mstyle><mml:mstyle class="text"><mml:mtext>M</mml:mtext></mml:mstyle><mml:mo>+</mml:mo><mml:mstyle class="text"><mml:mtext>K</mml:mtext></mml:mstyle><mml:mstyle class="text"><mml:mtext>E</mml:mtext></mml:mstyle><mml:mstyle class="text"><mml:mtext>L</mml:mtext></mml:mstyle><mml:mstyle class="text"><mml:mtext>M</mml:mtext></mml:mstyle></mml:math></alternatives></inline-formula></td>
<td>84.50</td>
<td>71.00</td>
<td>81.00</td>
<td>81.00</td>
<td>85.50</td>
<td>80.60</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>As it can be seen in <xref ref-type="table" rid="table-2">Tab. 2</xref>, we can observe that the ANN using the IMF 1 information outperformed the ANN using the DTW information (Gamma) because IMF 1 can provide more distinct representation than the DTW information. This indicates that IMF 1 is powerful for the brainwave classification in terms of the character-writing application. Next, we can find that the GMM-based classifier performs better than the ANN-based classifier. This is because the MSE function in the ANN-based classifier is non-convex function, making classifier ineffective for the brainwave classification in terms of the character-writing application. In addition, the KELM-based classifier can give the best performance in terms of individual classifiers due to the advantage of kernel mapping. Finally, the score fusion of GMM and KELM provides the best accuracy at 80.60% compared to the above mentioned systems because GMM and KELM have complementary features based on different classifiers. These outcomes show the usefulness of EMD feature with GMM and KELM-based classifiers for the brainwave classification based on the character-writing application, which do not require any limb movement and stimulus.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusions</title>
<p>In this paper, we proposed the brainwave classification by using EMD along with GMM and KELM for the character-writing application. For this purpose, we firstly explored the EMD method to decompose EEG signals into IMFs, which were used via statistical features as the input features of the classifiers. Secondly, the GMM and KELM methods were applied as classifiers. Finally, the score combination of GMM and KELM was proposed to fuse the merits based on different classifiers. The experimental results showed that the EMD with the proper IMF outperformed the DTW information. Furthermore, we found that by using EMD with the GMM and KELM-based classifier provided the average accuracy of 77.40% and 80.10%, respectively, which performed better than using DWT with the ANN-based classifier that gave the average accuracy of 74.10%. Moreover, the improved performance was obtained by combining the GMM and KELM at the average accuracy of 80.60%. These outcomes exhibit the usefulness of the EMD feature with GMM and KELM-based classifiers for the brainwave classification based on the character-writing application, which do not require any limb movement and stimulus.</p>
<p>In the future, by getting inspired by [<xref ref-type="bibr" rid="ref-36">36</xref>], we have a plan to use new neuroheadsets such as Emotiv EPOC+ and Open BCI neuroheadsets instead of EPOC neuroheadset with the aim of further improving the performance. We would also like to combine the phase feature extraction [<xref ref-type="bibr" rid="ref-31">31</xref>,<xref ref-type="bibr" rid="ref-37">37</xref>] and the neural network-based bottleneck feature extraction [<xref ref-type="bibr" rid="ref-38">38</xref>] with the proposed system in the future.</p>
</sec>
</body>
<back>
<ack><p>All subjects gave their informed consent for inclusion before they participated in the study. The study was conducted in accordance with the Declaration of Helsinki and the protocol was approved by the Ethics Committee of Suranaree University of Technology (License EC-61-14 COA No. 16/2561).</p></ack>
<fn-group><fn fn-type="other"><p><bold>Funding Statement:</bold> This work is supported by the SUT research and development fund, and in part by the National Natural Science Foundation of China under Grant 61771333.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p></fn></fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Prasad</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Herman</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Coyle</surname></string-name>, <string-name><given-names>S.</given-names> <surname>McDonough</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Crosbie</surname></string-name></person-group>, &#x201C;<article-title>Applying a brain-computer interface to support motor imagery practice in people with stroke for upper limb recovery: A feasibility study</article-title>,&#x201D; <source>Journal of Neuroengineering and Rehabilitation</source>, vol. <volume>7</volume>, no. <issue>1</issue>, pp. <fpage>60</fpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Brunner</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Birbaumer</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Blankertz</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Guger</surname></string-name>, <string-name><given-names>A.</given-names> <surname>K&#x00FC;bler</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>BNCI Horizon 2020: Towards a roadmap for the BCI community</article-title>,&#x201D; <source>Brain-Computer Interfaces</source>, vol. <volume>2</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>10</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. R.</given-names> <surname>Wolpaw</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Birbaumer</surname></string-name>, <string-name><given-names>D. J.</given-names> <surname>McFarland</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Pfurtscheller</surname></string-name> and <string-name><given-names>T. M.</given-names> <surname>Vaughan</surname></string-name></person-group>, &#x201C;<article-title>Brain-computer interfaces for communication and control</article-title>,&#x201D; <source>Clinical Neurophysiology</source>, vol. <volume>113</volume>, no. <issue>6</issue>, pp. <fpage>767</fpage>&#x2013;<lpage>791</lpage>, <year>2002</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G. E.</given-names> <surname>Fabiani</surname></string-name>, <string-name><given-names>D. J.</given-names> <surname>McFarland</surname></string-name>, <string-name><given-names>J. R.</given-names> <surname>Wolpaw</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Pfurtscheller</surname></string-name></person-group>, &#x201C;<article-title>Conversion of EEG activity into cursor movement by a brain-computer interface (BCI)</article-title>,&#x201D; <source>IEEE Transactions on Neural Systems and Rehabilitation Engineering</source>, vol. <volume>12</volume>, no. <issue>3</issue>, pp. <fpage>331</fpage>&#x2013;<lpage>338</lpage>, <year>2004</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Al-Nafjan</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Hosny</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Al-Ohali</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Al-Wabil</surname></string-name></person-group>, &#x201C;<article-title>Review and classification of emotion recognition based on EEG brain-computer interface system research: A systematic review</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>7</volume>, no. <issue>12</issue>, pp. <fpage>1239</fpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G. E.</given-names> <surname>Fabiani</surname></string-name>, <string-name><given-names>D. J.</given-names> <surname>McFarland</surname></string-name>, <string-name><given-names>J. R.</given-names> <surname>Wolpaw</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Pfurtscheller</surname></string-name></person-group>, &#x201C;<article-title>A brain-computer interface controlled auditory event-related potential (P300) spelling system for locked-in patients</article-title>,&#x201D; <source>Annals of The New York Academy of Sciences</source>, vol. <volume>1157</volume>, no. <issue>1</issue>, pp. <fpage>90</fpage>&#x2013;<lpage>100</lpage>, <year>2009</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Hwang</surname></string-name>, <string-name><given-names>V. Y.</given-names> <surname>Ferreria</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Ulrich</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Kilic</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Chatziliadis</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A gaze independent brain-computer interface based on visual stimulation through closed eyelids</article-title>,&#x201D; <source>Scientific Reports</source>, vol. <volume>5</volume>, pp. <fpage>15890</fpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. Van</given-names> <surname>der Waal</surname> </string-name>, <string-name><given-names>M.</given-names> <surname>Severens</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Geuze</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Desain</surname></string-name></person-group>, &#x201C;<article-title>Introducing the tactile speller: An ERP-based brain-computer interface for communication</article-title>,&#x201D; <source>Journal of Neural Engineering</source>, vol. <volume>9</volume>, no. <issue>4</issue>, pp. <fpage>045002</fpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L. A.</given-names> <surname>Farwell</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Donchin</surname></string-name></person-group>, &#x201C;<article-title>Talking off the top of your head: Toward a mental prosthesis utilizing event-related brain potentials</article-title>,&#x201D; <source>Electroencephalography and Clinical Neurophysiology</source>, vol. <volume>70</volume>, no. <issue>70</issue>, pp. <fpage>510</fpage>&#x2013;<lpage>523</lpage>, <year>1988</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Bin</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Hong</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Gao</surname></string-name></person-group>, &#x201C;<article-title>VEP-based brain-computer interfaces: Time, frequency and code modulations</article-title>,&#x201D; <source>IEEE Computational Intelligence Magazine</source>, vol. <volume>4</volume>, no. <issue>4</issue>, pp. <fpage>22</fpage>&#x2013;<lpage>26</lpage>, <year>2009</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Lai</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Xia</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Wu</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Yao</surname></string-name></person-group>, &#x201C;<article-title>Stimulator selection in SSVEP-based BCI</article-title>,&#x201D; <source>Medical Engineering &#x0026; Physics</source>, vol. <volume>30</volume>, no. <issue>8</issue>, pp. <fpage>1079</fpage>&#x2013;<lpage>1088</lpage>, <year>2008</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Gao</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Gao</surname></string-name></person-group>, &#x201C;<article-title>A high-ITR SSVEP-based BCI speller</article-title>,&#x201D; <source>Brain-Computer Interfaces</source>, vol. <volume>1</volume>, no. <issue>3&#x2013;4</issue>, pp. <fpage>181</fpage>&#x2013;<lpage>191</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Blankertz</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Dornhege</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Krauledat</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Schroder</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Williamson</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>The berlin brain-computer interface presents the novel mental typewriter hex-o-spell</article-title>,&#x201D; in <conf-name>3rd Int. Brain Computer Interface Workshop and Training Course</conf-name>, <publisher-loc>Graz, Austria</publisher-loc>, pp. <fpage>108</fpage>&#x2013;<lpage>109</lpage>, <year>2006</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Jumphoo</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Uthansakul</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Uthansakul</surname></string-name></person-group>, &#x201C;<article-title>Brainwave classification without the help of limb movement and any stimulus for character-writing application</article-title>,&#x201D; <source>Cognitive Systems Research</source>, vol. <volume>58</volume>, pp. <fpage>375</fpage>&#x2013;<lpage>386</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Kokkhunthod</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Jumphoo</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Uthansakul</surname></string-name></person-group>, &#x201C;<article-title>Improving brainwave classification for character-writing application using single effective EEG channel in SUT</article-title>,&#x201D; in <conf-name>Int. Virtual Conf. on Science and Technology</conf-name>, <publisher-loc>Nakhon Ratchasima, Thailand</publisher-loc>, pp. <fpage>142</fpage>&#x2013;<lpage>148</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Phapatanaburi</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Sakagami</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Li</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Distant-talking accent recognition by combining GMM and DNN</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>75</volume>, no. <issue>9</issue>, pp. <fpage>5109</fpage>&#x2013;<lpage>5124</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Cao</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Zhu</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Hu</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Kummert</surname></string-name></person-group>, &#x201C;<article-title>Epileptic signal classification with deep EEG features by stacked CNNs</article-title>,&#x201D; <source>IEEE Transactions on Cognitive and Developmental Systems</source>, vol. <volume>75</volume>, no. <issue>9</issue>, pp. <fpage>1</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Vokorokos</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Mado&#353;</surname></string-name>, <string-name><given-names>N.</given-names> <surname>&#x00C1;d&#x00E1;m</surname></string-name> and <string-name> <given-names>A.</given-names> <surname>Bal&#x00E1;&#382;</surname></string-name></person-group>, &#x201C;<article-title>Data acquisition in non-invasive brain-computer interface using emotiv Epoc neuroheadset</article-title>,&#x201D; <source>Acta Electrotechnica et Informatica</source>, vol. <volume>12</volume>, no. <issue>1</issue>, pp. <fpage>422</fpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N. E.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Shen</surname></string-name>, <string-name><given-names>S. R.</given-names> <surname>Long</surname></string-name>, <string-name><given-names>M. C.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>H. H.</given-names> <surname>Shih</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysis</article-title>,&#x201D; in <source>Proc. of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences</source>, vol. <volume>454</volume>, no. <issue>1971</issue>, pp. <fpage>903</fpage>&#x2013;<lpage>995</lpage>, <year>1998</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Ji</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Ma</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Dong</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>EEG signals feature extraction based on DWT and EMD combined with approximate entropy</article-title>,&#x201D; <source>Brain Sciences</source>, vol. <volume>9</volume>, no. <issue>8</issue>, pp. <fpage>201</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P. A.</given-names> <surname>Mu&#x00F1;oz-Guti&#x00E9;rrez</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Giraldo</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Bueno-L&#x00F3;pez</surname></string-name></person-group>, &#x201C;<article-title>Localization of active brain sources from EEG signals using empirical mode decomposition: A comparative study</article-title>,&#x201D; <source>Frontiers in Integrative Neuroscience</source>, vol. <volume>19</volume>, pp. <fpage>55</fpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Subasi</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Jukic</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Kevric</surname></string-name></person-group>, &#x201C;<article-title>Comparison of EMD, DWT and WPD for the localization of epileptogenic foci using random forest classifier</article-title>,&#x201D; <source>Measurement</source>, vol. <volume>146</volume>, pp. <fpage>846</fpage>&#x2013;<lpage>855</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R. K.</given-names> <surname>Tripathy</surname></string-name> and <string-name><given-names>U. R.</given-names> <surname>Acharya</surname></string-name></person-group>, &#x201C;<article-title>Use of features from RR-time series and EEG signals for automated classification of sleep stages in deep neural network framework</article-title>,&#x201D; <source>Biocybernetics and Biomedical Engineering</source>, vol. <volume>38</volume>, no. <issue>4</issue>, pp. <fpage>890</fpage>&#x2013;<lpage>902</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Tang</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Sun</surname></string-name></person-group>, &#x201C;<article-title>Single-trial EEG classification of motor imagery using deep convolutional neural networks</article-title>,&#x201D; <source>Optik</source>, vol. <volume>130</volume>, pp. <fpage>11</fpage>&#x2013;<lpage>18</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Jiang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Shang</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>LSTM-based EEG classification in motor imagery tasks</article-title>,&#x201D; <source>IEEE Transactions on Neural Systems and Rehabilitation Engineering</source>, vol. <volume>26</volume>, no. <issue>11</issue>, pp. <fpage>2086</fpage>&#x2013;<lpage>2095</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Phapatanaburi</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Oo</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Nakagawa</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Noise robust voice activity detection using joint phase and magnitude based feature enhancement</article-title>,&#x201D; <source>Journal of Ambient Intelligence and Humanized Computing</source>, vol. <volume>8</volume>, no. <issue>6</issue>, pp. <fpage>845</fpage>&#x2013;<lpage>859</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Hanil&#x00E7;i</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Kinnunen</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Sahidullah</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Sizov</surname></string-name></person-group>, &#x201C;<article-title>Classifiers for synthetic speech detection: A comparison</article-title>,&#x201D; in <conf-name>Annual Conf. of the International Speech Communication Association</conf-name>, <publisher-loc>Dresden, Germany</publisher-loc>, pp. <fpage>2087</fpage>&#x2013;<lpage>2091</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G. B.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Ding</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Extreme learning machine for regression and multiclass classification</article-title>,&#x201D; <source>IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)</source>, vol. <volume>42</volume>, no. <issue>2</issue>, pp. <fpage>513</fpage>&#x2013;<lpage>529</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Xiong</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Cheng</surname></string-name></person-group>, &#x201C;<article-title>Features fusion exaction and KELM with modified grey wolf optimizer for mixture control chart patterns recognition</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>42469</fpage>&#x2013;<lpage>42480</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Kundu</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Ari</surname></string-name></person-group>, &#x201C;<article-title>Fusion of convolutional neural networks for P300 based character recognition</article-title>,&#x201D; in <conf-name>Proc. of 2019 Int. Conf. on Information Technology</conf-name>, <publisher-loc>Quito, Ecuador</publisher-loc>, pp. <fpage>155</fpage>&#x2013;<lpage>159</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Phapatanaburi</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Nakagawa</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Iwahashi</surname></string-name></person-group>, &#x201C;<article-title>Replay attack detection using linear prediction analysis-based relative phase features</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>183614</fpage>&#x2013;<lpage>183625</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>M. F.</given-names> <surname>Font</surname></string-name></person-group>, &#x201C;<article-title>Maximum-likelihood linear regression coefficients as features for speaker recognition</article-title>,&#x201D; <comment>Ph.D. dissertation</comment>. <publisher-name>Facult&#x00E9; des sciences d&#x2019;Orsay, Universite Paris-Saclay</publisher-name>, <publisher-loc>Essonne, Paris</publisher-loc>, <year>2009</year>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Nakagawa</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Yoshida</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Kawakami</surname></string-name></person-group>, &#x201C;<article-title>Spoofing speech detection using modified relative phase information</article-title>,&#x201D; <source>IEEE Journal of Selected Topics in Signal Processing</source>, vol. <volume>11</volume>, no. <issue>4</issue>, pp. <fpage>660</fpage>&#x2013;<lpage>670</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M. R.</given-names> <surname>Kamble</surname></string-name> and <string-name><given-names>H. A.</given-names> <surname>Patil</surname></string-name></person-group>, &#x201C;<article-title>Novel energy separation based instantaneous frequency features for spoof speech detection</article-title>,&#x201D; in <conf-name>IEEE 25th European Signal Processing Conf.</conf-name>, Kos island, Greece, pp. <fpage>106</fpage>&#x2013;<lpage>110</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Xie</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Xu</surname></string-name></person-group>, &#x201C;<article-title>ResNet and model fusion for automatic spoofing detection</article-title>,&#x201D; in <conf-name>Annual Conf. of the International Speech Communication Association</conf-name>, <publisher-loc>Stockholm, Sweden</publisher-loc>, pp. <fpage>102</fpage>&#x2013;<lpage>106</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Sawangjai</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Hompoonsup</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Leelaarporn</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Kongwudhikunakorn</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Wilaiprasitporn</surname></string-name></person-group>, &#x201C;<article-title>Consumer grade EEG measuring sensors as research tools: A review</article-title>,&#x201D; <source>IEEE Sensors Journal</source>, vol. <volume>20</volume>, no. <issue>8</issue>, pp. <fpage>3996</fpage>&#x2013;<lpage>4024</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Oo</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Phapatanaburi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Nakagawa</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Replay attack detection with auditory filter-based relative phase features</article-title>,&#x201D; <source>EURASIP Journal on Audio, Speech, and Music Processing</source>, vol. <volume>2019</volume>, no. <issue>1</issue>, pp. <fpage>130</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Ren</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Lu</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Ueda</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Kai</surname></string-name></person-group>, &#x201C;<article-title>Combination of bottleneck feature extraction and dereverberation for distant-talking speech recognition</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>75</volume>, no. <issue>9</issue>, pp. <fpage>5093</fpage>&#x2013;<lpage>5108</lpage>, <year>2016</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>
