<?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" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">IASC</journal-id>
<journal-id journal-id-type="nlm-ta">IASC</journal-id>
<journal-id journal-id-type="publisher-id">IASC</journal-id>
<journal-title-group>
<journal-title>Intelligent Automation &#x0026; Soft Computing</journal-title>
</journal-title-group>
<issn pub-type="epub">2326-005X</issn>
<issn pub-type="ppub">1079-8587</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">38321</article-id>
<article-id pub-id-type="doi">10.32604/iasc.2023.038321</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Feature Fusion Based Deep Transfer Learning Based Human Gait Classification Model</article-title>
<alt-title alt-title-type="left-running-head">Feature Fusion based Deep Transfer Learning based Human Gait Classification Model</alt-title>
<alt-title alt-title-type="right-running-head">Feature Fusion based Deep Transfer Learning based Human Gait Classification Model</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Anupama</surname><given-names>C. S. S.</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>Zakieva</surname><given-names>Rafina</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>Sergin</surname><given-names>Afanasiy</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>Lydia</surname><given-names>E. Laxmi</given-names></name><xref ref-type="aff" rid="aff-4">4</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Kadry</surname><given-names>Seifedine</given-names></name><xref ref-type="aff" rid="aff-5">5</xref><xref ref-type="aff" rid="aff-6">6</xref><xref ref-type="aff" rid="aff-7">7</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Kim</surname><given-names>Chomyong</given-names></name><xref ref-type="aff" rid="aff-8">8</xref></contrib>
<contrib id="author-7" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Nam</surname><given-names>Yunyoung</given-names></name><xref ref-type="aff" rid="aff-8">8</xref><email>ynam@sch.ac.kr</email></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Electronics and Instrumentation Engineering, V. R. Siddhartha Engineering College</institution>, <addr-line>Vijayawada, 520007</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>Candidate of Pedagogical Sciences, Department of Industrial Electronics and Lighting Engineering, Kazan State Power Engineering University</institution>, <addr-line>Kazan, 420066</addr-line>, <country>Russia</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Theories and Principles of Physical Education and Life Safety, North-Eastern Federal University Named After M. K. Ammosov</institution>, <addr-line>Yakutsk, 677000</addr-line>, <country>Russia</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Computer Science and Engineering, Vignan&#x2019;s Institute of Information Technology</institution>, <addr-line>Visakhapatnam, 530049</addr-line>, <country>India</country></aff>
<aff id="aff-5"><label>5</label><institution>Department of Applied Data Science, Noroff University College</institution>, <addr-line>Kristiansand</addr-line>, <country>Norway</country></aff>
<aff id="aff-6"><label>6</label><institution>Artificial Intelligence Research Center (AIRC), Ajman University</institution>, <addr-line>Ajman, 346</addr-line>, <country>United Arab Emirates</country></aff>
<aff id="aff-7"><label>7</label><institution>Department of Electrical and Computer Engineering, Lebanese American University</institution>, <addr-line>Byblos</addr-line>, <country>Lebanon</country></aff>
<aff id="aff-8"><label>8</label><institution>Department of ICT Convergence, Soonchunhyang University</institution>, <addr-line>Asan, 31538</addr-line>, <country>Korea</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Yunyoung Nam. Email: <email>ynam@sch.ac.kr</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2023</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>23</day>
<month>6</month>
<year>2023</year></pub-date>
<volume>37</volume>
<issue>2</issue>
<fpage>1453</fpage>
<lpage>1468</lpage>
<history>
<date date-type="received">
<day>07</day>
<month>12</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>16</day>
<month>1</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Anupama et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Anupama 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_IASC_38321.pdf"></self-uri>
<abstract>
<p>Gait is a biological typical that defines the method by that people walk. Walking is the most significant performance which keeps our day-to-day life and physical condition. Surface electromyography (sEMG) is a weak bioelectric signal that portrays the functional state between the human muscles and nervous system to any extent. Gait classifiers dependent upon sEMG signals are extremely utilized in analysing muscle diseases and as a guide path for recovery treatment. Several approaches are established in the works for gait recognition utilizing conventional and deep learning (DL) approaches. This study designs an Enhanced Artificial Algae Algorithm with Hybrid Deep Learning based Human Gait Classification (EAAA-HDLGR) technique on sEMG signals. The EAAA-HDLGR technique extracts the time domain (TD) and frequency domain (FD) features from the sEMG signals and is fused. In addition, the EAAA-HDLGR technique exploits the hybrid deep learning (HDL) model for gait recognition. At last, an EAAA-based hyperparameter optimizer is applied for the HDL model, which is mainly derived from the quasi-oppositional based learning (QOBL) concept, showing the novelty of the work. A brief classifier outcome of the EAAA-HDLGR technique is examined under diverse aspects, and the results indicate improving the EAAA-HDLGR technique. The results imply that the EAAA-HDLGR technique accomplishes improved results with the inclusion of EAAA on gait recognition.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Feature fusion</kwd>
<kwd>human gait recognition</kwd>
<kwd>deep learning</kwd>
<kwd>electromyography signals</kwd>
<kwd>artificial algae algorithm</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>Korea Health Industry Development Institute (KHIDI), funded by the Ministry of Health &#x0026; Welfare, Republic of Korea</funding-source>
<award-id>HI21C1831</award-id>
</award-group>
<award-group id="awg2">
<funding-source>Soonchunhyang University Research Fund</funding-source>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Human gait, how an individual walks, is personally distinctive because of its physical properties difference betwixt individuals and might be employed as a novel biometric for the authentication and identification of a person [<xref ref-type="bibr" rid="ref-1">1</xref>]. In comparison to other biometrics, namely iris, face, and fingerprint, human gait recognition (HGR) has the advantage of non-invasion, non-cooperation (without any cooperation or interaction with the subject), hard to disguise and long distance, making it very attractive as a means of detection and demonstrates huge potential in the applications of surveillance and security [<xref ref-type="bibr" rid="ref-2">2</xref>,<xref ref-type="bibr" rid="ref-3">3</xref>]. Many sensing modalities involving wearable devices, vision, and foot pressure were used for capturing gait data [<xref ref-type="bibr" rid="ref-4">4</xref>].</p>
<p>Traditional HGR techniques include data preprocessing and features extracted in a handcrafted manner for additional identification [<xref ref-type="bibr" rid="ref-5">5</xref>], frequently suffer from various challenges and constraints enforced by the difficulty of the tasks, namely occlusions, viewing angle, locating the body segments, shadows, large intra-class variations, etc. [<xref ref-type="bibr" rid="ref-6">6</xref>,<xref ref-type="bibr" rid="ref-7">7</xref>]. Emerging trends in machine learning (ML), called deep learning (DL), have become apparent in the past few years as a ground-breaking tool for handling topics in computer vision, speech, sound, and image processing, tremendously outperforming virtually any baseline established previously [<xref ref-type="bibr" rid="ref-8">8</xref>]. The new model exempts the requirement of manually extracting representative features from the expert and provides primary outcomes based on HGR, surpassing the present difficulties and opening room for additional investigation [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-10">10</xref>]. The manually extracted feature was affected by the smartphone&#x2019;s position while gathering the information [<xref ref-type="bibr" rid="ref-11">11</xref>]. Consequently, some typical statistical manually extracted feature was collected from raw smartphone sensor information. Afterwards, the extraction of handcrafted features, the shallow ML classifier, was used to identify many physical activities of the human. Therefore, shallow ML algorithm relies on handcrafted feature [<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-13">13</xref>]. The DL algorithm is more advanced than the shallow ML algorithm since the DL algorithm automatically learns useful features from the raw sensory information without human intervention and identifies the human&#x2019;s physical activities [<xref ref-type="bibr" rid="ref-14">14</xref>]. The shallow ML algorithm with DL algorithms and handcrafted extracting features with automatically learned features achieved better outcomes in carrying out the smartphone-based HGR model. So, it is apparent that integrating manually extracted features with automatically learned features in the DL algorithm might enhance the potential of the smartphone-based HGR paradigm [<xref ref-type="bibr" rid="ref-15">15</xref>].</p>
<p>Khan et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] developed a lightweight DL algorithm for the HGR method. The presented algorithm involves sequential step&#x2013;pretrained deep model selection of feature classification. Initially, two lightweight pretrained methods are considered and finetuned concerning other layers and freeze some middle layers. Thereafter, the model was trained using the deep transfer learning (DTL) algorithm, and the feature was engineered on average pooling and fully connected layers. The fusion is carried out through discriminative correlation analysis, enhanced by the moth-flame optimization (MFO) technique. Liang et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] examine the effect of every layer on a parallel infrastructured convolutional neural network (CNN). In particular, we slowly freeze the parameter of GaitSet from high to low layers and see the performance of finetuning. Furthermore, the rise of the frozen layer has negative consequences on the performance; it could reach the maximal efficacy with a single convolution layer unfrozen.</p>
<p>The author in [<xref ref-type="bibr" rid="ref-18">18</xref>] proposed a novel architecture for HGR using DL and better feature selection. During the augmentation phase, three flip operations were performed. During the feature extraction phase, two pre-trained models have taken place, NASNet Mobile and Inception-ResNetV2. These two models were trained and fine-tuned utilizing the TL algorithm on the CASIA B gait data. The feature of the selected deep model was enhanced through an adapted three-step whale-optimized algorithm, and the better feature was selected. Hashem et al. [<xref ref-type="bibr" rid="ref-19">19</xref>] proposed an accurate and advanced end-user software system that is capable of identifying individuals in video based on the gait signature for hospital security. TL algorithm based on pretrained CNN was used and capable of extracting deep feature vectors and categorizing people directly rather than a typical representation that includes hand-crafted feature engineering and computing the binary silhouettes.</p>
<p>In [<xref ref-type="bibr" rid="ref-20">20</xref>], proposed a novel fully automatic technique for HGR under different view angles using the DL technique. Four major phases are included: recognition using supervised learning methods, pre-processing of the original video frame, which exploits pre-trained Densenet-201 CNN model for extracting features, and decrease of further features in extraction vector based on a hybrid selection technique. Sharif et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] suggest a method that efficiently deals with the problem related to walking styles and viewing angle shifts in real-time. The subsequent steps are included: (a) feature selection based on the kurtosis-controlled entropy (KcE) method, then a correlation-based feature fusion phase, (b) real-time video capture, and (c) extraction feature utilizing transfer learning (TL) on the ResNet101 deep model. Then, the most discriminative feature was categorized using the innovative ML classifier.</p>
<p>This study designs an Enhanced Artificial Algae Algorithm with Hybrid Deep Learning based Human Gait Classification (EAAA-HDLGR) technique on sEMG signals. The EAAA-HDLGR technique initially extracts the time domain (TD), and frequency domain (FD) features from the sEMG signals and is fused. In addition, the EAAA-HDLGR technique exploits the hybrid deep learning (HDL) model for gait recognition. At last, an EAAA-based hyperparameter optimizer is applied for the HDL model, mainly derived from the quasi-oppositional based learning (QOBL) concept. A brief classifier outcome of the EAAA-HDLGR technique is examined under diverse aspects.</p>
<p>The rest of the paper is organized as follows. Section 2 provides the overall description of the proposed model. Next, Section 3 offers the experimental validation process. Finally, Section 4 concludes the work with major findings.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>The Proposed Model</title>
<p>In this study, we have derived a new EAAA-HDLGR technique for gait recognition using sEMG signals. Primarily, the EAAA-HDLGR technique derived the TD as well as FD features from the sEMG signals, which are then fused. In addition, the EAAA-HDLGR technique exploited the HDL model for gait recognition. At last, an EAAA-based hyperparameter optimizer is applied for the HDL model, mainly derived from the QOBL concept. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> depicts the workflow of the EAAA-HDLGR algorithm.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Workflow of EAAA-HDLGR approach</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_38321-fig-1.tif"/>
</fig>
<sec id="s2_1">
<label>2.1</label>
<title>Feature Extraction Process</title>
<p>Afterwards, de-noising, the TD and FD features of all the channels of the EMG signal can be extracted [<xref ref-type="bibr" rid="ref-22">22</xref>]. During this case, the 3 representative time domain features comprising variance (VAR), zero crossing points (ZC), and mean absolute value (MAV) can be utilized as frequency domain features. MAV gets the benefit of properties in which sEMG signals are huge amplitude fluctuations from the time domain that are linearly compared with muscle activation level. The maximum value of <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>M</mml:mi><mml:mi>A</mml:mi><mml:mi>V</mml:mi></mml:math></inline-formula> is the superior activation level of muscles.</p>
<p><disp-formula id="eqn-1">
<label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:mi>M</mml:mi><mml:mi>A</mml:mi><mml:mi>V</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow></mml:math></disp-formula>whereas, <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> implies the sEMG time series with a window length of <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>N</mml:mi><mml:mo>.</mml:mo></mml:math></inline-formula> VAR is the size of signal powers of sEMG signals and is formulated as:</p>
<p><disp-formula id="eqn-2">
<label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mi>V</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msubsup><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:math></disp-formula></p>
<p><inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>Z</mml:mi><mml:mi>C</mml:mi></mml:math></inline-formula> implies the count of times the sEMG waveform passes with the zero point to avoid signal cross-calculating due to low-level noise. It can be a mathematical process as follows:</p>
<p><disp-formula id="eqn-3">
<label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:mi>Z</mml:mi><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msubsup><mml:mi>s</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>whereas, <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>s</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mspace width="thinmathspace" /><mml:mi>x</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mspace width="thinmathspace" /><mml:mrow><mml:mtext mathvariant="italic">otherwise</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></inline-formula></p>
<p>It can choose 2 representative frequency domain features like average power frequency <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and median frequency <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> determined as:</p>
<p><disp-formula id="eqn-4">
<label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:mrow></mml:msubsup><mml:mi>f</mml:mi><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mi>d</mml:mi><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:mrow></mml:msubsup><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mi>d</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><disp-formula id="eqn-5">
<label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>f</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>f</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:mrow></mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>f</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>f</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:mrow></mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>f</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>f</mml:mi></mml:math></disp-formula>whereas <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> implies the power spectral density of sEMG signals, and <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>f</mml:mi></mml:math></inline-formula> denotes the frequency.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Gait Classification using HDL Model</title>
<p>During this study, the HDL technique was employed for the gait classifier. It comprises CNN with long short-term memory (LSTM) and bidirectional LSTM (Bi-LSTM) technique [<xref ref-type="bibr" rid="ref-23">23</xref>]. CNN is increasingly popular under the domains of DL and is contained in convolution (Conv) and pooling layers. The Conv layer function is to remove useful features in the input database. Its interior includes one or more Conv kernels. The Conv layer was executed to remove effectual features by sliding the Conv kernel on the feature. Afterwards, enhance a Max-Pooling layer and then the Conv layer; the Max-Pooling layer maintains the strong features and extracts the weaker feature to prevent over-fitting and decrease the complexity. LSTM avoids gradient vanishing and explosion from the trained process of recurrent neural network (RNN), whereas input, output, and forget gates can be projected. The 3 gate functions effectively solve the trained problem of RNN. The input gate determines the data that existing time carries to future time. The forget gate identifies the data count of preceding times which is preserved in the current period. The resultant gate chooses the result of existing to future states. The succeeding equation illustrates the equation of distinct cells from LSTM:</p>
<p><disp-formula id="eqn-6">
<label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>z</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-7">
<label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>z</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-8">
<label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mi>o</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>z</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-9">
<label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>C</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>tanh</mml:mi><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>z</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-10">
<label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>z</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mi>e</mml:mi><mml:msub><mml:mrow><mml:mover><mml:mi>C</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="eqn-11">
<label>(11)</label>
<mml:math id="mml-eqn-11" display="block"><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>o</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mi>e</mml:mi><mml:mi>tanh</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>At this point, <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mi>o</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> implies the weighted in the hidden layer to forget, memory cell, output, and input gates. <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> signify the weight of the forgetting gate, output gate, input gate, and memory cell. <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mn>0</mml:mn><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> illustrate the <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msup><mml:mi>z</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> forget, input, and output gates. <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> stands for the bias values of a memory cell, output gate, forget gate, and input gate. Bi-LSTM is a group of forward and backward LSTM that could provide relevant data in forward and backward ways and concatenate the prediction. LSTM is suitable the time-related data in one way. BiLSTM improves the opposite way of LSTM in such a method that BiLSTM captures the pattern, which LSTM ignores. LSTM-BiLSTM classifier the gait based on extracting feature.
<list list-type="bullet">
<list-item>
<p>CNN was projected with three 1-D Conv layers, and the count of Conv kernels is set as 16, 32, 64, correspondingly. The Conv kernel size is set as 2, and the striding phase has set as. The effectual feature was extracted with stride from the Conv kernel. Then, add the Max-Pooling layer for all the Conv layers; afterwards, the pooling window size was set as 2, and the stride stage was set as one. The Max-Pooling layer decreases the feature effort and avoids overfitting.</p></list-item>
<list-item>
<p>By assigning weight to features using the attention process, the attention block enhances the outcome of time series features, restrains the interference of insignificant features, and effectually explains this problem that the process doesn&#x2019;t judge the effect of vital of various time series features.</p></list-item>
<list-item>
<p>The extraction feature assumed that the input of 1 Bi-LSTM layer and 2 LSTM layers achieved the classifier outcome.</p></list-item>
</list></p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Parameter Optimization using EAAA Model</title>
<p>To improve the recognition rate, EAAA based hyperparameter optimizer is applied to the HDL model. Artificial algae are generally known to describe the features of algae and demonstrate that they can be responsive to solutions from the problem spaces [<xref ref-type="bibr" rid="ref-24">24</xref>]. With a real one, artificial algae demonstrate that if it is implemented in the environment by moving to a light source for photosynthesizing by spiral swimming, it can switch superior species and eventually multiply with mitotic division. Thus, this procedure contains 3 important processes Helical Motion, Evolutionary Process, and Adaptation. The term algae colony signifies the collection of algae cells that lives together. Algae colony and population can demonstrate in the subsequent formula.</p>
<p><disp-formula id="eqn-12">
<label>(12)</label>
<mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mi mathvariant="italic">P</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">p</mml:mi><mml:mi mathvariant="italic">u</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22F1;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-13">
<label>(13)</label>
<mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mi mathvariant="italic">A</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">g</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">y</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msubsup><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The algae colony work as separate cell and permits together, and the cell from the colony can pass away an unfavourable level of life. The colony present at the optimal point is named a better colony, and it includes better algae cells. The development kinetics of algae colonies calculated by the Monod approach as demonstrated under.</p>
<p><disp-formula id="eqn-14">
<label>(14)</label>
<mml:math id="mml-eqn-14" display="block"><mml:mi>&#x03BC;</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-14">Eq. (14)</xref>, <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>&#x03BC;</mml:mi></mml:math></inline-formula> signifies the rate of growth, <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi>&#x03BC;</mml:mi><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:math></inline-formula> implies the maximal rate of growth, <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>S</mml:mi></mml:math></inline-formula> represents the nutrient concentration, and <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>K</mml:mi></mml:math></inline-formula> is divided as to algal colony. In <xref ref-type="disp-formula" rid="eqn-17">Eq. (17)</xref>, <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>&#x03BC;</mml:mi><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:math></inline-formula> value is set to one dependent upon the mass conservation model, an entire count converted as to biomass can correspond to the count of substrate expended to all the time units. The size of <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> algae colonies at time <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> from the Monod equation is depicted under:</p>
<p><disp-formula id="eqn-15">
<label>(15)</label>
<mml:math id="mml-eqn-15" display="block"><mml:msubsup><mml:mi>G</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:msubsup><mml:mi>G</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-15">Eq. (15)</xref>, <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msubsup><mml:mi>G</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> denotes the size of <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> algae colonies at <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>t</mml:mi></mml:math></inline-formula> time, <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>N</mml:mi></mml:math></inline-formula> represents the amount of algae colonies. The algae colony offers an optimum solution that develops higher as a sign of a greater count of nutrients is obtained. In all the algae cells, the minimal algae colony dies from the evolution procedure, and the algae cell of the maximum algae colony reproduces. Such procedure is complete in the subsequent formulas:</p>
<p><disp-formula id="eqn-16">
<label>(16)</label>
<mml:math id="mml-eqn-16" display="block"><mml:mrow><mml:mi mathvariant="italic">b</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">g</mml:mi><mml:mi mathvariant="italic">g</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:msubsup><mml:mi>G</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mi>N</mml:mi></mml:math></disp-formula></p>
<p><disp-formula id="eqn-17">
<label>(17)</label>
<mml:math id="mml-eqn-17" display="block"><mml:msup><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">t</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:msubsup><mml:mi>G</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mi>N</mml:mi></mml:math></disp-formula></p>
<p><disp-formula id="eqn-18">
<label>(18)</label>
<mml:math id="mml-eqn-18" display="block"><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:msubsup><mml:mi>l</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">b</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">g</mml:mi><mml:mi mathvariant="italic">g</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mi>D</mml:mi><mml:mi>D</mml:mi></mml:math></disp-formula></p>
<p>In the above formula, <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>D</mml:mi></mml:math></inline-formula> signifies that there is a problem feature, whereas the maximum describes the largest colony of algae, and the minimal symbolizes the lower colony of algae. A primary hunger value is 0 for every artificial alga, and the Adaptation process stops by an alteration in the hunger level.</p>
<p><disp-formula id="eqn-19">
<label>(19)</label>
<mml:math id="mml-eqn-19" display="block"><mml:msup><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">v</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">g</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:msubsup><mml:mi>A</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mspace width="thinmathspace" /><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mi>N</mml:mi></mml:math></disp-formula></p>
<p><disp-formula id="eqn-20">
<label>(20)</label>
<mml:math id="mml-eqn-20" display="block"><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">v</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:msup><mml:mi>g</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">v</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:msup><mml:mi>g</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="italic">b</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">g</mml:mi><mml:mi mathvariant="italic">g</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">v</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:msup><mml:mi>g</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:math></disp-formula></p>
<p>During this equation, the value <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>A</mml:mi></mml:math></inline-formula> signifies the hunger value of <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> algae colonies at <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mi>t</mml:mi></mml:math></inline-formula> time, and <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:msup><mml:mrow><mml:mtext>starving</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> describes the algae colonies with maximal angle value at <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>t</mml:mi></mml:math></inline-formula> time. In <xref ref-type="disp-formula" rid="eqn-20">Eq. (20)</xref>, the variation parameter states the adaptation scheme and is utilized at <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mi>t</mml:mi></mml:math></inline-formula> time. Generally, the variation parameter value lies in the interval of 0 and 1. In AAA, the movement of algae cells are spiral, the viscous drag is realized as shear force commensurate to algae cell size, gravity restricting movement is presented as zero, and viscous drag demonstrates as zero. At this time, <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>&#x03C4;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> implies the friction surface, the friction surface is the surface area, and the Algae colony has spherical from the shape demonstrated in the under equation. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> depicts the flowchart of AAA.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Flowchart of AAA</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_38321-fig-2.tif"/>
</fig>
<p><disp-formula id="eqn-21">
<label>(21)</label>
<mml:math id="mml-eqn-21" display="block"><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:msup><mml:mi>r</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p><disp-formula id="eqn-22">
<label>(22)</label>
<mml:math id="mml-eqn-22" display="block"><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:msqrt><mml:mfrac><mml:mrow><mml:mn>3</mml:mn><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>4</mml:mn><mml:mi>&#x03C0;</mml:mi></mml:mrow></mml:mfrac></mml:msqrt><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>The distance to the light source and friction surface is to control the step size of motions.</p>
<p><disp-formula id="eqn-23">
<label>(23)</label>
<mml:math id="mml-eqn-23" display="block"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mi>p</mml:mi></mml:math></disp-formula></p>
<p><disp-formula id="eqn-24">
<label>(24)</label>
<mml:math id="mml-eqn-24" display="block"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:math></disp-formula></p>
<p><disp-formula id="eqn-25">
<label>(25)</label>
<mml:math id="mml-eqn-25" display="block"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi>sin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>&#x03B2;</mml:mi></mml:math></disp-formula></p>
<p>For the helical rotation of algae cells, <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, and <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> are stated as the coordinate of the algae cell (<inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:math></inline-formula>, and z) at <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>t</mml:mi></mml:math></inline-formula> time. <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>&#x03B2;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">]</mml:mo><mml:mo>;</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo><mml:mo>;</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:math></inline-formula> the force to the procedure; <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mi>t</mml:mi></mml:math></inline-formula> (xi) signifies the friction surface area of <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> algae cells. The AAO technique arbitrarily creates the primary solution in the search range. Once the solution is superior to the global better solution, afterwards, the convergence population rate can be slower and simply decrease as to the local better solution. Tizhoosh projected oppositional-based learning (OBL) technique for preventing these local better problems [<xref ref-type="bibr" rid="ref-25">25</xref>].</p>
<p>Also, the QOAAO technique resulted by utilizing quasi-opposition-based population initialization. At this point, the random solution was higher than the global better solution if related to their opposite solution. So, the N better individual was chosen in the distinct population containing <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>N</mml:mi></mml:math></inline-formula> arbitrary individuals and the opposite solution of individuals. Let <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> refer to the point in <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mi>d</mml:mi></mml:math></inline-formula> dimension space, and its opposite point signifies <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> which is calculated by the subsequent formula; and its quasi-opposite point <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:mi>Q</mml:mi><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>Q</mml:mi><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>Q</mml:mi><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>Q</mml:mi><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> was measured as:</p>
<p><disp-formula id="eqn-26">
<label>(26)</label>
<mml:math id="mml-eqn-26" display="block"><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>l</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>u</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="eqn-27">
<label>(27)</label>
<mml:math id="mml-eqn-27" display="block"><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>Q</mml:mi><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>l</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>u</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mstyle><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>l</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>u</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mstyle><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>l</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>u</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>l</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>u</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mstyle><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>l</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>u</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula></p>
<p>In the formula, the <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mi>d</mml:mi></mml:math></inline-formula> dimension vector of <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mi>X</mml:mi></mml:math></inline-formula> was signified as <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, and <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>Q</mml:mi><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> denotes the <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi>d</mml:mi></mml:math></inline-formula> dimensional opposite point <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, and quasi-opposite point <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:mi>Q</mml:mi><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> correspondingly. Also, LBD and <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mi>u</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> illustrate the <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mi>d</mml:mi></mml:math></inline-formula> dimensional of lower as well as upper limits of problems, correspondingly.</p>
<p>The fitness chosen is a vital feature in the EAAA system. The solution encoder was exploited to assess the aptitude (goodness) of candidate solutions. At this point, the accuracy value is the main form employed to design a fitness function.</p>
<p><disp-formula id="eqn-28">
<label>(28)</label>
<mml:math id="mml-eqn-28" display="block"><mml:mrow><mml:mi mathvariant="italic">F</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>P</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-29">
<label>(29)</label>
<mml:math id="mml-eqn-29" display="block"><mml:mi>P</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>From the expression, TP represents the true positive, and FP denotes the false positive value.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Results and Discussion</title>
<p>In this section, the gait classification results of the EAAA-HDLGR approach are investigated in detail. The proposed model is simulated using Python 3.6.5 tool on PC i5-8600k, GeForce 1050Ti 4GB, 16GB RAM, 250GB SSD, and 1TB HDD. The parameter settings are given as follows: learning rate: 0.01, dropout: 0.5, batch size: 5, epoch count: 50, and activation: ReLU.</p>
<p><xref ref-type="table" rid="table-1">Table 1</xref> and <xref ref-type="fig" rid="fig-3">Fig. 3</xref> demonstrate the overall gait classification outcomes of the EAAA-HDLGR model with other ML models on TD features [<xref ref-type="bibr" rid="ref-22">22</xref>]. The experimental results inferred that the EAAA-HDLGR model exhibits effectual outcomes. For instance, with the pre-stance stage, the EAAA-HDLGR model has highlighted an increasing <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.07% while the support vector machine (SVM), extreme learning machine (ELM), LSTM, deep belief network (DBN), and salp swarm algorithm with DBN (SSA-DBN) models have attained reducing <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 95%, 96.07%, 93.49%, 93.63%, and 96.99% respectively.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Gait classifier outcome of EAAA-HDLGR approach with other ML techniques on TD features</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th colspan="7" align="center">Accuracy (%)-TD features</th>
</tr>
<tr>
<th>Class</th>
<th>SVM</th>
<th>ELM</th>
<th>LSTM</th>
<th>DBN</th>
<th>SSA-DBN</th>
<th>EAAA-HDLGR</th>
</tr>
</thead>
<tbody>
<tr>
<td>Pre-stance</td>
<td>95.00</td>
<td>96.07</td>
<td>93.49</td>
<td>93.63</td>
<td>96.99</td>
<td>96.07</td>
</tr>
<tr>
<td>Mid-stance</td>
<td>95.15</td>
<td>94.45</td>
<td>95.89</td>
<td>92.36</td>
<td>96.49</td>
<td>95.56</td>
</tr>
<tr>
<td>Terminal-stance</td>
<td>92.01</td>
<td>95.50</td>
<td>97.33</td>
<td>94.73</td>
<td>95.78</td>
<td>98.95</td>
</tr>
<tr>
<td>Pre-swing</td>
<td>92.17</td>
<td>92.77</td>
<td>93.89</td>
<td>92.65</td>
<td>92.03</td>
<td>95.78</td>
</tr>
<tr>
<td>Terminal-swing</td>
<td>96.92</td>
<td>94.79</td>
<td>92.76</td>
<td>96.65</td>
<td>94.84</td>
<td>98.03</td>
</tr>
<tr>
<td><bold>Average</bold></td>
<td><bold>94.25</bold></td>
<td><bold>94.72</bold></td>
<td><bold>94.67</bold></td>
<td><bold>94.00</bold></td>
<td><bold>95.23</bold></td>
<td><bold>96.88</bold></td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Gait classifier outcome of EAAA-HDLGR approach on TD features</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_38321-fig-3.tif"/>
</fig>
<p>Meanwhile, with the Terminal-Stance stage, the EAAA-HDLGR approach has emphasized increasing <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.95% while the SVM, ELM, LSTM, DBN, and SSA-DBN models have attained decreasing <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 92.01%, 95.50%, 97.33%, 94.73%, and 95.78% correspondingly. Finally, with the Terminal-Swing stage, the EAAA-HDLGR technique has demonstrated a higher <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.03% while the SVM, ELM, LSTM, DBN, and SSA-DBN methods have attained lesser <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.92%, 94.79%, 92.76%, 96.65% and 94.84% correspondingly.</p>
<p>An average <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> assessment of the EAAA-HDLGR model with other models on TD features is given in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. The outcomes stated that the EAAA-HDLGR method had reached an improving <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.88%. Contrastingly, the SVM, ELM, LSTM, DBN, and SSA-DBN models have accomplished degrading <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 94.25%, 94.72%, 94.67%, 94%, and 95.23%, respectively.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Average outcome of EAAA-HDLGR approach on TD features</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_38321-fig-4.tif"/>
</fig>
<p><xref ref-type="table" rid="table-2">Table 2</xref> and <xref ref-type="fig" rid="fig-5">Fig. 5</xref> illustrate the overall gait classification outcomes of the EAAA-HDLGR approach with other ML models on FD features. The experimental outcomes inferred that the EAAA-HDLGR system exhibits effectual outcomes. For the sample, with the pre-stance stage, the EAAA-HDLGR method has exhibited a maximal <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.06% while the SVM, ELM, LSTM, DBN, and SSA-DBN models have attained a lesser <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.02%, 92.59%, 96.62%, 97.45% and 94.59% correspondingly. In the meantime, with the Terminal-Stance stage, the EAAA-HDLGR system has highlighted an increasing <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.02% while the SVM, ELM, LSTM, DBN, and SSA-DBN methodologies have attained a reducing <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 92.02%, 94.43%, 93.70%, 94.84% and 96.28% correspondingly. Lastly, with the Terminal-Swing stage, the EAAA-HDLGR model has demonstrated an increasing <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.44% while the SVM, ELM, LSTM, DBN, and SSA-DBN approaches have attained a reducing <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.45%, 95.47%, 94.38%, 92.54% and 95.29% correspondingly.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Gait classifier outcome of EAAA-HDLGR approach with other ML techniques on FD features</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th colspan="7" align="center">Accuracy (%)-FD features</th>
</tr>
<tr>
<th>Class</th>
<th>SVM</th>
<th>ELM</th>
<th>LSTM</th>
<th>DBN</th>
<th>SSA-DBN</th>
<th>EAAA-HDLGR</th>
</tr>
</thead>
<tbody>
<tr>
<td>Pre-stance</td>
<td>97.02</td>
<td>92.59</td>
<td>96.62</td>
<td>97.45</td>
<td>94.59</td>
<td>96.06</td>
</tr>
<tr>
<td>Mid-stance</td>
<td>94.80</td>
<td>96.64</td>
<td>93.19</td>
<td>92.00</td>
<td>94.86</td>
<td>96.79</td>
</tr>
<tr>
<td>Terminal-stance</td>
<td>92.02</td>
<td>94.43</td>
<td>93.70</td>
<td>94.84</td>
<td>96.28</td>
<td>97.02</td>
</tr>
<tr>
<td>Pre-swing</td>
<td>96.58</td>
<td>96.98</td>
<td>95.77</td>
<td>92.96</td>
<td>97.62</td>
<td>96.55</td>
</tr>
<tr>
<td>Terminal-swing</td>
<td>97.45</td>
<td>95.47</td>
<td>94.38</td>
<td>92.54</td>
<td>95.29</td>
<td>97.44</td>
</tr>
<tr>
<td><bold>Average</bold></td>
<td><bold>95.57</bold></td>
<td><bold>95.22</bold></td>
<td><bold>94.73</bold></td>
<td><bold>93.96</bold></td>
<td><bold>95.73</bold></td>
<td><bold>96.77</bold></td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Gait classifier outcome of EAAA-HDLGR approach on FD features</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_38321-fig-5.tif"/>
</fig>
<p>An average <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis of the EAAA-HDLGR approach with other models on FD features is given in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. The outcomes pointed out that the EAAA-HDLGR algorithm has reached an improving <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.77%. Contrastingly, the SVM, ELM, LSTM, DBN, and SSA-DBN models have accomplished degrading <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 95.57%, 95.22%, 94.73%, 93.96% and 95.73% correspondingly.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Average outcome of EAAA-HDLGR approach on FD features</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_38321-fig-6.tif"/>
</fig>
<p><xref ref-type="table" rid="table-3">Table 3</xref> and <xref ref-type="fig" rid="fig-7">Fig. 7</xref> showcase the overall gait classification outcomes of the EAAA-HDLGR algorithm with other ML techniques on Fusion features. The experimental results inferred that the EAAA-HDLGR system demonstrates effectual outcomes. For instance, with the pre-stance stage, the EAAA-HDLGR approach has highlighted a higher <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.66% while the SVM, ELM, LSTM, DBN, and SSA-DBN methods have gained minimal <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 94.53%, 94.65%, 93.41%, 97.54% and 95.24% correspondingly. Followed by, with Terminal-Stance stage, the EAAA-HDLGR algorithm has exhibited an increasing <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.62% while the SVM, ELM, LSTM, DBN, and SSA-DBN models have attained a reducing <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 93.59%, 95.77%, 94.02%, 92.36% and 95.50% respectively. Finally, with the Terminal-Swing stage, the EAAA-HDLGR approach has depicted a superior <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.55% while the SVM, ELM, LSTM, DBN, and SSA-DBN systems have obtained a reducing <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 92.77%, 97.00%, 94.89%, 93.75% and 97.81% correspondingly.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Gait classifier outcome of EAAA-HDLGR approach with other ML techniques on fusion features</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th colspan="7" align="center">Accuracy (%)-Fusion features</th>
</tr>
<tr>
<th>Class</th>
<th>SVM</th>
<th>ELM</th>
<th>LSTM</th>
<th>DBN</th>
<th>SSA-DBN</th>
<th>EAAA-HDLGR</th>
</tr>
</thead>
<tbody>
<tr>
<td>Pre-stance</td>
<td>94.53</td>
<td>94.65</td>
<td>93.41</td>
<td>97.54</td>
<td>95.24</td>
<td>97.66</td>
</tr>
<tr>
<td>Mid-stance</td>
<td>92.36</td>
<td>95.09</td>
<td>93.88</td>
<td>97.12</td>
<td>96.30</td>
<td>98.23</td>
</tr>
<tr>
<td>Terminal-stance</td>
<td>93.59</td>
<td>95.77</td>
<td>94.02</td>
<td>92.36</td>
<td>95.50</td>
<td>98.62</td>
</tr>
<tr>
<td>Pre-swing</td>
<td>96.62</td>
<td>92.61</td>
<td>95.00</td>
<td>96.28</td>
<td>93.23</td>
<td>97.86</td>
</tr>
<tr>
<td>Terminal-swing</td>
<td>92.77</td>
<td>97.00</td>
<td>94.89</td>
<td>93.75</td>
<td>97.81</td>
<td>97.55</td>
</tr>
<tr>
<td><bold>Average</bold></td>
<td><bold>93.97</bold></td>
<td><bold>95.02</bold></td>
<td><bold>94.24</bold></td>
<td><bold>95.41</bold></td>
<td><bold>95.62</bold></td>
<td><bold>97.98</bold></td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Gait classifier outcome of EAAA-HDLGR approach on fusion features</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_38321-fig-7.tif"/>
</fig>
<p>An average <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> investigation of the EAAA-HDLGR approach with other methodologies on Fusion features is given in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. The outcomes stated that the EAAA-HDLGR system has reached an improving <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.98%. Also, the SVM, ELM, LSTM, DBN, and SSA-DBN systems have accomplished degrading <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 93.97%, 95.02%, 94.24%, 95.41% and 95.62% correspondingly.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Average outcome of EAAA-HDLGR approach on fusion features</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_38321-fig-8.tif"/>
</fig>
<p>The training accuracy (TACC) and validation accuracy (VACC) of the EAAA-HDLGR approach are investigated on gait classifier performance in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>. The figure stated that the EAAA-HDLGR methodology has shown higher performance with improved values of TACC and VACC. It is observable that the EAAA-HDLGR methodology has reached maximal TACC outcomes.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>TACC and VACC outcome of EAAA-HDLGR approach</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_38321-fig-9.tif"/>
</fig>
<p>The training loss (TLS) and validation loss (VLS) of the EAAA-HDLGR system are tested on gait classifier performance in <xref ref-type="fig" rid="fig-10">Fig. 10</xref>. The figure pointed out that the EAAA-HDLGR algorithm has better performance with minimal values of TLS and VLS. It is noticeable that the EAAA-HDLGR model has resulted in lesser VLS outcomes.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>TLS and VLS outcome of the EAAA-HDLGR approach</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_38321-fig-10.tif"/>
</fig>
</sec>
<sec id="s4">
<label>4</label>
<title>Conclusion</title>
<p>In this study, we have derived a new EAAA-HDLGR technique for gait recognition using sEMG signals. Primarily, the EAAA-HDLGR technique derived the TD as well as FD features from the sEMG signals which are then fused. In addition, the EAAA-HDLGR technique exploited the HDL model for gait recognition. At last, an EAAA-based hyperparameter optimizer is applied for the HDL model, which is mainly derived by the use of the QOBL concept. A brief classifier outcome of the EAAA-HDLGR technique is examined under diverse aspects and the results indicated the betterment of the EAAA-HDLGR technique. The results imply that the EAAA-HDLGR technique accomplishes improved results with the inclusion of EAAA on gait recognition. In future, feature reduction and feature selection processes can be combined to boost the recognition rate of the EAAA-HDLGR technique.</p>
</sec>
</body>
<back>
<sec><title>Funding Statement</title>
<p>This research was supported by a grant from the Korea Health Technology R&#x0026;D Project through the Korea Health Industry Development Institute (KHIDI), funded by the Ministry of Health &#x0026; Welfare, Republic of Korea (grant number: HI21C1831) and the Soonchunhyang University Research Fund.</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Ni</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Huang</surname></string-name></person-group>, &#x201C;<article-title>Human identification based on natural gait micro&#x2010;Doppler signatures using deep transfer learning</article-title>,&#x201D; <source>IET Radar, Sonar &#x0026; Navigation</source>, vol. <volume>14</volume>, no. <issue>10</issue>, pp. <fpage>1640</fpage>&#x2013;<lpage>1646</lpage>, <year>2020</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>X.</given-names> <surname>Bai</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Hui</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Zhou</surname></string-name></person-group>, &#x201C;<article-title>Radar-based human gait recognition using dual-channel deep convolutional neural network</article-title>,&#x201D; <source>IEEE Transactions on Geoscience and Remote Sensing</source>, vol. <volume>57</volume>, no. <issue>12</issue>, pp. <fpage>9767</fpage>&#x2013;<lpage>9778</lpage>, <year>2019</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>M.</given-names> <surname>Sharif</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Attique</surname></string-name>, <string-name><given-names>M. Z.</given-names> <surname>Tahir</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Yasmim</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Saba</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A machine learning method with threshold based parallel feature fusion and feature selection for automated gait recognition</article-title>,&#x201D; <source>Journal of Organizational and End User Computing</source>, vol. <volume>32</volume>, no. <issue>2</issue>, pp. <fpage>67</fpage>&#x2013;<lpage>92</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wu</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Yan</surname></string-name></person-group>, &#x201C;<article-title>Classification algorithm for human walking gait based on multi-sensor feature fusion</article-title>,&#x201D; in <conf-name>Int. Conf. on Mechatronics and Intelligent Robotics, Advances in Intelligent Systems and Computing Book Series</conf-name>, <publisher-loc>Cham</publisher-loc>, <publisher-name>Springer</publisher-name>, vol. <volume>856</volume>, pp. <fpage>718</fpage>&#x2013;<lpage>725</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>H.</given-names> <surname>Arshad</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Sharif</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Yasmin</surname></string-name> and <string-name><given-names>M. Y.</given-names> <surname>Javed</surname></string-name></person-group>, &#x201C;<article-title>Multi-level features fusion and selection for human gait recognition: An optimized framework of Bayesian model and binomial distribution</article-title>,&#x201D; <source>International Journal of Machine Learning and Cybernetics</source>, vol. <volume>10</volume>, no. <issue>12</issue>, pp. <fpage>3601</fpage>&#x2013;<lpage>3618</lpage>, <year>2019</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>N.</given-names> <surname>Mansouri</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Issa</surname></string-name> and <string-name><given-names>Y. B.</given-names> <surname>Jemaa</surname></string-name></person-group>, &#x201C;<article-title>Gait features fusion for efficient automatic age classification</article-title>,&#x201D; <source>IET Computer Vision</source>, vol. <volume>12</volume>, no. <issue>1</issue>, pp. <fpage>69</fpage>&#x2013;<lpage>75</lpage>, <year>2018</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>D.</given-names> <surname>Thakur</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Biswas</surname></string-name></person-group>, &#x201C;<article-title>Feature fusion using deep learning for smartphone based human activity recognition</article-title>,&#x201D; <source>International Journal of Information Technology</source>, vol. <volume>13</volume>, no. <issue>4</issue>, pp. <fpage>1615</fpage>&#x2013;<lpage>1624</lpage>, <year>2021</year>; <pub-id pub-id-type="pmid">34151135</pub-id></mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F. M.</given-names> <surname>Castro</surname></string-name>, <string-name><given-names>M. J.</given-names> <surname>Mar&#x00ED;n-Jim&#x00E9;nez</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Guil</surname></string-name> and <string-name><given-names>N.</given-names> <surname>P&#x00E9;rez de la Blanca</surname></string-name></person-group>, &#x201C;<article-title>Multimodal feature fusion for CNN-based gait recognition: An empirical comparison</article-title>,&#x201D; <source>Neural Computing and Applications</source>, vol. <volume>32</volume>, no. <issue>17</issue>, pp. <fpage>14173</fpage>&#x2013;<lpage>14193</lpage>, <year>2020</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>M. M.</given-names> <surname>Hasan</surname></string-name> and <string-name><given-names>H. A.</given-names> <surname>Mustafa</surname></string-name></person-group>, &#x201C;<article-title>Multi-level feature fusion for robust pose-based gait recognition using RNN</article-title>,&#x201D; <source>International Journal of Computer Science and Information Security</source>, vol. <volume>18</volume>, no. <issue>2</issue>, pp. <fpage>20</fpage>&#x2013;<lpage>31</lpage>, <year>2021</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>Y.</given-names> <surname>Lang</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Hou</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Huang</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Unsupervised domain adaptation for micro-Doppler human motion classification via feature fusion</article-title>,&#x201D; <source>IEEE Geoscience and Remote Sensing Letters</source>, vol. <volume>16</volume>, no. <issue>3</issue>, pp. <fpage>392</fpage>&#x2013;<lpage>396</lpage>, <year>2018</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>M.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Tian</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Sun</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>Gait analysis for post-stroke hemiparetic patient by multi-features fusion method</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>19</volume>, no. <issue>7</issue>, pp. <fpage>1737</fpage>, <year>2019</year>; <pub-id pub-id-type="pmid">30978981</pub-id></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>A.</given-names> <surname>Abdelbaky</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Aly</surname></string-name></person-group>, &#x201C;<article-title>Two-stream spatiotemporal feature fusion for human action recognition</article-title>,&#x201D; <source>The Visual Computer</source>, vol. <volume>37</volume>, no. <issue>7</issue>, pp. <fpage>1821</fpage>&#x2013;<lpage>1835</lpage>, <year>2021</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>F. F.</given-names> <surname>Wahid</surname></string-name></person-group>, &#x201C;<article-title>Statistical features from frame aggregation and differences for human gait recognition</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>80</volume>, no. <issue>12</issue>, pp. <fpage>18345</fpage>&#x2013;<lpage>18364</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Q.</given-names> <surname>Hong</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Huang</surname></string-name></person-group>, &#x201C;<article-title>Cross-view gait recognition based on feature fusion</article-title>,&#x201D; in <conf-name>IEEE 33rd Int. Conf. on Tools with Artificial Intelligence (ICTAI)</conf-name>, <publisher-loc>Washington, DC, USA</publisher-loc>, pp. <fpage>640</fpage>&#x2013;<lpage>646</lpage>, <year>2021</year>. </mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Sugandhi</surname></string-name>, <string-name><given-names>F. F.</given-names> <surname>Wahid</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Raju</surname></string-name></person-group>, &#x201C;<article-title>Inter frame statistical feature fusion for human gait recognition</article-title>,&#x201D; in <conf-name>Int. Conf. on Data Science and Communication (IconDSC)</conf-name>, <publisher-loc>Bangalore, India</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>, <year>2019</year>. </mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Arshad</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Dama&#x0161;evi&#x010D;ius</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Alqahtani</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Alsubai</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Human gait analysis: A sequential framework of lightweight deep learning and improved moth-flame optimization algorithm</article-title>,&#x201D; <source>Computational Intelligence and Neuroscience</source>, vol. <volume>2022</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Liang</surname></string-name>, <string-name><given-names>E. H. K.</given-names> <surname>Yeung</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Hu</surname></string-name></person-group>, &#x201C;<article-title>Parallel CNN classification for human gait identification with optimal cross data-set transfer learning</article-title>,&#x201D; in <conf-name>IEEE Int. Conf. on Computational Intelligence and Virtual Environments for Measurement Systems and Applications (CIVEMSA)</conf-name>, <publisher-loc>Hong Kong, China</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2021</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>F.</given-names> <surname>Saleem</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Alhaisoni</surname></string-name>, <string-name><given-names>U.</given-names> <surname>Tariq</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Armghan</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Human gait recognition: A single stream optimal deep learning features fusion</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>21</volume>, no. <issue>22</issue>, pp. <fpage>7584</fpage>, <year>2021</year>; <pub-id pub-id-type="pmid">34833658</pub-id></mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Hashem</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Al-Harakeh</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Cherry</surname></string-name></person-group>, &#x201C;<article-title>Human gait identification system based on transfer learning</article-title>,&#x201D; in <conf-name>21st Int. Arab Conf. on Information Technology (ACIT)</conf-name>, <publisher-loc>Giza, Egypt</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2020</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>A.</given-names> <surname>Mehmood</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Sharif</surname></string-name>, <string-name><given-names>S. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Shaheen</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Prosperous human gait recognition: An end-to-end system based on pre-trained CNN features selection</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, pp. <fpage>1</fpage>&#x2013;<lpage>21</lpage>, <year>2020</year>. <pub-id pub-id-type="doi">10.1007/s11042-020-08928-0</pub-id></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>M. I.</given-names> <surname>Sharif</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Alqahtani</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Nazir</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Alsubai</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Deep learning and kurtosis-controlled, entropy-based framework for human gait recognition using video sequences</article-title>,&#x201D; <source>Electronics</source>, vol. <volume>11</volume>, no. <issue>3</issue>, pp. <fpage>334</fpage>, <year>2022</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>J.</given-names> <surname>He</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Zhang</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A method combining multi-feature fusion and optimized deep belief network for emg-based human gait classification</article-title>,&#x201D; <source>Mathematics</source>, vol. <volume>10</volume>, no. <issue>22</issue>, pp. <fpage>4387</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R. J.</given-names> <surname>Kavitha</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Thiagarajan</surname></string-name>, <string-name><given-names>P. I.</given-names> <surname>Priya</surname></string-name>, <string-name><given-names>A. V.</given-names> <surname>Anand</surname></string-name>, <string-name><given-names>E. A.</given-names> <surname>Al-Ammar</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Improved harris hawks optimization with hybrid deep learning based heating and cooling load prediction on residential buildings</article-title>,&#x201D; <source>Chemosphere</source>, vol. <volume>309</volume>, pp. <fpage>136525</fpage>, <year>2022</year>; <pub-id pub-id-type="pmid">36210577</pub-id></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>K. I.</given-names> <surname>Anwer</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Servi</surname></string-name></person-group>, &#x201C;<article-title>Clustering method based on artificial algae algorithm</article-title>,&#x201D; <source>International Journal of Intelligent Systems and Applications in Engineering</source>, vol. <volume>9</volume>, no. <issue>4</issue>, pp. <fpage>136</fpage>&#x2013;<lpage>151</lpage>, <year>2021</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>J.</given-names> <surname>Xia</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Cai</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Adaptive barebones salp swarm algorithm with quasi-oppositional learning for medical diagnosis systems: A comprehensive analysis</article-title>,&#x201D; <source>Journal of Bionic Engineering</source>, vol. <volume>19</volume>, no. <issue>1</issue>, pp. <fpage>240</fpage>&#x2013;<lpage>256</lpage>, <year>2022</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>