<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">31976</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2022.031976</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Metaheuristic with Deep Learning Enabled Biomedical Bone Age Assessment and Classification Model</article-title>
<alt-title alt-title-type="left-running-head">Metaheuristic with Deep Learning Enabled Biomedical Bone Age Assessment and Classification Model</alt-title>
<alt-title alt-title-type="right-running-head">Metaheuristic with Deep Learning Enabled Biomedical Bone Age Assessment and Classification Model</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Duhayyim</surname><given-names>Mesfer Al</given-names>
</name><xref ref-type="aff" rid="aff-1">1</xref><email>m.alduhayyim@psau.edu.sa</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Malibari</surname><given-names>Areej A.</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>Obayya</surname><given-names>Marwa</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>Nour</surname><given-names>Mohamed K.</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>Salama</surname><given-names>Ahmed S.</given-names>
</name><xref ref-type="aff" rid="aff-5">5</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Eldesouki</surname><given-names>Mohamed I.</given-names>
</name><xref ref-type="aff" rid="aff-6">6</xref></contrib>
<contrib id="author-7" contrib-type="author">
<name name-style="western"><surname>Zamani</surname><given-names>Abu Sarwar</given-names>
</name><xref ref-type="aff" rid="aff-7">7</xref></contrib>
<contrib id="author-8" contrib-type="author">
<name name-style="western"><surname>Rizwanullah</surname><given-names>Mohammed</given-names>
</name><xref ref-type="aff" rid="aff-7">7</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Science, College of Sciences and Humanities-Aflaj, Prince Sattam bin Abdulaziz University</institution>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Industrial and Systems Engineering, College of Engineering, Princess Nourah bint Abdulrahman University, P.O. Box 84428</institution>, <addr-line>Riyadh, 11671</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Biomedical Engineering, College of Engineering, Princess Nourah bint Abdulrahman University, P.O. Box 84428</institution>, <addr-line>Riyadh, 11671</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Computer Sciences, College of Computing and Information System, Umm Al-Qura University</institution>, <country>Saudi Arabia</country></aff>
<aff id="aff-5"><label>5</label><institution>Department of Electrical Engineering, Faculty of Engineering &#x0026; Technology, Future University in Egypt</institution>, <addr-line>New Cairo, 11845</addr-line>, <country>Egypt</country></aff>
<aff id="aff-6"><label>6</label><institution>Department of Information System, College of Computer Engineering and Sciences, Prince Sattam bin Abdulaziz University</institution>, <addr-line>AlKharj</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-7"><label>7</label><institution>Department of Computer and Self Development, Preparatory Year Deanship, Prince Sattam bin Abdulaziz University</institution>, <addr-line>AlKharj</addr-line>, <country>Saudi Arabia</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Mesfer Al Duhayyim. Email: <email>m.alduhayyim@psau.edu.sa</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-07-25"><day>25</day>
<month>07</month>
<year>2022</year></pub-date>
<volume>73</volume>
<issue>3</issue>
<fpage>5473</fpage>
<lpage>5489</lpage>
<history>
<date date-type="received">
<day>02</day>
<month>5</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>06</day>
<month>6</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Duhayyim et al.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Duhayyim et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_31976.pdf"></self-uri>
<abstract>
<p>The skeletal bone age assessment (BAA) was extremely implemented in development prediction and auxiliary analysis of medicinal issues. X-ray images of hands were detected from the estimation of bone age, whereas the ossification centers of epiphysis and carpal bones are important regions. The typical skeletal BAA approaches remove these regions for predicting the bone age, however, few of them attain suitable efficacy or accuracy. Automatic BAA techniques with deep learning (DL) methods are reached the leading efficiency on manual and typical approaches. Therefore, this study introduces an intellectual skeletal bone age assessment and classification with the use of metaheuristic with deep learning (ISBAAC-MDL) model. The presented ISBAAC-MDL technique majorly focuses on the identification of bone age prediction and classification process. To attain this, the presented ISBAAC-MDL model derives a mask Region-related Convolutional Neural Network (Mask-RCNN) with MobileNet as baseline model to extract features. Followed by, the whale optimization algorithm (WOA) is implemented for hyperparameter tuning of the MobileNet method. At last, Deep Feed-Forward Module (DFFM) based age prediction and Radial Basis Function Neural Network (RBFNN) based stage classification approach is utilized. The experimental evaluation of the ISBAAC-MDL model is tested using benchmark dataset and the outcomes are assessed over distinct factors. The experimental outcomes reported the better performances of the ISBAAC-MDL model over recent approaches with maximum accuracy of 0.9920.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Biomedical images</kwd>
<kwd>bone age assessment</kwd>
<kwd>age prediction</kwd>
<kwd>computer vision</kwd>
<kwd>deep learning</kwd>
<kwd>image classification</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>The progression in healthcare technologies presents highly effective e-health care structures to the healthcare sector benefitting the medical specialists for good medications for patients. E-health care structures has been helpful in numerous medicinal fields [<xref ref-type="bibr" rid="ref-1">1</xref>]. But many computer visualization related biomedical imaging applications obtained high significance due to such applications offering detectable info to the radiotherapists for superior medication. Skeletal bone age assessment (BAA) is an algorithm which can be utilized for therapeutic inquiry and analytic of endocrinology difficulties like children&#x2019;s growth and genetic disorders, in the domain of pediatric radiology [<xref ref-type="bibr" rid="ref-2">2</xref>]. The BAA methodology is usually accomplished by radiological scrutiny of the left hand, because the peculiar character of bone ossification levels of the non-dominant hand, and after which comparison done with chronological ages. In reality, the radiotherapists usually adjust the bone age through witnessing the X-ray pictures of the non-dominant hand of subject [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-4">4</xref>]. They get more interest in the adulthood extent of the wrist bones, metacarpal bones, and the lowest termination of the ulna for predicting skeletal bone age which has been extensively termed as the regions of interest (RoIs) in BAA methods. Even though labor-intensive methodologies were widely implied in medical training, these old methodologies mostly depend on the radiologist&#x2019;s experience, that leads to the truth that the proficiency could not be ensured and the analysis outcome differs every time among distinct radiotherapists [<xref ref-type="bibr" rid="ref-5">5</xref>].</p>
<p>Many image processing systems were utilized for BAA [<xref ref-type="bibr" rid="ref-6">6</xref>]. Separation is the first and foremost stage in image processing application areas which abstract the ROIs from diverse image modes namely MRI, X-rays, and CT scans [<xref ref-type="bibr" rid="ref-7">7</xref>]. Segmentation of ROIs is regarded as significant job for BAA. X-ray and MRI has different characteristics which have been employed for BAA which adds structure tensor eigenvalues, local histograms, and image textures [<xref ref-type="bibr" rid="ref-8">8</xref>]. Deep learning (DL) has grabbed more interest in medical imaging difficulties. Lately, encouraged by the triumph of deep convolutional neural network system (DCNN) in image categorization [<xref ref-type="bibr" rid="ref-9">9</xref>], research works in medical imaging were exploring these approaches. DL-related methodologies permit neglecting feature engineering through mechanically studying the order of discriminate features right from a set of drill information. DCNN was effectively used in the BAA [<xref ref-type="bibr" rid="ref-10">10</xref>]. These methodologies suggest an endwise learning architectures to guesstimate bone age by employing DCNN.</p>
<p>In [<xref ref-type="bibr" rid="ref-11">11</xref>], the researchers presented a DL based technique to BAA with integration of Tanner-Whitehouse (TW3) approaches and deep convolutional network system dependent upon extracting regions of interest (ROI) recognition and classifier employing Faster-RCNN and Inception-v4 network correspondingly. The presented approach permits the investigation of expert data in the TW3 and feature engineering in deep convolutional network for enhancing the accuracy of BAA. Son&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-12">12</xref>] presented a whole end-to-end BAA technique for automating the total procedure of TW3 approach, beginning from localization of epiphysis metaphysis development areas in 13 distinct bones and finishing with estimate of equivalent BA. The particular alterations to CNNs and other phases were presented for improving outcomes. Also, the annotated databases of 3300 X-ray images was constructed for training and evaluating the method.</p>
<p>Tong&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-13">13</xref>] progress a deep automated skeletal BAA method dependent upon CNNs and support vector regression (SVR) utilizing multiple kernel learning (MKL) technique for processing heterogeneous structures. In [<xref ref-type="bibr" rid="ref-14">14</xref>], the authors assumed that important region and present a novel deep automated skeletal BAA technique using region-related CNN (R-CNN). The Faster R-CNN (Faster R-CNN) technique was executed in object detection for bone age regression to identify the ossification centers of epiphysis and carpal bone and estimate bone age. The presented technique overcomes the restriction of other CNN related techniques, obtaining large-scale original X-ray images as input. In [<xref ref-type="bibr" rid="ref-15">15</xref>&#x2013;<xref ref-type="bibr" rid="ref-19">19</xref>], the authors presented a novel DL based techniques for improving the BAA trained from both training and pre-training structures. In the pre training structure, it can be presented a structure utilizing a novel distance metric of cosine distance from the structure of optimum carrying for data augmentation (CNN-GAN-OTD). During the training structure, it can be discovered the procedure of bone age and gender label data, semi-supervised and supervised training.</p>
<p>This article introduces an intellectual skeletal bone age assessment and classification with the help of metaheuristic with deep learning (ISBAAC-MDL) approach. The presented ISBAAC-MDL technique derives a mask Region-related Convolutional Neural Network (Mask-RCNN) with MobileNet as baseline model to extract features. Followed by, the whale optimization algorithm (WOA) was implemented for hyperparameter tuning of the MobileNet model. At last, Deep Feed-Forward Module (DFFM) based age prediction and Radial Basis Function Neural Network (RBFNN) based stage classification technique is utilized. The experimental evaluation of the ISBAAC-MDL model is tested using benchmark dataset and the outcomes are assessed over distinct prospects.</p>
<p>The rest of the paper is organized as follows. Section 2 offers the proposed model and the Section 3 provides the experimental validation. Lastly, Section 4 concludes the work.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>The Proposed BAA Model</title>
<p>In this article, a novel ISBAAC-MDL method was enhanced for the effective bone age prediction and classification process. Initially, the Mask-RCNN with MobileNet as baseline model is utilized to extract features. Then, the WOA was implemented for hyperparameter tuning of the MobileNet technique. Next, the DFFM based age prediction and RBFNN based stage classification model is utilized.</p>
<sec id="s2_1">
<label>2.1</label>
<title>Module I: Feature Extraction Process</title>
<p>Primarily, the Mask-RCNN with MobileNet as baseline model is utilized to extract features. In the Mask R-CNN is an effectual DL framework that combines the semantic segmentation and object detection procedure. It mostly contains 2 levels of functions such as generating region proposals and categorizing every generated proposal [<xref ref-type="bibr" rid="ref-20">20</xref>]. An input X-ray image was primarily got into a convolutional networks termed a backbone networks and its influence obtain varies dependent upon the needed trade-off amongst the efficiency, trained speed, and restricted due to the computation power. During the Mask R-CNN method, the MobileNet structure was utilized as the baseline method. MobileNet is a CNN based methodology that can be extensively used for the classification mechanism. The great benefits of the use of MobileNet model are that they need lower computation power compared to the standard CNN technique, making them fit to operate with mobile gadgets and the computer that operates with less computation capability. The MobileNet was considered as a fundamental architecture that incorporates convolution layers that are applied in discriminating the information on the basis of two controllable characteristics that switches among the parameter&#x2019;s latency and accuracy. The MobileNet architecture is benefited in minimizing the size of the network [<xref ref-type="bibr" rid="ref-21">21</xref>]. MobileNet architecture is effective correspondingly with an insignificant quantity of features, namely Palmprint Detection. The difficulty of <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> is termed as a pointwise difficulty Platforms to make in-depth were designed to have points via an average, ReLU, and abstract layer with in-depth structure. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> depicts the process of Mask RCNN technique.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Process of Mask RCNN Model</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31976-fig-1.png"/>
</fig>
<p>Where filter is of size is represented as <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and vector feature mapping of size is indicated by <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, the output variable is called <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>q</mml:mi></mml:math></inline-formula>, and the input variable is characterized by <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>p</mml:mi></mml:math></inline-formula>. For the abstraction layer, the computation effort is considered a variable <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and it is evaluated as follows:</p>
<p><disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>The value of resolution multipliers known as <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> is deliberated to be one. The values of multiplier <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>&#x03C9;</mml:mi></mml:math></inline-formula> lie within the range of [1, <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>n</mml:mi></mml:math></inline-formula>]. The variable <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is evaluated as follows:</p>
<p><disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>The proposed methodology combines the pointwise and depthwise convolution are constrained by the reduction variable represented as <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>d</mml:mi></mml:math></inline-formula> parameter and it is evaluated as follows:</p>
<p><disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:mo>.</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>The two hyper features, such as the resolution and width multipliers help to modify the optimal size window for predicting accurately. The third values recommend that it has three input networks. The given architecture comprises the filter size is <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>32</mml:mn></mml:math></inline-formula>, and thirty-two filters.</p>
<p>The principle under the MobileNet framework replaces complex convolutional layer in which every single layer involves a convolutional layers of size <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula> that buffers the input dataset, along with a convolution layer of size <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> pointwise which combines the filtered variable for constructing a novel element. The abovementioned concept illustrates the technique and makes them faster when compared to the standard convolutional process. The residual and downsizing layers encompass three sub-layers.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Module II: Hyperparameter Optimization</title>
<p>At this stage, the WOA was implemented for hyperparameter tuning [<xref ref-type="bibr" rid="ref-22">22</xref>&#x2013;<xref ref-type="bibr" rid="ref-24">24</xref>] of the MobileNet system. The WOA has been executed. Firstly, an initialization process takes place. In the neighboring prey method, the humpback whales are distinguished that the position of prey and surrounded them [<xref ref-type="bibr" rid="ref-25">25</xref>]. For uncertain locations in the searching region, the present optimal outcome was considered by prey. When tan optimal search agent was defined, another searching space revives the criteria in the optimal searching region.</p>
<p><disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:mover><mml:mrow><mml:mtext>U</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mi>S</mml:mi><mml:mo>.</mml:mo><mml:msup><mml:mrow><mml:mover><mml:mi>K</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>K</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="ueqn-15"><mml:math id="mml-ueqn-15" display="block"><mml:mrow><mml:mover><mml:mrow><mml:mtext>K</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>.</mml:mo><mml:msup><mml:mrow><mml:mover><mml:mi>K</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>best</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mrow><mml:mtext>Y</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mover><mml:mrow><mml:mtext>U</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>, <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mrow><mml:mtext>S</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mn>2.</mml:mn><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mrow><mml:mtext>Y</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mn>2.</mml:mn><mml:mrow><mml:mtext>I</mml:mtext></mml:mrow><mml:mo>.</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext>I</mml:mtext></mml:mrow></mml:math></inline-formula>. A newly accomplished outcome for optimal fitness is associated with the highlight that composes certain variable dependence. It couldn&#x2019;t need to define the major set of variables and step size to ideal solution.</p>
<p>According to the fitness value of the abovementioned iterations, the &#x201C;<inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>y</mml:mi></mml:math></inline-formula>&#x201D; coefficient vector is achieved by getting the possible probability operation as:</p>
<p><disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x21D2;</mml:mo><mml:mrow><mml:mi mathvariant="italic">P</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">b</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">b</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">y</mml:mi></mml:mrow><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:msub><mml:mrow><mml:mtext>C</mml:mtext></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mtext>f</mml:mtext></mml:mrow><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mtext>f</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mtext>f</mml:mtext></mml:mrow><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mtext>F</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>avg</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mrow><mml:mtext>f</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:msub><mml:mrow><mml:mtext>F</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>avg</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mtext>C</mml:mtext></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mrow><mml:mtext>f</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mrow><mml:mtext>f</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>avg</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>, <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msub><mml:mrow><mml:mtext>f</mml:mtext></mml:mrow><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msub><mml:mrow><mml:mtext>f</mml:mtext></mml:mrow><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> indicates the least and highest value of fitness function, however, <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msub><mml:mrow><mml:mtext>C</mml:mtext></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msub><mml:mrow><mml:mtext>C</mml:mtext></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> range within [0,1]. The position of ideal solution was transformed vigorously by fitness function. Next, for defining the bubble-net nature of humpback whales, 2 improved methodologies are applied. The bubble-net procedure takes place using exploitation along with exploration stages.</p>
<p>The spiral process was implemented among the location of whale and prey to imitate the helix-framed growth of humpback whale that is represented by following equation:</p>
<p><disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:mover><mml:mrow><mml:mtext>K</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mtext>e</mml:mtext></mml:mrow><mml:mrow><mml:mi>b</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo>.</mml:mo><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mo>.</mml:mo><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo><mml:msup><mml:mrow><mml:mover><mml:mrow><mml:mtext>U</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mover><mml:mi>K</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>It has been noted that the humpback whale swims through the prey in the contracting circle and winding molded methodology.</p>
<p>In order to illustrate the synchronous efficacy, the probability of fifty percentage has forecasted for choosing the constricting spiral and enclosed system for refreshing the whale condition. It can be mathematically formulated in the subsequent equation:</p>
<p><disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:mover><mml:mrow><mml:mtext>K</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><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:mrow><mml:mover><mml:mi>K</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>y</mml:mi><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mrow><mml:mover><mml:mi>U</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mtd><mml:mtd><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mover><mml:mrow><mml:mtext>U</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>.</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msup><mml:mo>.</mml:mo><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:mtext>K</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>0.5</mml:mn><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>In which <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:math></inline-formula>uninformed distributed number ranges from [&#x2212;1 to 1], demonstrate the synchronous efficacy specifically acceptable that there are possibilities of half for gathering between composed the contracting adjacent procedure and twisted procedure for refreshing the whale condition from center of optimization. The administrator&#x2019;s request has motivated by purposelessly selected searching agent beforehand a most favorable searching agent is found in the following equation:</p>
<p><disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:mover><mml:mrow><mml:mtext>U</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:mtext>S</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>.</mml:mo><mml:msub><mml:mover><mml:mrow><mml:mtext>K</mml:mtext></mml:mrow><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:mtext>K</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><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:mrow><mml:mtext>K</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mrow><mml:mtext>K</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mtext>rand</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:mtext>Y</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>.</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:mtext>U</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>Therefore, the uninformed distributed random number was applied essentially on 1 or under <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> to make searching experts move reserved in orientation whale. Next, in the exploitation stage, the position of searching agent has revitalized in the exploration process as declared by using subjectively-chosen searching agent beforehand an optimal searching agent demonstrating the point. This approach <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mover><mml:mrow><mml:mtext>Y</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mo>&#x003E;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> highlights the exploration and considers the WOA technique for proceeding a global best searching and <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mover><mml:mrow><mml:mtext>Y</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mo>&#x003E;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> for motivating the position of searching operator. This procedure is repeated until the greatest quantity of iterations gets accomplished. A novel set of solutions are authenticated and trailed according to the upgraded method.</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Module III: DFFM Based Age Prediction</title>
<p>In this study, the DFFM model receives the features and performs effective age prediction process [<xref ref-type="bibr" rid="ref-26">26</xref>]. In fully connected (FC) model, the neuron receives certain input, implements dot products, and utilizes non-linear functions namely ReLU, Tanh, Parametric ReLU, Sigmoid, Leaky ReLU, etc., allowing a model to create complex mapping among input and output of the networks. This is significant for datasets with higher dimensionality. All the neurons make use of a non-linear activation and the final layer makes use of softmax layer. During forward pass, a series of processes which convert input to output is implemented. Activation function is utilized for presenting nonlinear into the network and learning complex functions. The backward pass is utilized when a wrong output is obtained. In backpropagation, error gradient concerns neuron weight and bias are evaluated. Cross-entropy or <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>log</mml:mi></mml:math></inline-formula> loss could evaluate the outcome of the classifier method with outputs among zero and one. The loss function might be a distinct mathematical expression. When <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>R</mml:mi></mml:math></inline-formula> indicates the input to the FC layer, <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mi>R</mml:mi></mml:math></inline-formula> represents the <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>i</mml:mi></mml:math></inline-formula> outputs from the FC layer. Thus, <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mi>R</mml:mi></mml:math></inline-formula> is calculated by:</p>
<p><disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</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:mn>1</mml:mn></mml:mrow></mml:msub><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>w</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><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>w</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>&#x03C3;</mml:mi></mml:math></inline-formula> non-linear function is a rectifier to resolve gradient vanishing problems:</p>
<p><disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>DFFM could be trained fast when compared to SRBMM. Thus, a deep network having twelve hidden layer is utilized. We utilize BN with batch size of 10000 rather than a dropout method for getting accurate outcomes and the gradient of complete data would have a stable estimation. The batch size changes the learning speed and doesn&#x2019;t affect the quality of learning. Also, In order to prevent this algorithm from memorizing the attack, earlier stopping is utilized. We employ the 0.01 value as the learning rate; selecting a small value might result in long training time and high value makes the training not stable. Adam optimization algorithm was regarded as an extension of stochastic gradient descent utilized to update the network weight, this model is very efficient when compared to RMSProp or AdaGrad. Cross entropy is utilized in multiple class scenarios. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> illustrates the framework of DFFM.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Structure of DFFM</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31976-fig-2.png"/>
</fig>
</sec>
<sec id="s2_4">
<label>2.4</label>
<title>Module IV: RBFNN Based Stage Classification</title>
<p>At the same time, the RBFNN model is utilized for effective stage classification process. The RBFNN [<xref ref-type="bibr" rid="ref-27">27</xref>] is a multiple layer forward network that can able to approximate non-linear operation and avoid plunging into local minimal. Typically, the RBFNN comprises input and hidden layers with a linear output layer, and nonlinear RBF activation function. The input of RBFNN is a traffic vector dataset that is modeled by:</p>
<p><disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><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>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref>, <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> indicates preceding dataset and <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>g</mml:mi></mml:math></inline-formula> characterize the amount of input layers. The output of RBFNN is a scalar function of input vector that is given by:</p>
<p><disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mi>Y</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>c</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>In <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref> <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mi>M</mml:mi></mml:math></inline-formula> indicates the amount of layers in the hidden neuron; <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> denotes the radial basis function; <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the center vector for <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mi>i</mml:mi></mml:math></inline-formula> neuron; <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represent the neuron weight <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi>i</mml:mi></mml:math></inline-formula> in the linear output neurons. In the structure of RBFNN, each input is interconnected to hidden neuron. Typically, the norm is considered as Euclidean distance, and the RBF is usually considered as the Gaussian that is formulated by</p>
<p><disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-14">Eq. (14)</xref>, <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> indicates the standardized constant of <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><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> hidden unit that indicates the width of RBF nearby the center vector.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Results and Discussion</title>
<p>The performance validation of the ISBAAC-MDL technique is tested with existing models under distinct sizes of training size (TS) data and cross-validation (CV). A few sample images are illustrated in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, <xref ref-type="table" rid="table-1">Tab. 1</xref> and <xref ref-type="fig" rid="fig-4">Fig. 4</xref> provide detailed maturity stage classification outcomes of the ISBAAC-MDL model with recent models under varying sizes of TS. The results indicated that the ISBAAC-MDL model has obtained effectual outcomes with maximum classification results under all TSs. For instance, with TS &#x003D; 40%, the ISBAAC-MDL model has accomplished higher <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9843 whereas the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM models have obtained lower <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9789, 0.9778, 0.9833, and 0.9817 respectively. Also, with TS &#x003D; 50%, the ISBAAC-MDL method has established higher <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9962 whereas the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM algorithms have gained lower <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9768, 0.9822, 0.9805, and 0.9831 correspondingly. Besides, with TS &#x003D; 60%, the ISBAAC-MDL algorithm has accomplished higher <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9687 whereas the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM systems have attained lower <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9596, 0.9574, 0.9545, and 0.9563 correspondingly. Eventually , with TS &#x003D; 70%, the ISBAAC-MDL model has presented higher <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9994 whereas the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM models have attained lower <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9913, 0.9940, 0.9863, and 0.9811 correspondingly. At last, with TS &#x003D; 80%, the ISBAAC-MDL model has accomplished higher <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9870 while the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM models have reached lower <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9834, 0.9723, 0.9721, and 0.9739 correspondingly.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Sample bone images</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31976-fig-3.png"/>
</fig>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Maturity stage classification results of ISBAAC-MDL model with existing models under distinct TS</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Training size (%)</th>
<th>ISBAAC-MDL</th>
<th>DL-BAAC</th>
<th>CNN-WELM</th>
<th>CNN-KELM</th>
<th>CNN-ELM</th>
</tr>
</thead>
<tbody>
<tr>
<td align="center" colspan="6">Sensitivity</td>
</tr>
<tr>
<td>TS &#x003D; 40</td>
<td>0.9843</td>
<td>0.9789</td>
<td>0.9778</td>
<td>0.9833</td>
<td>0.9817</td>
</tr>
<tr>
<td>TS &#x003D; 50</td>
<td>0.9962</td>
<td>0.9768</td>
<td>0.9822</td>
<td>0.9805</td>
<td>0.9831</td>
</tr>
<tr>
<td>TS &#x003D; 60</td>
<td>0.9687</td>
<td>0.9596</td>
<td>0.9574</td>
<td>0.9545</td>
<td>0.9563</td>
</tr>
<tr>
<td>TS &#x003D; 70</td>
<td>0.9994</td>
<td>0.9913</td>
<td>0.9940</td>
<td>0.9863</td>
<td>0.9811</td>
</tr>
<tr>
<td>TS &#x003D; 80</td>
<td>0.9870</td>
<td>0.9834</td>
<td>0.9723</td>
<td>0.9721</td>
<td>0.9739</td>
</tr>
<tr>
<td>Average</td>
<td>0.9871</td>
<td>0.9780</td>
<td>0.9767</td>
<td>0.9753</td>
<td>0.9752</td>
</tr>
<tr>
<td align="center" colspan="6">Specificity</td>
</tr>
<tr>
<td>TS &#x003D; 40</td>
<td>0.9703</td>
<td>0.9697</td>
<td>0.9641</td>
<td>0.9607</td>
<td>0.9629</td>
</tr>
<tr>
<td>TS &#x003D; 50</td>
<td>0.9921</td>
<td>0.9841</td>
<td>0.9769</td>
<td>0.9758</td>
<td>0.9678</td>
</tr>
<tr>
<td>TS &#x003D; 60</td>
<td>0.9913</td>
<td>0.9754</td>
<td>0.9764</td>
<td>0.9664</td>
<td>0.9746</td>
</tr>
<tr>
<td>TS &#x003D; 70</td>
<td>0.9984</td>
<td>0.9752</td>
<td>0.9742</td>
<td>0.9834</td>
<td>0.971</td>
</tr>
<tr>
<td>TS &#x003D; 80</td>
<td>0.9688</td>
<td>0.9572</td>
<td>0.9583</td>
<td>0.9503</td>
<td>0.9581</td>
</tr>
<tr>
<td>Average</td>
<td>0.9842</td>
<td>0.9723</td>
<td>0.9700</td>
<td>0.9673</td>
<td>0.9669</td>
</tr>
<tr>
<td align="center" colspan="6">Accuracy</td>
</tr>
<tr>
<td>TS &#x003D; 40</td>
<td>0.9944</td>
<td>0.9859</td>
<td>0.9728</td>
<td>0.9754</td>
<td>0.9725</td>
</tr>
<tr>
<td>TS &#x003D; 50</td>
<td>0.9907</td>
<td>0.9884</td>
<td>0.9884</td>
<td>0.9885</td>
<td>0.9895</td>
</tr>
<tr>
<td>TS &#x003D; 60</td>
<td>0.9925</td>
<td>0.9841</td>
<td>0.9871</td>
<td>0.9831</td>
<td>0.9834</td>
</tr>
<tr>
<td>TS &#x003D; 70</td>
<td>0.9938</td>
<td>0.9711</td>
<td>0.9739</td>
<td>0.9628</td>
<td>0.9684</td>
</tr>
<tr>
<td>TS &#x003D; 80</td>
<td>0.9830</td>
<td>0.9707</td>
<td>0.9756</td>
<td>0.9808</td>
<td>0.9727</td>
</tr>
<tr>
<td>Average</td>
<td>0.9909</td>
<td>0.9800</td>
<td>0.9796</td>
<td>0.9781</td>
<td>0.9773</td>
</tr>
<tr>
<td align="center" colspan="6">F-score</td>
</tr>
<tr>
<td>TS &#x003D; 40</td>
<td>0.9934</td>
<td>0.9833</td>
<td>0.9792</td>
<td>0.9826</td>
<td>0.9713</td>
</tr>
<tr>
<td>TS &#x003D; 50</td>
<td>0.9900</td>
<td>0.9889</td>
<td>0.9780</td>
<td>0.9789</td>
<td>0.9825</td>
</tr>
<tr>
<td>TS &#x003D; 60</td>
<td>0.9972</td>
<td>0.9868</td>
<td>0.9788</td>
<td>0.9854</td>
<td>0.9877</td>
</tr>
<tr>
<td>TS &#x003D; 70</td>
<td>0.9800</td>
<td>0.9621</td>
<td>0.9736</td>
<td>0.9595</td>
<td>0.9644</td>
</tr>
<tr>
<td>TS &#x003D; 80</td>
<td>0.9939</td>
<td>0.9721</td>
<td>0.9817</td>
<td>0.9704</td>
<td>0.9672</td>
</tr>
<tr>
<td>Average</td>
<td>0.9909</td>
<td>0.9786</td>
<td>0.9783</td>
<td>0.9754</td>
<td>0.9746</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Result analysis of ISBAAC-MDL technique under distinct TS (a) <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, (b) <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mi>S</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, (c) <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><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>, and (d) <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31976-fig-4.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> reports an average classifier outcome of the ISBAAC-MDL model with recent models. The figure inferred the enhanced performance of the ISBAAC-MDL model over other models. Concerning <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, the ISBAAC-MDL model has offered increased average <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9871 whereas the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM models have provided decreased <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9780, 0.9767, 0.9753, and 0.9752 respectively. Also, with respect to <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><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>, the ISBAAC-MDL method has provided raised average <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><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 0.9909 whereas the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM techniques have offered reduced <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 0.9800, 0.9796, 0.9781, and 0.9773 correspondingly. Eventually, with respect to <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, the ISBAAC-MDL algorithm has rendered increased average <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9909 while the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM models have offered reduced <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9786, 0.9783, 0.9754, and 0.9746 correspondingly.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Average analysis of ISBAAC-MDL technique under distinct TS (a) <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, (b) <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi>S</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, (c) <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>, and (d) <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31976-fig-5.png"/>
</fig>
<p><xref ref-type="table" rid="table-2">Tab. 2</xref> and <xref ref-type="fig" rid="fig-6">Fig. 6</xref> present detailed maturity stage classification results of the ISBAAC-MDL model with current methods under varying sizes of CV. The outcomes indicated that the ISBAAC-MDL model has gained effectual outcomes with maximum classification results under all CVs. For example, with CV &#x003D; 6, the ISBAAC-MDL model has accomplished higher <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9993 whereas the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM models have gained lower <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9849, 0.9931, 0.9864, and 0.9916 correspondingly. Additionally, with CV &#x003D; 7, the ISBAAC-MDL model has established higher <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9966 whereas the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM models have obtained lower <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9901, 0.9874, 0.9767, and 0.9735 respectively. Also, with CV &#x003D; 8, the ISBAAC-MDL algorithm has established higher <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9983 whereas the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM models have reached lower <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9681, 0.9633, 0.9653, and 0.9564 correspondingly. Meanwhile, with CV &#x003D; 9, the ISBAAC-MDL technique has accomplished higher <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9931 whereas the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM techniques have gained lower <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9828, 0.9902, 0.9831, and 0.9860 correspondingly. Finally, with CV &#x003D; 10, the ISBAAC-MDL model has established higher <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9925 whereas the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM methodologies have obtained lower <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9879, 0.9789, 0.9815, and 0.9798 correspondingly.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Maturity Stage Classification results of ISBAAC-MDL model with existing models under distinct CV</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>No. of cross validation</th>
<th>ISBAAC-MDL</th>
<th>DL-BAAC</th>
<th>CNN-WELM</th>
<th>CNN-KELM</th>
<th>CNN-ELM</th>
</tr>
</thead>
<tbody>
<tr>
<td align="center" colspan="6">Sensitivity (%)</td>
</tr>
<tr>
<td>CV &#x003D; 6</td>
<td>0.9993</td>
<td>0.9849</td>
<td>0.9931</td>
<td>0.9864</td>
<td>0.9916</td>
</tr>
<tr>
<td>CV &#x003D; 7</td>
<td>0.9966</td>
<td>0.9901</td>
<td>0.9874</td>
<td>0.9767</td>
<td>0.9735</td>
</tr>
<tr>
<td>CV &#x003D; 8</td>
<td>0.9983</td>
<td>0.9681</td>
<td>0.9633</td>
<td>0.9653</td>
<td>0.9564</td>
</tr>
<tr>
<td>CV &#x003D; 9</td>
<td>0.9931</td>
<td>0.9828</td>
<td>0.9902</td>
<td>0.9831</td>
<td>0.9860</td>
</tr>
<tr>
<td>CV &#x003D; 10</td>
<td>0.9925</td>
<td>0.9879</td>
<td>0.9789</td>
<td>0.9815</td>
<td>0.9798</td>
</tr>
<tr>
<td>Average</td>
<td>0.9960</td>
<td>0.9828</td>
<td>0.9826</td>
<td>0.9786</td>
<td>0.9775</td>
</tr>
<tr>
<td align="center" colspan="6">Specificity (%)</td>
</tr>
<tr>
<td>CV &#x003D; 6</td>
<td>0.9758</td>
<td>0.9670</td>
<td>0.9589</td>
<td>0.9644</td>
<td>0.9740</td>
</tr>
<tr>
<td>CV &#x003D; 7</td>
<td>0.9827</td>
<td>0.9792</td>
<td>0.9777</td>
<td>0.9768</td>
<td>0.9690</td>
</tr>
<tr>
<td>CV &#x003D; 8</td>
<td>0.9795</td>
<td>0.9736</td>
<td>0.9765</td>
<td>0.9760</td>
<td>0.9688</td>
</tr>
<tr>
<td>CV &#x003D; 9</td>
<td>0.9944</td>
<td>0.9770</td>
<td>0.9850</td>
<td>0.9838</td>
<td>0.9792</td>
</tr>
<tr>
<td>CV &#x003D; 10</td>
<td>0.9913</td>
<td>0.9697</td>
<td>0.9611</td>
<td>0.9558</td>
<td>0.9591</td>
</tr>
<tr>
<td>Average</td>
<td>0.9847</td>
<td>0.9733</td>
<td>0.9718</td>
<td>0.9714</td>
<td>0.9700</td>
</tr>
<tr>
<td align="center" colspan="6">Accuracy (%)</td>
</tr>
<tr>
<td>CV &#x003D; 6</td>
<td>0.9900</td>
<td>0.9841</td>
<td>0.9812</td>
<td>0.9706</td>
<td>0.9719</td>
</tr>
<tr>
<td>CV &#x003D; 7</td>
<td>0.9971</td>
<td>0.9800</td>
<td>0.9786</td>
<td>0.9923</td>
<td>0.9814</td>
</tr>
<tr>
<td>CV &#x003D; 8</td>
<td>0.9900</td>
<td>0.9832</td>
<td>0.9820</td>
<td>0.9732</td>
<td>0.9780</td>
</tr>
<tr>
<td>CV &#x003D; 9</td>
<td>0.9957</td>
<td>0.9729</td>
<td>0.9670</td>
<td>0.9625</td>
<td>0.9683</td>
</tr>
<tr>
<td>CV &#x003D; 10</td>
<td>0.9870</td>
<td>0.9786</td>
<td>0.9827</td>
<td>0.9754</td>
<td>0.9701</td>
</tr>
<tr>
<td>Average</td>
<td>0.9920</td>
<td>0.9798</td>
<td>0.9783</td>
<td>0.9748</td>
<td>0.9739</td>
</tr>
<tr>
<td align="center" colspan="6">F-score (%)</td>
</tr>
<tr>
<td>CV &#x003D; 6</td>
<td>0.9905</td>
<td>0.9804</td>
<td>0.9845</td>
<td>0.9735</td>
<td>0.9812</td>
</tr>
<tr>
<td>CV &#x003D; 7</td>
<td>0.9989</td>
<td>0.9894</td>
<td>0.9917</td>
<td>0.9903</td>
<td>0.9799</td>
</tr>
<tr>
<td>CV &#x003D; 8</td>
<td>0.9978</td>
<td>0.9832</td>
<td>0.9778</td>
<td>0.9830</td>
<td>0.9733</td>
</tr>
<tr>
<td>CV &#x003D; 9</td>
<td>0.9966</td>
<td>0.9740</td>
<td>0.9648</td>
<td>0.9627</td>
<td>0.9734</td>
</tr>
<tr>
<td>CV &#x003D; 10</td>
<td>0.9944</td>
<td>0.9825</td>
<td>0.9724</td>
<td>0.9757</td>
<td>0.9717</td>
</tr>
<tr>
<td>Average</td>
<td>0.9956</td>
<td>0.9819</td>
<td>0.9782</td>
<td>0.9770</td>
<td>0.9759</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Result analysis of ISBAAC-MDL technique under distinct CV (a) <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, (b) <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:mi>S</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, (c) <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>, and (d) <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31976-fig-6.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-7">Fig. 7</xref> reports average classifier outcomes of the ISBAAC-MDL method with recent models. The figure inferred the enhanced performance of the ISBAAC-MDL model over other models. In relation <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, the ISBAAC-MDL model has offered raised average <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9960 whereas the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM techniques have provided decreased <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9828, 0.9826, 0.9786, and 0.9775 correspondingly. Likewise, with respect to <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>, the ISBAAC-MDL model has offered increased average <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 0.9920 while the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM models have offered reduced <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><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 0.9798, 0.9783, 0.9748, and 0.9739 correspondingly. Finally, with respect to <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, the ISBAAC-MDL algorithm has rendered increased average <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9956 whereas the DL-BAAC, CNN-WELM, CNN-KELM, and CNN-ELM models have provided reduced <inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9819, 0.9782, 0.9770, and 0.9759 respectively.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Average analysis of ISBAAC-MDL technique under distinct CV (a) <inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, (b) <inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:mi>S</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, (c) <inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><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>, and (d) <inline-formula id="ieqn-95"><mml:math id="mml-ieqn-95"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31976-fig-7.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-8">Fig. 8</xref> highlights an extensive mean absolute error (MAE) inspection of the ISBAAC-MDL model on the bone age estimation process [<xref ref-type="bibr" rid="ref-28">28</xref>]. The figure shows that the CNN-ELM, BONet, Fine-Tuned GoogLeNet, Fine-Tuned OxfordNet, and CNN-GP models have obtained poor performance with MAE of 0.826, 0.859, 0.886, 0.892, and 0.806 respectively. Followed by, the CNN-KELM and CNN-TW3 approaches have reached slightly reduced MAE of 0.759 and 0.659 respectively. Though the DL-BAAC model has accomplished reasonable MAE of 0.348, the presented ISBAAC-MDL model has gained effectual outcome with minimal MAE of 0.311. Thus, the presented ISBAAC-MDL model has shown superior results over the other models.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>MAE analysis of ISBAAC-MDL technique with existing algorithms</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31976-fig-8.png"/>
</fig>
</sec>
<sec id="s4">
<label>4</label>
<title>Conclusion</title>
<p>In this article, a new ISBAAC-MDL method was advanced for the effective bone age prediction and classification process. Initially, the Mask-RCNN with MobileNet as baseline model is utilized to extract features. Then, the WOA was implemented for hyperparameter tuning of the MobileNet model. Next, the DFFM based age prediction and RBFNN based stage classification model is utilized. The experimental evaluation of the ISBAAC-MDL model is tested using benchmark dataset and the outcomes are assessed over distinct prospects. The experimental outcomes reported the better performances of the ISBAAC-MDL model over recent approaches. Thus, the ISBAAC-MDL model can be exploited for effective BAA in real time. In future, deep instance segmentation models might be involved to foster the overall efficiency of the ISBAAC-MDL model.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2022R151), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia. The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work by Grant Code: (22UQU4310373DSR17).</p>
</fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. W.</given-names> <surname>Nadeem</surname></string-name>, <string-name><given-names>H. G.</given-names> <surname>Goh</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Ali</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Hussain</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Khan</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Bone age assessment empowered with deep learning: A survey, open research challenges and future directions</article-title>,&#x201D; <source>Diagnostics</source>, vol. <volume>10</volume>, no. <issue>10</issue>, pp. <fpage>781</fpage>, <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>S.</given-names> <surname>Deshmukh</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Khaparde</surname></string-name></person-group>, &#x201C;<article-title>Faster region-convolutional neural network oriented feature learning with optimal trained recurrent neural network for bone age assessment for pediatrics</article-title>,&#x201D; <source>Biomedical Signal Processing and Control</source>, vol. <volume>71</volume>, no. <issue>12</issue>, pp. <fpage>103016</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>V. I.</given-names> <surname>Iglovikov</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Rakhlin</surname></string-name>, <string-name><given-names>A. A.</given-names> <surname>Kalinin</surname></string-name> and <string-name><given-names>A. A.</given-names> <surname>Shvets</surname></string-name></person-group>, &#x201C;<article-title>Paediatric bone age assessment using deep convolutional neural networks</article-title>,&#x201D; in <conf-name>Int. Workshop on Deep Learning in Medical Image Analysis, Int. Workshop on Multimodal Learning for Clinical Decision Support, DLMIA 2018, ML-CDS 2018: Deep Learning in Medical Image Analysis and Multimodal Learning for Clinical Decision Support</conf-name>, <publisher-name>Lecture Notes in Computer Science book series, Springer</publisher-name>, <publisher-loc>Cham</publisher-loc>, vol. <volume>11045</volume>, pp. <fpage>300</fpage>&#x2013;<lpage>308</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. H.</given-names> <surname>Lee</surname></string-name> and <string-name><given-names>K. G.</given-names> <surname>Kim</surname></string-name></person-group>, &#x201C;<article-title>Applying deep learning in medical images: The case of bone age estimation</article-title>,&#x201D; <source>Healthcare Informatics Research</source>, vol. <volume>24</volume>, no. <issue>1</issue>, pp. <fpage>86</fpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Shen</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Zeng</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Hu</surname></string-name></person-group>, &#x201C;<article-title>Bone age assessment using convolutional neural networks</article-title>,&#x201D; in <conf-name>2018 Int. Conf. on Artificial Intelligence and Big Data (ICAIBD)</conf-name>, <publisher-loc>Chengdu, China</publisher-loc>, pp. <fpage>175</fpage>&#x2013;<lpage>178</lpage>, <year>2018</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>S.</given-names> <surname>Deshmukh</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Khaparde</surname></string-name></person-group>, &#x201C;<article-title>Multi-objective segmentation approach for bone age assessment using parameter tuning-based U-net architecture</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>81</volume>, no. <issue>5</issue>, pp. <fpage>6755</fpage>&#x2013;<lpage>6800</lpage>, <year>2022</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>C.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Han</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Jia</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Fan</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Gou</surname></string-name></person-group>, &#x201C;<article-title>Versatile framework for medical image processing and analysis with application to automatic bone age assessment</article-title>,&#x201D; <source>Journal of Electrical and Computer Engineering</source>, vol. <volume>2018</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Mao</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Lu</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Mao</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Dai</surname></string-name></person-group>, &#x201C;<article-title>Bone age assessment method based on fine-grained image classification using multiple regions of interest</article-title>,&#x201D; <source>Systems Science &#x0026; Control Engineering</source>, vol. <volume>10</volume>, no. <issue>1</issue>, pp. <fpage>15</fpage>&#x2013;<lpage>23</lpage>, <year>2022</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>S.</given-names> <surname>Mutasa</surname></string-name>, <string-name><given-names>P. D.</given-names> <surname>Chang</surname></string-name>, <string-name><given-names>C. R.</given-names> <surname>Shapiro</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Ayyala</surname></string-name></person-group>, &#x201C;<article-title>MABAL: A novel deep-learning architecture for machine-assisted bone age labeling</article-title>,&#x201D; <source>Journal of Digital Imaging</source>, vol. <volume>31</volume>, no. <issue>4</issue>, pp. <fpage>513</fpage>&#x2013;<lpage>519</lpage>, <year>2018</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>B. D.</given-names> <surname>Lee</surname></string-name> and <string-name><given-names>M. S.</given-names> <surname>Lee</surname></string-name></person-group>, &#x201C;<article-title>Automated bone age assessment using artificial intelligence: The future of bone age assessment</article-title>,&#x201D; <source>Korean Journal of Radiology</source>, vol. <volume>22</volume>, no. <issue>5</issue>, pp. <fpage>792</fpage>, <year>2021</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>T. D.</given-names> <surname>Bui</surname></string-name>, <string-name><given-names>J. J.</given-names> <surname>Lee</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Shin</surname></string-name></person-group>, &#x201C;<article-title>Incorporated region detection and classification using deep convolutional networks for bone age assessment</article-title>,&#x201D; <source>Artificial Intelligence in Medicine</source>, vol. <volume>97</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>8</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. J.</given-names> <surname>Son</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Song</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Kim</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Do</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Kwak</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>TW3-based fully automated bone age assessment system using deep neural networks</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>33346</fpage>&#x2013;<lpage>33358</lpage>, <year>2019</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>C.</given-names> <surname>Tong</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Liang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Zheng</surname></string-name></person-group>, &#x201C;<article-title>A deep automated skeletal bone age assessment model with heterogeneous features learning</article-title>,&#x201D; <source>Journal of Medical Systems</source>, vol. <volume>42</volume>, no. <issue>12</issue>, pp. <fpage>249</fpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Liang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhai</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Tong</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Li</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A deep automated skeletal bone age assessment model via region-based convolutional neural network</article-title>,&#x201D; <source>Future Generation Computer Systems</source>, vol. <volume>98</volume>, no. <issue>3</issue>, pp. <fpage>54</fpage>&#x2013;<lpage>59</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Su</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Fu</surname></string-name> and <string-name><given-names>Q.</given-names> <surname>Hu</surname></string-name></person-group>, &#x201C;<article-title>Generative adversarial network based data augmentation and gender-last training strategy with application to bone age assessment</article-title>,&#x201D; <source>Computer Methods and Programs in Biomedicine</source>, vol. <volume>212</volume>, no. <issue>5</issue>, pp. <fpage>106456</fpage>, <year>2021</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>A. S.</given-names> <surname>Almasoud</surname></string-name>, <string-name><given-names>S. B. H.</given-names> <surname>Hassine</surname></string-name>, <string-name><given-names>F. N. A.</given-names> <surname>Wesabi</surname></string-name>, <string-name><given-names>M. K.</given-names> <surname>Nour</surname></string-name>, <string-name><given-names>A. M.</given-names> <surname>Hilal</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Automated multi-document biomedical text summarization using deep learning model</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>71</volume>, no. <issue>3</issue>, pp. <fpage>5799</fpage>&#x2013;<lpage>5815</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Poonia</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Gupta</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Abunadi</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Albraikan</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Al-Wesabi</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Intelligent diagnostic prediction and classification models for detection of kidney disease</article-title>,&#x201D; <source>Healthcare</source>, vol. <volume>10</volume>, no. <issue>2</issue>, pp. <fpage>371</fpage>, <year>2022</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>A. A.</given-names> <surname>Malibari</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Alshahrani</surname></string-name>, <string-name><given-names>F. N.</given-names> <surname>Al-Wesabi</surname></string-name>, <string-name><given-names>S. B.</given-names> <surname>Haj Hassine</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Alkhonaini</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Artificial intelligence based prostate cancer classification model using biomedical images</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>72</volume>, no. <issue>2</issue>, pp. <fpage>3799</fpage>&#x2013;<lpage>3813</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. A.</given-names> <surname>Malibari</surname></string-name>, <string-name><given-names>F. N.</given-names> <surname>Al-Wesabi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Obayya</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Alkhonaini</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Hamza</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Arithmetic optimization with Retinanet model for motor imagery classification on brain computer interface</article-title>,&#x201D; <source>Journal of Healthcare Engineering</source>, vol. <volume>2022</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>11</lpage>, <year>2022</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>T.</given-names> <surname>Palaniswamy</surname></string-name></person-group>, &#x201C;<article-title>Hyperparameter optimization based deep convolution neural network model for automated bone age assessment and classification</article-title>,&#x201D; <source>Displays</source>, vol. <volume>73</volume>, no. <issue>1</issue>, pp. <fpage>102206</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P. N.</given-names> <surname>Srinivasu</surname></string-name>, <string-name><given-names>J. G.</given-names> <surname>SivaSai</surname></string-name>, <string-name><given-names>M. F.</given-names> <surname>Ijaz</surname></string-name>, <string-name><given-names>A. K.</given-names> <surname>Bhoi</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Kim</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Classification of skin disease using deep learning neural networks with MobileNet V2 and LSTM</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>21</volume>, no. <issue>8</issue>, pp. <fpage>2852</fpage>, <year>2021</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>K.</given-names> <surname>Shankar</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Perumal</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Elhoseny</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Taher</surname></string-name>, <string-name><given-names>B. B.</given-names> <surname>Gupta</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Synergic deep learning for smart health diagnosis of covid-19 for connected living and smart cities</article-title>,&#x201D; <source>ACM Transactions on Internet Technology</source>, vol. <volume>22</volume>, no. <issue>3</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <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.</given-names> <surname>Gopi</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Muthusamy</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Suresh</surname></string-name>, <string-name><given-names>C. G. G. S.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>I. V.</given-names> <surname>Pustokhina</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Optimal confidential mechanisms in smart city healthcare</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>70</volume>, no. <issue>3</issue>, pp. <fpage>4883</fpage>&#x2013;<lpage>4896</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D. A.</given-names> <surname>Pustokhin</surname></string-name>, <string-name><given-names>I. V.</given-names> <surname>Pustokhina</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Rani</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Kansal</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Elhoseny</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Optimal deep learning approaches and healthcare big data analytics for mobile networks toward 5G</article-title>,&#x201D; <source>Computers &#x0026; Electrical Engineering</source>, vol. <volume>95</volume>, no. <issue>11</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>14</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>S.</given-names> <surname>Chakraborty</surname></string-name>, <string-name><given-names>A. K.</given-names> <surname>Saha</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Sharma</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Mirjalili</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Chakraborty</surname></string-name></person-group>, &#x201C;<article-title>A novel enhanced whale optimization algorithm for global optimization</article-title>,&#x201D; <source>Computers &#x0026; Industrial Engineering</source>, vol. <volume>153</volume>, no. <issue>5</issue>, pp. <fpage>107086</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Atefinia</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Ahmadi</surname></string-name></person-group>, &#x201C;<article-title>Network intrusion detection using multi-architectural modular deep neural network</article-title>,&#x201D; <source>The Journal of Supercomputing</source>, vol. <volume>77</volume>, no. <issue>4</issue>, pp. <fpage>3571</fpage>&#x2013;<lpage>3593</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>She</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Battery aging assessment for real-world electric buses based on incremental capacity analysis and radial basis function neural network</article-title>,&#x201D; <source>IEEE Transactions on Industrial Informatics</source>, vol. <volume>16</volume>, no. <issue>5</issue>, pp. <fpage>3345</fpage>&#x2013;<lpage>3354</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Spampinato</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Palazzo</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Giordano</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Aldinucci</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Leonardi</surname></string-name></person-group>, &#x201C;<article-title>Deep learning for automated skeletal bone age assessment in X-ray images</article-title>,&#x201D; <source>Medical Image Analysis</source>, vol. <volume>36</volume>, pp. <fpage>41</fpage>&#x2013;<lpage>51</lpage>, <year>2017</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>
