<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">14446</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2021.014446</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Timing and Classification of Patellofemoral Osteoarthritis Patients Using Fast Large Margin Classifier</article-title>
<alt-title alt-title-type="left-running-head">Timing and Classification of Patellofemoral Osteoarthritis Patients Using Fast Large Margin Classifier</alt-title>
<alt-title alt-title-type="right-running-head">Timing and Classification of Patellofemoral Osteoarthritis Patients Using Fast Large Margin Classifier</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western">
<surname>Ibraheem</surname>
<given-names>Mai Ramadan</given-names>
</name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western">
<surname>Adel</surname>
<given-names>Jilan</given-names>
</name>
<xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western">
<surname>Balbaa</surname>
<given-names>Alaa Eldin</given-names>
</name>
<xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western">
<surname>El-Sappagh</surname>
<given-names>Shaker</given-names>
</name>
<xref ref-type="aff" rid="aff-4">4</xref></contrib>
<contrib id="author-5" contrib-type="author" corresp="yes">
<name name-style="western">
<surname>Abuhmed</surname>
<given-names>Tamer</given-names>
</name>
<xref ref-type="aff" rid="aff-5">5</xref>
<email>tamer@skku.edu</email>
</contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western">
<surname>Elmogy</surname>
<given-names>Mohammed</given-names>
</name>
<xref ref-type="aff" rid="aff-6">6</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Faculty of Computers and Information, Kafrelsheikh University</institution>, <country>Egypt</country></aff>
<aff id="aff-2"><label>2</label><institution>Faculty of Physical Therapy, Kafrelsheikh University</institution>, <country>Egypt</country></aff>
<aff id="aff-3"><label>3</label><institution>Faculty of Physical Therapy, Nahda University</institution>, <addr-line>NUB</addr-line>, <country>Egypt</country></aff>
<aff id="aff-4"><label>4</label><institution>Universidade de Santiago de Compostela</institution>, <addr-line>Santiago de Compostela</addr-line>, <country>Spain</country></aff>
<aff id="aff-5"><label>5</label><institution>College of Computing, Sungkyunkwan University</institution>, <addr-line>Seoul, 06351, Korea</addr-line></aff>
<aff id="aff-6"><label>6</label><institution>Faculty of Computers and Information, Mansoura University</institution>, <addr-line>Mansoura, 35516</addr-line>, <country>Egypt</country></aff>
</contrib-group>
<author-notes><corresp id="cor1">&#x002A;Corresponding Author: Tamer Abuhmed. Email: <email>tamer@skku.edu</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2020-11-09">
<day>09</day>
<month>11</month>
<year>2020</year>
</pub-date>
<volume>67</volume>
<issue>1</issue>
<fpage>393</fpage>
<lpage>409</lpage>
<history>
<date date-type="received">
<day>21</day>
<month>09</month>
<year>2020</year>
</date>
<date date-type="accepted">
<day>03</day>
<month>11</month>
<year>2020</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2021 Ibraheem et al.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Ibraheem et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_14446.pdf"></self-uri>
<abstract>
<p>Surface electromyogram (sEMG) processing and classification can assist neurophysiological standardization and evaluation and provide habitational detection. The timing of muscle activation is critical in determining various medical conditions when looking at sEMG signals. Understanding muscle activation timing allows identification of muscle locations and feature validation for precise modeling. This work aims to develop a predictive model to investigate and interpret Patellofemoral (PF) osteoarthritis based on features extracted from the sEMG signal using pattern classification. To this end, sEMG signals were acquired from five core muscles over about 200 reads from healthy adult patients while they were going upstairs. Onset, offset, and time duration for the Transversus Abdominus (TrA), Vastus Medialis Obliquus (VMO), Gluteus Medius (GM), Vastus Lateralis (VL), and Multifidus Muscles (ML) were acquired to construct a classification model. The proposed classification model investigates function mapping from real-time space to a PF osteoarthritis discriminative feature space. The activation feature space of muscle timing is used to train several large margin classifiers to modulate muscle activations and account for such activation measurements. The fast large margin classifier achieved higher performance and faster convergence than support vector machines (SVMs) and other state-of-the-art classifiers. The proposed sEMG classification framework achieved an average accuracy of 98.8% after 7 s training time, improving other classification techniques in previous literature.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Muscle activation onset time</kwd>
<kwd>LS-SVM</kwd>
<kwd>surface electromyogram</kwd>
<kwd>patellofemoral osteoarthritis</kwd>
<kwd>the timing of core muscles</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Biomedical signals are common electrical signals from a specified organ used to detect physical changes. These biomedical signals generally represent neuromuscular activity during constriction. The nervous system controls the contraction and relaxation activities of muscle. The muscle tissue carries electrical signals (myoelectric activity) through nerves. These electrical signals indicate potential muscle movement [<xref ref-type="bibr" rid="ref-1">1</xref>]. Muscle activity can be detected via electromyography (EMG) devices in the form of a signal [<xref ref-type="bibr" rid="ref-2">2</xref>]. The acquisition of the signal is achieved by reading EMG signals generated in the form of analog measurements. Acquiring electromyograms from active muscles is done in two ways. The electrode utilized for obtaining these muscle signals can be an invasive and non-invasive electrode [<xref ref-type="bibr" rid="ref-3">3</xref>]. sEMG is preferable in clinical and physiological applications and can be used for obtaining the desired data simply and painlessly [<xref ref-type="bibr" rid="ref-4">4</xref>]. Several problems may influence the detected surface electromyogram (sEMG) signal and, consequently, the accuracy of the detected activation timing [<xref ref-type="bibr" rid="ref-5">5</xref>]. The most obvious problem is any noise added to the EMG, resulting in significant errors in the detected EMG. Another problem is the interference of neighboring muscles in the form of crosstalk. Other problems, i.e., measurement inaccuracies, affect the final EMG signal&#x2019;s nature recorded [<xref ref-type="bibr" rid="ref-6">6</xref>]. Patellofemoral Pain (PFP) is a common but complex illness that affects both athletes and the general population. Functional movements are produced by contributing a chain of muscles around the hip and knee regions working in unison. The pain itself generally result from excessive increases in running mileage or the addition of strength exercises. The pain may get worse with excessive use, climbing, or going upstairs [<xref ref-type="bibr" rid="ref-7">7</xref>]. Patellofemoral Osteoarthritis (PF OA) affects the underside of the kneecap (patella) and thighbone in the (femur) that the patella rests in [<xref ref-type="bibr" rid="ref-8">8</xref>]. PF OA typically affects patients with inflammation of the joints, patellofemoral laxity, or a high-riding patella [<xref ref-type="bibr" rid="ref-9">9</xref>]. The knee joint has a complex structure with three main parts called compartments, as shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. Each compartment has individual functions and structures within it. The inner compartment and the outer compartments are formed by joining the lowest part of the thighbone (femur) and the highest part of the shinbone (tibia) [<xref ref-type="bibr" rid="ref-10">10</xref>]. The inner and the outer compartment are known as medial and lateral compartments, respectively. The third compartment of the knee consists of the kneecap (patella) and the front part of the femur called the patellofemoral joint [<xref ref-type="bibr" rid="ref-7">7</xref>]. The patella protects the knee and gives control to muscles by sliding within the knee [<xref ref-type="bibr" rid="ref-11">11</xref>]. This helps shock absorption and allows the knee joint to move smoothly [<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-13">13</xref>]. However, arthritis in the knee affects more than four million Americans annually. It is more frequently seen in women [<xref ref-type="bibr" rid="ref-14">14</xref>]. PF OA patients need progressive rehabilitation exercises in order to recover full muscle function [<xref ref-type="bibr" rid="ref-8">8</xref>]. Understanding the timing of muscle activation will guide clinicians to incorporate exercises correctly in a rehabilitation program [<xref ref-type="bibr" rid="ref-13">13</xref>]. Exercises targeting the correct musculatures will benefit patients suffering from PFP and improve their strength and motor control in these regions [<xref ref-type="bibr" rid="ref-9">9</xref>].</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>The knee joint structure, including the patellofemoral compartment, which is located behind the kneecap (patella)</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-1.png"/>
</fig>
<p>For a precise diagnosis of PF OA, the number of related muscle have been synchronously estimated in an experiment [<xref ref-type="bibr" rid="ref-8">8</xref>]. This research adopted the five most generic asymptomatic controls for the diagnosis of PF OA. The sEMG research tool was used for obtaining readings from the target muscles. EMG activities for the Transversus Abdominus (TrA), Vastus Medialis Obliquus (VMO), Gluteus Medius (GM), Vastus Lateralis (VL) and Multifidus Muscles (ML) were acquired for further analysis. The timing of muscle activation is an important factor in predicting joint stiffness and in measuring joint stability. Joint stability balance depends on several muscle activation values [<xref ref-type="bibr" rid="ref-15">15</xref>]. A new approach is therefore needed to distinguish sEMG signals in different patients. The proposed approach is comprised of three steps. In the pre-processing step, electromyogram signaling is enhanced to overcome the interference problems that result from neighboring muscles in terms of crosstalk. In the second step, we extract key factor variables, i.e., burst onset, duration, and offset. Finally, a classification model is constructed using the features extracted from different patients to perform the classification task. This work aims to develop a more precise diagnostic framework for muscle activities measured using sEMG signals for PF OA patients. The order of muscle activation is determined to allow the clinician to incorporate exercises correctly in the rehabilitation program.</p>
<p>The rest of this paper is comprised of four sections. Section 2 reviews different literature in the classification of sEMG signals. Section 3 describes electromyogram acquisition in this work and the proposed framework. Section 4 presents the classification results of the predictive model, along with discussion and comparisons. Conclusions and future work are outlined in Section 5.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Literature Review</title>
<p>Numerous studies have analyzed and classified sEMG signals acquired from the different muscles responsible for controlling different body movements. This section presents similar techniques utilized in this area, along with some of the other relevant works using different methods. For example, Cene et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] proposed a classification framework based on a logistic regression algorithm to identify the sEMG signal movement. They used a gradient-descent adaptive method that was implemented to generate the proper equations for each movement. After testing their proposed logistic regression classification algorithm with the case study movement database, they achieved an average accuracy of <inline-formula id="ieqn-1"><alternatives><inline-graphic xlink:href="ieqn-1.png"/><tex-math id="tex-ieqn-1"><![CDATA[$90.2 \pm 3.8$]]></tex-math><mml:math id="mml-ieqn-1"><mml:mn>90</mml:mn><mml:mo>.</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>3</mml:mn><mml:mo>.</mml:mo><mml:mn>8</mml:mn></mml:math></alternatives></inline-formula>%. Sadikoglu et al. [<xref ref-type="bibr" rid="ref-2">2</xref>] demonstrated a binary classification system for diagnosing a healthy individual or a neuropathy patient. The system received two different EMG signals from different patients. The results were obtained in terms of comparative figures for both healthy and neuropathy EMG signals in the time domain. Veer et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] presented a classification system for sEMG signals from different upper arm muscles. They investigated muscle force relationships by applying statistical techniques for amplitude estimation. They reported an average classification accuracy of 92.50% using the ANN classifier. Khowailed et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] introduced real-time muscle activity detection based on deep learning. They used a recurrent neural network (RNN) that gave the network the ability to process time sequences. They observed a reasonable difference between the true and detected onset time. Liu et al. [<xref ref-type="bibr" rid="ref-19">19</xref>] presented an unsupervised learning framework based on a sequential Gaussian mixture model to detect EMG muscle activation. They evaluated their approach on a simulated sEMG signal whose activation was known previously. Rane et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] suggested using supervised learning in building an approximate prediction model for muscular force magnitude. They evaluated their system on widely known benchmark data (International Grand Challenge Competitions) [<xref ref-type="bibr" rid="ref-21">21</xref>]. They reported the average accuracy for predicting the forces of major muscle groups as 84%. Morbidoni et al. [<xref ref-type="bibr" rid="ref-22">22</xref>] proposed an sEMG classification approach to predict foot-floor-contact during natural walking. They adopted a deep learning approach for characterizing muscular recruitment during walking. They experimented with optimization using stochastic gradient descent (SGD) and optimal learning rate. After an extensive evaluation, they achieved an average classification accuracy of 94%.</p>
<p>In summary, some of the previous studies focused on measuring muscle activation timing in real-time [<xref ref-type="bibr" rid="ref-2">2</xref>,<xref ref-type="bibr" rid="ref-18">18</xref>,<xref ref-type="bibr" rid="ref-19">19</xref>]. Other relevant work used different techniques for the analysis and classification of EMG signals [<xref ref-type="bibr" rid="ref-16">16</xref>,<xref ref-type="bibr" rid="ref-17">17</xref>,<xref ref-type="bibr" rid="ref-20">20</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>]. The studies that measured muscle activation investigated characterizing the occurrence of active muscle from baseline in terms of the onset of muscle activation only using simulated signals [<xref ref-type="bibr" rid="ref-18">18</xref>,<xref ref-type="bibr" rid="ref-19">19</xref>]. The other EMG signal classification techniques relied on extracting statistical characteristics for the recognition process [<xref ref-type="bibr" rid="ref-17">17</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>]. This work aims to develop a classification technique based on muscle activation characteristics. The proposed muscle activation-based classification model can help by giving a more precise diagnosis for PF OA patients. The extracted features can also help determine the order of muscle activation to help clinicians incorporate suitable exercises into rehabilitation programs correctly [<xref ref-type="bibr" rid="ref-23">23</xref>&#x2013;<xref ref-type="bibr" rid="ref-26">26</xref>].</p>
</sec>
<sec id="s3">
<label>3</label>
<title>The Proposed Framework</title>
<sec id="s3_1">
<label>3.1</label>
<title>Surface Electromyography (SEMG) Acquisition</title>
<p>The placement of electrodes on the muscle of interest helps in acquiring a healthy signal. The most PF OA related muscles, i.e., TrA, VMO, GM, VL, and ML, were synchronously monitored for the experiment. In this section, the steps of our muscle activation-based classification model in terms of onset, offset, and duration of muscle activation are discussed in detail. The proposed PF OA diagnosis framework consists of the following steps, as shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>The PF OA diagnosis framework</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-2.png"/>
</fig>
<p>For a better understanding of the sEMG signal properties, several steps, such as pre-processing, feature extraction, and classification, are required. During the first phase, several filters are applied for better separation of the signal corresponding to movements from the subject. Several possible ways to perform this pre-processing stage, rectification, and filler techniques, along with a high pass filter, were applied in this framework. Once the electromyography signal is filtered, some key feature characteristics are extracted from the signal to serve as input parameters for the classification phase. Finally, in the last stage of sEMG signal recognition, classification is implemented based on the input characteristics provided, and the classification model is constructed. The fast large margin and SVM classification algorithms were used in this work.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Signal Pre-Processing</title>
<p>Several problems may affect the acquired sEMG signal formation and, consequently, the accuracy of the detected activation timing [<xref ref-type="bibr" rid="ref-2">2</xref>]. The first problem is the added noise to the sEMG that results in a significant error margin in the detected EMG [<xref ref-type="bibr" rid="ref-27">27</xref>]. The second problem is the crosstalk that results from the interference of neighboring muscles. Other problems, i.e., measurement inaccuracies, affect the nature of the sEMG signal [<xref ref-type="bibr" rid="ref-28">28</xref>]. In the pre-processing step, electromyogram signaling is enhanced to overcome the problems mentioned above, i.e., noise and interference problems. The processing stages that are applied to the sEMG signal are summarized in the following.</p>
<sec id="s3_2_1">
<label>3.2.1</label>
<title>Replace Outliers in sEMG Signal</title>
<p>Various background noise is received during the acquisition of the sEMG signal due to electronic equipment and other physiological factors. Proper techniques are required to eliminate noise and possible artifacts. The replace outliers method mostly finds the outliers for each of the five detected muscles and replaces them according to a filler [<xref ref-type="bibr" rid="ref-6">6</xref>]. The filler in terms of a method can be specified by each of the following ways: median, which return elements more than 3 scaled MADs (Median Absolute Deviations) from the median. mean, previous and next methods [<xref ref-type="bibr" rid="ref-28">28</xref>].</p>
</sec>
<sec id="s3_2_2">
<label>3.2.2</label>
<title>Rectification of the Full Wave</title>
<p>The sEMG signal is time and strength dependent whose amplitude takes random values above and below zero. Normalization of the sEMG signal is essential to define any characteristic properties of the signal then. The normalizing signal can be constructed by wave rectification to a scale that is common to all measurement occasions [<xref ref-type="bibr" rid="ref-17">17</xref>].</p>
<p>Full-wave rectification is applied by taking the absolute value of the signal. This rectification step is essential for getting a linear envelope shape for the sEMG signal [<xref ref-type="bibr" rid="ref-29">29</xref>]. Rectification turns the negative swings into positive swings. Rectification should be performed before low-passing the signal to smooth it [<xref ref-type="bibr" rid="ref-27">27</xref>]. The linear envelope of the signal can be obtained by performing filtering in both directions to eliminate any phase shift of the signal [<xref ref-type="bibr" rid="ref-28">28</xref>]. Constructing a low pass filter is also needed with order 4, and a cutoff frequency of 10 Hz. The combination of rectification and low pass filtering forms a &#x201C;linear envelope&#x201D; for the signal [<xref ref-type="bibr" rid="ref-27">27</xref>]. Converting the recorded sEMG signal into a linear envelope makes it easier to display and prepares it for any associated decision.</p>
</sec>
<sec id="s3_2_3">
<label>3.2.3</label>
<title>Root Mean Square (RMS) Envelope</title>
<p>When investigating the electromyogram signals detected from the surface electrode system, estimating the amplitude variation of the sEMG signal is most appropriate. The time-domain parameters in terms of RMS value can be used for identifying the proper timing of muscle activation [<xref ref-type="bibr" rid="ref-17">17</xref>]. The RMS value for the signal is plotted at the window center to avoid any envelope time shifts relative to the signal [<xref ref-type="bibr" rid="ref-28">28</xref>].</p>
</sec>
<sec id="s3_2_4">
<label>3.2.4</label>
<title>High Pass Filter</title>
<p>The number of muscle fibers, depth, amount of tissue, and location of active fibers all affect the quality of the sEMG signal recorded. These factors superimpose unwanted signals or cancel out the signal from the target muscle we are attempting to record. High-pass filtering permanently removes the effect of maintaining a constant force on or of repetitive fluctuation in the intensity from the sEMG signals [<xref ref-type="bibr" rid="ref-27">27</xref>]. A high-pass filter is well suited for eliminating the oscillation caused by superimposed artifacts. This step constructs a high pass filter using a design function with order 4, a passband frequency of 75 kHz, and a sampling frequency of 1000Hz. The designed high pass filter efficiently transforms the signals with flexible resolution in the time domain.</p>
</sec>
<sec id="s3_2_5">
<label>3.2.5</label>
<title>Rectification for the Final Result</title>
<p>The pre-processed sEMG signal is ready to be utilized in the subsequent steps of the proposed framework. Algorithm 1 shows the pre-processing steps of the proposed framework.</p>
<fig id="fig-6">
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-6.png"/>
</fig>
</sec>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Feature Extraction</title>
<p>The temporal characteristics of specific muscle activities can be investigated by analyzing sEMG signals during movement. The recorded sEMG signals during muscle movements should mainly cover activity level (activation timing) [<xref ref-type="bibr" rid="ref-25">25</xref>]. Every group of muscles works in a sequential order to perform a specific physical activity. The timing parameters of muscular activity are signification factors in the determination of the electromechanical delay under different conditions [<xref ref-type="bibr" rid="ref-5">5</xref>]. The timing parameters can be extracted from the recorded sEMG, including onset and offset times, to identify the duration of sEMG bursts [<xref ref-type="bibr" rid="ref-4">4</xref>]. Onset and offset values are defined as follows. The time point where muscle activity begins is the onset, whereas the time point where muscle activity ends is the offset. Determination of onset and offset times enables identifying the duration of each muscle&#x2019;s activity [<xref ref-type="bibr" rid="ref-3">3</xref>]. Aminaka et al. [<xref ref-type="bibr" rid="ref-9">9</xref>] defined duration as the time between muscle activation onset and offset. The detecting of timing parameters, i.e., onset, offset, and duration, also enable the determination of the order of activation for each of the five muscles. The values of onset and offset allow physicians to identify the physiological activity characteristics of the target muscle in the recorded sEMG [<xref ref-type="bibr" rid="ref-4">4</xref>]. The selection strategy is mainly based on the determination of a specific threshold value. The threshold choice lacks an agreement between the researchers [<xref ref-type="bibr" rid="ref-30">30</xref>]. Our approach adopts a threshold where the targeted muscle is considered to have reached the start time (onset) when its activity exceeds a threshold equal to three SDs above its baseline level. The activity must stay above the threshold for a minimum of 25 ms to be considered. At the same time, the muscle is considered to have reached the end time (offset) if its activity drops below the threshold equal to 3<inline-formula id="ieqn-2"><alternatives><inline-graphic xlink:href="ieqn-2.png"/><tex-math id="tex-ieqn-2"><![CDATA[$\times$]]></tex-math><mml:math id="mml-ieqn-2"><mml:mo>&#x00D7;</mml:mo></mml:math></alternatives></inline-formula> SDs for at least a 25 ms period [<xref ref-type="bibr" rid="ref-31">31</xref>]. Algorithm 1 lists the main steps of the feature extraction stage. The proposed algorithm is used for computing muscle activation parameters, i.e., onset duration, offset duration, and order of activation. The suggested algorithm first computes SDs for each of the five involved muscle signals. Then, it checks for muscle start time (onset) where the signal value exceeds the specified threshold of 3<inline-formula id="ieqn-3"><alternatives><inline-graphic xlink:href="ieqn-3.png"/><tex-math id="tex-ieqn-3"><![CDATA[$\times$]]></tex-math><mml:math id="mml-ieqn-3"><mml:mo>&#x00D7;</mml:mo></mml:math></alternatives></inline-formula> SDs. The signal value must exceed the specified threshold for 25 ms or more. In the same way, the algorithm checks for muscle end time (offset) where the signal value drops below the specified threshold of 3<inline-formula id="ieqn-4"><alternatives><inline-graphic xlink:href="ieqn-4.png"/><tex-math id="tex-ieqn-4"><![CDATA[$\times$]]></tex-math><mml:math id="mml-ieqn-4"><mml:mo>&#x00D7;</mml:mo></mml:math></alternatives></inline-formula> SDs for at least 25 ms. The algorithm calculates these values for each of the five involved muscles and each signal length. Consequently, the duration can be measured by subtracting onset from offset for each muscle signal. The signal for each muscle of interest was measured several times for each patient to overcome the problem of inaccurate measurements. Net values for key feature parameters, along with their matched muscle names, are concatenated in the table below.</p>
<fig id="fig-7">
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-7.png"/>
</fig>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Classification</title>
<sec id="s3_4_1">
<label>3.4.1</label>
<title>Post-Processing</title>
<p>The muscle characteristics features i.e., onset, offset, and duration are extracted for each of the five core muscles (TrA, VMO, GM, VL, and ML). The model was constructed using fifteen feature descriptors along with a labeling field to mark patients separate from healthy cases, as shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>The arrangement of sEMG features fed as input to the classifier</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-3.png"/>
</fig>
<p>The first row of entries in the given table shows the three discriminative features that were extracted for each of the five core muscles. The last row of entries in the table shows the three discriminative features; onset, offset, and duration, that were extracted for each muscle from healthy adults. The labeling field uses {1} to mark patients from {0} healthy cases in order to construct the training model. The extracted features are used as input data to train the linearly separable classifier. All feature matrices resulting from all trials were concatenated to form a single large matrix representing the whole dataset for the extensive margin classifiers, where each row represents a single input.</p>
<p>Before feeding data into the classifier, some prepossessing steps are applied to the final form of the dataset. Post-processing steps are needed to prepare, transform, and clean the data to emphasize any strong patterns in the dataset and summarize the information content. A min-max normalization for each muscle signal was performed to unify individual samples. The data cleansing helps in detecting irrelevant parts of the data, such as duplicates or coarse data. Low-quality data were removed by applying data cleansing methods. Dimensionality reduction using principal component analysis (PCA) technique is then performed to obtain the most significant judgment variables [<xref ref-type="bibr" rid="ref-32">32</xref>]. Thus, the model was built using discriminative muscle features to evaluate the ability of the trained model to produce precise predictions. The following algorithm shows the post-processing steps.</p>
<fig id="fig-8">
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-8.png"/>
</fig>
</sec>
<sec id="s3_4_2">
<label>3.4.2</label>
<title>Classification</title>
<p><italic>Support vector machines</italic></p>
<p>SVM is a machine learning algorithm for classification. The SVM&#x2019;s main objective is to find a dependency description between a set measured variables from an object and specific properties of these variables. Estimating the function mapping f: <inline-formula id="ieqn-5"><alternatives><inline-graphic xlink:href="ieqn-5.png"/><tex-math id="tex-ieqn-5"><![CDATA[$\mathrm{RN}\rightarrow \{{\pm}1\}$]]></tex-math><mml:math id="mml-ieqn-5"><mml:mstyle mathvariant="normal"><mml:mi>R</mml:mi><mml:mi>N</mml:mi></mml:mstyle><mml:mo>&#x2192;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> can be done in determining the corresponding values for new [<xref ref-type="bibr" rid="ref-33">33</xref>]. Using hard SVM, the hyperplane cannot separate in all cases. As such, in certain cases, the promotion of soft margin SVM is needed. Soft margin SVMs can find separation hyperplanes using positive slack variables, <inline-formula id="ieqn-6"><alternatives><inline-graphic xlink:href="ieqn-6.png"/><tex-math id="tex-ieqn-6"><![CDATA[$\xi _{i}$]]></tex-math><mml:math id="mml-ieqn-6"><mml:msub><mml:mrow><mml:mi>&#x03BE;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>, that can be used to adapt the constraints in <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref> [<xref ref-type="bibr" rid="ref-34">34</xref>]. Slack variable adaptation gives SVM flexibility to reduce the optimization influence by allowing some cases to lie inside the margin or within the cases of another class.</p>
<p><disp-formula id="eqn-1">
<label>(1)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-1.png"/>
<tex-math id="tex-eqn-1"><![CDATA[$$\begin{equation}
\forall i \left\{\begin{array}{l}
w{*}x_{i}+b \geq +1-\xi _{i}\quad y=+1 \\[5pt]
w{*}x_{i}+b \leq -1-\xi _{i}\quad y=-1 \\[5pt]
\xi _{i} \geq 0 \end{array}\right.
\label{eqn-1}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-1" display="block"><mml:mo>&#x2200;</mml:mo><mml:mi>i</mml:mi><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable equalrows="false" columnlines="" equalcolumns="false"><mml:mtr><mml:mtd columnalign="left"><mml:mi>w</mml:mi><mml:mo>*</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>b</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>&#x03BE;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="1em"/><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mi>w</mml:mi><mml:mo>*</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>b</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>&#x03BE;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="1em"/><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:msub><mml:mrow><mml:mi>&#x03BE;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr> </mml:mtable></mml:mrow><mml:mo></mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p><italic>Fast large margin classifier</italic></p>
<p>The concept of a large margin has been identified as a principle for classifying data based on the margin of classification (i.e., a scale parameter) rather than a raw training error [<xref ref-type="bibr" rid="ref-35">35</xref>]. The margin of the classification is mainly determined by locating the decision function far away from any data points [<xref ref-type="bibr" rid="ref-36">36</xref>]. Fast large margin approaches are looking to achieve large margin decision solutions by solving a constrained quadratic optimization problem and boosting with early stopping techniques [<xref ref-type="bibr" rid="ref-37">37</xref>].</p>
<p>The fast large margin classifier considers the above optimization and convergence techniques to reduce generalized errors and maximize the margin of separating hyperplanes. Such algorithms can save time and resources when optimizing training processes [<xref ref-type="bibr" rid="ref-37">37</xref>]. Let the quantity <inline-formula id="ieqn-7"><alternatives><inline-graphic xlink:href="ieqn-7.png"/><tex-math id="tex-ieqn-7"><![CDATA[$\rho$]]></tex-math><mml:math id="mml-ieqn-7"><mml:mi>&#x03C1;</mml:mi></mml:math></alternatives></inline-formula> denote the margin, the quantity which determines how well two classes can be separated and, consequently, how fast the learning algorithm converges. Using the real-valued mapping <inline-formula id="ieqn-8"><alternatives><inline-graphic xlink:href="ieqn-8.png"/><tex-math id="tex-ieqn-8"><![CDATA[$f\colon X\rightarrow R$]]></tex-math><mml:math id="mml-ieqn-8"><mml:mi>f</mml:mi><mml:mo>:</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2192;</mml:mo><mml:mi>R</mml:mi></mml:math></alternatives></inline-formula> for classifying the pattern x; the margin can be given by <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref> [<xref ref-type="bibr" rid="ref-35">35</xref>].</p>
<p><disp-formula id="eqn-2">
<label>(2)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-2.png"/>
<tex-math id="tex-eqn-2"><![CDATA[$$\begin{equation}
\rho _{f(x, y)}:=y f(x)
 \label{eqn-2}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mrow><mml:mi>&#x03C1;</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:mo>=</mml:mo><mml:mi>y</mml:mi><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>Define the margin cost function <inline-formula id="ieqn-9"><alternatives><inline-graphic xlink:href="ieqn-9.png"/><tex-math id="tex-ieqn-9"><![CDATA[$\varphi \colon \colon R\rightarrow R^{+}$]]></tex-math><mml:math id="mml-ieqn-9"><mml:mi>&#x03C6;</mml:mi><mml:mo>:</mml:mo><mml:mo>:</mml:mo><mml:mi>R</mml:mi><mml:mo>&#x2192;</mml:mo><mml:msup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msup></mml:math></alternatives></inline-formula> and <inline-formula id="ieqn-10"><alternatives><inline-graphic xlink:href="ieqn-10.png"/><tex-math id="tex-ieqn-10"><![CDATA[$\varphi$]]></tex-math><mml:math id="mml-ieqn-10"><mml:mi>&#x03C6;</mml:mi></mml:math></alternatives></inline-formula> risk of <italic>f</italic> given by <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>.</p>
<p><disp-formula id="eqn-3">
<label>(3)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-3.png"/>
<tex-math id="tex-eqn-3"><![CDATA[$$\begin{equation}
R_{\varphi } \left(f\right)=E \varphi \rho _{f(x, y)}
\label{eqn-3}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x03C6;</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mi>&#x03C6;</mml:mi><mml:msub><mml:mrow><mml:mi>&#x03C1;</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:math></alternatives></disp-formula></p>
<p>Minimizing empirical <inline-formula id="ieqn-11"><alternatives><inline-graphic xlink:href="ieqn-11.png"/><tex-math id="tex-ieqn-11"><![CDATA[$\varphi$]]></tex-math><mml:math id="mml-ieqn-11"><mml:mi>&#x03C6;</mml:mi></mml:math></alternatives></inline-formula> risk gives <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>.</p>
<p><disp-formula id="eqn-4">
<label>(4)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-4.png"/>
<tex-math id="tex-eqn-4"><![CDATA[$$\begin{equation}
\hat{R}_{\varphi } \left(f\right)=\hat{E}\varphi \rho _{f(x, y)}
 \label{eqn-4}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mo>^</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03C6;</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x00CA;</mml:mi><mml:mi>&#x03C6;</mml:mi><mml:msub><mml:mrow><mml:mi>&#x03C1;</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:math></alternatives></disp-formula></p>
<p>The AdaBoost algorithm uses the margin cost function <inline-formula id="ieqn-12"><alternatives><inline-graphic xlink:href="ieqn-12.png"/><tex-math id="tex-ieqn-12"><![CDATA[$\varphi (\alpha )=\exp (-\alpha )$]]></tex-math><mml:math id="mml-ieqn-12"><mml:mi>&#x03C6;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo class="qopname"> exp</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula>; minimizes <inline-formula id="ieqn-13"><alternatives><inline-graphic xlink:href="ieqn-13.png"/><tex-math id="tex-ieqn-13"><![CDATA[$\hat{R}_{\varphi } \left(f\right)$]]></tex-math><mml:math id="mml-ieqn-13"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mo>^</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03C6;</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> using greedy basis selection, line search [<xref ref-type="bibr" rid="ref-35">35</xref>].</p>
<p>Classifiers should achieve a large margin <inline-formula id="ieqn-14"><alternatives><inline-graphic xlink:href="ieqn-14.png"/><tex-math id="tex-ieqn-14"><![CDATA[$\rho _{f}$]]></tex-math><mml:math id="mml-ieqn-14"><mml:msub><mml:mrow><mml:mi>&#x03C1;</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:math></alternatives></inline-formula> for reliable training and also to perform well on unseen instances. These algorithms can perform training more robustly concerning patterns and parameters. The maximum margin hyperplanes <italic>f</italic><sup>*</sup> can be given by <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref> [<xref ref-type="bibr" rid="ref-35">35</xref>].</p>
<p><disp-formula id="eqn-5">
<label>(5)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-5.png"/>
<tex-math id="tex-eqn-5"><![CDATA[$$\begin{equation}
{f^*}: = \mathop {\textrm{arg}\,\textrm{max}}\limits_f {\rho _f}:\, = \mathop {\textrm{arg}{\mkern 1mu} \textrm{max}}\limits_f \mathop {\min }\limits_{_i} {y_i}{\mkern 1mu} f({x_i})
 \label{eqn-5}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:msup><mml:mi>f</mml:mi><mml:mo>*</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mtext>arg&#x2009;max</mml:mtext></mml:mrow><mml:mi>f</mml:mi></mml:munder><mml:msub><mml:mi>&#x03C1;</mml:mi><mml:mi>f</mml:mi></mml:msub><mml:mo>:</mml:mo><mml:mtext>&#x2009;</mml:mtext><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mtext>argmax&#x00A0;</mml:mtext></mml:mrow><mml:mi>f</mml:mi></mml:munder><mml:munder><mml:mrow><mml:mi>min</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:munder><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mi>f</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>The maximum margin f for the optimal hyperplane can be given such that the weight vector and threshold satisfy <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>.</p>
<p><disp-formula id="eqn-6">
<label>(6)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-6.png"/>
<tex-math id="tex-eqn-6"><![CDATA[$$\begin{equation}
w^{*}, b^{*}=\mathop{argmax}\limits_{w, b}\, _{i=1}^{m}{\min }\frac{(w\cdot x_{i})+b}{ \left\| w\right\| }
 \label{eqn-6}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-6" display="block"><mml:msup><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mo>argmax</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow></mml:munder><mml:msubsup><mml:mrow><mml:mspace width="0.3em"/></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo lspace='0pt' rspace='0pt'>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mo>min</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>&#x2225;</mml:mo><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mo>&#x2225;</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></alternatives></disp-formula></p>
<p>The maxi&#x2013;min optimization problem can be transformed into a constrained optimization task by maximizing the subject to the margin lower bound <inline-formula id="ieqn-15"><alternatives><inline-graphic xlink:href="ieqn-15.png"/><tex-math id="tex-ieqn-15"><![CDATA[$\rho$]]></tex-math><mml:math id="mml-ieqn-15"><mml:mi>&#x03C1;</mml:mi></mml:math></alternatives></inline-formula> as in <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref> [<xref ref-type="bibr" rid="ref-35">35</xref>].</p>
<p><disp-formula id="eqn-7">
<label>(7)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-7.png"/>
<tex-math id="tex-eqn-7"><![CDATA[$$\begin{equation}
w^{*}, b^{*}, \rho ^{*}=\mathop{argmax}\limits_{w, b, \rho }\rho~\mathit{subject}~to~\frac{(w\cdot x_{i})+b}{ \left\| w\right\| } \geq \rho\quad for~1 \leq i \leq m
 \label{eqn-7}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-7" display="block"><mml:msup><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mi>&#x03C1;</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mo>argmax</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03C1;</mml:mi></mml:mrow></mml:munder><mml:mi>&#x03C1;</mml:mi><mml:mspace width=".3em" /><mml:mstyle mathvariant="italic"><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:mstyle><mml:mspace width=".3em" /><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mspace width=".3em" /><mml:mfrac><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>&#x2225;</mml:mo><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mo>&#x2225;</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x2265;</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mspace width="1em"/><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mspace width=".3em" /><mml:mn>1</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>m</mml:mi></mml:math></alternatives></disp-formula></p>
<p>
<disp-formula id="eqn-8a">
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-8a.png"/>
<tex-math id="tex-eqn-8a"><![CDATA[$$\begin{eqnarray*}
w^{*}, b^{*}, \rho ^{*}=\mathop{argmax}\limits_{w, b, \rho }\rho~\mathit{subject}~to~ \left\| w\right\| =1~and~y_{i} \left( \left(w\cdot x_{i}\right)+b\right) \geq \rho\quad for~1 \leq i \leq m
\end{eqnarray*}$$]]></tex-math>
<mml:math id="mml-eqn-8a" display="block"><mml:mrow><mml:msup><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mi>&#x03C1;</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mo>argmax</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03C1;</mml:mi></mml:mrow></mml:munder><mml:mi>&#x03C1;</mml:mi><mml:mspace width=".3em" /><mml:mstyle mathvariant="italic"><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:mstyle><mml:mspace width=".3em" /><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mspace width=".3em" /><mml:mrow><mml:mo>&#x2225;</mml:mo><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mo>&#x2225;</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mspace width=".3em" /><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mspace width=".3em" /><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2265;</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mspace width="1em"/><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mspace width=".3em" /><mml:mn>1</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:math></alternatives></disp-formula>
</p>
<p>High noise cases result in a significant overlap within the classes. The previous maximum margin algorithms perform poorly in this case because the maximum-minimum margin achieves negative values. A standard approach to overcome the sensitivity to noisy training patterns is by introducing slack variables (<xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref>). The relaxed constraints take the form of <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref> [<xref ref-type="bibr" rid="ref-36">36</xref>].</p>
<p><disp-formula id="eqn-8">
<label>(8)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-8.png"/>
<tex-math id="tex-eqn-8"><![CDATA[$$\begin{equation}\xi _{i} \geq 0,\quad for~all\;i=1,\ldots ,m
\label{eqn-8} \end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x03BE;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="1em"/><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mspace width=".3em" /><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mspace width="2.77695pt"/><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:mrow><mml:mrow></mml:mrow><mml:mrow></mml:mrow></mml:math>
</alternatives></disp-formula></p>
<p><disp-formula id="eqn-9">
<label>(9)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-9.png"/>
<tex-math id="tex-eqn-9"><![CDATA[$$\begin{equation}y_{i} \left( \left(w\cdot x_{i}\right)+b\right) \geq 1-\xi _{i},\quad for~all\;i=1,\ldots ,m
 \label{eqn-9}\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>&#x03BE;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="1em"/><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mspace width=".3em" /><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mspace width="2.77695pt"/><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:mrow><mml:mrow></mml:mrow><mml:mrow></mml:mrow></mml:math>
</alternatives></disp-formula></p>
<p>By controlling both the size of <italic>w</italic> and the number of training errors, we can minimize the following objective function, where the constant <italic>C</italic> &#x003E; 0, a classifier that generalizes well, can then be found by <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref> [<xref ref-type="bibr" rid="ref-35">35</xref>].</p>
<p><disp-formula id="eqn-10">
<label>(10)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-10.png"/>
<tex-math id="tex-eqn-10"><![CDATA[$$\begin{equation}
\tau \left(w,\xi \right)=\frac{1}{2} \left\| w\right\| ^{2}+C\sum_{i=1}^{m}\xi _{i}
 \label{eqn-10}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-10" display="block"><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03BE;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:msup><mml:mrow><mml:mrow><mml:mo>&#x2225;</mml:mo><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mo>&#x2225;</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>C</mml:mi><mml:mstyle displaystyle='true'><mml:mstyle displaystyle='true'><mml:munderover><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo lspace='0pt' rspace='0pt'>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:munderover></mml:mstyle></mml:mstyle><mml:msub><mml:mrow><mml:mi>&#x03BE;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></alternatives></disp-formula></p>
<p>Incorporating kernels <italic>k</italic> for the dot products <italic>k</italic>(<italic>x</italic>,  <italic>x<sub>i</sub></italic>) and Lagrange multipliers <inline-formula id="ieqn-16"><alternatives><inline-graphic xlink:href="ieqn-16.png"/><tex-math id="tex-ieqn-16"><![CDATA[$\alpha _{i}$]]></tex-math><mml:math id="mml-ieqn-16"><mml:msub><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>, subject to the constraints leading to decision functions of the more general form.</p>
<p><disp-formula id="eqn-11">
<label>(11)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-11.png"/>
<tex-math id="tex-eqn-11"><![CDATA[$$\begin{equation}
f \left(x\right)=\sum_{i=1}\alpha _{i}k(x,x_{i})+b
\label{eqn-11}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-11" display="block"><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mo>&#x2211;</mml:mo> </mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo lspace='0pt' rspace='0pt'>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munder><mml:msub><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>b</mml:mi></mml:math></alternatives></disp-formula></p>
<p>A fast large margin algorithm has several advantages. First, it converges in a finite number of updates. Second, the solution is optimized to give the maximum possible margin [<xref ref-type="bibr" rid="ref-35">35</xref>]. Experimental results using a fast large margin algorithm show higher performance and faster convergence compared to SVMs and other state-of-the-art classifiers.</p>
</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental Results</title>
<sec id="s4_1">
<label>4.1</label>
<title>Dataset</title>
<p>The dataset was synchronously captured form five PF OA related muscles: TrA, VMO, GM, VL, and ML. The data from the five muscles were acquired for each activity, such as going upstairs. The dataset was acquired at the Outpatient Clinic, Faculty of Physical Therapy, Cairo University using quantitative EMG with surface electrodes. The sEMG data signal of the dataset was recorded at the Department of Biomedical Engineering, Faculty of Engineering, Cairo University.</p>
<p>This dataset has a total of 186 records for PF OA patients and 66 records for healthy individuals. This dataset is comprised of training cases along with corresponding clinical label diagnosis cases. Different pre-processing steps, i.e., normalization, cleansing, and dimensionality reduction, were performed to prepare the data to be fed into the classifier. Different evaluation metrics were adopted to check the significance of the proposed PF OA diagnosis framework.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Performance Evaluation</title>
<p>The four outcomes of positive instances (P) and negative instances (N) formulates a <inline-formula id="ieqn-17"><alternatives><inline-graphic xlink:href="ieqn-17.png"/><tex-math id="tex-ieqn-17"><![CDATA[$2\times2$]]></tex-math><mml:math id="mml-ieqn-17"><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>2</mml:mn></mml:math></alternatives></inline-formula> confusion matrix for the experiment. The area under the ROC (receiver operating characteristics) curve (AUC) is an important evaluation metric for checking the performance of the classification model. The ROC curve is plotted with the TPR (True Positive Rate) against the FPR (False Positive Rate), where TPR is on the y-axis, and FPR is on the x-axis [<xref ref-type="bibr" rid="ref-38">38</xref>]. The accuracy (ACC) measure is used to check the capability of the classification model. Accuracy can be calculated using <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref>. The sensitivity (Sen.) or recall measure is used to check the capability of our classifier to recognize the positive class patterns. The Sen of the classifier can be determined using <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref>. The specificity (Spec.) measure is used to check the capability of the classifier to recognize the negative class patterns. It can be calculated using <xref ref-type="disp-formula" rid="eqn-14">Eq. (14)</xref>. The F-measure or dice similarity coefficient (DSC) considers both precision and recall to measure the accuracy of the test. DSC ranges from 0, the worst score, to 1, the best score, as a weighted average of precision and recall. The DSC measure can be calculated using <xref ref-type="disp-formula" rid="eqn-15">Eq. (15)</xref> [<xref ref-type="bibr" rid="ref-39">39</xref>].</p>
<p><disp-formula id="eqn-12">
<label>(12)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-12.png"/>
<tex-math id="tex-eqn-12"><![CDATA[$$\begin{equation}
\text{A}\text{c}\text{c}\text{u}\text{r}\text{acy}=\frac{\text{T}\text{P}+\text{T}\text{N}}{(\text{T}\text{P}+\text{F}\text{P}+\text{T}\text{N}+\text{F}\text{N})}\times 100
 \label{eqn-12}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-12" display="block"><mml:mstyle><mml:mtext>A</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>c</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>c</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>u</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>r</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>acy</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mstyle><mml:mtext>T</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>P</mml:mtext></mml:mstyle><mml:mo>+</mml:mo><mml:mstyle><mml:mtext>T</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>N</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle><mml:mtext>T</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>P</mml:mtext></mml:mstyle><mml:mo>+</mml:mo><mml:mstyle><mml:mtext>F</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>P</mml:mtext></mml:mstyle><mml:mo>+</mml:mo><mml:mstyle><mml:mtext>T</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>N</mml:mtext></mml:mstyle><mml:mo>+</mml:mo><mml:mstyle><mml:mtext>F</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>N</mml:mtext></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mn>100</mml:mn></mml:math></alternatives></disp-formula></p>
<p><disp-formula id="eqn-13">
<label>(13)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-13.png"/>
<tex-math id="tex-eqn-13"><![CDATA[$$\begin{equation}
\text{Sen.}=\frac{{\rm TP}}{\text{TP }+\text{T}\text{N}}
 \label{eqn-13}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-13" display="block"><mml:mstyle><mml:mtext>Sen.</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mstyle><mml:mtext>TP&#x00A0;</mml:mtext></mml:mstyle><mml:mo>+</mml:mo><mml:mstyle><mml:mtext>T</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>N</mml:mtext></mml:mstyle></mml:mrow></mml:mfrac></mml:math></alternatives></disp-formula></p>
<disp-formula id="eqn-14">
<label>(14)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-14.png"/>
<tex-math id="tex-eqn-14"><![CDATA[$$\begin{equation}
\text{Spec.}=\frac{{\rm TN}}{\text{T}\text{N}+\text{F}\text{P}}
\label{eqn-14}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-14" display="block"><mml:mstyle><mml:mtext>Spec.</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mstyle><mml:mtext>T</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>N</mml:mtext></mml:mstyle><mml:mo>+</mml:mo><mml:mstyle><mml:mtext>F</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>P</mml:mtext></mml:mstyle></mml:mrow></mml:mfrac></mml:math></alternatives></disp-formula>
<disp-formula id="eqn-15">
<label>(15)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-15.png"/>
<tex-math id="tex-eqn-15"><![CDATA[$$\begin{equation}
\text{D}\text{S}\text{C}= 2\times \frac{\text{Precision }\times \text{Recall }}{\text{P}\text{r}\text{e}\text{c}\text{i}\text{sion}+\text{Recall }}
 \label{eqn-15}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-15" display="block"><mml:mstyle><mml:mtext>D</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>S</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>C</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mfrac><mml:mrow><mml:mstyle><mml:mtext>Precision&#x00A0;</mml:mtext></mml:mstyle><mml:mo>&#x00D7;</mml:mo><mml:mstyle><mml:mtext>Recall&#x00A0;</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle><mml:mtext>P</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>r</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>e</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>c</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>i</mml:mtext></mml:mstyle><mml:mstyle><mml:mtext>sion</mml:mtext></mml:mstyle><mml:mo>+</mml:mo><mml:mstyle><mml:mtext>Recall&#x00A0;</mml:mtext></mml:mstyle></mml:mrow></mml:mfrac></mml:math></alternatives></disp-formula>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Results</title>
<p>Large margin classifiers were used to evaluate the performance of the proposed model, i.e., fast large margin and SVM classifiers. Significant evaluation metrics were used to check the capability of the model at distinguishing between classes. ACC, AUC, DSC, Sen, and Spec are used as performance indicators. These evaluation metrics are considered along with total time spent in training to indicate the convergence rate. The proposed framework achieved higher performance results using the fast large margin and SVM classifiers. The higher performance from using the fast large margin classifier was achieved in shorter computing time than with SVM. The proposed system achieved an average ACC equal to 98.8%, AUC equal to 0.999, DSC equal to 99.1%, Sen equal to 99.9%, and Spec equal to 96.0% in 7 s using the fast large margin classifier and an average ACC equal to 98.8%, AUC equal to 0.999, DSC equal to 99.1%, Sen equal to 99.9%, and Spec equal to 96.0% using the SVM classifier in 21 s.</p>
<p>To evaluate the results of the proposed system, the computed results were compared with other state-of-the-art classifiers. These classifiers are the generalized linear model (GLM), logistic regression, Na&#x00EF;ve Bayes, deep learning, decision trees, random forest, and gradient boosted trees (GBT). The comparison measurements are listed in <xref ref-type="table" rid="table-1">Tab. 1</xref>, as follows GLM, logistic regression, Na&#x00EF;ve Bayes, deep learning, decision trees, random forest, and GBT achieved ACC equal to 97.4%, 96.1%, 97.4%, 96.1%, 80.6%, 79.3%, and 91.0%, respectively. They achieved average AUC equal to 0.996, 0.992, 0.996, 0.999, 0.689, 0.943 and 0.732, respectively. They achieved average DSC equal to 98.2%, 97.4%, 98.2%, 97.3%, 88.0%, 83.4%, and 94.0%, respectively. They achieved average Sen equal to 99.9%, 99.9%, 98.5%, 98.0%, 96.9%, 72.3%, and 96.9%, respectively. They achieved average Spec equal to 92.0%, 82.0%, 96.0%, 89.3%, 36.7%, 99.9%, and 74.0%, respectively. The training time of these classifiers was 3, 4, 7, 7, 7, 38, and 125 s, respectively. The proposed system, using the fast large margin and SVM classifiers, outperformed the other state-of-the-art techniques in terms of accuracy. When it comes to convergence time, the fast large margin classifier outperforms SVM and the other tested classifiers in the comparative evaluation.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>The performance evaluation of the proposed technique with other classifiers</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Model</th>
<th>ACC. (%)</th>
<th>AUC</th>
<th>DC (%)</th>
<th>Sen. (%)</th>
<th>Spec. (%)</th>
<th>Total time (s)</th>
</tr>
</thead>
<tbody>
<tr>
<td>GLM</td>
<td>97.4</td>
<td>0.996</td>
<td>98.2</td>
<td>99.9</td>
<td>92.0</td>
<td>3</td>
</tr>
<tr>
<td>Logistic regression</td>
<td>96.1</td>
<td>0.992</td>
<td>97.4</td>
<td>99.9</td>
<td>82.0</td>
<td>4</td>
</tr>
<tr>
<td>Na&#x00EF;ve Bayes</td>
<td>97.4</td>
<td>0.996</td>
<td>98.2</td>
<td>98.5</td>
<td>96.0</td>
<td>7</td>
</tr>
<tr>
<td>Deep learning</td>
<td>96.1</td>
<td>0.999</td>
<td>97.3</td>
<td>98.0</td>
<td>89.3</td>
<td>7</td>
</tr>
<tr>
<td>Decision trees</td>
<td>80.6</td>
<td>0.689</td>
<td>88.0</td>
<td>96.9</td>
<td>36.7</td>
<td>7</td>
</tr>
<tr>
<td>Random forest</td>
<td>79.3</td>
<td>0.943</td>
<td>83.4</td>
<td>72.3</td>
<td>99.9</td>
<td>38</td>
</tr>
<tr>
<td>GBT</td>
<td>91.0</td>
<td>0.732</td>
<td>94.0</td>
<td>96.9</td>
<td>74.0</td>
<td>125</td>
</tr>
<tr>
<td>SVM</td>
<td>98.8</td>
<td>0.999</td>
<td>99.1</td>
<td>99.9</td>
<td>96.0</td>
<td>21</td>
</tr>
<tr>
<td>Fast large margin</td>
<td>98.8</td>
<td>0.999</td>
<td>99.1</td>
<td>99.9</td>
<td>96.0</td>
<td>7</td>
</tr>
</tbody>
</table></table-wrap>
<p>The convergence and robustness are illustrated by the training time in seconds, as shown in <xref ref-type="table" rid="table-1">Tab. 1</xref>. To visualize the performance of the proposed model, the ROC curve was constructed along with the other comparative classifiers. The ROC curve was created by plotting the TPR against the FPR. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> shows the relationship between Sen and Spec for all comparative techniques. The results show the superiority of the proposed framework&#x2019;s predictions <italic>vs.</italic> the other techniques.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>The ROC curve for the tested classifiers</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-4.png"/>
</fig>
</sec>
<sec id="s4_4">
<label>4.4</label>
<title>Discussion</title>
<p>sEMG based research considered in the comparison can be divided into two major categories. Some of them investigated measuring muscle activity, and other relevant work explored the classification of EMG signals using various approaches. Khowailed et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] and Liu [<xref ref-type="bibr" rid="ref-19">19</xref>] investigated measuring muscle activation and characterized the active muscles from their baseline state in terms of the onset of muscle activation. Other sEMG based techniques are concerned with the analysis and classification of EMG signals [<xref ref-type="bibr" rid="ref-2">2</xref>,<xref ref-type="bibr" rid="ref-16">16</xref>,<xref ref-type="bibr" rid="ref-17">17</xref>,<xref ref-type="bibr" rid="ref-20">20</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>]. Most EMG signal classification techniques are based on real time-domain features. The classification studies in recent literature have been carried out based on extracting statistical characteristics for the recognition process [<xref ref-type="bibr" rid="ref-17">17</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>].</p>
<p>To provide a comparison with feature-based methods, a classification technique based on muscle activation characteristics was developed. The proposed classification model investigates extracting core muscle activation in terms of onset, offset, and duration of muscle activation for a more precise diagnosis for PF OA arthritis patients. The extracted feature space is used to construct the classification model. Large margin classifiers were used for training the model to discriminate the labeled PF OA arthritis patients <italic>vs.</italic> healthy cases. The fast large margin classifier utilized the LS-SVM solver type in this method. The penalty parameter of the error term was <inline-formula id="ieqn-18"><alternatives><inline-graphic xlink:href="ieqn-18.png"/><tex-math id="tex-ieqn-18"><![CDATA[$\mathrm{C}=10$]]></tex-math><mml:math id="mml-ieqn-18"><mml:mstyle mathvariant="normal"><mml:mi>C</mml:mi></mml:mstyle><mml:mo>=</mml:mo><mml:mn>10</mml:mn></mml:math></alternatives></inline-formula>, the tolerance of the termination criterion <inline-formula id="ieqn-19"><alternatives><inline-graphic xlink:href="ieqn-19.png"/><tex-math id="tex-ieqn-19"><![CDATA[$\xi$]]></tex-math><mml:math id="mml-ieqn-19"><mml:mi>&#x03BE;</mml:mi></mml:math></alternatives></inline-formula>, class weights w, intercept value bias was set as optimal parameters. The penalty parameter values over the training processes, along with error terms, are given in <xref ref-type="table" rid="table-2">Tab. 2</xref>. It can be seen that the optimal penalty parameter value over the training processes is 10, which corresponds to the smallest error shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>The penalty parameter values over the training processes along with error terms</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>C</th>
<th>Error rate (%)</th>
</tr>
</thead>
<tbody>
<tr>
<td>0.001</td>
<td>13.7</td>
</tr>
<tr>
<td>0.010</td>
<td>23.8</td>
</tr>
<tr>
<td>0.100</td>
<td>8.1</td>
</tr>
<tr>
<td>1</td>
<td>5.0</td>
</tr>
<tr>
<td>10</td>
<td>2.5</td>
</tr>
<tr>
<td>100</td>
<td>2.5</td>
</tr>
<tr>
<td>1000</td>
<td>6.3</td>
</tr>
</tbody>
</table></table-wrap>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Comparison in terms of accuracy with convergence time 
</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-5.png"/>
</fig>
<p>Several comparative classifiers converged in a short time but with lower performance, i.e., logistic regression, Na&#x00EF;ve Bayes, deep learning, and decision trees. The proposed fast large margin classifier achieves higher accuracy in shorter convergence time, as shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<p>Some of the previous studies evaluated their approach using a real-time domain comparison [<xref ref-type="bibr" rid="ref-2">2</xref>,<xref ref-type="bibr" rid="ref-18">18</xref>,<xref ref-type="bibr" rid="ref-19">19</xref>]. Other studies on classification techniques evaluated their work in terms of accuracy. Cene et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] proposed a classification framework based on a logistic regression algorithm to identify the sEMG signal movement. Their system achieved an average accuracy equal to 90.2%. Veer et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] introduced a classification model that discriminated against the strength of the movement as high or low from the sEMG signal. The model was trained using an ANN with pre-defined arm motions and achieved an average classification accuracy of 92.5%. Rane et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] proposed a supervised model for predicting muscular force-based EMG movement signals as inputs to a hierarchical model. Their system achieved an average accuracy equal to 84%. Morbidoni et al. [<xref ref-type="bibr" rid="ref-22">22</xref>] proposed a deep learning approach to predict foot-floor-contact during natural walking for sEMG signals. The sEMG signals were acquired from eight lower-limb muscles of 23 healthy subjects during walking, and the model achieved an average classification accuracy of 94%.The proposed fast large margin classification model based on muscle activation features extracted is compared with the sEMG signal feature-based classification techniques in the literature. The proposed fast large margin classification model based muscle activation features achieved 98.8% classification accuracy. The presented model uses muscle activity timing as a feature space, while others carried out a classification task based on statistical characteristics. The extracted feature space can also help in determining the order of muscle activation to help clinicians to incorporate suitable exercises into a rehabilitation program correctly. The results of the proposed model were evaluated using the acquired sEMG signals from PF OA arthritis patients <italic>vs.</italic> healthy cases. However, in some studies, the experiments were carried out using a simulated signal. The implemented framework shows promising results in sEMG signal analysis since the accuracy rate outperforms other studies with similar techniques in this area. The trained fast large margin classifier allows the system to automatically learn relevant features and determine the modification of muscular activation patterns to compensate for the muscle disorders efficiently. The proposed PF OA arthritis classification model provides novel insights to approximate the accurate timing of core muscles in designing treatment exercises.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>This work proposed a precise diagnosing approach for PF OA arthritis patients. The developed predictive model investigates PF OA arthritis muscle timing features. sEMG signals were acquired from five core muscles over 252 reads from PF OA patients and healthy adults while stepping upstairs. Onset, offset, and duration times for TrA, VMO, GM, VL, and ML muscles were acquired to construct the classification model. PF OA arthritis muscle timing features were extracted using function mapping from real-time space to a PF OA arthritis discriminative feature space. The extracted features helped determine the order of muscle activation for a clinician to incorporate suitable exercises into a rehabilitation program correctly. The fast large margin classifier results based on the muscle timing activation features achieved higher performance and faster convergence than SVM and other state-of-the-art classifiers. The implemented framework shows promising results in sEMG signal analysis since the accuracy rate outperforms other similar techniques in this area. In future work, more analysis of the signal and expanding the dataset is required. Hierarchical networks can also be used for deep training.</p>
</sec>
</body>
<back>
<fn-group><fn fn-type="other"><p><bold>Funding Statement:</bold> This work was supported by the National Research Foundation of Korea (NRF) Grant funded by the Korean government (MSIT) (NRF-2016R1D1A1A03934816) and by Chowis Co., Ltd.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p></fn></fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Rodriguez-Falces</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Navallas</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Mal</surname></string-name></person-group>, &#x201C;<chapter-title>EMG modeling</chapter-title>,&#x201D; in <source>Computational Intelligence in Electromyography Analysis-A Perspective on Current Applications and Future Challenges</source>, <publisher-loc>London, UK</publisher-loc>: <publisher-name>IntechOpen</publisher-name>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Sadikoglu</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Kavalcioglu</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Dagman</surname></string-name></person-group>, &#x201C;<article-title>Electromyogram (EMG) signal detection, classification of EMG signals and diagnosis of neuropathy muscle disease</article-title>,&#x201D; <source>Procedia Computer Science</source><italic>,</italic> vol. <volume>120</volume><italic>,</italic> pp. <fpage>422</fpage>&#x2013;<lpage>429</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Mika</surname></string-name>, <string-name><given-names>B. C.</given-names> <surname>Clark</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Oleksy</surname></string-name></person-group>, &#x201C;<article-title>The influence of high and low heeled shoes on EMG timing characteristics of the lumbar and hip extensor complex during trunk forward flexion and return task</article-title>,&#x201D; <source>Manual Therapy</source><italic>,</italic> vol. <volume>18</volume><italic>,</italic> no. <issue>6</issue><italic>,</italic> pp. <fpage>506</fpage>&#x2013;<lpage>511</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>U.</given-names> <surname>Rashid</surname></string-name>, <string-name><given-names>I. K.</given-names> <surname>Niazi</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Signal</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Farina</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Taylor</surname></string-name></person-group>, &#x201C;<article-title>Optimal automatic detection of muscle activation intervals</article-title>,&#x201D; <source>Journal of Electromyography and Kinesiology</source><italic>,</italic> vol. <volume>48</volume><italic>,</italic> pp. <fpage>103</fpage>&#x2013;<lpage>111</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Staude</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Flachenecker</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Daumer</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Wolf</surname></string-name></person-group>, &#x201C;<article-title>Onset detection in surface electromyographic signals: A systematic comparison of methods</article-title>,&#x201D; <source>EURASIP Journal on Advances in Signal Processing</source><italic>,</italic> vol. <volume>2001</volume><italic>,</italic> no. <issue>2</issue><italic>,</italic> pp. <fpage>67</fpage>&#x2013;<lpage>81</lpage>, <year>2001</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Veer</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Agarwal</surname></string-name></person-group>, &#x201C;<article-title>Wavelet denoising and evaluation of electromyogram signal using statistical algorithm</article-title>,&#x201D; <source>International Journal of Biomedical Engineering and Technology</source><italic>,</italic> vol. <volume>16</volume><italic>,</italic> no. <issue>4</issue><italic>,</italic> pp. <fpage>293</fpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Becker</surname></string-name>, <string-name><given-names>M.</given-names> <surname>R&#x00F6;pke</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Krull</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Musahl</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Nebelung</surname></string-name></person-group>, &#x201C;<article-title>Surgical treatment of isolated patellofemoral osteoarthritis</article-title>,&#x201D; <source>Clinical Orthopaedics and Related Research</source><italic>,</italic> vol. <volume>466</volume><italic>,</italic> no. <issue>2</issue><italic>,</italic> pp. <fpage>443</fpage>&#x2013;<lpage>449</lpage>, <year>2008</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Kiel</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Kaiser</surname></string-name></person-group>, &#x201C;<chapter-title>Patellofemoral arthritis</chapter-title>,&#x201D; in <source>Treasure Island</source>, <publisher-loc>FL, USA</publisher-loc>: <publisher-name>StatPearls, PMID</publisher-name>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Aminaka</surname></string-name>, <string-name><given-names>B. G.</given-names> <surname>Pietrosimone</surname></string-name>, <string-name><given-names>C. W.</given-names> <surname>Armstrong</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Meszaros</surname></string-name> and <string-name><given-names>P. A.</given-names> <surname>Gribble</surname></string-name></person-group>, &#x201C;<article-title>Patellofemoral pain syndrome alters neuromuscular control and kinetics during stair ambulation</article-title>,&#x201D; <source>Journal of Electromyography and Kinesiology</source><italic>,</italic> vol. <volume>21</volume><italic>,</italic> no. <issue>4</issue><italic>,</italic> pp. <fpage>645</fpage>&#x2013;<lpage>651</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.-P. W.</given-names> <surname>Van Jonbergen</surname></string-name>, <string-name><given-names>R. W.</given-names> <surname>Poolman</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Van Kampen</surname></string-name></person-group>, &#x201C;<article-title>Isolated patellofemoral osteoarthritis</article-title>,&#x201D; <source>Acta Orthopaedica</source><italic>,</italic> vol. <volume>81</volume><italic>,</italic> no. <issue>2</issue><italic>,</italic> pp. <fpage>199</fpage>&#x2013;<lpage>205</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Eapen</surname></string-name>, <string-name><given-names>C. D.</given-names> <surname>Nayak</surname></string-name> and <string-name><given-names>C. P.</given-names> <surname>Zulfeequer</surname></string-name></person-group>, &#x201C;<article-title>Effect of eccentric isotonic quadriceps muscle exercises on patellofemoral pain syndrome: An exploratory pilot study</article-title>,&#x201D; <source>Asian Journal of Sports Medicine</source><italic>,</italic> vol. <volume>2</volume><italic>,</italic> no. <issue>4</issue><italic>,</italic> pp. <fpage>227</fpage>&#x2013;<lpage>234</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Wyndow</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Collins</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Vicenzino</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Tucker</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Crossley</surname></string-name></person-group>, &#x201C;<article-title>Is there a biomechanical link between patellofemoral pain and osteoarthritis? A narrative review</article-title>,&#x201D; <source>Sports Medicine</source><italic>,</italic> vol. <volume>46</volume><italic>,</italic> no. <issue>12</issue><italic>,</italic> pp. <fpage>1797</fpage>&#x2013;<lpage>1808</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Yao</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Yan</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Yao</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Prevalence of patellofemoral pain and knee pain in the general population of Chinese young adults: A community-based questionnaire survey</article-title>,&#x201D; <source>BMC Musculoskeletal Disorders</source><italic>,</italic> vol. <volume>19</volume><italic>,</italic> no. <issue>1</issue><italic>,</italic> pp. <fpage>165</fpage>&#x2013;<lpage>171</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. D.</given-names> <surname>Willson</surname></string-name>, <string-name><given-names>T. W.</given-names> <surname>Kernozek</surname></string-name>, <string-name><given-names>R. L.</given-names> <surname>Arndt</surname></string-name>, <string-name><given-names>D. A.</given-names> <surname>Reznichek</surname></string-name> and <string-name><given-names>J. S.</given-names> <surname>Straker</surname></string-name></person-group>, &#x201C;<article-title>Gluteal muscle activation during running in females with and without patellofemoral pain syndrome</article-title>,&#x201D; <source>Clinical Biomechanics</source><italic>,</italic> vol. <volume>26</volume><italic>,</italic> no. <issue>7</issue><italic>,</italic> pp. <fpage>735</fpage>&#x2013;<lpage>740</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Motealleh</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Maroufi</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Sarrafzadeh</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Sanjari</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Salehi</surname></string-name></person-group>, &#x201C;<article-title>Comparative evaluation of core and knee extensor mechanism muscle activation patterns in a stair stepping task in healthy controls and patellofemoral pain patients</article-title>,&#x201D; <source>Journal of Rehabilitation Sciences &#x0026; Research</source><italic>,</italic> vol. <volume>1</volume><italic>,</italic> no. <issue>4</issue><italic>,</italic> pp. <fpage>84</fpage>&#x2013;<lpage>91</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>V. H.</given-names> <surname>Cene</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Balbinot</surname></string-name></person-group>, &#x201C;<chapter-title>Upper-limb movement classification through logistic regression sEMG signal processing</chapter-title>,&#x201D; in <source>Latin America Congress on Computational Intelligence (LA-CCI)</source><italic>,</italic> <publisher-loc>Curitiba, Brazil</publisher-loc>: <publisher-name>IEEE</publisher-name>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Veer</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Sharma</surname></string-name></person-group>, &#x201C;<article-title>Extraction and Analysis of above elbow SEMG for Pattern classification</article-title>,&#x201D; <source>Journal of Medical Engineering &#x0026; Technology</source><italic>,</italic> vol. <volume>40</volume><italic>,</italic> no. <issue>4</issue><italic>,</italic> pp. <fpage>149</fpage>&#x2013;<lpage>154</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I. A.</given-names> <surname>Khowailed</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Abotabl</surname></string-name></person-group>, &#x201C;<article-title>Neural muscle activation detection: A deep learning approach using surface electromyography</article-title>,&#x201D; <source>Journal of Biomechanics</source><italic>,</italic> vol. <volume>95</volume><italic>,</italic> pp. <fpage>109322</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Ying</surname></string-name>, <string-name><given-names>W. Z.</given-names> <surname>Rymer</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Zhou</surname></string-name></person-group>, &#x201C;<article-title>Robust muscle activity onset detection using an unsupervised electromyogram learning framework</article-title>,&#x201D; <source>PLoS ONE</source><italic>,</italic> vol. <volume>10</volume><italic>,</italic> no. <issue>6</issue><italic>,</italic> pp. <fpage>e0127990</fpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Rane</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Ding</surname></string-name>, <string-name><given-names>A. H.</given-names> <surname>McGregor</surname></string-name> and <string-name><given-names>A. M. J.</given-names> <surname>Bull</surname></string-name></person-group>, &#x201C;<article-title>Deep learning for musculoskeletal force prediction</article-title>,&#x201D; <source>Annals of Biomedical Engineering</source><italic>,</italic> vol. <volume>47</volume><italic>,</italic> no. <issue>3</issue><italic>,</italic> pp. <fpage>778</fpage>&#x2013;<lpage>789</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. L.</given-names> <surname>Kinney</surname></string-name>, <string-name><given-names>T. F.</given-names> <surname>Besier</surname></string-name>, <string-name><given-names>D. D.</given-names> <surname>DtextquotesingleLima</surname></string-name> and <string-name><given-names>B. J.</given-names> <surname>Fregly</surname></string-name></person-group>, &#x201C;<article-title>Update on grand challenge competition to predict in vivo knee loads</article-title>,&#x201D; <source>Journal of Biomechanical Engineering</source><italic>,</italic> vol. <volume>135</volume><italic>,</italic> no. <issue>2</issue><italic>,</italic> pp. <fpage>131</fpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. F. A.</given-names> <surname>Cucchiarelli</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Morbidoni</surname></string-name> and <string-name><given-names>F. D.</given-names> <surname>Nardo</surname></string-name></person-group>, &#x201C;<article-title>A deep learning approach to emg-based classification of gait phases during level ground walking</article-title>,&#x201D; <source>Electronics</source><italic>,</italic> vol. <volume>8</volume><italic>,</italic> no. <issue>8</issue><italic>,</italic> pp. <fpage>894</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K. M.</given-names> <surname>Park</surname></string-name>, <string-name><given-names>S. Y.</given-names> <surname>Kim</surname></string-name> and <string-name><given-names>D. W.</given-names> <surname>Oh</surname></string-name></person-group>, &#x201C;<article-title>Effects of the pelvic compression belt on gluteus medius, quadratus lumborum, and lumbar multifidus activities during side-lying hip abduction</article-title>,&#x201D; <source>Journal of Electromyography and Kinesiology</source><italic>,</italic> vol. <volume>20</volume><italic>,</italic> no. <issue>6</issue><italic>,</italic> pp. <fpage>1141</fpage>&#x2013;<lpage>1145</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E.</given-names> <surname>Kellis</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Kouvelioti</surname></string-name></person-group>, &#x201C;<article-title>Agonist versus antagonist muscle fatigue effects on thigh muscle activity and vertical ground reaction during drop landing</article-title>,&#x201D; <source>Journal of Electromyography and Kinesiology</source><italic>,</italic> vol. <volume>19</volume><italic>,</italic> no. <issue>1</issue><italic>,</italic> pp. <fpage>55</fpage>&#x2013;<lpage>64</lpage>, <year>2009</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Boudreau</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Farina</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Kongstad</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Buus</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Redder</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>The relative timing of trunk muscle activation is retained in response to unanticipated postural-perturbations during acute low back pain</article-title>,&#x201D; <source>Experimental Brain Research</source><italic>,</italic> vol. <volume>210</volume><italic>,</italic> no. <issue>2</issue><italic>,</italic> pp. <fpage>259</fpage>&#x2013;<lpage>267</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Marshall</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Murphy</surname></string-name></person-group>, &#x201C;<article-title>The validity and reliability of surface EMG to assess the neuromuscular response of the abdominal muscles to rapid limb movement</article-title>,&#x201D; <source>Journal of Electromyography and Kinesiology</source><italic>,</italic> vol. <volume>13</volume><italic>,</italic> no. <issue>5</issue><italic>,</italic> pp. <fpage>477</fpage>&#x2013;<lpage>489</lpage>, <year>2003</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Chowdhury</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Reaz</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ali</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Bakar</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Chellappan</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Surface electromyography signal processing and classification techniques</article-title>,&#x201D; <source>Sensors</source><italic>,</italic> vol. <volume>13</volume><italic>,</italic> no. <issue>9</issue><italic>,</italic> pp. <fpage>12431</fpage>&#x2013;<lpage>12466</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Mengarelli</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Cardarelli</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Verdini</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Burattini</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Fioretti</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A matlab-based graphical user interface for the identification of muscular activations from surface electromyography signals</article-title>,&#x201D; in <conf-name>38th Annual Int. Conf. of the IEEE Engineering in Medicine and Biology Society (EMBC)</conf-name>, pp. <fpage>3646</fpage>&#x2013;<lpage>3649</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>O.</given-names> <surname>Barzilay</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Wolf</surname></string-name></person-group>, &#x201C;<article-title>A fast implementation for EMG signal linear envelope computation</article-title>,&#x201D; <source>Journal of Electromyography and Kinesiology</source><italic>,</italic> vol. <volume>21</volume><italic>,</italic> no. <issue>4</issue><italic>,</italic> pp. <fpage>678</fpage>&#x2013;<lpage>682</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K. T.</given-names> <surname>Ozgunen</surname></string-name>, <string-name><given-names>U.</given-names> <surname>Celik</surname></string-name> and <string-name><given-names>S. S.</given-names> <surname>Kurdak</surname></string-name></person-group>, &#x201C;<article-title>Determination of an optimal threshold value for muscle activity detection in EMG analysis</article-title>,&#x201D; <source>Journal of Sports Science &#x0026; Medicine</source><italic>,</italic> vol. <volume>9</volume><italic>,</italic> no. <issue>4</issue><italic>,</italic> pp. <fpage>620</fpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Cavazzuti</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Merlo</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Orlandi</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Campanini</surname></string-name></person-group>, &#x201C;<article-title>Delayed onset of electromyographic activity of vastus medialis obliquus relative to vastus lateralis in subjects with patellofemoral pain syndrome</article-title>,&#x201D; <source>Gait &#x0026; Posture</source><italic>,</italic> vol. <volume>32</volume><italic>,</italic> no. <issue>3</issue><italic>,</italic> pp. <fpage>290</fpage>&#x2013;<lpage>295</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I. T.</given-names> <surname>Jolliffe</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Cadima</surname></string-name></person-group>, &#x201C;<article-title>Principal component analysis: A review and recent developments</article-title>,&#x201D; <source>Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences</source><italic>,</italic> vol. <volume>374</volume><italic>,</italic> no. <issue>2065</issue><italic>,</italic> pp. <fpage>20150202</fpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>T. N. Hui</given-names> <surname>Cao</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Ninomiya</surname></string-name></person-group>, &#x201C;<article-title>Approximate RBF kernel SVM and its applications in pedestrian classification</article-title>,&#x201D; in <conf-name>Int. Workshop on Machine Learning for Vision-Based Motion Analysis</conf-name>, <publisher-loc>Marseille, France</publisher-loc>, <year>2008</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Cervantes</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Garcia-Lamont</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Rodriguez-Mazahua</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Lopez</surname></string-name></person-group>, &#x201C;<article-title>A comprehensive survey on support vector machine classification: Applications, challenges and trends</article-title>,&#x201D; <source>Neurocomputing</source><italic>,</italic> vol. <volume>408</volume><italic>,</italic> pp. <fpage>189</fpage>&#x2013;<lpage>215</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>A. J.</given-names> <surname>Smola</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Bartlett</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Schuurmans</surname></string-name></person-group>, &#x201C;<source>Advances in large margin classifiers</source>,&#x201D; <publisher-loc>Cambridge, MA, USA</publisher-loc>: <publisher-name>MIT Press</publisher-name>, <year>2000</year>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Panwar</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Gupta</surname></string-name></person-group>, &#x201C;<chapter-title>Optimized large margin classifier based on perceptron</chapter-title>,&#x201D; in <source>Advances in Intelligent and Soft Computing</source><italic>,</italic> <publisher-loc>Heidelberg, Berlin</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>385</fpage>&#x2013;<lpage>392</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Wei</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Yang</surname></string-name> and <string-name><given-names>M. J.</given-names> <surname>Wainwright</surname></string-name></person-group>, &#x201C;<article-title>Early stopping for kernel boosting algorithms: A general analysis with localized complexities</article-title>,&#x201D; <source>IEEE Transactions on Information Theory</source><italic>,</italic> vol. <volume>65</volume><italic>,</italic> no. <issue>10</issue><italic>,</italic> pp. <fpage>6685</fpage>&#x2013;<lpage>6703</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. P.</given-names> <surname>Bradley</surname></string-name></person-group>, &#x201C;<article-title>The use of the area under the ROC curve in the evaluation of machine learning algorithms</article-title>,&#x201D; <source>Pattern Recognition</source><italic>,</italic> vol. <volume>30</volume><italic>,</italic> no. <issue>7</issue><italic>,</italic> pp. <fpage>1145</fpage>&#x2013;<lpage>1159</lpage>, <year>1997</year>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. R.</given-names> <surname>Ibraheem</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Elmogy</surname></string-name></person-group>, &#x201C;<article-title>Automated segmentation and classification of hepatocellular carcinoma using fuzzy c-means and SVM</article-title>,&#x201D; <source>Medical Imaging in Clinical Applications</source><italic>,</italic> vol. <volume>651</volume><italic>,</italic> pp. <fpage>193</fpage>&#x2013;<lpage>210</lpage>, <year>2016</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>