<?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">CSSE</journal-id>
<journal-id journal-id-type="nlm-ta">CSSE</journal-id>
<journal-id journal-id-type="publisher-id">CSSE</journal-id>
<journal-title-group>
<journal-title>Computer Systems Science &#x0026; Engineering</journal-title>
</journal-title-group>
<issn pub-type="ppub">0267-6192</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">26877</article-id>
<article-id pub-id-type="doi">10.32604/csse.2023.026877</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Stacked Gated Recurrent Unit Classifier with CT Images for Liver Cancer Classification</article-title><alt-title alt-title-type="left-running-head">Stacked Gated Recurrent Unit Classifier for Liver Cancer Classification</alt-title><alt-title alt-title-type="right-running-head">Stacked Gated Recurrent Unit Classifier for Liver Cancer Classification</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Ragab</surname><given-names>Mahmoud</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
<xref ref-type="aff" rid="aff-2">2</xref>
<xref ref-type="aff" rid="aff-3">3</xref><email>mragab@kau.edu.sa</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Alyami</surname><given-names>Jaber</given-names></name>
<xref ref-type="aff" rid="aff-4">4</xref>
<xref ref-type="aff" rid="aff-5">5</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Information Technology Department, Faculty of Computing and Information Technology, King Abdulaziz University</institution>, <addr-line>Jeddah, 21589</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Centre of Artificial Intelligence for Precision Medicines, King Abdulaziz University</institution>, <addr-line>Jeddah, 21589</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Mathematics, Faculty of Science, Al-Azhar University</institution>, <addr-line>Naser City, 11884, Cairo</addr-line>, <country>Egypt</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Diagnostic Radiology, Faculty of Applied Medical Sciences, King Abdulaziz</institution>, <addr-line>Jeddah, 21589</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-5"><label>5</label><institution>Imaging Unit, King Fahd Medical Research Centre, King Abdulaziz</institution>, <addr-line>Jeddah, 21589</addr-line>, <country>Saudi Arabia</country></aff>
</contrib-group><author-notes><corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Mahmoud Ragab. Email: <email>mragab@kau.edu.sa</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-06-20"><day>20</day>
<month>06</month>
<year>2022</year></pub-date>
<volume>44</volume>
<issue>3</issue>
<fpage>2309</fpage>
<lpage>2322</lpage>
<history>
<date date-type="received"><day>06</day><month>1</month><year>2022</year></date>
<date date-type="accepted"><day>10</day><month>3</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Ragab and Alyami</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Ragab and Alyami</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_CSSE_26877.pdf"></self-uri>
<abstract>
<p>Liver cancer is one of the major diseases with increased mortality in recent years, across the globe. Manual detection of liver cancer is a tedious and laborious task due to which Computer Aided Diagnosis (CAD) models have been developed to detect the presence of liver cancer accurately and classify its stages. Besides, liver cancer segmentation outcome, using medical images, is employed in the assessment of tumor volume, further treatment plans, and response monitoring. Hence, there is a need exists to develop automated tools for liver cancer detection in a precise manner. With this motivation, the current study introduces an Intelligent Artificial Intelligence with Equilibrium Optimizer based Liver cancer Classification (IAIEO-LCC) model. The proposed IAIEO-LCC technique initially performs Median Filtering (MF)-based pre-processing and data augmentation process. Besides, Kapur&#x2019;s entropy-based segmentation technique is used to identify the affected regions in liver. Moreover, VGG-19 based feature extractor and Equilibrium Optimizer (EO)-based hyperparameter tuning processes are also involved to derive the feature vectors. At last, Stacked Gated Recurrent Unit (SGRU) classifier is exploited to detect and classify the liver cancer effectively. In order to demonstrate the superiority of the proposed IAIEO-LCC technique in terms of performance, a wide range of simulations was conducted and the results were inspected under different measures. The comparison study results infer that the proposed IAIEO-LCC technique achieved an improved accuracy of 98.52%.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Liver cancer</kwd>
<kwd>image segmentation</kwd>
<kwd>artificial intelligence</kwd>
<kwd>deep learning</kwd>
<kwd>CT images</kwd>
<kwd>parameter tuning</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Globally, liver cancer is one of the major causes that leads to high mortality [<xref ref-type="bibr" rid="ref-1">1</xref>]. Liver cancer may either start in liver itself or it may begin somewhere else in the body and reach the liver cell at last in the form of secondary liver cancer (otherwise called metastasis). Different types of liver cancers have been identified so far such as Hepatocellular Carcinoma (HCC), bile duct cancer, angiosarcoma, hepatoblastoma, and hemangiosarcoma. Among these, Hepatocellular carcinoma (HCC) is the most common and predominant liver cancer reported among men than their counterparts [<xref ref-type="bibr" rid="ref-2">2</xref>]. Usually, HCC spreads across the body of the patient diagnosed with chronic liver disease [<xref ref-type="bibr" rid="ref-3">3</xref>]. Numerous imaging methods exist for the diagnoses of HCC for example, Positron Emission Tomography (PET), contrast-enhanced ultrasound perfusion magnetic resonance imaging, Computed Tomography (CT), and PET-CT. Among these, CT is the most preferred imaging method for diagnosis as well as recognition of hepatic metastases and HCC, thanks to its high specificity and sensitivity [<xref ref-type="bibr" rid="ref-4">4</xref>]. Further, multi-slice CT scanner provides high resolution 3D images through low dose radiation. CT technique captures 3D volume images of the liver through X-rays produced by a rotating X-ray source and detector assembly over the patients [<xref ref-type="bibr" rid="ref-5">5</xref>]. CT scan investigation is a critical phase in the early diagnosis of liver cancer. The investigation is conducted through manual, semi-automatic, or automatic models through certified professionals such as radiotherapist. Among the given models, manual method lacks repeatability and is also a time-consuming process. In the past few years, with rapid advancements made in the field of Machine Learning (ML) and Computer Vision (CV) algorithms, the automatic classification methods for liver cancer images too have tremendously increased.</p>
<p>Computer Aided Diagnosis (CAD) is used to classify the stage of liver cancer so as to support the physician in decision making procedures [<xref ref-type="bibr" rid="ref-6">6</xref>]. For efficient classification of different stages of liver cancer, artificial intelligence and image processing methods must have the capability in study application. Liver cancer can be diagnosed through different methods such as watershed transform, ML, and region-based methods. Usually, Deep Learning (DL) is the simplest method to standardize the pixels of images to a similar level. Therefore, the extracted image could reflect the features of image itself for the preprocessed image whereas the nature of the extracted features determine the accuracy of the process [<xref ref-type="bibr" rid="ref-7">7</xref>]. Finally, it can be concluded that the object class in images is the key component in DL method. It is also the focus of a number of existing works [<xref ref-type="bibr" rid="ref-8">8</xref>]. ML algorithm has attained good radiological efficacy and solved the gap in radiological classification of distinct diseases [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-10">10</xref>]. Convolution Neural Network (CNN) of DL methods have been employed earlier for automated identification of liver cancer from CT scan images.</p>
<p>Mao et al. [<xref ref-type="bibr" rid="ref-11">11</xref>] examined the application of ML-based ultrasound radiomics in effective segmentation of metastatic and primary liver cancer images. In this study, liver lesion was automatically classified by two professionals using ITK-SNAP software. The seven classes of radiomics features have been extracted from Pyradiomics framework. Ding et al. [<xref ref-type="bibr" rid="ref-12">12</xref>] presented the current technological provisions for medical treatment and diagnoses and he validated the provisions in terms of enhanced rigor, objectivity, and accuracy of segmentation of Traditional Chinese medicine (TCM) syndrome. According to fuzzy mathematics concept, the authors measured the signs and symptoms of syndrome-based TCM factor and also the data from TCM four diagnosis modes. Following this, with Extreme Learning Machine (ELM) system and Particle Swarm Optimization (PSO), a Neural Network (NN) syndrome prediction and classification model was created utilizing &#x2018;TCM symptom &#x002B; sign &#x002B; tongue diagnoses data &#x002B; pulse diagnoses data&#x2019; as input and syndrome as output. This method was utilized in the mining of non-linear relationships among medical information with different syndrome types and electronic medical records.</p>
<p>Rajesh et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] deliberated a predictive method for liver cancer. Being reported as one of the most deadly types of cancer, a straightforward method was presented in this study to predict liver cancer via widely accessible data sets. Distinct kinds of data preprocessing were performed on the data set to extract the optimal data. Further, the study experiments utilized distinct kinds of classifier methods too to arrive at the predictive outcomes. In the study conducted earlier [<xref ref-type="bibr" rid="ref-14">14</xref>], histopathological H&#x0026;E image from Genomic Data Common Databases was utilized to train a NN system (inception V3) for automated classification. When this method that use Matthew relation coefficients was assessed, the efficiency level was found to be closer to the capacity of 5-year experiences. The researchers [<xref ref-type="bibr" rid="ref-15">15</xref>] projected a hybrid Feature Selection (FS) method by integrating sequential forward selection and data gain-based class-dependent method (IGSFS-CD) for the segmentation of liver cancer images. Two distinct classifications namely na&#x00EF;ve Bayes (NB) and Decision Tree (DT) have been utilized in this study to evaluate the feature subset.</p>
<p>The current study introduces an Intelligent Artificial Intelligence with Equilibrium Optimizer based Liver Cancer Classification (IAIEO-LCC) model. The proposed IAIEO-LCC technique initially performs Median Filtering (MF)-based pre-processing and data augmentation process. Besides, Kapur&#x2019;s Entropy (KE)-based segmentation technique is also used to identify the affected regions in liver. Moreover, VGG-19 based feature extractor and Equilibrium Optimizer (EO)-based hyperparameter tuning processes are also involved in this study to derive the feature vectors. Finally, Stacked Gated Recurrent Unit (SGRU) classifier is exploited to detect and classify the stages of liver cancer effectively. In order to demonstrate the superior performance of the proposed IAIEO-LCC technique, a wide range of experiments was carried out.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>The Proposed IAIEO-LCC Technique</title>
<p>In this study, an effective IAIEO-LCC technique has been developed to differentiate the classes of liver images. The proposed IAIEO-LCC technique primarily undergoes MF-based noise elimination, data augmentation, KE-based segmentation, VGG-19 based feature extraction, EO-based hyperparameter tuning, and SGRU-based classification. SGRU classifier is exploited to detect and classify the liver cancer effectively.</p>
<sec id="s2_1">
<label>2.1</label>
<title>Pre-processing: Data Augmentation and Filtering Technique</title>
<p>In order to train the CNN model, huge quantities of labeled data are required. Since the model, trained with restricted data, might fail to achieve generalization, increasing the size of the dataset is a promising way to reduce overfitting or memorization problems. Data augmentation is an effective way to raise the number of images whereas geometric translations such as shearing, flipping, shifting, and zooming are used to augment the images.</p>
<p>MF utilizes the median values of the window to replace intermediate pixels treated by the window. When intermittent pixels are noisy, it gets substituted by intermediate window value. The median value is considered as the mid-point value after sorting process. Hence, the undistorted pixels can be substituted using the median value of the window.</p>
<p>Sample window Output</p>
<p><disp-formula id="eqn-1"><label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mn>46</mml:mn></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mn>64</mml:mn></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mn>82</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mn>255</mml:mn></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>45</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mn>52</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mn>64</mml:mn></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mn>64</mml:mn></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mn>82</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mn>46</mml:mn></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mn>64</mml:mn></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mn>82</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mn>255</mml:mn></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>82</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mn>52</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mn>64</mml:mn></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mn>64</mml:mn></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mn>82</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Segmentation: Kapur&#x2019;s Entropy</title>
<p>Both pre-processed and augmented images are then passed on to KE-based segmentation approach for the identification of affected regions. KE technique seeks to determine the optimal threshold value, <inline-formula id="ieqn-1">
<mml:math id="mml-ieqn-1"><mml:mi>t</mml:mi></mml:math>
</inline-formula>. Usually, <inline-formula id="ieqn-2">
<mml:math id="mml-ieqn-2"><mml:mi>t</mml:mi></mml:math>
</inline-formula> gets a value between [1,255] (for 8-bit depth image) which subdivides an image into <inline-formula id="ieqn-3">
<mml:math id="mml-ieqn-3"><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-4">
<mml:math id="mml-ieqn-4"><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math>
</inline-formula> which still maximizes the subsequent function.</p>
<p><disp-formula id="eqn-2"><label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-3"><label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>ln</mml:mi><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mi>T</mml:mi></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mspace width="thickmathspace" /></mml:mstyle></mml:mstyle></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-4"><label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>ln</mml:mi><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mi>T</mml:mi></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mstyle></mml:mstyle></mml:mstyle></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-5">
<mml:math id="mml-ieqn-5"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> implies the number of pixels with gray value, <inline-formula id="ieqn-6">
<mml:math id="mml-ieqn-6"><mml:mi>i</mml:mi></mml:math>
</inline-formula>, and <inline-formula id="ieqn-7">
<mml:math id="mml-ieqn-7"><mml:mi>T</mml:mi></mml:math>
</inline-formula> signifies the number of pixels from image [<xref ref-type="bibr" rid="ref-16">16</xref>]. <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref> is adapted simply to determine multi-threshold values that separate the image as to distinct homogenous area, in which it can be reformed as follows: Consider that the gray image with intensity values are in the range of <inline-formula id="ieqn-8">
<mml:math id="mml-ieqn-8"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>L</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</inline-formula>. Afterwards, this technique seek to find the <inline-formula id="ieqn-9">
<mml:math id="mml-ieqn-9"><mml:mi>n</mml:mi></mml:math>
</inline-formula> optimum threshold values <inline-formula id="ieqn-10">
<mml:math id="mml-ieqn-10"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</inline-formula> which subdivides the image in to <inline-formula id="ieqn-11">
<mml:math id="mml-ieqn-11"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</inline-formula> for maximizing the subsequent function.</p>
<p><disp-formula id="eqn-5"><label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-6"><label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>ln</mml:mi><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mi>T</mml:mi></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mstyle></mml:mstyle></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-7"><label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>ln</mml:mi><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mi>T</mml:mi></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mspace width="thickmathspace" /></mml:mstyle></mml:mstyle></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-8"><label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>ln</mml:mi><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mi>T</mml:mi></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mstyle></mml:mstyle></mml:mstyle></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:msub><mml:mi>E</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>ln</mml:mi><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mi>T</mml:mi></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mstyle></mml:mstyle></mml:mstyle></mml:math>
</disp-formula></p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Feature Extraction: EO&#x002B;VGG-19 Model</title>
<p>The segmented images are then passed onto VGG19 method to produce a collection of feature vectors. VGGNet [<xref ref-type="bibr" rid="ref-17">17</xref>] is a kind of DL model with numerous layers. It mainly depends upon CNN model, exhibits simplicity and has 3 &#x00D7; 3 convolution layers which are kept at the top for increasing the depth. In order to reduce the size of volume, max-pooling layer is employed as a handler in VGG-19 model. A pair of Fully Connected (FC) layers is utilized with 4,096 neurons. During training process, the convolution layer is applied to derive the features and max-pooling layer related to few convolution layers can be utilized for minimizing the feature dimensionalities. At initial convolution layer, 64 kernels (3 &#x00D7; 3 filter size) are utilized to derive the feature vectors from input image, and the FC layer is utilized to prepare the feature vectors. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> offers the structure of VGG-19 model.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Structure of VGG-19 model</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_26877-fig-1.png"/>
</fig>
<p>For optimal modification of the hyperparameters involved in VGG19, EO is utilized. A metaheuristic technique, simulated as physics laws such as EO, was presented to resolve the optimized issues. Further, the data on the simulation of EO was established in [<xref ref-type="bibr" rid="ref-18">18</xref>]. The mathematical process of EO technique was showcased in subsequent three steps.</p>
<p><bold>Step 1:</bold> Initiation</p>
<p>In this step, EO utilizes a set of particles, in which all the particles signify the concentration vector which has the solution to optimize the issue. The primary concentration vector is created arbitrarily from search space, utilizing the equation given below.</p>
<p><disp-formula id="eqn-10"><label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:mrow><mml:mover><mml:mi>v</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mi>r</mml:mi><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-12">
<mml:math id="mml-ieqn-12"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>v</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> implies the concentration vector of particle <inline-formula id="ieqn-13">
<mml:math id="mml-ieqn-13"><mml:mi>i</mml:mi><mml:mo>,</mml:mo></mml:math>
</inline-formula> <inline-formula id="ieqn-14">
<mml:math id="mml-ieqn-14"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">x</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> define the upper and lower bounds to all dimensions from the problem correspondingly, <inline-formula id="ieqn-15">
<mml:math id="mml-ieqn-15"><mml:mi>r</mml:mi></mml:math>
</inline-formula> stands for arbitrary number in the range of zero and one, and <inline-formula id="ieqn-16">
<mml:math id="mml-ieqn-16"><mml:mi>n</mml:mi></mml:math>
</inline-formula> denotes the amount of particles from the groups.</p>
<p><bold>Step 2:</bold> Equilibrium pool and candidate solutions <inline-formula id="ieqn-17">
<mml:math id="mml-ieqn-17"><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</inline-formula></p>
<p>In order to incorporate metaheuristic technique, there exists an objective for everyone, based on their nature, who tries to achieve it. If receiving the equilibrium state is the objective, EO receives near-optimum solutions for optimized problems. During optimization procedure, EO does not recognize the level of concentration that attains the equilibrium state. Therefore, it allocates four optimum particles established from the population at equilibrium candidate solution and it also comprises of different average of four optimum particles. These five equilibrium candidate solutions support EO from exploration and exploitation operators. The 1<sup>st</sup> four candidate solutions help EO in attaining optimum diversification abilities, and the average enhancement from exploitation. These five candidate solutions are saved from the vector such as equilibrium pool [<xref ref-type="bibr" rid="ref-19">19</xref>]:</p>
<p><disp-formula id="eqn-11"><label>(11)</label>
<mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mo>,</mml:mo><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mspace width="thickmathspace" /><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>5</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p><bold>Step 3:</bold> update the concentration</p>
<p>The subsequent term supports the EO containing a plausible balance between intensification and diversification. As the turnover rate differs over time in real control volumes, <inline-formula id="ieqn-18">
<mml:math id="mml-ieqn-18"><mml:mrow><mml:mover><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math>
</inline-formula> is assumed to be an arbitrary vector between zero and one.</p>
<p><disp-formula id="eqn-12"><label>(12)</label>
<mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mover><mml:mi>F</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-19">
<mml:math id="mml-ieqn-19"><mml:mi>t</mml:mi></mml:math>
</inline-formula> reduces with increment from the iteration (it) utilizing the equation given below.</p>
<p><disp-formula id="eqn-13"><label>(13)</label>
<mml:math id="mml-eqn-13" display="block"><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">x</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mn>2</mml:mn><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">x</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mstyle></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-20">
<mml:math id="mml-ieqn-20"><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:math>
</inline-formula> and <inline-formula id="ieqn-21">
<mml:math id="mml-ieqn-21"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> stand for present and maximal iterations correspondingly. And <inline-formula id="ieqn-22">
<mml:math id="mml-ieqn-22"><mml:mi>a</mml:mi><mml:mn>2</mml:mn></mml:math>
</inline-formula> refers to constant values that are utilized for controlling the intensification (exploitation) abilities. Other factors, <inline-formula id="ieqn-23">
<mml:math id="mml-ieqn-23"><mml:mi>a</mml:mi><mml:mn>1</mml:mn></mml:math>
</inline-formula> is utilized for improving the diversification and intensification of EO and is created as follows.</p>
<p><disp-formula id="eqn-14"><label>(14)</label>
<mml:math id="mml-eqn-14" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>t</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mrow><mml:mover><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mover><mml:mi>r</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-24">
<mml:math id="mml-ieqn-24"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math>
</inline-formula> refers to a constant value utilized for managing the exploration abilities. Once <inline-formula id="ieqn-25">
<mml:math id="mml-ieqn-25"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math>
</inline-formula> is superior, the diversification ability becomes optimum whereas intensification ability becomes lesser. Conversely <inline-formula id="ieqn-26">
<mml:math id="mml-ieqn-26"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo></mml:math>
</inline-formula> <inline-formula id="ieqn-27">
<mml:math id="mml-ieqn-27"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math>
</inline-formula> signify the constant&#x0027;s value utilized for controlling the exploitation ability. If <inline-formula id="ieqn-28">
<mml:math id="mml-ieqn-28"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math>
</inline-formula> is superior, the intensification ability is superior while diversification capability is minimum [<xref ref-type="bibr" rid="ref-19">19</xref>]. The generation rate (R) is another term utilized in the improvement of intensification function and is expressed as follows</p>
<p><disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:mrow><mml:mover accent='true'><mml:mi>R</mml:mi><mml:mo>&#x21C0;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:msub><mml:mover accent='true'><mml:mi>R</mml:mi><mml:mo>&#x21C0;</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mo>*</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mover accent='true'><mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03BB;</mml:mi></mml:mrow><mml:mo stretchy='true'>&#x2192;</mml:mo></mml:mover><mml:mo>*</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>where <inline-formula id="ieqn-29">
<mml:math id="mml-ieqn-29"><mml:mrow><mml:mover><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math>
</inline-formula> signifies the arbitrary vector in the range of zero and one and <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mrow><mml:msub><mml:mover accent='true'><mml:mi>R</mml:mi><mml:mo>&#x21C0;</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> represents the primary value and is demonstrated as follows.</p>
<p><disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mrow><mml:msub><mml:mover accent='true'><mml:mi>R</mml:mi><mml:mo>&#x21C0;</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mover accent='true'><mml:mrow><mml:mi>R</mml:mi><mml:mi>C</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mo stretchy='true'>&#x2192;</mml:mo></mml:mover><mml:mo>*</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mover accent='true'><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy='true'>&#x2192;</mml:mo></mml:mover><mml:mo>&#x2212;</mml:mo><mml:mover accent='true'><mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03BB;</mml:mi></mml:mrow><mml:mo stretchy='true'>&#x2192;</mml:mo></mml:mover><mml:mo>*</mml:mo><mml:mover accent='true'><mml:mi>C</mml:mi><mml:mo>&#x21C0;</mml:mo></mml:mover></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-17"><label>(17)</label>
<mml:math id="mml-eqn-17" display="block"><mml:mover><mml:mrow><mml:mi>R</mml:mi><mml:mi>C</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mn>0.5</mml:mn><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>&gt;</mml:mo><mml:mi>R</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-31">
<mml:math id="mml-ieqn-31"><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math>
</inline-formula> and <inline-formula id="ieqn-32">
<mml:math id="mml-ieqn-32"><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math>
</inline-formula> signify the arbitrary numbers between <inline-formula id="ieqn-33">
<mml:math id="mml-ieqn-33"><mml:mi>z</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi></mml:math>
</inline-formula> and one. In this formula, <inline-formula id="ieqn-34">
<mml:math id="mml-ieqn-34"><mml:mover><mml:mrow><mml:mi>R</mml:mi><mml:mi>C</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math>
</inline-formula> vector is the generation rate which is implemented to upgrade the model depending upon probability, <inline-formula id="ieqn-35">
<mml:math id="mml-ieqn-35"><mml:mi>R</mml:mi><mml:mi>P</mml:mi><mml:mo>.</mml:mo></mml:math>
</inline-formula> Eventually, the upgraded formula of EO is as follows.</p>
<p><disp-formula id="eqn-18"><label>(18)</label>
<mml:math id="mml-eqn-18" display="block"><mml:mover><mml:mi>C</mml:mi><mml:mrow><mml:mpadded height="+0.7em" depth="-0.7em"><mml:mstyle displaystyle="false" scriptlevel="0"><mml:mrow><mml:mrow><mml:mpadded height="0" depth="0"><mml:mstyle displaystyle="false" scriptlevel="2"><mml:mo stretchy="false">&#x21C0;</mml:mo></mml:mstyle></mml:mpadded></mml:mrow></mml:mrow></mml:mstyle></mml:mpadded><mml:mspace width="-5pt" /></mml:mrow></mml:mover><mml:mo>=</mml:mo><mml:mover><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mover><mml:mi>C</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mover><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mover><mml:mi>F</mml:mi><mml:mrow><mml:mpadded height="+0.7em" depth="-0.7em"><mml:mstyle displaystyle="false" scriptlevel="0"><mml:mrow><mml:mrow><mml:mpadded height="0" depth="0"><mml:mstyle displaystyle="false" scriptlevel="2"><mml:mo stretchy="false">&#x21C0;</mml:mo></mml:mstyle></mml:mpadded></mml:mrow></mml:mrow></mml:mstyle></mml:mpadded><mml:mspace width="-5pt" /></mml:mrow></mml:mover><mml:mo>+</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mover><mml:mi>R</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mover><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>V</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>F</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mstyle></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-36">
<mml:math id="mml-ieqn-36"><mml:mi>V</mml:mi></mml:math>
</inline-formula> is equivalent to 1.</p>
</sec>
<sec id="s2_4">
<label>2.4</label>
<title>Classifier: Stacked GRU Model</title>
<p>Finally, SGRU classifier is utilized for the differentiation of liver cancer images effectively. Conventional ML techniques manage time series issues; all the moments of instance are considered to be independent arbitrary variables which can be provided as to regression technique or NN to train. But, this technique considers that the data at distinct moments are independent of each other, and its order in time remains non-assumed. Recurrent Neural Network (RNN) is presented to capture this temporal correlation with the help of ML. GRU has been altered with RNN depending upon Long Short Term Memory (LSTM). If the error signal propagates backward with time in conventional RNN, then the signal is provided to vanish or blow up. This case eventually leads to failure of the learning network [<xref ref-type="bibr" rid="ref-20">20</xref>]. GRU not only maintains the capability to prevent the earlier revealed problems whereas it also decreases the difficulty of framework without losing an efficient learning capability.</p>
<p>Both reset and update gates are FC layers with sigmoid activation and are utilized for controlling the memory [<xref ref-type="bibr" rid="ref-20">20</xref>]. GRU cell is demonstrated as follows.</p>
<p><disp-formula id="ueqn-37">
<mml:math id="mml-ueqn-37" display="block"><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>W</mml:mi><mml:mi>z</mml:mi></mml:msup></mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msup><mml:mi>U</mml:mi><mml:mi>z</mml:mi></mml:msup></mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msup><mml:mi>b</mml:mi><mml:mi>z</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-19"><label>(19)</label>
<mml:math id="mml-eqn-19" display="block"><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>W</mml:mi><mml:mi>r</mml:mi></mml:msup></mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msup><mml:mi>U</mml:mi><mml:mi>r</mml:mi></mml:msup></mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msup><mml:mi>b</mml:mi><mml:mi>r</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math>
</disp-formula></p>
<p><disp-formula id="ueqn-38">
<mml:math id="mml-ueqn-38" display="block"><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">h</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mi>U</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2299;</mml:mo><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math>
</disp-formula></p>
<p><disp-formula id="ueqn-1000">
<mml:math id="mml-ueqn-1000" display="block"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2299;</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2299;</mml:mo><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-37">
<mml:math id="mml-ieqn-37"><mml:mi>W</mml:mi></mml:math>
</inline-formula> and <inline-formula id="ieqn-38">
<mml:math id="mml-ieqn-38"><mml:mi>U</mml:mi></mml:math>
</inline-formula> signify the weight matrices of FC layer and <inline-formula id="ieqn-39">
<mml:math id="mml-ieqn-39"><mml:mi>b</mml:mi></mml:math>
</inline-formula> stands for bias vector. <inline-formula id="ieqn-40">
<mml:math id="mml-ieqn-40"><mml:mi>&#x03C3;</mml:mi></mml:math>
</inline-formula> and <inline-formula id="ieqn-41">
<mml:math id="mml-ieqn-41"><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:math>
</inline-formula> represent the sigmoid and <inline-formula id="ieqn-42">
<mml:math id="mml-ieqn-42"><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:math>
</inline-formula> activation function correspondingly. <inline-formula id="ieqn-43">
<mml:math id="mml-ieqn-43"><mml:mo>&#x2299;</mml:mo></mml:math>
</inline-formula> denotes element-wise product between two matrices of similar size. To make the GRU function, its present hidden state is linked with next hidden state input. In order to improve the learning capability, several GRU cells are stacked together in input-output way, and the resultant GRU cell, from all the steps, are utilized as input of next GRU cell at corresponding step. Related to single layer GRU, stacked GRU has several hidden states that enhance the capability for learning time series, as shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Overall structure of SGRU model</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_26877-fig-2.png"/>
</fig>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Results and Discussion</title>
<p>The performance of the proposed IAIEO-LCC technique was validated using a collection of CT scan images collected from various sources. The dataset includes images under three classes such as Hemangioma (HEMA), Hepatocellular Carcinoma (HCC), and Metastatic Carcinoma (MEC). Each class holds a set of 75 images which became 150 after data augmentation process. <xref ref-type="fig" rid="fig-3">Fig. 3</xref> demonstrates the sample test images. The confusion matrix generated by the proposed IAIEO-LCC technique with training/testing set of 80:20 is portrayed in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. The results report that IAIEO-LCC technique has classified 29 instances under HEMA class, 30 images under HCA class, and 29 instances under MSC class.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Sample test images</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_26877-fig-3.png"/>
</fig>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Confusion matrix of IAIEO-LCC approach with a training/testing set of 80:20</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_26877-fig-4.png"/>
</fig>
<p>The results obtained by IAIEO-LCC technique, on the classification of liver cancer images under training/testing set of 80:20, are shown in <xref ref-type="table" rid="table-1">Tab. 1</xref> and <xref ref-type="fig" rid="fig-5">Fig. 5</xref>. The results demonstrate the enhanced effectiveness of the proposed IAIEO-LCC technique in terms of different measures. The proposed IAIEO-LCC technique classified HEMA class with <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:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-45">
<mml:math id="mml-ieqn-45"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-46">
<mml:math id="mml-ieqn-46"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-47">
<mml:math id="mml-ieqn-47"><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-48">
<mml:math id="mml-ieqn-48"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>C</mml:mi><mml:mi>O</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 96.67%, 98.33%, 97.78%, 96.67%, and 96.67% respectively.</p>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>Liver cancer classification results of IAIEO-LCC technique under a training/testing set of 80:20</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th colspan="6">Training/Testing (80:20)</th>
</tr>
<tr>
<th>Methods</th>
<th>Sensitivity</th>
<th>Specificity</th>
<th>Accuracy</th>
<th>Precision</th>
<th>F-Score</th>
</tr>
</thead>
<tbody>
<tr>
<td>HEMA</td>
<td>96.67</td>
<td>98.33</td>
<td>97.78</td>
<td>96.67</td>
<td>96.67</td>
</tr>
<tr>
<td>HCA</td>
<td>100.00</td>
<td>100.00</td>
<td>100.00</td>
<td>100.00</td>
<td>100.00</td>
</tr>
<tr>
<td>MSC</td>
<td>96.67</td>
<td>98.33</td>
<td>97.78</td>
<td>96.67</td>
<td>96.67</td>
</tr>
<tr>
<td>Average</td>
<td>97.78</td>
<td>98.89</td>
<td>98.52</td>
<td>97.78</td>
<td>97.78</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Classifier results of IAIEO-LCC technique under a training/testing set of 80:20</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_26877-fig-5.png"/>
</fig>
<p>Moreover, IAIEO-LCC technique categorized the HCA class with <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:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-50">
<mml:math id="mml-ieqn-50"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-51">
<mml:math id="mml-ieqn-51"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-52">
<mml:math id="mml-ieqn-52"><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-53">
<mml:math id="mml-ieqn-53"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>C</mml:mi><mml:mi>O</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 100%, 100%, 100%, 100%, and 100% respectively. Furthermore, IAIEO-LCC technique identified the MSC class with <inline-formula id="ieqn-54">
<mml:math id="mml-ieqn-54"><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mi>N</mml:mi><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-55">
<mml:math id="mml-ieqn-55"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-56">
<mml:math id="mml-ieqn-56"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-57">
<mml:math id="mml-ieqn-57"><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-58">
<mml:math id="mml-ieqn-58"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>C</mml:mi><mml:mi>O</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 96.67%, 98.33%, 97.78%, 96.67%, and 96.67% respectively.</p>

<p>The confusion matrix generated by IAIEO-LCC technique with training/testing set of 70:30 is portrayed in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. The experimental values highlight that the proposed IAIEO-LCC technique recognized 44 instances as HEMA class, 41 images as HCA class, and 42 instances as MSC class.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Confusion matrix of IAIEO-LCC approach with a training/testing set of 70:30</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_26877-fig-6.png"/>
</fig>
<p>The experimental values offered by the proposed IAIEO-LCC technique on the classification of liver cancer with training/testing set of 70:30, are presented in <xref ref-type="table" rid="table-2">Tab. 2</xref> and <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. The results reveal the improved effectiveness of IAIEO-LCC technique in terms of dissimilar measures. The proposed IAIEO-LCC technique categorized HEMA class with <inline-formula id="ieqn-59">
<mml:math id="mml-ieqn-59"><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mi>N</mml:mi><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-60">
<mml:math id="mml-ieqn-60"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <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:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-62">
<mml:math id="mml-ieqn-62"><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-63">
<mml:math id="mml-ieqn-63"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>C</mml:mi><mml:mi>O</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> values being 97.78%, 97.78%, 97.78%, 95.65%, and 96.70% respectively. Furthermore, IAIEO-LCC technique categorized HCA class with <inline-formula id="ieqn-64">
<mml:math id="mml-ieqn-64"><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mi>N</mml:mi><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-65">
<mml:math id="mml-ieqn-65"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-66">
<mml:math id="mml-ieqn-66"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-67">
<mml:math id="mml-ieqn-67"><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-68">
<mml:math id="mml-ieqn-68"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>C</mml:mi><mml:mi>O</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> values being 91.11%, 96.67%, 94.81%, 93.18%, and 92.13% respectively. Besides, IAIEO-LCC technique identified MSC class with <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:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-70">
<mml:math id="mml-ieqn-70"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-71">
<mml:math id="mml-ieqn-71"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-72">
<mml:math id="mml-ieqn-72"><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-73">
<mml:math id="mml-ieqn-73"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>C</mml:mi><mml:mi>O</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> values such as 93.33%, 96.67%, 95.56%, 93.33%, and 93.33% respectively.</p>
<table-wrap id="table-2"><label>Table 2</label>
<caption>
<title>Liver cancer classification results of IAIEO-LCC technique under a training/testing set of 70:30</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th colspan="6">Training/Testing (70:30)</th>
</tr>
<tr>
<th>Methods</th>
<th>Sensitivity</th>
<th>Specificity</th>
<th>Accuracy</th>
<th>Precision</th>
<th>F-Score</th>
</tr>
</thead>
<tbody>
<tr>
<td>HEMA</td>
<td>97.78</td>
<td>97.78</td>
<td>97.78</td>
<td>95.65</td>
<td>96.70</td>
</tr>
<tr>
<td>HCA</td>
<td>91.11</td>
<td>96.67</td>
<td>94.81</td>
<td>93.18</td>
<td>92.13</td>
</tr>
<tr>
<td>MSC</td>
<td>93.33</td>
<td>96.67</td>
<td>95.56</td>
<td>93.33</td>
<td>93.33</td>
</tr>
<tr>
<td>Average</td>
<td>94.07</td>
<td>97.04</td>
<td>96.05</td>
<td>94.06</td>
<td>94.06</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Classification results of IAIEO-LCC approach with a training/testing set of 70:30</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_26877-fig-7.png"/>
</fig>
<p>The confusion matrix generated by IAIEO-LCC technique with a training/testing set of 60:40 is portrayed in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. The results state that the proposed IAIEO-LCC technique recognized 58 instances as HEMA class, 57 images as HCA class, and 57 instances as MSC class.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Confusion matrix of IAIEO-LCC approach with a training/testing set of 60:40</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_26877-fig-8.png"/>
</fig>
<p>The results achieved by the proposed IAIEO-LCC technique, on the classification of liver cancer with training/testing set of 60:40, are presented in <xref ref-type="table" rid="table-3">Tab. 3</xref> and <xref ref-type="fig" rid="fig-9">Fig. 9</xref>. The results validate the boosted effectiveness of IAIEO-LCC technique in terms of different measures. The IAIEO-LCC technique categorized HEMA class with <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:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-75">
<mml:math id="mml-ieqn-75"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-76">
<mml:math id="mml-ieqn-76"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-77">
<mml:math id="mml-ieqn-77"><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-78">
<mml:math id="mml-ieqn-78"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>C</mml:mi><mml:mi>O</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> values such as 96.67%, 98.33%, 97.78%, 96.67%, and 96.67% respectively. Also, the proposed IAIEO-LCC technique categorized HCA class with <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:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <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:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <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:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-82">
<mml:math id="mml-ieqn-82"><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-83">
<mml:math id="mml-ieqn-83"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>C</mml:mi><mml:mi>O</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> values such as 95%, 95.83%, 95.56%, 91.94%, and 93.44% respectively. Likewise, the presented IAIEO-LCC technique segregated MSC class with <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:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-85">
<mml:math id="mml-ieqn-85"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <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:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-87">
<mml:math id="mml-ieqn-87"><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-88">
<mml:math id="mml-ieqn-88"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>C</mml:mi><mml:mi>O</mml:mi><mml:mi>R</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> values such as 95%, 99.17%, 97.78%, 98.28%, and 96.61% respectively.</p>
<table-wrap id="table-3"><label>Table 3</label>
<caption>
<title>Liver cancer classification results of IAIEO-LCC technique under a training/testing set of 60:40</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th colspan="6">Training/Testing (60:40)</th>
</tr>
<tr>
<th>Methods</th>
<th>Sensitivity</th>
<th>Specificity</th>
<th>Accuracy</th>
<th>Precision</th>
<th>F-Score</th>
</tr>
</thead>
<tbody>
<tr>
<td>HEMA</td>
<td>96.67</td>
<td>98.33</td>
<td>97.78</td>
<td>96.67</td>
<td>96.67</td>
</tr>
<tr>
<td>HCA</td>
<td>95.00</td>
<td>95.83</td>
<td>95.56</td>
<td>91.94</td>
<td>93.44</td>
</tr>
<tr>
<td>MSC</td>
<td>95.00</td>
<td>99.17</td>
<td>97.78</td>
<td>98.28</td>
<td>96.61</td>
</tr>
<tr>
<td>Average</td>
<td>95.56</td>
<td>97.78</td>
<td>97.04</td>
<td>95.63</td>
<td>95.57</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Classifier results of IAIEO-LCC technique under a training/testing set of 60:40</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_26877-fig-9.png"/>
</fig>
<p>In order to ensure the betterment of the proposed IAIEO-LCC technique, a comparison study was conducted against MLP, SVM, Random Forest (RF), J48, and NB models [<xref ref-type="bibr" rid="ref-21">21</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>] and the results are shown in <xref ref-type="table" rid="table-4">Tab. 4</xref>. <xref ref-type="fig" rid="fig-10">Fig. 10</xref> illustrates the comparison of IAIEO-LCC technique against other methods in terms of <inline-formula id="ieqn-89">
<mml:math id="mml-ieqn-89"><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mi>N</mml:mi><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>. The experimental results showcase that NB model achieved the least outcome with <inline-formula id="ieqn-90">
<mml:math id="mml-ieqn-90"><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mi>N</mml:mi><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> of 89.90%. Then, RF, J48, and SVM techniques produced slightly enhanced <inline-formula id="ieqn-91">
<mml:math id="mml-ieqn-91"><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mi>N</mml:mi><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> values such as 94.40%, 94.40%, and 94.22% respectively. Though the MLP model accomplished a near optimal <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:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> of 95.90%, the proposed IAIEO-LCC technique reported the highest <inline-formula id="ieqn-93">
<mml:math id="mml-ieqn-93"><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mi>N</mml:mi><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> of 97.78%.</p>
<table-wrap id="table-4"><label>Table 4</label>
<caption>
<title>Comparative classification results of IAIEO-LCC technique against existing models</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Sensitivity</th>
<th>Specificity</th>
<th>Accuracy</th>
</tr>
</thead>
<tbody>
<tr>
<td>IAIEO-LCC</td>
<td>97.78</td>
<td>98.89</td>
<td>98.52</td>
</tr>
<tr>
<td>MLP Model</td>
<td>95.90</td>
<td>98.52</td>
<td>95.59</td>
</tr>
<tr>
<td>RF Technique</td>
<td>94.40</td>
<td>98.42</td>
<td>94.44</td>
</tr>
<tr>
<td>J48 Technique</td>
<td>94.40</td>
<td>98.30</td>
<td>94.44</td>
</tr>
<tr>
<td>SVM Technique</td>
<td>94.22</td>
<td>95.76</td>
<td>95.17</td>
</tr>
<tr>
<td>NB Model</td>
<td>89.90</td>
<td>93.65</td>
<td>91.94</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Comparative <inline-formula id="ieqn-94">
<mml:math id="mml-ieqn-94"><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mi>N</mml:mi><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> results of IAIEO-LCC technique</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_26877-fig-10.png"/>
</fig>

<p><xref ref-type="fig" rid="fig-11">Fig. 11</xref> exemplifies the comparison study results of IAIEO-LCC technique against existing approaches with respect to <inline-formula id="ieqn-96">
<mml:math id="mml-ieqn-96"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>. The obtained values display that NB model reported a minimal performance with a <inline-formula id="ieqn-97">
<mml:math id="mml-ieqn-97"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> of 93.65%. Meanwhile, RF, J48, and SVM techniques resulted in slightly enhanced <inline-formula id="ieqn-98">
<mml:math id="mml-ieqn-98"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> values such as 98.42%, 98.30%, and 94.44% respectively. Although MLP model has accomplished a competitive <inline-formula id="ieqn-99">
<mml:math id="mml-ieqn-99"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>of 98.52%, the proposed IAIEO-LCC technique accomplished the highest <inline-formula id="ieqn-100">
<mml:math id="mml-ieqn-100"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> of 98.89%.</p>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Comparative <inline-formula id="ieqn-95">
<mml:math id="mml-ieqn-95"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> results of IAIEO-LCC technique</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_26877-fig-11.png"/>
</fig>
<p>Finally, <xref ref-type="fig" rid="fig-12">Fig. 12</xref> illustrates the comparison study results of IAIEO-LCC technique against other methods in terms of <inline-formula id="ieqn-101">
<mml:math id="mml-ieqn-101"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>. The table values showcase that NB model failed in achieving the effective results with an <inline-formula id="ieqn-102">
<mml:math id="mml-ieqn-102"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> of 91.94%. Then, RF, J48, and SVM techniques produced slightly enhanced <inline-formula id="ieqn-103">
<mml:math id="mml-ieqn-103"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> values such as 94.44%, 94.44%, and 95.17% respectively. Though MLP model produced a near optimal <inline-formula id="ieqn-104">
<mml:math id="mml-ieqn-104"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> of 95.59%, the proposed IAIEO-LCC technique reported an improved <inline-formula id="ieqn-105">
<mml:math id="mml-ieqn-105"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> of 98.52%. Based on these detailed results and discussions, it is obvious that the proposed IAIEO-LCC technique has accomplished a superior performance with maximum liver cancer classification outcome.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Comparative <inline-formula id="ieqn-106">
<mml:math id="mml-ieqn-106"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> results of IAIEO-LCC technique</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_26877-fig-12.png"/>
</fig>
</sec>
<sec id="s4">
<label>4</label>
<title>Conclusion</title>
<p>In this study, an effective IAIEO-LCC technique has been developed to differentiate various classes of liver cancer images. The presented IAIEO-LCC technique primarily undergoes MF-based noise elimination, data augmentation, KE-based segmentation, VGG-19 based feature extraction, EO-based hyperparameter tuning, and SGRU-based classification. SGRU classifier is exploited to detect and classify the liver cancer images effectively. In order to demonstrate the superiority of the proposed IAIEO-LCC technique in terms of performance, a wide range of simulations was conducted and the results were inspected under distinct measures. The experimental results established the superiority of the proposed IAIEO-LCC technique over recent approaches. Thus, IAIEO-LCC technique can be utilized for the classification of liver cancer images. In future, deep instance segmentation approaches can be followed to improve the detection performance of IAIEO-LCC technique.</p>
</sec>
</body>
<back>
<ack>
<p>The Deanship of Scientific Research (DSR) at King Abdulaziz University, Jeddah, Saudi Arabia has funded this project, under grant no. (FP-206-43). The authors, therefore acknowledge with thanks DSR for technical and financial support.</p>
</ack><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> The Deanship of Scientific Research (DSR) at King Abdulaziz University, Jeddah, Saudi Arabia has funded this project, under grant no. (FP-206-43).</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>A. B.</given-names> <surname>Cohen</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Diamant</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Klang</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Amitai</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Greenspan</surname></string-name></person-group>, &#x201C;<chapter-title>Fully convolutional network for liver segmentation and lesions detection</chapter-title>,&#x201D; in <source>Deep Learning and Data Labeling for Medical Applications, DLMIA 2016, LABELS 2016. Lecture Notes in Computer Science</source>, vol. <volume>10008</volume>, <publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>77</fpage>&#x2013;<lpage>85</lpage>, <year>2016</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>N.</given-names> <surname>Nanda</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Kakkar</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Nagpal</surname></string-name></person-group>, &#x201C;<article-title>Computer-aided segmentation of liver lesions in CT scans using cascaded convolutional neural networks and genetically optimised classifier</article-title>,&#x201D; <source>Arabian Journal for Science and Engineering</source>, vol. <volume>44</volume>, no. <issue>4</issue>, pp. <fpage>4049</fpage>&#x2013;<lpage>4062</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Liang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Lin</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Hu</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>CasCRNN-GL-Net: Cascaded convolutional and recurrent neural networks with global and local pathways for classification of focal liver lesions in multi-phase CT images</article-title>,&#x201D; <source>Communications in Information and Systems</source>, vol. <volume>20</volume>, no. <issue>4</issue>, pp. <fpage>415</fpage>&#x2013;<lpage>442</lpage>, <year>2020</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>F.</given-names> <surname>&#x00D6;zyurt</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Tuncer</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Avci</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ko&#x00E7;</surname></string-name> and <string-name><given-names>&#x0130;.</given-names> <surname>Serhatlio&#x011F;lu</surname></string-name></person-group>, &#x201C;<article-title>A novel liver image classification method using perceptual hash-based convolutional neural network</article-title>,&#x201D; <source>Arabian Journal for Science and Engineering</source>, vol. <volume>44</volume>, no. <issue>4</issue>, pp. <fpage>3173</fpage>&#x2013;<lpage>3182</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. M.</given-names> <surname>Anwar</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Majid</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Qayyum</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Awais</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Alnowami</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Medical image analysis using convolutional neural networks: A review</article-title>,&#x201D; <source>Journal of Medical Systems</source>, vol. <volume>42</volume>, no. <issue>11</issue>, pp. <fpage>226</fpage>, <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>B.</given-names> <surname>Sahiner</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Pezeshk</surname></string-name>, <string-name><given-names>L. M.</given-names> <surname>Hadjiiski</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Drukke</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Deep learning in medical imaging and radiation therapy</article-title>,&#x201D; <source>Medical Physics</source>, vol. <volume>46</volume>, no. <issue>1</issue>, pp. <fpage>e1</fpage>&#x2013;<lpage>e36</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H. C.</given-names> <surname>Shin</surname></string-name>, <string-name><given-names>H. R.</given-names> <surname>Roth</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Lu</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Xu</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Deep convolutional neural networks for computer-aided detection: Cnn architectures, dataset characteristics and transfer learning</article-title>,&#x201D; <source>IEEE Transactions on Medical Imaging</source>, vol. <volume>35</volume>, no. <issue>5</issue>, pp. <fpage>1285</fpage>&#x2013;<lpage>1298</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Iwamoto</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Han</surname></string-name>, <string-name><given-names>Y. W.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Chen</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Classification of focal liver lesions using deep learning with fine-tuning</article-title>,&#x201D; in <conf-name>Proc. of the 2018 Int. Conf. on Digital Medicine and Image Processing</conf-name>, <publisher-loc>Okinawa Japan</publisher-loc>, pp. <fpage>56</fpage>&#x2013;<lpage>60</lpage>, <year>2018</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>X.</given-names> <surname>Dong</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Peng</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Lou</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Liver cancer detection using hybridized fully convolutional neural network based on deep learning framework</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>129889</fpage>&#x2013;<lpage>129898</lpage>, <year>2020</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>S.</given-names> <surname>Naeem</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Ali</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Qadri</surname></string-name>, <string-name><given-names>W. K.</given-names> <surname>Mashwani</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Tairan</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Machine-learning based hybrid-feature analysis for liver cancer classification using fused (MR and CT) images</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>10</volume>, no. <issue>9</issue>, pp. <fpage>3134</fpage>, <year>2020</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>B.</given-names> <surname>Mao</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Ma</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Duan</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Xia</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Tao</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Preoperative classification of primary and metastatic liver cancer via machine learning-based ultrasound radiomics</article-title>,&#x201D; <source>European Radiology</source>, vol. <volume>31</volume>, no. <issue>7</issue>, pp. <fpage>4576</fpage>&#x2013;<lpage>4586</lpage>, <year>2021</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>L.</given-names> <surname>Ding</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Wu</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Application of an extreme learning machine network with particle swarm optimization in syndrome classification of primary liver cancer</article-title>,&#x201D; <source>Journal of Integrative Medicine</source>, vol. <volume>19</volume>, no. <issue>5</issue>, pp. <fpage>395</fpage>&#x2013;<lpage>407</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Rajesh</surname></string-name>, <string-name><given-names>N. A.</given-names> <surname>Choudhury</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Moulik</surname></string-name></person-group>, &#x201C;<article-title>Hepatocellular carcinoma (HCC) liver cancer prediction using machine learning algorithms</article-title>,&#x201D; in <conf-name>2020 IEEE 17th India Council Int. Conf. (INDICON)</conf-name>, <publisher-loc>New Delhi, India</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>, <year>2020</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>M.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Topatana</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Cao</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhu</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Classification and mutation prediction based on histopathology H&#x0026;E images in liver cancer using deep learning</article-title>,&#x201D; <source>NPJ Precision Oncology</source>, vol. <volume>4</volume>, no. <issue>1</issue>, pp. <fpage>14</fpage>, <year>2020</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>R.</given-names> <surname>Panthong</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Srivihok</surname></string-name></person-group>, &#x201C;<article-title>Liver cancer classification model using hybrid feature selection based on class-dependent technique for the central region of thailand</article-title>,&#x201D; <source>Information</source>, vol. <volume>10</volume>, no. <issue>6</issue>, pp. <fpage>187</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. A.</given-names> <surname>Basset</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Chang</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Mohamed</surname></string-name></person-group>, &#x201C;<article-title>A novel equilibrium optimization algorithm for multi-thresholding image segmentation problems</article-title>,&#x201D; <source>Neural Computing and Applications</source>, vol. <volume>33</volume>, no. <issue>17</issue>, pp. <fpage>10685</fpage>&#x2013;<lpage>10718</lpage>, <year>2021</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>M.</given-names> <surname>Mateen</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wen</surname></string-name>, <string-name><surname>Nasrullah</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Song</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Huang</surname></string-name></person-group>, &#x201C;<article-title>Fundus image classification using vgg-19 architecture with PCA and SVD</article-title>,&#x201D; <source>Symmetry</source>, vol. <volume>11</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>, <year>2018</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>M. A.</given-names> <surname>Basset</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Chang</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Mohamed</surname></string-name></person-group>, &#x201C;<article-title>A novel equilibrium optimization algorithm for multi-thresholding image segmentation problems</article-title>,&#x201D; <source>Neural Computing and Applications</source>, vol. <volume>33</volume>, no. <issue>17</issue>, pp. <fpage>10685</fpage>&#x2013;<lpage>10718</lpage>, <year>2021</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.</given-names> <surname>Faramarzi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Heidarinejad</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Stephens</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Mirjalili</surname></string-name></person-group>, &#x201C;<article-title>Equilibrium optimizer: A novel optimization algorithm</article-title>,&#x201D; <source>Knowledge-Based Systems</source>, vol. <volume>191</volume>, pp. <fpage>105190</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Xie</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Su</surname></string-name></person-group>, &#x201C;<article-title>Decomposition-based multistep sea wind speed forecasting using stacked gated recurrent unit improved by residual connections</article-title>,&#x201D; <source>Complexity</source>, vol. <volume>2021</volume>, no. <issue>10</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Das</surname></string-name>, <string-name><given-names>U. R.</given-names> <surname>Acharya</surname></string-name>, <string-name><given-names>S. S.</given-names> <surname>Panda</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Sabut</surname></string-name></person-group>, &#x201C;<article-title>Deep learning based liver cancer detection using watershed transform and Gaussian mixture model techniques</article-title>,&#x201D; <source>Cognitive Systems Research</source>, vol. <volume>54</volume>, no. <issue>3&#x2013;4</issue>, pp. <fpage>165</fpage>&#x2013;<lpage>175</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Naeem</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Ali</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Qadri</surname></string-name>, <string-name><given-names>W. K.</given-names> <surname>Mashwani</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Tairan</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Machine-learning based hybrid-feature analysis for liver cancer classification using fused (MR and CT) images</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>10</volume>, no. <issue>9</issue>, pp. <fpage>3134</fpage>, <year>2020</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>