<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Neurol.</journal-id>
<journal-title>Frontiers in Neurology</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Neurol.</abbrev-journal-title>
<issn pub-type="epub">1664-2295</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fneur.2017.00573</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Neuroscience</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>An Individual Finger Gesture Recognition System Based on Motion-Intent Analysis Using Mechanomyogram Signal</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Ding</surname> <given-names>Huijun</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://frontiersin.org/people/u/460444"/>
</contrib>
<contrib contrib-type="author">
<name><surname>He</surname> <given-names>Qing</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://frontiersin.org/people/u/483468"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Zhou</surname> <given-names>Yongjin</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Dan</surname> <given-names>Guo</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="cor1">&#x0002A;</xref>
</contrib>
<contrib contrib-type="author">
<name><surname>Cui</surname> <given-names>Song</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Guangdong Key Laboratory for Biomedical Measurements and Ultrasound Imaging, School of Biomedical Engineering, Health Science Center, Shenzhen University</institution>, <addr-line>Guangdong</addr-line>, <country>China</country></aff>
<aff id="aff2"><sup>2</sup><institution>Center for Neurorehabilitation, Shenzhen Institute of Neuroscience</institution>, <addr-line>Guangdong</addr-line>, <country>China</country></aff>
<aff id="aff3"><sup>3</sup><institution>Institute of High Performance Computing</institution>, <addr-line>Singapore</addr-line>, <country>Singapore</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Ping Zhou, University of Texas Health Science Center at Houston, United States</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Hongbo Xie, Queensland University of Technology, Australia; Keum-Shik Hong, Pusan National University, South Korea</p></fn>
<corresp content-type="corresp" id="cor1">&#x0002A;Correspondence: Guo Dan, <email>danguo&#x00040;szu.edu.cn</email></corresp>
<fn fn-type="other" id="fn001"><p>Specialty section: This article was submitted to Stroke, a section of the journal Frontiers in Neurology</p></fn>
</author-notes>
<pub-date pub-type="epub">
<day>08</day>
<month>11</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="collection">
<year>2017</year>
</pub-date><volume>8</volume>
<elocation-id>573</elocation-id>
<history>
<date date-type="received">
<day>12</day>
<month>08</month>
<year>2017</year>
</date>
<date date-type="accepted">
<day>12</day>
<month>10</month>
<year>2017</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2017 Ding, He, Zhou, Dan and Cui.</copyright-statement>
<copyright-year>2017</copyright-year>
<copyright-holder>Ding, He, Zhou, Dan and Cui</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<p>Motion-intent-based finger gesture recognition systems are crucial for many applications such as prosthesis control, sign language recognition, wearable rehabilitation system, and human&#x02013;computer interaction. In this article, a motion-intent-based finger gesture recognition system is designed to correctly identify the tapping of every finger for the first time. Two auto-event annotation algorithms are firstly applied and evaluated for detecting the finger tapping frame. Based on the truncated signals, the Wavelet packet transform (WPT) coefficients are calculated and compressed as the features, followed by a feature selection method that is able to improve the performance by optimizing the feature set. Finally, three popular classifiers including naive Bayes (NBC), K-nearest neighbor (KNN), and support vector machine (SVM) are applied and evaluated. The recognition accuracy can be achieved up to 94%. The design and the architecture of the system are presented with full system characterization results.</p>
</abstract>
<kwd-group>
<kwd>mechanomyogram</kwd>
<kwd>inertial sensor</kwd>
<kwd>finger gesture recognition</kwd>
<kwd>motion intent</kwd>
<kwd>feature selection</kwd>
</kwd-group>
<counts>
<fig-count count="7"/>
<table-count count="0"/>
<equation-count count="18"/>
<ref-count count="50"/>
<page-count count="11"/>
<word-count count="8361"/>
</counts>
</article-meta>
</front>
<body>
<sec id="S1" sec-type="introduction">
<label>1</label> <title>Introduction</title>
<p>Modeling and recognizing human hand gesture is an extremely important research topic, and it is the core of any intelligent human&#x02013;computer interaction system with applications in automatic control, virtual reality, augmented reality, human&#x02013;robotic interaction, and computer animation. In addition, it attracts more attentions and interests in biomedical engineering recently, e.g., prosthesis control and wearable rehabilitation system. As it is difficult to model the gesture accurately from images and the gesture appearance varies a lot, it is still a difficult task to recognize and track hand gestures. On the other hand, stroke is the leading cause of disability in adults worldwide. Exercise disorders as the most common sequelae of stroke can seriously affect normal activity and quality of life. Exercise and training have long been used to restore motor function after stroke. Among that, hand movement as a kind of fine action is more difficult to recover. Finger gesture recognition technique can be used to train and lead the patients to do the rehabilitation exercises, which normally requires real-time interaction and long-term monitoring. Thus, portable system with real-time processing technique is a valuable topic to pay attention and be explored in the stroke application area.</p>
<p>Currently, most hand-gesture recognition systems are using either hand-motion-based (HMB) technologies or motion-intent-based (MIB) technologies. HMB methods are capable of directly detecting the tracking of hand motions. Non-skin attached sensors such as optical sensors, inertial sensors, and force sensors (<xref ref-type="bibr" rid="B1">1</xref>) are usually deployed in HMB technologies. Many commercial products, such as Kinect and Data Glove, are built on HMB technologies. However, the performance of HMB-based hand-gesture recognition system degrades when the lighting variations present. The recognition accuracy will also drop significantly if skin colors are too similar to background colors or the usage is in dark environment. In addition, the coverage of the system is limited by the sensors&#x02019; measurement range and attaching sensors to fingers and hands make user hand movements unsmoothly and uncomfortable.</p>
<p>MIB methods measure the motion intentions instead of the actual hand motions, which is critical in certain applications such as prosthesis control, virtual reality, and motor rehabilitation. Hand-gesture recognition systems relying on MIB technologies are capable of recognizing the hand gestures based on the forearm muscle activities (<xref ref-type="bibr" rid="B2">2</xref>) or the signal decoding from brain (<xref ref-type="bibr" rid="B3">3</xref>). The brain related methods are driven by the neuroplasticity for stroke rehabilitation and are explained more from the nervous system. Brain cortex activities are analyzed by imaging techniques, e.g., electroencephalography (<xref ref-type="bibr" rid="B4">4</xref>, <xref ref-type="bibr" rid="B5">5</xref>), electrocorticography (<xref ref-type="bibr" rid="B6">6</xref>), near-infrared spectroscopy (<xref ref-type="bibr" rid="B7">7</xref>, <xref ref-type="bibr" rid="B8">8</xref>), magnetic resonance imaging (<xref ref-type="bibr" rid="B9">9</xref>), and optical tomography (<xref ref-type="bibr" rid="B10">10</xref>). A review of hybrid brain&#x02013;computer interface techniques can also be found in Ref. (<xref ref-type="bibr" rid="B11">11</xref>). All these methods by using imaging technologies are with high cost and sensitive to the experimental environment and setup. For example, electroencephalography is not reliable under exposure to high-intensity magnetic fields and also cannot be applied to the participants having metal implants in their body (<xref ref-type="bibr" rid="B12">12</xref>).</p>
<p>The most commonly used forearm muscle analysis solutions relying on MIB approach are the surface electromyography (sEMG) method and the mechanomyogram (MMG) method. This kind of methods explains more about the efforts made by muscles. sEMG uses the surface electrodes to record the electrical currents signal produced by the muscular contraction and many sEMG-based systems have been proposed in the past decades (<xref ref-type="bibr" rid="B13">13</xref>). On the other hand, the MMG approach becomes an active topic recently because these sensors can be made into small sizes with reduced cost and good performances. MMG is a low-frequency mechanical signal which can be detected during the muscular contracting period. It is transmitted from the muscle to the surface skin by the soft tissue, and it can be detected by the motion sensors, i.e., inertial sensors (<xref ref-type="bibr" rid="B14">14</xref>, <xref ref-type="bibr" rid="B15">15</xref>), laser sensors (<xref ref-type="bibr" rid="B16">16</xref>, <xref ref-type="bibr" rid="B17">17</xref>), and microphones (<xref ref-type="bibr" rid="B18">18</xref>, <xref ref-type="bibr" rid="B19">19</xref>) attached to the skin. Among all the sensors, inertial sensors are widely used. They are cheaper and more wearable than laser sensors (<xref ref-type="bibr" rid="B20">20</xref>). For the microphone-based MMG acquisition system, an air chamber is normally required to be placed between the condenser microphone and the surface of the skin to improve the quality of the acoustic signal. The design of the air chamber is a key factor which affects the frequency response of the acquisition system (<xref ref-type="bibr" rid="B19">19</xref>). In addition, the microphone-based MMG acquisition system is less wearable than inertial sensor-based system. Since different hand gestures are due to different modes of voluntary isometric contraction (<xref ref-type="bibr" rid="B17">17</xref>), it is possible to recognize the hand gestures based on the MMG signal detected from the forearm muscle group (<xref ref-type="bibr" rid="B14">14</xref>, <xref ref-type="bibr" rid="B21">21</xref>). Compared with the sEMG approaches, MMG approaches have some advantages. First of all, MMG provides flexibility in setting up the sensors. Since the MMG signal can be detected on the distal of soft tissue during the muscle contraction (<xref ref-type="bibr" rid="B14">14</xref>), the location for placing the sensors are more flexible in contrast to the sEMG, which normally requires an experienced technician to find out the good positions for the sEMG sensors. This flexibility will give MMG users better user experiences compared with sEMG users. Second, the MMG signal is independent of the skin impedance. On the other hand, the sEMG signal is easier to be affected by the skin impedance, which is one of the shortcomings of sEMG-based approach (<xref ref-type="bibr" rid="B22">22</xref>). This drawback makes the sEMG sensors unstable due to the reasons that the skin impedance is sensitive to many factors such as temperature and humidity. Finally, systems with MMG have low cost and have less computational loads. MMG is a low-frequency signal with the range of 10&#x02013;22&#x02009;Hz (<xref ref-type="bibr" rid="B23">23</xref>) while sEMG signal is in the range of 50&#x02013;900&#x02009;Hz (<xref ref-type="bibr" rid="B15">15</xref>). In that case, there is no need for high-frequency electronic components in the MMG acquisition system and lower sampling rate produces less data for processing thus reduces the computational load.</p>
<p>Due to these advantages, many hand-gesture identification systems are built using MMG&#x02013;MIB approach. A recognition system is built for identifying the flexion and extensor of the wrist in 1986 (<xref ref-type="bibr" rid="B14">14</xref>). The MMG signal was collected by a microphone from the flexion digitorum and extensor digitorum in the system. The amplitude of the MMG signal is used to classify these two gestures. Based on a similar idea, a recognition system is built and capable of identifying additional hand gestures including wrist flex, wrist extensor, hand open, and hand close (<xref ref-type="bibr" rid="B24">24</xref>). In this system, the MMG capture system is deploying acceleration sensors. Then, wavelet packet transform (WPT) is used to process the MMG raw signal, followed by the singular value decomposition (SVD) to reduce dimensions of features for gesture recognition. Based on a linear discriminant analysis classifier, the identification algorithm gives an average accuracy rate of 89.7%. After that, many researchers (<xref ref-type="bibr" rid="B25">25</xref>&#x02013;<xref ref-type="bibr" rid="B27">27</xref>) extend the study for the recognition of different hand gestures.</p>
<p>There are only few reported MMG&#x02013;MIB systems on finger gesture recognition (FGR) in the literature. Three types of finger gestures including thumb flexion, pinkie flexion, and middle three finger flexions are classified in an FGR system based on the microphone-accelerometer (<xref ref-type="bibr" rid="B28">28</xref>). This system recognizes these finger gestures by root mean square (RMS) of the MMG signal amplitudes, and its average identification accuracy rate is 76.2%. However, individual flexion of the middle three fingers cannot be distinguished in this FGR system. Subsequently, a system is presented in Ref. (<xref ref-type="bibr" rid="B29">29</xref>) to identify the middle three finger gestures, namely, index tapping, middle tapping, and ring finger tapping. Two tri-axial accelerometers are used to record the MMG signal from the forearm muscles. Three types of finger gestures can be recognized, and the average accuracy rate is 75%. At the same time, some researchers dedicate to recognize more motion patterns of a single finger. For instance, a system proposed in Ref. (<xref ref-type="bibr" rid="B30">30</xref>) is capable of classifying four thumb motion patterns, which includes flexion, extension, abduction, and adduction. The features are extracted by a hybrid algorithm combing the mean absolute value of MMG signal, RMS of amplitude, mean frequency, etc. The average accuracy rate is 81.5% achieved by the quadratic discriminant analysis.</p>
<p>Among all the existing FGR systems, none of them can recognize the individual movement of five fingers, which is the goal of our efforts. Our previous work (<xref ref-type="bibr" rid="B31">31</xref>) proves that the individual finger tapping can be recognized based on the analysis of forearm muscle contractions, and a support vector machine (SVM) classifier shows a good performance on classification and recognition. In this article, we further present a FGR system capable of recognizing thumb tapping, index finger tapping, middle finger tapping, ring finger tapping and little finger tapping based on MMG-MIB approach. Two auto-event annotation algorithms are applied and evaluated for detecting the finger tapping frame. They are better for real-time processing system than the manual cutting approach although the latter one is more accurate. Based on the analysis of MMG frame, the wavelet packet transform (WPT) coefficients are calculated and compressed as the feature, followed by a feature selection method which is able to improve the performance of only one kind of feature. Finally, three popular classifiers including NBC, KNN, and SVM are applied and evaluated by their performances on finger gesture recognition.</p>
<p>In the current stage, only healthy participants are invited to attend our experiments to prove the feasibility of recognition for individual finger movement. For stroke patients, the situation is extremely complicated. The applicable subjects for the experiments of the proposed system are limited to the group of who is capable of controlling the contractions of the forearm muscle. Finding such subjects and to some extent further studying how the proposed system can be adaptive and scalable for subjects with different degrees of the capability of controlling forearm muscle is a much broader topic demanding more effort which will be further explored in future work.</p>
</sec>
<sec id="S2">
<label>2</label> <title>System Architecture</title>
<p>The proposed system relies on two MMG signal channels for identifying movements of five fingers. The architect of the proposed FGR system is shown in Figure <xref ref-type="fig" rid="F1">1</xref>. The first module contains the MMG acquisition system obtaining the two-channel MMG signals from the forearm muscle by the inertial sensor. Then, the detected MMG signals are going through a band-pass filter to reduce noise distortion. The third stage of the system consists of the tapping event detection (TED) algorithm to extract the MMG signal segments with the muscle activity information. The next stage is the feature extraction process on the obtained MMG signal segments. Finally, different classifiers including SVM, KNN, and NBC are built for the recognition purpose based on the features extracted. A detailed description of each sub-system is given below.</p>
<fig position="float" id="F1">
<label>Figure 1</label>
<caption><p>The flowchart of the proposed FGR system.</p></caption>
<graphic xlink:href="fneur-08-00573-g001.tif"/>
</fig>
<sec id="S2-1">
<label>2.1</label> <title>MMG Acquisition Module</title>
<p>The MMG signal is detected by the inertial sensor MUP6050 (InvenSense, USA), which is capable of capturing the information of acceleration and angular velocity. In our system, the acceleration signal from its Z-axis is recorded for FGR. Since Z-axis is perpendicular to the skin surface, it is the most important direction for studying the motions of muscular contraction (<xref ref-type="bibr" rid="B24">24</xref>). As mentioned previously, the MMG signals measuring the mechanical activities are characterized by low-frequency vibrations (&#x0003C;50&#x02009;Hz) (<xref ref-type="bibr" rid="B32">32</xref>). The sampling frequency is chosen to be 1&#x02009;kHz, and the cutoff frequency is chosen to be 200&#x02009;Hz for the embedded analog to digital converter and low-pass filter in MUP6050, respectively. Since the contractions of the extensor digitorum muscle are the main muscle activities when finger taps, the MMG signal is detected from the belly of extensor digitorum muscle. Two sensors are attached on the skin surface within the above mentioned area to have a multichannel understanding of the extensor digitorum muscle. This is the reason why we have two-channel MMG signal measurements.</p>
<p>The relatively high movement artifact is the major deficiency of MMG acquisition, which can significantly degrade the recognition accuracy. Thus, all the subjects were asked to put their arms on the desk to keep their forearms as motionless as possible during the experiments.</p>
</sec>
<sec id="S2-2">
<label>2.2</label> <title>Band-Pass Filtering Module</title>
<p>As reported in Ref. (<xref ref-type="bibr" rid="B17">17</xref>, <xref ref-type="bibr" rid="B33">33</xref>), the predominant power in MMG signals detected is within 10&#x02013;22&#x02009;Hz, and the acoustic frequency contents of MMG signal produced by contracting muscles are within 5&#x02013;50&#x02009;Hz (<xref ref-type="bibr" rid="B32">32</xref>). Thus, a 4th-order band-pass Butterworth filter in the range of 0.1&#x02013;50&#x02009;Hz is used in preprocessing to retain the useful information and reduce noises.</p>
</sec>
<sec id="S2-3">
<label>2.3</label> <title>Auto-Event Annotation Module</title>
<p>The MMG signals after band-pass filters need to go through our auto-event annotation process. Auto-event annotation is designed to detect the finger tapping event and extract the activity segment in this article. Thus it is also called tapping event detection (TED) in the following. This module is also considered as the first stage of finger gesture recognition. In the literature, the MMG signal segments are obtained by manual cut (<xref ref-type="bibr" rid="B14">14</xref>) or predefined time slot when the participants are asked to make each movement (<xref ref-type="bibr" rid="B24">24</xref>, <xref ref-type="bibr" rid="B29">29</xref>). These approaches introduce the inconvenience in either the data preprocessing stage or in the data acquisition process. Furthermore, they do not have the capability of real-time processing. To make the proposed FGR system with real-time processing capability, an automatic TED algorithm is required. In our system, two different TED algorithms are tested. The first one is the root mean square (RMS) algorithm (<xref ref-type="bibr" rid="B30">30</xref>), and the other algorithm is the difference-template filtering (DTF). Their performances are compared in our experiments.</p>
<sec id="S2-3-1">
<label>2.3.1</label> <title>Root Mean Square (RMS) Algorithm</title>
<p>The RMS algorithm has been used in many MMG signal processing applications such as the assessment of muscle function (<xref ref-type="bibr" rid="B32">32</xref>, <xref ref-type="bibr" rid="B34">34</xref>) and automatic detection of muscle activities (<xref ref-type="bibr" rid="B35">35</xref>). It can be described by the following equation:
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:msub><mml:mrow><mml:mi>Z</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd class="array" columnalign="left"><mml:mn>1</mml:mn><mml:mo class="MathClass-punc">,</mml:mo><mml:mspace width="1em" class="quad"/></mml:mtd><mml:mtd class="array" columnalign="left"><mml:mi mathvariant="italic">if</mml:mi><mml:mtext>&#x02009;</mml:mtext><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo class="MathClass-open">[</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">]</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003E;</mml:mo><mml:mi>T</mml:mi><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array" columnalign="left"><mml:mn>0</mml:mn><mml:mo class="MathClass-punc">,</mml:mo><mml:mspace width="1em" class="quad"/></mml:mtd><mml:mtd class="array" columnalign="left"><mml:mi mathvariant="italic">otherwise</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
where <italic>t</italic> is the time index. <italic>Z<sub>r</sub></italic>[<italic>t</italic>] is the output of this algorithm. Its value will be set to 1 when the finger motion event is detected, otherwise it will be zero. <italic>g<sub>r</sub></italic>[<italic>t</italic>] and <italic>TH<sub>r</sub></italic> are defined by the following equations:
<disp-formula id="E2"><label>(2)</label><mml:math id="M2"><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo stretchy='false'>[</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>]</mml:mo><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>W</mml:mi></mml:mfrac><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mi>x</mml:mi><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mstyle><mml:mo>,</mml:mo></mml:mrow></mml:msqrt></mml:mrow></mml:math></disp-formula>
<disp-formula id="E3"><label>(3)</label><mml:math id="M3"><mml:mi>T</mml:mi><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mn>&#x003B1;</mml:mn></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02217;</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mrow><mml:mo class="MathClass-op">&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:msubsup><mml:mtext>&#x02009;</mml:mtext><mml:msub><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo class="MathClass-open">[</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mo class="MathClass-close">]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
where the <italic>g<sub>r</sub></italic>[<italic>t</italic>] is the RMS value from <italic>x</italic>[<italic>t</italic>] to <italic>x</italic>[<italic>t</italic>&#x02009;&#x0002B;&#x02009;<italic>W</italic>] and the parameter <italic>W</italic> is the window size. As reported in Ref. (<xref ref-type="bibr" rid="B35">35</xref>), an appropriate analysis window size for MMG signal is from 100 to 400&#x02009;ms. In our system, the window size is fixed to 400&#x02009;ms, which has a superior performance in contrast to other smaller sizes. The parameters, <italic>T<sub>s</sub></italic><sub>1</sub> and <italic>T<sub>s</sub></italic><sub>2</sub>, are the start and end points of time during which the forearm muscle group of participants are required to keep relaxed. The parameter, <italic>&#x003B1;<sub>r</sub></italic>, is the threshold scaling factor which is set to 2.15 in our system.</p>
</sec>
<sec id="S2-3-2">
<label>2.3.2</label> <title>Difference-Template Filtering (DTF)</title>
<p>A DTF-based TED algorithm is proposed to detect the muscle activities in our system. The vector <italic>D</italic>&#x02009;&#x0003D;&#x02009;[&#x02212;1, &#x02212;1, &#x02212;1, &#x02212;1, &#x02212;1, &#x02212;1, &#x02212;1, &#x02212;1, 0, 1, 1, 1, 1, 1, 1, 1, 1] is designed as the difference template for convolution with MMG signal. The difference template-based TED can be described by equations (<xref ref-type="disp-formula" rid="E4">4</xref>)&#x02013;(<xref ref-type="disp-formula" rid="E6">6</xref>):
<disp-formula id="E4"><label>(4)</label><mml:math id="M4"><mml:msub><mml:mrow><mml:mi>Z</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd class="array" columnalign="left"><mml:mn>1</mml:mn><mml:mo class="MathClass-punc">,</mml:mo><mml:mspace width="1em" class="quad"/></mml:mtd><mml:mtd class="array" columnalign="left"><mml:mi mathvariant="italic">if</mml:mi><mml:mtext>&#x02009;</mml:mtext><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo class="MathClass-open">[</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">]</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003E;</mml:mo><mml:mi>T</mml:mi><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array" columnalign="left"><mml:mn>0</mml:mn><mml:mo class="MathClass-punc">,</mml:mo><mml:mspace width="1em" class="quad"/></mml:mtd><mml:mtd class="array" columnalign="left"><mml:mi mathvariant="italic">otherwise</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
where <italic>g<sub>d</sub></italic>[<italic>t</italic>] is defined by equation (<xref ref-type="disp-formula" rid="E5">5</xref>) and the parameter <italic>TH<sub>d</sub></italic> is defined by equation (<xref ref-type="disp-formula" rid="E6">6</xref>).
<disp-formula id="E5"><label>(5)</label><mml:math id="M5"><mml:msub><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>D</mml:mi><mml:mo class="MathClass-op">&#x02297;</mml:mo><mml:mi>x</mml:mi><mml:mo class="MathClass-punc">.</mml:mo></mml:math></disp-formula></p>
<p>The &#x02297; is the convolution operator, and <italic>x</italic> is the input MMG signal.
<disp-formula id="E6"><label>(6)</label><mml:math id="M6"><mml:mi>T</mml:mi><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mn>&#x003B1;</mml:mn></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02217;</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mrow><mml:mo class="MathClass-op">&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:msubsup><mml:mtext>&#x02009;</mml:mtext><mml:msub><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo class="MathClass-open">[</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mo class="MathClass-close">]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo class="MathClass-punc">.</mml:mo></mml:math></disp-formula></p>
<p>The parameter <italic>&#x003B1;<sub>d</sub></italic> in above equation is the threshold scaling factor, which is set to 2 in our system. <italic>T<sub>s</sub></italic><sub>1</sub> and <italic>T<sub>s</sub></italic><sub>2</sub> have same definitions as mentioned above.</p>
</sec>
</sec>
<sec id="S2-4">
<label>2.4</label> <title>Feature Extraction Module</title>
<p>Feature extraction is an extremely important process in our system as the recognition accuracy is heavily dependent on whether indicative and relevant features to finger movements can be found. In our system, the MMG signals are transformed to wavelet domain for wavelet packet transform (WPT) coefficients. Then singular value decomposition (SVD) is applied to reduce the dimension of the coefficients for computational efficiency. Then, WPT features will be sent to our classification module for the recognition purpose.</p>
<sec id="S2-4-1">
<label>2.4.1</label> <title>Feature Matrix Extraction</title>
<p>Wavelet transform (WT) is proposed for multi-resolution analysis developed from the Fourier transform. It is able to represent the local signal characteristics in time-frequency domain. However, its resolution is decreasing when the signal frequency is increasing. In other words, the resolution in high-frequency region is very poor in the WT analysis. As an extension of the standard WT, WPT is able to provide an arbitrary time-frequency resolution (<xref ref-type="bibr" rid="B36">36</xref>). Therefore, WPT is used to extract the signal characteristics from the MMG signal here for analyzing the muscle activities.</p>
<p>The Figure <xref ref-type="fig" rid="F2">2</xref> shows a 5-level wavelet packet decomposition which is also known as optimal subband tree structuring. Each node of the tree is marked as <inline-formula><mml:math id="M7"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>, where <italic>j</italic> is the level with the range from 1 to 5, and <italic>p</italic>&#x02009;&#x0003D;&#x02009;1,&#x02009;&#x02026;&#x02009;,&#x02009;2<italic><sup>j</sup></italic> is the number of the packet in the <italic>j</italic>th level. Each node, <inline-formula><mml:math id="M8"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>, can be decomposed to two nodes, <inline-formula><mml:math id="M9"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>p</mml:mi><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M10"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>, which is described in equation (<xref ref-type="disp-formula" rid="E7">7</xref>). The reconstructions are given in equations (<xref ref-type="disp-formula" rid="E9">8</xref>) and (<xref ref-type="disp-formula" rid="E9">9</xref>) as below:
<disp-formula id="E7"><label>(7)</label><mml:math id="M11"><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>p</mml:mi><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo class="MathClass-op">&#x02295;</mml:mo><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
<disp-formula id="E8"><label>(8)</label><mml:math id="M12"><mml:msubsup><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:mi>p</mml:mi><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msqrt><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msqrt><mml:mo class="MathClass-op">&#x02211;</mml:mo><mml:mi>h</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>2</mml:mn><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
<disp-formula id="E9"><label>(9)</label><mml:math id="M13"><mml:msubsup><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:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msqrt><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msqrt><mml:mo class="MathClass-op">&#x02211;</mml:mo><mml:mi>g</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>2</mml:mn><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
where <italic>n</italic> and <italic>t</italic> are both time indexes, <italic>h</italic>(<italic>n</italic>) in equation (<xref ref-type="disp-formula" rid="E8">8</xref>) is the scaling function, <italic>g</italic>(<italic>n</italic>) in equation (<xref ref-type="disp-formula" rid="E9">9</xref>) is the wavelet filter, and the details of <italic>h</italic>(<italic>n</italic>) and <italic>g</italic>(<italic>n</italic>) can be referred to Ref. (<xref ref-type="bibr" rid="B37">37</xref>). In our system, every MMG signal segment is decomposed into the 5th level shown in Figure <xref ref-type="fig" rid="F2">2</xref>. Each node of the 5th level wavelet is a column vector containing <italic>LN</italic>/32 coefficients, where <italic>LN</italic> is the size of the processed MMG signal. All the nodes of the 5th level construct a (<italic>LN</italic>/32) x 32 feature matrix, <italic>X</italic>, shown in the following equation:
<disp-formula id="E10"><label>(10)</label><mml:math id="M14"><mml:mi>X</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfenced separators="" open="[" close="]"><mml:mrow><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-punc">,</mml:mo><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-punc">,</mml:mo><mml:mo class="MathClass-punc">.</mml:mo><mml:mo class="MathClass-punc">.</mml:mo><mml:mo class="MathClass-punc">.</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>32</mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow></mml:mfenced><mml:mspace width="0.3em" class="thinspace"/><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mn>1</mml:mn><mml:mo class="MathClass-punc">,</mml:mo><mml:mn>2</mml:mn><mml:mo class="MathClass-punc">,</mml:mo><mml:mn>3</mml:mn><mml:mo class="MathClass-punc">,</mml:mo><mml:mo class="MathClass-op">&#x02026;</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:mi mathvariant="italic">LN</mml:mi><mml:mo class="MathClass-bin">&#x02215;</mml:mo><mml:mn>32</mml:mn></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-punc">.</mml:mo></mml:math></disp-formula></p>
<fig position="float" id="F2">
<label>Figure 2</label>
<caption><p>The wavelet packet decomposition tree.</p></caption>
<graphic xlink:href="fneur-08-00573-g002.tif"/>
</fig>
</sec>
<sec id="S2-4-2">
<label>2.4.2</label> <title>Feature Compression</title>
<p>WPT normally generates a large number of features for classification. To reduce the workload of following classifier and prompt the proposed system to be real-time processing, the SVD technique is used in our system to extract the new feature from the <italic>X</italic> for reducing dimension. As a matrix factorization technique, SVD is proven to be reliable and efficient (<xref ref-type="bibr" rid="B38">38</xref>, <xref ref-type="bibr" rid="B39">39</xref>). The feature matrix, <italic>X<sub>L</sub></italic><sub>&#x000D7;</sub><italic><sub>M</sub></italic> (<italic>L</italic>&#x02009;&#x0003D;&#x02009;<italic>LN</italic>/32, <italic>M</italic>&#x02009;&#x0003D;&#x02009;32), given by equation (<xref ref-type="disp-formula" rid="E10">10</xref>) is decomposed by the SVD technique given by the following equation:
<disp-formula id="E11"><label>(11)</label><mml:math id="M15"><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo class="MathClass-bin">&#x000D7;</mml:mo><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo class="MathClass-bin">&#x000D7;</mml:mo><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mo class="MathClass-op">&#x0039B;</mml:mo></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo class="MathClass-bin">&#x000D7;</mml:mo><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mo class="MathClass-bin">&#x000D7;</mml:mo><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
where <italic>U</italic> and <italic>V</italic> are the <italic>L</italic>&#x02009;&#x000D7;&#x02009;<italic>L</italic> and <italic>M</italic>&#x02009;&#x000D7;&#x02009;<italic>M</italic> orthogonal matrixes, and &#x0039B; is a <italic>L</italic>&#x02009;&#x000D7;&#x02009;<italic>M</italic> nonnegative diagonal matrix described as follows:
<disp-formula id="E12"><label>(12)</label><mml:math id="M16"><mml:mo class="MathClass-op">&#x0039B;</mml:mo><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfenced separators="" open="(" close=")"><mml:mrow><mml:mtable equalrows="false" columnlines="none none none none none none none none none" equalcolumns="false" class="array"><mml:mtr><mml:mtd class="array" columnalign="center"><mml:mi>S</mml:mi><mml:mspace width="2.56804pt" class="tmspace"/><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array" columnalign="center"><mml:mn>0</mml:mn><mml:mspace width="2.56804pt" class="tmspace"/><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced><mml:mo class="MathClass-punc">,</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mi>S</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi mathvariant="italic">diag</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mn>&#x003C3;</mml:mn></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo class="MathClass-punc">,</mml:mo><mml:msub><mml:mrow><mml:mn>&#x003C3;</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo class="MathClass-punc">,</mml:mo><mml:mo class="MathClass-punc">.</mml:mo><mml:mo class="MathClass-punc">.</mml:mo><mml:mo class="MathClass-punc">.</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:msub><mml:mrow><mml:mn>&#x003C3;</mml:mn></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
where <italic>r</italic> is the rank of the matrix, and <italic>&#x003C3;</italic><sub>1</sub>, <italic>&#x003C3;</italic><sub>2</sub>,&#x02009;&#x02026;&#x02009;,&#x02009;<italic>&#x003C3;</italic><sub>r</sub> are the singular values of matrix <italic>X</italic>, which are used as the extracted features. Since (<italic>LN</italic>/32) is normally larger than 32 in this article, the extracted features are with the size of 32.</p>
</sec>
<sec id="S2-4-3">
<label>2.4.3</label> <title>Feature Selection</title>
<p>There are 32 features from each MMG channel after the feature compression stage. However, these features have different degrees of relevance for the hand-motion classification. The MMG signal obtained by the MMG acquisition system contains both the mechanical signal generated by the hand motions and noises from different sources such as electrical noise and the vibration noise from the surroundings. The features containing the noise usually have an adverse effect for the recognition. It should be noted that a larger number of SVD features do not always lead to more effective classification results (<xref ref-type="bibr" rid="B24">24</xref>). Therefore, a feature ranking algorithm is required to select the most relevant features to further improve the recognition results.</p>
<p>In the proposed system, the methodology proposed in Ref. (<xref ref-type="bibr" rid="B40">40</xref>) is utilized for features ranking. The parameter <italic>F</italic>-value is calculated from the features extracted by WPT&#x02013;SVD algorithm. For each feature, the bigger value of the <italic>F</italic> indicates higher importance for classification. The details of how to calculate the <italic>F</italic> are described following.</p>
<p>First of all, the average distance of each kind of feature from the same finger gesture is calculated by the following equation:
<disp-formula id="E13"><label>(13)</label><mml:math id="M17"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mtext>&#x02009;</mml:mtext><mml:mrow><mml:mn>&#x0007C;</mml:mn><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x02212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mn>&#x0007C;</mml:mn><mml:mo>;</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mo stretchy='false'>(</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mi>m</mml:mi><mml:mo>&#x02260;</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mstyle><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
where <italic>N</italic> is the number of the samples of the same finger gestures, <italic>p<sub>i,j</sub></italic>(<italic>m</italic>) is the <italic>m</italic>th sample of the <italic>i</italic>th feature of the <italic>j</italic>th gesture. For each feature, its average distance between 5 finger gestures can be defined as follows:
<disp-formula id="E14"><label>(14)</label><mml:math id="M18"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="italic">ai</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>M</mml:mi></mml:mfrac><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>M</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mstyle><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The <italic>ai</italic> is the number of the gestures. The value of <italic>M</italic> is 5 since there are five gestures needed to be recognized. Then, we calculate the average value of each feature in the same gesture as follows:
<disp-formula id="E15"><label>(15)</label><mml:math id="M19"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi mathvariant="italic">ai</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mo stretchy='false'>(</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mi>N</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mstyle><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The average distance of each feature between different finger gestures can be defined by the following equation:
<disp-formula id="E16"><label>(16)</label><mml:math id="M20"><mml:mrow><mml:msub><mml:msup><mml:mi>d</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mrow><mml:mi mathvariant="italic">ai</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>M</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>M</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>M</mml:mi></mml:munderover><mml:mrow><mml:mn>&#x0007C;</mml:mn><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi mathvariant="italic">ai</mml:mi><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi mathvariant="italic">ai</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mn>&#x0007C;</mml:mn><mml:mtext>&#x02009;</mml:mtext><mml:mo stretchy='false'>(</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mi>N</mml:mi><mml:mo>;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#x02260;</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mstyle><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Finally, the F-values can be calculated as follows: <inline-formula><mml:math id="M21"><mml:mi>F</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">ai</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02215;</mml:mo><mml:msub><mml:mrow><mml:mi>d</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="italic">ai</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Following this algorithm, the 32 features are ranked in descending order according to its F-value.</p>
</sec>
</sec>
<sec id="S2-5">
<label>2.5</label> <title>Classification Module</title>
<p>The last module of our FGR system is the classifier to recognize the finger movement based on the features selected. In many reported MMG-based hand-gesture recognition systems, various pattern recognition algorithms were used such as linear classifier (<xref ref-type="bibr" rid="B24">24</xref>), multilayer perception (<xref ref-type="bibr" rid="B26">26</xref>), and neural networks (<xref ref-type="bibr" rid="B21">21</xref>). In our system, the classifiers, NBC, KNN, and SVM are selected, and the performance of three algorithms is compared.</p>
<sec id="S2-5-1">
<label>2.5.1</label> <title>NBC</title>
<p>NBC, as a subclass of Bayes classification algorithm, is widely applied in the pattern recognition because of its simplicity and effectiveness. In some applications, its performance is comparable with other classifiers with increased computational complexity (<xref ref-type="bibr" rid="B41">41</xref>). Naive Bayes classification model assumes that each feature is independent for the classification. Although this unrealistic assumption limits its scope of applications, the time and space complexities are reduced. Therefore, the NBC is still a popular choice in various applications (<xref ref-type="bibr" rid="B42">42</xref>, <xref ref-type="bibr" rid="B43">43</xref>). The implementation of NBC is based on the reference (<xref ref-type="bibr" rid="B44">44</xref>, <xref ref-type="bibr" rid="B45">45</xref>).</p>
</sec>
<sec id="S2-5-2">
<label>2.5.2</label> <title>KNN</title>
<p>KNN is a classification model based on statistical analysis. The KNN algorithm classifies the sample according to the class of its k-nearest neighbor samples in the feature space. And the sample is assigned to the class where most of its neighbor samples belong to. KNN is a simple classifier without priori statistical knowledge. Thus, it is widely used in applications with non-normal or unknown sample distributions (<xref ref-type="bibr" rid="B46">46</xref>). However, its performance will be degraded when the number of samples is large (<xref ref-type="bibr" rid="B47">47</xref>). The implementation of KNN is based on the reference (<xref ref-type="bibr" rid="B48">48</xref>).</p>
</sec>
<sec id="S2-5-3">
<label>2.5.3</label> <title>SVM</title>
<p>SVM is a machine learning algorithm based on the statistical learning theory. It is good to deal with the situations when small samples are available and high dimension pattern recognition task is given (<xref ref-type="bibr" rid="B49">49</xref>). The libSVM3.12 package (<xref ref-type="bibr" rid="B50">50</xref>) is adopted for programming implementation in our system. The polynomial kernel function, <italic>G</italic>(<italic>x</italic>), given by equation (<xref ref-type="disp-formula" rid="E17">17</xref>) is utilized in SVM classifier,
<disp-formula id="E17"><label>(17)</label><mml:math id="M22"><mml:mi>G</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mn>&#x003B3;</mml:mn><mml:mo class="MathClass-bin">&#x000D7;</mml:mo><mml:mi>x</mml:mi><mml:mo class="MathClass-bin">&#x000D7;</mml:mo><mml:mi>z</mml:mi><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mi mathvariant="italic">coef</mml:mi><mml:mtext>&#x02009;</mml:mtext><mml:mn>0</mml:mn></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="italic">degree</mml:mi></mml:mrow></mml:msup><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
where <italic>x</italic> is the vector of input features, <italic>z</italic> is the support vector produced by SVM after training, and the parameters <italic>coef</italic> &#x02009;0, <italic>&#x003B3;</italic>, and <italic>degree</italic> are set to 0, 1, and 3, respectively, in our system.</p>
</sec>
</sec>
</sec>
<sec id="S3">
<label>3</label> <title>System Characterization Results</title>
<p>In this section, we will describe the detailed experimental protocol for our FGR system characterizations. The characterization results are presented in this section as well with discussions. First of all, the performance of two TED algorithms introduced is compared with the manual event detection method. After that, the effectiveness of the features ranking and the performances of different classifiers are presented and discussed. At the end of this section, possible factors affecting the recognition results such as power of grip (PG) and body mass index (BMI) are discussed.</p>
<sec id="S3-1">
<label>3.1</label> <title>Participants</title>
<p>To fully characterize our system, twelve healthy participants (8 males and 4 females, 1 left-hander and 11 right-handers, age: 23&#x02009;&#x000B1;&#x02009;3.21, height: 164.2&#x02009;&#x000B1;&#x02009;7.65&#x02009;cm, weight 66.2&#x02009;&#x000B1;&#x02009;16.51&#x02009;kg) participate in our experiments voluntarily. No medical history of neuromuscular disorders is reported. All the participants understand and agree with the experiment protocol before joining in the test for MMG signal acquisition.</p>
</sec>
<sec id="S3-2">
<label>3.2</label> <title>Experimental Procedure</title>
<p>All participants are instructed to use five fingers of their dominant hand to tap, including thumb tapping, index finger tapping, middle finger tapping, ring finger tapping, and little finger tapping. Following a metronome with 30 beats per minute, every participant is asked to tap five fingers one by one from thumb to little finger, and each finger gesture is repeated five times before moving to next finger. The above process is repeated five times with 5&#x02009;min interval to avoid the unreliable samples due to large number of consecutive tappings on the same finger. Therefore, there are totally 125 finger-gesture movements (5 finger gestures&#x02009;&#x000D7;&#x02009;5 times&#x02009;&#x000D7;&#x02009;5 rounds) for every participant. A total of 25 movements on each finger are obtained from tapping with either short time interval or long time interval which increases the variety of data set.</p>
</sec>
<sec id="S3-3">
<label>3.3</label> <title>Characterization of Auto-Event Annotation Module</title>
<p>The auto-event annotation module in our system is tested. In details, the performance of two automatic TED algorithms is compared with the manual approach which is supposed to be optimal. The false detection events ratio (FDER) of the RMS-based and the DTF-based automatic TED algorithms are calculated which relates to the error rate of the muscle activity event detection. In addition, the accuracies of the MMG signal segmentation by different methods including DTF, RMS, and manual cutting are calculated and discussed.</p>
<sec id="S3-3-1">
<label>3.3.1</label> <title>The Error Rate of Automatic TED</title>
<p>In this experiment, the false detection events in two scenarios are measured. The first one is the false negative event shown on the top of Figure <xref ref-type="fig" rid="F3">3</xref>. The muscular contraction event occurs but the TED algorithm cannot detect it. In this situation, the proposed system is not able to recognize finger-gesture movements. The other one is the false positive event shown in the bottom of Figure <xref ref-type="fig" rid="F3">3</xref>. The muscular contraction events can be detected by the TED algorithm while this signal segment contains irrelevant information. As a result, the wrong recognition results will be obtained by the proposed system.</p>
<fig position="float" id="F3">
<label>Figure 3</label>
<caption><p>The examples of false negative event (top) and false positive event (bottom) highlighted by the pink windows. The vertical axis title is &#x0201C;Amplitude&#x0201D; and the horizontal axis title is &#x0201C;Number of Sampling Points.&#x0201D; The sampling rate is 1&#x02009;kHz, and then the above chart shows segments lasting approximately 4&#x02009;s (top) and 8&#x02009;s (bottom). Within this chart, the blue line is the original MMG signal, the red line is the automatic TED result, and the horizontal gray line is the threshold calculated by equation (<xref ref-type="disp-formula" rid="E3">3</xref>) or equation (<xref ref-type="disp-formula" rid="E6">6</xref>). Thus, the vertical black line indicates the start point of detected event after which the red line goes beyond the gray line, while the vertical green line indicates the end point of detected event after which the red line goes under the gray line.</p></caption>
<graphic xlink:href="fneur-08-00573-g003.tif"/>
</fig>
<p>FDER is a suitable indicator to measure and compare the performance between the RMS- and DTF-based automatic TED algorithms. The FDER is defined by the equation (<xref ref-type="disp-formula" rid="E18">18</xref>):
<disp-formula id="E18"><label>(18)</label><mml:math id="M23"><mml:mi mathvariant="italic">FDER</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">FP</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">FN</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">all</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
where the <italic>N<sub>all</sub></italic> is the number of all events detected by the algorithm. The <italic>N<sub>FP</sub></italic> and <italic>N<sub>FN</sub></italic> are the numbers of the false positive event and the false negative event, respectively.</p>
<p>In our experiment, all the data are processed separately by the RMS- and DTF-based automatic TED algorithms. The FDER values are 1.5 and 2.2%, respectively, for RMS-based method and the DTF-based method.</p>
</sec>
<sec id="S3-3-2">
<label>3.3.2</label> <title>The Accuracy of MMG Segmentation</title>
<p>There are two tasks for the TED algorithms. The first task is to detect the fingers activity events correctly. The second task is to extract the MMG signal segment accurately. The FDER is the index to measure the performance of the first task. Next, we discuss how to measure the performance of the second task. There are two scenarios when the MMG signal segment is extracted inaccurately. As shown in Figure <xref ref-type="fig" rid="F4">4</xref>, the segment of the MMG signal shown in the top is very weak where the starting point of the event is too close to the end point, resulting in loss of the key information. On the other hand, the sub-figure in the bottom part of Figure <xref ref-type="fig" rid="F4">4</xref> shows that the MMG signals contain some noises which may introduce some interferences. These inaccurate segmentations are the two factors that can degrade the recognition accuracy of the proposed FGR system.</p>
<fig position="float" id="F4">
<label>Figure 4</label>
<caption><p>The examples of inaccurate extraction by automatic TED Algorithms highlighted by the pink windows. The vertical axis title is &#x0201C;Amplitude&#x0201D; and the horizontal axis title is &#x0201C;Number of Sampling Points.&#x0201D; The sampling rate is 1&#x02009;kHz, and then the above chart shows segments lasting approximately 5&#x02009;s (top) and 6&#x02009;s (bottom). Within this chart, the blue line is the original MMG signal, the red line is the automatic TED result, and the horizontal gray line is the threshold calculated by equation (<xref ref-type="disp-formula" rid="E3">3</xref>) or equation (<xref ref-type="disp-formula" rid="E6">6</xref>). Thus, the vertical black line indicates the start point of detected event after which the red line goes beyond the gray line, while the vertical green line indicates the end point of detected event after which the red line goes under the gray line.</p></caption>
<graphic xlink:href="fneur-08-00573-g004.tif"/>
</fig>
<p>Currently, there is no quantitative index to directly measure the quality of the MMG signal segment extraction. As our system focuses on the final finger-gesture recognition accuracy, we only compare the performance of RMS- and DTF-based TED algorithms with manual segmentation in achieving the final recognition rate. Among that, manual segmentation is supposed to be the accurate and optimal method for extracting the finger tapping event. In this comparison experiment, only the first 4 features after feature ranking process are used, and the NBC classifier is used. The results are reported in the Figure <xref ref-type="fig" rid="F5">5</xref>. This figure clearly shows that the manual segmentation has the best performance for the proposed FGR system, followed by the RMS- and DTF-based automatic TED algorithms.</p>
<fig position="float" id="F5">
<label>Figure 5</label>
<caption><p>The recognition accuracy achieved by the manual segmentation, RMS- and DTF-based automatic TED algorithms, respectively.</p></caption>
<graphic xlink:href="fneur-08-00573-g005.tif"/>
</fig>
</sec>
<sec id="S3-3-3">
<label>3.3.3</label> <title>Discussion of TED Algorithm Evaluation</title>
<p>From the results in Section <xref ref-type="sec" rid="S3-3-1">3.3.1</xref> and <xref ref-type="sec" rid="S3-3-2">3.3.2</xref>, the manual segmentation has slightly better performance compared with two automatic TED algorithms. If the performance between two automatic TED algorithms is compared, the RMS-based approach has a slightly better performance. However, the DTF-based approach has less computational complexity compared with the RMS-based method. Thus, the DTF-based approach is preferred in some low cost and real-time processing applications.</p>
</sec>
</sec>
<sec id="S3-4">
<label>3.4</label> <title>Classification Evaluation</title>
<p>The recognition accuracies of the classifiers SVM, KNN, and NBC are computed, and the results are compared and discussed. There are in total of 64 features from two-channel recorded MMG signals and 32 features are extracted from each channel. During the system characterization evaluation, the appropriate number of features used for recognition is also studied. Different numbers of features are selected by the ranking algorithm and the resulting recognition accuracies are compared. In this section, the manual segmentation for TED is selected to reduce unnecessary interference.</p>
<p>The experimental results are shown in Figure <xref ref-type="fig" rid="F6">6</xref>. The accuracy rate of identification is up to 94.0%, and the average accuracy rate is 87.9% by the NBC. The highest recognition results (94%) in NBC classifier are obtained when the first 4 features of each channel are used. The accuracy is reduced with the increased number of features as NBC assumes that every feature is dependent. In other words, each feature has the same importance impact for the NBC classifier. According to the ranking algorithm introduced in Section <xref ref-type="sec" rid="S2-4-3">2.4.3</xref>, the feature with lower rank means that it is less useful because of more noises involved. Thus, when less irrelevant features are used in the classification process, more noises are introduced, resulting in less accuracy of the NBC classifier. In addition, this result also shows that the feature ranking algorithm is critical for the NBC-based classifier, because it can remove the irrelevant features and improve the NBC performance.</p>
<fig position="float" id="F6">
<label>Figure 6</label>
<caption><p>The accuracy of different classifier with different number of features. The X-axis is number of the features from each channel for classification. The Y-axis is the average accuracy of all participants.</p></caption>
<graphic xlink:href="fneur-08-00573-g006.tif"/>
</fig>
<p>The recognition accuracies from the KNN and SVM classifiers are improved slightly when the number of features per channel is larger than 3. The possible reasons of this observation are explained as follows. KNN is a classification algorithm based on the distance of the feature space. In that case, it is insensitive to the weak features. Therefore, the classification accuracy is not degraded when the number of weak features is increased (<xref ref-type="bibr" rid="B46">46</xref>). The SVM classifier aims to optimize the performance based on all features, which definitely includes the weak features. The best linear combination of all features is chosen by the SVM classification. Thus, the SVM performance is becoming slightly better when more features are used in Figure <xref ref-type="fig" rid="F6">6</xref>. In addition, the performance of SVM is also dependent on the used kernel function. The proposed system only considers the polynomial kernel and nonlinear kernel functions may improve the performance which will be explored in the future work.</p>
</sec>
<sec id="S3-5">
<label>3.5</label> <title>Influencing Factors</title>
<p>As the MMG signals are produced by the muscle and transmitted by the soft tissue (<xref ref-type="bibr" rid="B14">14</xref>), intuitively, our FGR system might have better performance on participants who have well developed forearm muscles and thinner hypodermic fat. To verify this hypothesis, the power of grip (PG) is measured as the index of muscle strength, and the body mass index (BMI) is recorded as the index of hypodermic fat for each participant in this experiment. The recognition performance on each participant is then compared.</p>
<p>The Figure <xref ref-type="fig" rid="F7">7</xref> shows the relationship between (<italic>PG</italic>/<italic>BMI</italic>) and the recognition accuracy rate. The X-axis is the recognition accuracy based on every participant data where the NBC classifier with 8 features (4 features for each channel) is adopted for the FGR system. The Y-axis is the value of PG divided by BMI, namely (<italic>PG</italic>/<italic>BMI</italic>). There is a linear relationship between the (<italic>PG</italic>/<italic>BMI</italic>) and the recognition accuracy in our experiments, and the cross-correlation coefficient is 0.728. The above results show that the recognition accuracy rate of FGR system is proportional to the muscle strength, while has a inverse proportion to the hypodermic fat. Although more testing data are needed to reach a firm conclusion instead of the above results from 12 participants, it is highly possible that the recognition accuracy of FGR system and the value of (<italic>PG</italic>/<italic>BMI</italic>) have a linear relationship. The MMG-based FGR system may have higher recognition accuracy on participants with higher ratio of PG and BMI. This finding also suggests that the proposed FGR system users should take more exercises to strengthen the forearm muscles and reduce the hypodermic fat to well control the system. This system may be adopted in different applications such as prosthetic control.</p>
<fig position="float" id="F7">
<label>Figure 7</label>
<caption><p>The relationship between the recognition accuracy and PG/BMI value. The two red samples are outliers, while the blue samples have a pronounced linear relationship.</p></caption>
<graphic xlink:href="fneur-08-00573-g007.tif"/>
</fig>
</sec>
</sec>
<sec id="S4">
<label>4</label> <title>Conclusion</title>
<p>In this article, a novel motion-intend-based finger gesture recognition system based on mechanomyogram (MMG) signal is presented to recognize each finger tapping. This is the first system capable of detecting every finger tapping. The architect and the design of the system are presented. A full system characterization is also evaluated and the recognition accuracies of the system are compared under different experimental settings. Our system is able to achieve up to 94% accuracy. How different factors such as PG and BMI of the participants affect the system performances are also discussed, and the obtained results suggest that the proposed FGR system users should take more exercises to strengthen their muscles and reduce the hypodermic fat.</p>
<p>The proposed system focuses on identifying motion intentions instead of actual finger movements. It is therefore suitable for finger rehabilitation training of stroke patients. In some cases, when stroke patients try to move their fingers, they cannot find corresponding action. With the proposed system, we can provide guidance to the patients by correcting the effort made toward their intentions of finger movement and can further quantitively measure the accuracy by exploring the enhancement of the system design. The quantified result is beneficial to further understanding of training intensity, contrasting training effect, and so on. Therefore, applying the proposed system to the stroke rehabilitation is worthy of continuous exploration and development.</p>
</sec>
<sec id="S5">
<title>Ethics Statement</title>
<p>This study was carried out in accordance with the recommendations of Ethical Committee of Health Science Center, Shenzhen University with written informed consent from all subjects. All subjects gave written informed consent in accordance with the Declaration of Helsinki. The protocol was approved by the School of Biomedical Engineering, Health Science Center, Shenzhen University, China.</p>
</sec>
<sec id="S6">
<title>Author Contributions</title>
<p>All the authors listed in this article have participated in the following work: substantial contributions to the conception or design of the work; or the acquisition, analysis, or interpretation of data for the work; drafting the work or revising it critically for important intellectual content; final approval of the version to be published; and agreement to be accountable for all aspects of the work in ensuring that questions related to the accuracy or integrity of any part of the work are appropriately investigated and resolved. HD and QH designed and implemented the simulation model, and prepared the manuscript; YZ built initial constructs and GD supervised the project; SC supervised the analysis and edited the manuscript; all the authors discussed the results and implications and commented on the manuscript at all stages.</p>
</sec>
<sec id="S7">
<title>Conflict of Interest Statement</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="financial-disclosure">
<p><bold>Funding.</bold> This work is supported by the Shenzhen Science and Technology Innovation Council (JCYJ20160608173106220, KQTD20 15033016104926) and Natural Science Foundation of SZU (827/000088). This work is also supported in part by the Science and Technology Planning Project of Guangdong Province (2015B020214007, 2016A020220002). SC is only financially supported by Institute of High Performance and Computing, Agency for Science, Technology and Research, Singapore.</p></fn>
</fn-group>
<ref-list>
<title>References</title>
<ref id="B1"><label>1</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ibraheem</surname> <given-names>NA</given-names></name> <name><surname>Khan</surname> <given-names>R</given-names></name></person-group>. <article-title>Survey on various gesture recognition technologies and techniques</article-title>. <source>Int J Comput Appl</source> (<year>2012</year>) <volume>50</volume>(<issue>7</issue>):<fpage>38</fpage>&#x02013;<lpage>44</lpage>.<pub-id pub-id-type="doi">10.5120/7786-0883</pub-id></citation></ref>
<ref id="B2"><label>2</label><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Brunelli</surname> <given-names>D</given-names></name> <name><surname>Tadesse</surname> <given-names>AM</given-names></name> <name><surname>Vodermayer</surname> <given-names>B</given-names></name> <name><surname>Nowak</surname> <given-names>M</given-names></name> <name><surname>Castellini</surname> <given-names>C</given-names></name></person-group>. <article-title>Low-cost wearable multichannel surface EMG acquisition for prosthetic hand control</article-title>. <conf-name>Proceedings of the 6th International Workshop on Advances in Sensors and Interfaces</conf-name>. <conf-loc>Gallipoli</conf-loc>: <conf-sponsor>IEEE</conf-sponsor> (<year>2015</year>). p. <fpage>94</fpage>&#x02013;<lpage>9</lpage>.</citation></ref>
<ref id="B3"><label>3</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Beisteiner</surname> <given-names>R</given-names></name> <name><surname>Windischberger</surname> <given-names>C</given-names></name> <name><surname>Lanzenberger</surname> <given-names>R</given-names></name> <name><surname>Edward</surname> <given-names>V</given-names></name> <name><surname>Cunnington</surname> <given-names>R</given-names></name> <name><surname>Erdler</surname> <given-names>M</given-names></name> <etal/></person-group> <article-title>Finger somatotopy in human motor cortex</article-title>. <source>Neuroimage</source> (<year>2001</year>) <volume>13</volume>(<issue>6</issue>):<fpage>1016</fpage>&#x02013;<lpage>26</lpage>.<pub-id pub-id-type="doi">10.1006/nimg.2000.0737</pub-id><pub-id pub-id-type="pmid">11352607</pub-id></citation></ref>
<ref id="B4"><label>4</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liao</surname> <given-names>K</given-names></name> <name><surname>Xiao</surname> <given-names>R</given-names></name> <name><surname>Gonzalez</surname> <given-names>J</given-names></name> <name><surname>Ding</surname> <given-names>L</given-names></name></person-group>. <article-title>Decoding individual finger movements from one hand using human EEG signals</article-title>. <source>PLoS One</source> (<year>2014</year>) <volume>9</volume>(<issue>1</issue>):<fpage>e85192</fpage>.<pub-id pub-id-type="doi">10.1371/journal.pone.0085192</pub-id><pub-id pub-id-type="pmid">24416360</pub-id></citation></ref>
<ref id="B5"><label>5</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Khan</surname> <given-names>MJ</given-names></name> <name><surname>Hong</surname> <given-names>MJ</given-names></name> <name><surname>Hong</surname> <given-names>K-S</given-names></name></person-group>. <article-title>Decoding of four movement directions using hybrid NIRS-EEG brain-computer interface</article-title>. <source>Front Hum Neurosci</source> (<year>2014</year>) <volume>8</volume>:<fpage>244</fpage>.<pub-id pub-id-type="doi">10.3389/fnhum.2014.00244</pub-id><pub-id pub-id-type="pmid">24808844</pub-id></citation></ref>
<ref id="B6"><label>6</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hotson</surname> <given-names>G</given-names></name> <name><surname>McMullen</surname> <given-names>DP</given-names></name> <name><surname>Fifer</surname> <given-names>MS</given-names></name> <name><surname>Johannes</surname> <given-names>MS</given-names></name> <name><surname>Katyal</surname> <given-names>KD</given-names></name> <name><surname>Para</surname> <given-names>MP</given-names></name> <etal/></person-group> <article-title>Individual finger control of a modular prosthetic limb using high-density electrocorticography in a human subject</article-title>. <source>J Neural Eng</source> (<year>2016</year>) <volume>13</volume>(<issue>2</issue>):<fpage>026017</fpage>.<pub-id pub-id-type="doi">10.1088/1741-2560/13/2/026017</pub-id><pub-id pub-id-type="pmid">26863276</pub-id></citation></ref>
<ref id="B7"><label>7</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nguyen</surname> <given-names>H-D</given-names></name> <name><surname>Hong</surname> <given-names>K-S</given-names></name> <name><surname>Shin</surname> <given-names>Y-I</given-names></name></person-group>. <article-title>Bundled-optode method in functional near-infrared spectroscopy</article-title>. <source>PLoS One</source> (<year>2016</year>) <volume>11</volume>(<issue>10</issue>):<fpage>e0165146</fpage>.<pub-id pub-id-type="doi">10.1371/journal.pone.0165146</pub-id><pub-id pub-id-type="pmid">27788178</pub-id></citation></ref>
<ref id="B8"><label>8</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hong</surname> <given-names>K-S</given-names></name> <name><surname>Bhutta</surname> <given-names>MR</given-names></name> <name><surname>Liu</surname> <given-names>X</given-names></name> <name><surname>Shin</surname> <given-names>Y-I</given-names></name></person-group>. <article-title>Classification of somatosensory cortex activities using fNIRS</article-title>. <source>Behav Brain Res</source> (<year>2017</year>) <volume>333</volume>:<fpage>225</fpage>&#x02013;<lpage>34</lpage>.<pub-id pub-id-type="doi">10.1016/j.bbr.2017.06.034</pub-id><pub-id pub-id-type="pmid">28668280</pub-id></citation></ref>
<ref id="B9"><label>9</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Olman</surname> <given-names>CA</given-names></name> <name><surname>Pickett</surname> <given-names>KA</given-names></name> <name><surname>Schallmo</surname> <given-names>M-P</given-names></name> <name><surname>Kimberley</surname> <given-names>TJ</given-names></name></person-group>. <article-title>Selective bold responses to individual finger movement measured with FMRI at 3t</article-title>. <source>Hum Brain Mapp</source> (<year>2012</year>) <volume>33</volume>(<issue>7</issue>):<fpage>1594</fpage>&#x02013;<lpage>606</lpage>.<pub-id pub-id-type="doi">10.1002/hbm.21310</pub-id><pub-id pub-id-type="pmid">21674691</pub-id></citation></ref>
<ref id="B10"><label>10</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Habermehl</surname> <given-names>C</given-names></name> <name><surname>Holtze</surname> <given-names>S</given-names></name> <name><surname>Steinbrink</surname> <given-names>J</given-names></name> <name><surname>Koch</surname> <given-names>SP</given-names></name> <name><surname>Obrig</surname> <given-names>H</given-names></name> <name><surname>Mehnert</surname> <given-names>J</given-names></name> <etal/></person-group> <article-title>Somatosensory activation of two fingers can be discriminated with ultrahigh-density diffuse optical tomography</article-title>. <source>Neuroimage</source> (<year>2012</year>) <volume>59</volume>(<issue>4</issue>):<fpage>3201</fpage>&#x02013;<lpage>11</lpage>.<pub-id pub-id-type="doi">10.1016/j.neuroimage.2011.11.062</pub-id><pub-id pub-id-type="pmid">22155031</pub-id></citation></ref>
<ref id="B11"><label>11</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hong</surname> <given-names>K-S</given-names></name> <name><surname>Khan</surname> <given-names>MJ</given-names></name></person-group>. <article-title>Hybrid brain-computer interface techniques for improved classification accuracy and increased number of commands: a review</article-title>. <source>Front Neurorobot</source> (<year>2017</year>) <volume>11</volume>:<fpage>35</fpage>.<pub-id pub-id-type="doi">10.3389/fnbot.2017.00035</pub-id><pub-id pub-id-type="pmid">28790910</pub-id></citation></ref>
<ref id="B12"><label>12</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schenck</surname> <given-names>JF</given-names></name></person-group>. <article-title>The role of magnetic susceptibility in magnetic resonance imaging: MRI magnetic compatibility of the first and second kinds</article-title>. <source>Med Phys</source> (<year>1996</year>) <volume>23</volume>(<issue>6</issue>):<fpage>815</fpage>&#x02013;<lpage>50</lpage>.<pub-id pub-id-type="doi">10.1118/1.597854</pub-id><pub-id pub-id-type="pmid">8798169</pub-id></citation></ref>
<ref id="B13"><label>13</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Al-Mulla</surname> <given-names>MR</given-names></name> <name><surname>Sepulveda</surname> <given-names>F</given-names></name> <name><surname>Colley</surname> <given-names>M</given-names></name></person-group>. <article-title>A review of non-invasive techniques to detect and predict localised muscle fatigue</article-title>. <source>Sensors (Basel)</source> (<year>2011</year>) <volume>11</volume>(<issue>4</issue>):<fpage>3545</fpage>&#x02013;<lpage>94</lpage>.<pub-id pub-id-type="doi">10.3390/s110403545</pub-id><pub-id pub-id-type="pmid">22163810</pub-id></citation></ref>
<ref id="B14"><label>14</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Barry</surname> <given-names>DT</given-names></name> <name><surname>Leonard</surname> <given-names>J</given-names> <suffix>Jr</suffix></name> <name><surname>Gitter</surname> <given-names>AJ</given-names></name> <name><surname>Ball</surname> <given-names>RD</given-names></name></person-group>. <article-title>Acoustic myography as a control signal for an externally powered prosthesis</article-title>. <source>Arch Phys Med Rehabil</source> (<year>1986</year>) <volume>67</volume>(<issue>4</issue>):<fpage>267</fpage>&#x02013;<lpage>9</lpage>.<pub-id pub-id-type="pmid">3964064</pub-id></citation></ref>
<ref id="B15"><label>15</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Balbinot</surname> <given-names>A</given-names></name> <name><surname>de Freitas</surname> <given-names>JCR</given-names></name> <name><surname>C&#x000F4;rrea</surname> <given-names>DS</given-names></name></person-group>. <article-title>Use of inertial sensors as devices for upper limb motor monitoring exercises for motor rehabilitation</article-title>. <source>Health Technol</source> (<year>2015</year>) <volume>5</volume>(<issue>2</issue>):<fpage>91</fpage>&#x02013;<lpage>102</lpage>.<pub-id pub-id-type="doi">10.1007/s12553-015-0110-6</pub-id></citation></ref>
<ref id="B16"><label>16</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tosovic</surname> <given-names>D</given-names></name> <name><surname>Seidl</surname> <given-names>L</given-names></name> <name><surname>Ghebremedhin</surname> <given-names>E</given-names></name> <name><surname>Brown</surname> <given-names>MJ</given-names></name></person-group>. <article-title>Determining minimal stimulus intensity for mechanomyographic analysis</article-title>. <source>J Electromyogr Kinesiol</source> (<year>2015</year>) <volume>25</volume>(<issue>5</issue>):<fpage>749</fpage>&#x02013;<lpage>53</lpage>.<pub-id pub-id-type="doi">10.1016/j.jelekin.2015.06.003</pub-id><pub-id pub-id-type="pmid">26188951</pub-id></citation></ref>
<ref id="B17"><label>17</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Orizio</surname> <given-names>C</given-names></name> <name><surname>Perini</surname> <given-names>R</given-names></name> <name><surname>Diemont</surname> <given-names>B</given-names></name> <name><surname>Figini</surname> <given-names>MM</given-names></name> <name><surname>Veicsteinas</surname> <given-names>A</given-names></name></person-group>. <article-title>Spectral analysis of muscular sound during isometric contraction of biceps brachii</article-title>. <source>J Appl Physiol</source> (<year>1990</year>) <volume>68</volume>(<issue>2</issue>):<fpage>508</fpage>&#x02013;<lpage>12</lpage>.<pub-id pub-id-type="pmid">2318762</pub-id></citation></ref>
<ref id="B18"><label>18</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Posatskiy</surname> <given-names>A</given-names></name> <name><surname>Chau</surname> <given-names>T</given-names></name></person-group>. <article-title>Design and evaluation of a novel microphone-based mechanomyography sensor with cylindrical and conical acoustic chambers</article-title>. <source>Med Eng Phys</source> (<year>2012</year>) <volume>34</volume>(<issue>8</issue>):<fpage>1184</fpage>&#x02013;<lpage>90</lpage>.<pub-id pub-id-type="doi">10.1016/j.medengphy.2011.12.007</pub-id><pub-id pub-id-type="pmid">22227245</pub-id></citation></ref>
<ref id="B19"><label>19</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Watakabe</surname> <given-names>M</given-names></name> <name><surname>Mita</surname> <given-names>K</given-names></name> <name><surname>Akataki</surname> <given-names>K</given-names></name> <name><surname>Itoh</surname> <given-names>Y</given-names></name></person-group>. <article-title>Mechanical behaviour of condenser microphone in mechanomyography</article-title>. <source>Med Biol Eng Comput</source> (<year>2001</year>) <volume>39</volume>(<issue>2</issue>):<fpage>195</fpage>&#x02013;<lpage>201</lpage>.<pub-id pub-id-type="doi">10.1007/BF02344804</pub-id><pub-id pub-id-type="pmid">11361247</pub-id></citation></ref>
<ref id="B20"><label>20</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Islam</surname> <given-names>MA</given-names></name> <name><surname>Sundaraj</surname> <given-names>K</given-names></name> <name><surname>Ahmad</surname> <given-names>R</given-names></name> <name><surname>Ahamed</surname> <given-names>NU</given-names></name> <name><surname>Ali</surname> <given-names>M</given-names></name></person-group>. <article-title>Mechanomyography sensor development, related signal processing, and applications: a systematic review</article-title>. <source>IEEE Sens J</source> (<year>2013</year>) <volume>13</volume>(<issue>7</issue>):<fpage>2499</fpage>&#x02013;<lpage>516</lpage>.<pub-id pub-id-type="doi">10.1109/JSEN.2013.2255982</pub-id></citation></ref>
<ref id="B21"><label>21</label><citation citation-type="book"><person-group person-group-type="author"><name><surname>Alves-Kotzev</surname> <given-names>NL</given-names></name></person-group>. <source>Mechanomyography as an Access Pathway for Binary and Multifunction Control [PhD thesis]</source>. Citeseer. <publisher-loc>Toronto</publisher-loc>: <publisher-name>Doctoral dissertation, University of Toronto</publisher-name> (<year>2010</year>).</citation></ref>
<ref id="B22"><label>22</label><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Silva</surname> <given-names>J</given-names></name> <name><surname>Chau</surname> <given-names>T</given-names></name> <name><surname>Goldenberg</surname> <given-names>A</given-names></name></person-group>. <article-title>MMG-based multisensor data fusion for prosthesis control</article-title>. <conf-name>Proceedings of the 25th Annual International Conference of the IEEE Engineering in Medicine and Biology Society</conf-name>. (Vol. <volume>3</volume>), <conf-loc>Cancun</conf-loc>: <conf-sponsor>IEEE</conf-sponsor> (<year>2003</year>). p. <fpage>2909</fpage>&#x02013;<lpage>12</lpage>.</citation></ref>
<ref id="B23"><label>23</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ibitoye</surname> <given-names>MO</given-names></name> <name><surname>Hamzaid</surname> <given-names>NA</given-names></name> <name><surname>Zuniga</surname> <given-names>JM</given-names></name> <name><surname>Wahab</surname> <given-names>AKA</given-names></name></person-group>. <article-title>Mechanomyography and muscle function assessment: a review of current state and prospects</article-title>. <source>Clin Biomech</source> (<year>2014</year>) <volume>29</volume>(<issue>6</issue>):<fpage>691</fpage>&#x02013;<lpage>704</lpage>.<pub-id pub-id-type="doi">10.1016/j.clinbiomech.2014.04.003</pub-id><pub-id pub-id-type="pmid">24856875</pub-id></citation></ref>
<ref id="B24"><label>24</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Xie</surname> <given-names>H-B</given-names></name> <name><surname>Zheng</surname> <given-names>Y-P</given-names></name> <name><surname>Guo</surname> <given-names>J-Y</given-names></name></person-group>. <article-title>Classification of the mechanomyogram signal using a wavelet packet transform and singular value decomposition for multifunction prosthesis control</article-title>. <source>Physiol Meas</source> (<year>2009</year>) <volume>30</volume>(<issue>5</issue>):<fpage>441</fpage>.<pub-id pub-id-type="doi">10.1088/0967-3334/30/5/002</pub-id><pub-id pub-id-type="pmid">19349648</pub-id></citation></ref>
<ref id="B25"><label>25</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Alves</surname> <given-names>N</given-names></name> <name><surname>Chau</surname> <given-names>T</given-names></name></person-group>. <article-title>Uncovering patterns of forearm muscle activity using multi-channel mechanomyography</article-title>. <source>J Electromyogr Kinesiol</source> (<year>2010</year>) <volume>20</volume>(<issue>5</issue>):<fpage>777</fpage>&#x02013;<lpage>86</lpage>.<pub-id pub-id-type="doi">10.1016/j.jelekin.2009.09.003</pub-id></citation></ref>
<ref id="B26"><label>26</label><citation citation-type="book"><person-group person-group-type="author"><name><surname>Sasidhar</surname> <given-names>S</given-names></name> <name><surname>Panda</surname> <given-names>SK</given-names></name> <name><surname>Xu</surname> <given-names>J</given-names></name></person-group>. <article-title>A wavelet feature based mechanomyography classification system for a wearable rehabilitation system for the elderly</article-title>. <source>Inclusive Society: Health and Wellbeing in the Community, and Care at Home</source>. <publisher-loc>Berlin, Heidelberg</publisher-loc>: <publisher-name>Springer</publisher-name> (<year>2013</year>). p. <fpage>45</fpage>&#x02013;<lpage>52</lpage>.</citation></ref>
<ref id="B27"><label>27</label><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Hong-liu</surname> <given-names>Y</given-names></name> <name><surname>Sheng-nan</surname> <given-names>Z</given-names></name> <name><surname>Jia-hua</surname> <given-names>H</given-names></name></person-group>. <article-title>MMG signal and its applications in prosthesis control</article-title>. <conf-name>Proceedings of the 4th International Convention on Rehabilitation Engineering &#x00026; Assistive Technology</conf-name>. <conf-loc>Shanghai</conf-loc>: <conf-sponsor>Singapore Therapeutic, Assistive &#x00026; Rehabilitative Technologies (START) Centre</conf-sponsor> (<year>2010</year>). <fpage>58</fpage> p.</citation></ref>
<ref id="B28"><label>28</label><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Grossman</surname> <given-names>A</given-names></name> <name><surname>Silva</surname> <given-names>J</given-names></name> <name><surname>Chau</surname> <given-names>T</given-names></name></person-group>. <article-title>Functional mapping of multiple mechanomyographic signals to hand kinematics</article-title>. <conf-name>Proceedings of the Canadian Conference on Electrical and Computer Engineering</conf-name>. (Vol. <volume>1</volume>), <conf-loc>Niagara Falls</conf-loc>: <conf-sponsor>IEEE</conf-sponsor> (<year>2004</year>). p. <fpage>493</fpage>&#x02013;<lpage>6</lpage>.</citation></ref>
<ref id="B29"><label>29</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yu</surname> <given-names>W</given-names></name> <name><surname>Kishi</surname> <given-names>T</given-names></name> <name><surname>Acharya</surname> <given-names>UR</given-names></name> <name><surname>Horiuchi</surname> <given-names>Y</given-names></name> <name><surname>Gonzalez</surname> <given-names>J</given-names></name></person-group>. <article-title>Finger motion classification by forearm skin surface vibration signals</article-title>. <source>Open Med Inform J</source> (<year>2010</year>) <volume>4</volume>:<fpage>31</fpage>.<pub-id pub-id-type="doi">10.2174/1874431101004020031</pub-id><pub-id pub-id-type="pmid">20694155</pub-id></citation></ref>
<ref id="B30"><label>30</label><citation citation-type="book"><person-group person-group-type="author"><name><surname>Saha</surname> <given-names>DP</given-names></name></person-group>. <source>Design of a Wearable Two-Dimensional Joystick as a Muscle-Machine Interface Using Mechanomyographic Signals [Master&#x02019;s thesis]</source>. <publisher-loc>Blacksburg</publisher-loc>: <publisher-name>Virginia Polytechnic Institute and State University</publisher-name> (<year>2013</year>).</citation></ref>
<ref id="B31"><label>31</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ding</surname> <given-names>H</given-names></name> <name><surname>He</surname> <given-names>Q</given-names></name> <name><surname>Zeng</surname> <given-names>L</given-names></name> <name><surname>Zhou</surname> <given-names>Y</given-names></name> <name><surname>Shen</surname> <given-names>M</given-names></name> <name><surname>Dan</surname> <given-names>G</given-names></name></person-group>. <article-title>Motion intent recognition of individual fingers based on mechanomyogram</article-title>. <source>Pattern Recognit Lett</source> (<year>2017</year>) <volume>88</volume>:<fpage>41</fpage>&#x02013;<lpage>8</lpage>.<pub-id pub-id-type="doi">10.1016/j.patrec.2017.01.012</pub-id></citation></ref>
<ref id="B32"><label>32</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Silva</surname> <given-names>J</given-names></name> <name><surname>Heim</surname> <given-names>W</given-names></name> <name><surname>Chau</surname> <given-names>T</given-names></name></person-group>. <article-title>A self-contained, mechanomyography-driven externally powered prosthesis</article-title>. <source>Arch Phys Med Rehabil</source> (<year>2005</year>) <volume>86</volume>(<issue>10</issue>):<fpage>2066</fpage>&#x02013;<lpage>70</lpage>.<pub-id pub-id-type="doi">10.1016/j.apmr.2005.03.034</pub-id><pub-id pub-id-type="pmid">16213256</pub-id></citation></ref>
<ref id="B33"><label>33</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rhatigan</surname> <given-names>BA</given-names></name> <name><surname>Mylrea</surname> <given-names>KC</given-names></name> <name><surname>Lonsdale</surname> <given-names>E</given-names></name> <name><surname>Stern</surname> <given-names>LZ</given-names></name></person-group>. <article-title>Investigation of sounds produced by healthy and diseased human muscular contraction</article-title>. <source>IEEE Trans Biomed Eng</source> (<year>1986</year>) <volume>BME-33</volume>(<issue>10</issue>):<fpage>967</fpage>&#x02013;<lpage>71</lpage>.<pub-id pub-id-type="doi">10.1109/TBME.1986.325668</pub-id></citation></ref>
<ref id="B34"><label>34</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Madeleine</surname> <given-names>P</given-names></name> <name><surname>Farina</surname> <given-names>D</given-names></name> <name><surname>Merletti</surname> <given-names>R</given-names></name> <name><surname>Arendt-Nielsen</surname> <given-names>L</given-names></name></person-group>. <article-title>Upper trapezius muscle mechanomyographic and electromyographic activity in humans during low force fatiguing and non-fatiguing contractions</article-title>. <source>Eur J Appl Physiol</source> (<year>2002</year>) <volume>87</volume>(<issue>4&#x02013;5</issue>):<fpage>327</fpage>&#x02013;<lpage>36</lpage>.<pub-id pub-id-type="doi">10.1007/s00421-002-0655-8</pub-id><pub-id pub-id-type="pmid">12172870</pub-id></citation></ref>
<ref id="B35"><label>35</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Alves</surname> <given-names>N</given-names></name> <name><surname>Chau</surname> <given-names>T</given-names></name></person-group>. <article-title>Automatic detection of muscle activity from mechanomyogram signals: a comparison of amplitude and wavelet-based methods</article-title>. <source>Physiol Meas</source> (<year>2010</year>) <volume>31</volume>(<issue>4</issue>):<fpage>461</fpage>.<pub-id pub-id-type="doi">10.1088/0967-3334/31/4/001</pub-id></citation></ref>
<ref id="B36"><label>36</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sun</surname> <given-names>Z</given-names></name> <name><surname>Chang</surname> <given-names>C</given-names></name></person-group>. <article-title>Structural damage assessment based on wavelet packet transform</article-title>. <source>J Struct Eng</source> (<year>2002</year>) <volume>128</volume>(<issue>10</issue>):<fpage>1354</fpage>&#x02013;<lpage>61</lpage>.<pub-id pub-id-type="doi">10.1061/(ASCE)0733-9445(2002)128:10(1354)</pub-id></citation></ref>
<ref id="B37"><label>37</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Walczak</surname> <given-names>B</given-names></name> <name><surname>Massart</surname> <given-names>D</given-names></name></person-group>. <article-title>Noise suppression and signal compression using the wavelet packet transform</article-title>. <source>Chemom Intell Lab Syst</source> (<year>1997</year>) <volume>36</volume>(<issue>2</issue>):<fpage>81</fpage>&#x02013;<lpage>94</lpage>.<pub-id pub-id-type="doi">10.1016/S0169-7439(96)00077-9</pub-id></citation></ref>
<ref id="B38"><label>38</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Selvan</surname> <given-names>S</given-names></name> <name><surname>Ramakrishnan</surname> <given-names>S</given-names></name></person-group>. <article-title>SVD-based modeling for image texture classification using wavelet transformation</article-title>. <source>IEEE Trans Image Process</source> (<year>2007</year>) <volume>16</volume>(<issue>11</issue>):<fpage>2688</fpage>&#x02013;<lpage>96</lpage>.<pub-id pub-id-type="doi">10.1109/TIP.2007.908082</pub-id><pub-id pub-id-type="pmid">17990746</pub-id></citation></ref>
<ref id="B39"><label>39</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Brenner</surname> <given-names>MJ</given-names></name></person-group>. <article-title>Non-stationary dynamics data analysis with wavelet-svd filtering</article-title>. <source>Mech Syst Signal Process</source> (<year>2003</year>) <volume>17</volume>(<issue>4</issue>):<fpage>765</fpage>&#x02013;<lpage>86</lpage>.<pub-id pub-id-type="doi">10.1006/mssp.2002.1512</pub-id></citation></ref>
<ref id="B40"><label>40</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>B-S</given-names></name> <name><surname>Han</surname> <given-names>T</given-names></name> <name><surname>An</surname> <given-names>JL</given-names></name></person-group>. <article-title>ART&#x02013;KOHONEN neural network for fault diagnosis of rotating machinery</article-title>. <source>Mech Syst Signal Process</source> (<year>2004</year>) <volume>18</volume>(<issue>3</issue>):<fpage>645</fpage>&#x02013;<lpage>57</lpage>.<pub-id pub-id-type="doi">10.1016/S0888-3270(03)00073-6</pub-id></citation></ref>
<ref id="B41"><label>41</label><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Rish</surname> <given-names>I</given-names></name></person-group>. <article-title>An empirical study of the naive Bayes classifier</article-title>. <conf-name>Proceedings of the IJCAI 2001 Workshop on Empirical Methods in Artificial Intelligence</conf-name>. (Vol. <volume>3</volume>), <conf-loc>New York</conf-loc>: <conf-sponsor>IBM</conf-sponsor> (<year>2001</year>). p. <fpage>41</fpage>&#x02013;<lpage>6</lpage>.</citation></ref>
<ref id="B42"><label>42</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Domingos</surname> <given-names>P</given-names></name> <name><surname>Pazzani</surname> <given-names>M</given-names></name></person-group>. <article-title>On the optimality of the simple Bayesian classifier under zero-one loss</article-title>. <source>Mach Learn</source> (<year>1997</year>) <volume>29</volume>(<issue>2&#x02013;3</issue>):<fpage>103</fpage>&#x02013;<lpage>30</lpage>.<pub-id pub-id-type="doi">10.1023/A:1007413511361</pub-id></citation></ref>
<ref id="B43"><label>43</label><citation citation-type="book"><person-group person-group-type="author"><name><surname>Hellerstein</surname> <given-names>JL</given-names></name> <name><surname>Jayram</surname> <given-names>T</given-names></name> <name><surname>Rish</surname> <given-names>I</given-names></name></person-group>. <source>Recognizing End-User Transactions in Performance Management</source>. <publisher-loc>Hawthorne, NY</publisher-loc>: <publisher-name>IBM Thomas J. Watson Research Division</publisher-name> (<year>2000</year>).</citation></ref>
<ref id="B44"><label>44</label><citation citation-type="book"><person-group person-group-type="author"><name><surname>Mitchell</surname> <given-names>TM</given-names></name></person-group>. <source>Machine Learning</source>. <publisher-loc>New York</publisher-loc>: <publisher-name>McGraw-Hill</publisher-name> (<year>1997</year>).</citation></ref>
<ref id="B45"><label>45</label><citation citation-type="book"><person-group person-group-type="author"><name><surname>Metsis</surname> <given-names>V</given-names></name> <name><surname>Androutsopoulos</surname> <given-names>I</given-names></name> <name><surname>Paliouras</surname> <given-names>G</given-names></name></person-group>. <article-title>Spam filtering with naive Bayes-which naive Bayes?</article-title> <source>CEAS</source>. (Vol. <volume>17</volume>), <publisher-loc>Mountain View, CA</publisher-loc> (<year>2006</year>). p. <fpage>28</fpage>&#x02013;<lpage>69</lpage>.</citation></ref>
<ref id="B46"><label>46</label><citation citation-type="book"><person-group person-group-type="author"><name><surname>Sang</surname> <given-names>Y</given-names></name></person-group>. <source>Research of Classification Algorithm Based on K-Nearest Neighbor</source>. <publisher-loc>Chongqing</publisher-loc>: <publisher-name>Chongqing University</publisher-name> (<year>2009</year>).</citation></ref>
<ref id="B47"><label>47</label><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Angiulli</surname> <given-names>F</given-names></name></person-group>. <article-title>Fast condensed nearest neighbor rule</article-title>. <conf-name>Proceedings of the 22nd International Conference on Machine Learning</conf-name>. <conf-loc>Bonn</conf-loc>: <conf-sponsor>ACM</conf-sponsor> (<year>2005</year>). p. <fpage>25</fpage>&#x02013;<lpage>32</lpage>.</citation></ref>
<ref id="B48"><label>48</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Friedman</surname> <given-names>JH</given-names></name> <name><surname>Bentley</surname> <given-names>JL</given-names></name> <name><surname>Finkel</surname> <given-names>RA</given-names></name></person-group>. <article-title>An algorithm for finding best matches in logarithmic expected time</article-title>. <source>ACM Trans Math Software</source> (<year>1977</year>) <volume>3</volume>(<issue>3</issue>):<fpage>209</fpage>&#x02013;<lpage>26</lpage>.<pub-id pub-id-type="doi">10.1145/355744.355745</pub-id></citation></ref>
<ref id="B49"><label>49</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Xuegong</surname> <given-names>Z</given-names></name></person-group>. <article-title>Introduction to statistical learning theory and support vector machines</article-title>. <source>Acta Autom Sinica</source> (<year>2000</year>) <volume>26</volume>(<issue>1</issue>):<fpage>32</fpage>&#x02013;<lpage>42</lpage>.</citation></ref>
<ref id="B50"><label>50</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chang</surname> <given-names>C-C</given-names></name> <name><surname>Lin</surname> <given-names>C-J</given-names></name></person-group>. <article-title>LIBSVM: a library for support vector machines</article-title>. <source>ACM Trans Intell Syst Technol</source> (<year>2011</year>) <volume>2</volume>:<fpage>27</fpage>.<pub-id pub-id-type="doi">10.1145/1961189.1961199</pub-id></citation></ref>
</ref-list>
</back>
</article>