<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">25577</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2022.025577</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Intelligent Deep Transfer Learning Based Malaria Parasite Detection and Classification Model Using Biomedical Image</article-title>
<alt-title alt-title-type="left-running-head">Intelligent Deep-Transfer-Learning-Based Malaria Parasite Detection in Blood Smear Images</alt-title>
<alt-title alt-title-type="right-running-head">Intelligent Deep-Transfer-Learning-Based Malaria Parasite Detection in Blood Smear Images</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Alassaf</surname><given-names>Ahmad</given-names></name></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Sikkandar</surname><given-names>Mohamed Yacin</given-names></name><email>m.sikkandar@mu.edu.sa</email>
</contrib>
<aff><institution>Department of Medical Equipment Technology, College of Applied Medical Sciences, Majmaah University</institution>, <addr-line>Al Majmaah, 11952</addr-line>, <country>Saudi Arabia</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Mohamed Yacin Sikkandar. Email: <email>m.sikkandar@mu.edu.sa</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-04-20"><day>20</day>
<month>04</month>
<year>2022</year></pub-date>
<volume>72</volume>
<issue>3</issue>
<fpage>5273</fpage>
<lpage>5285</lpage>
<history>
<date date-type="received"><day>29</day><month>11</month><year>2021</year></date>
<date date-type="accepted"><day>09</day><month>2</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Alassaf and Sikkandar</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Alassaf and Sikkandar</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_25577.pdf"></self-uri>
<abstract>
<p>Malaria is a severe disease caused by Plasmodium parasites, which can be detected through blood smear images. The early identification of the disease can effectively reduce the severity rate. Deep learning (DL) models can be widely employed to analyze biomedical images, thereby minimizing the misclassification rate. With this objective, this study developed an intelligent deep-transfer-learning-based malaria parasite detection and classification (IDTL-MPDC) model on blood smear images. The proposed IDTL-MPDC technique aims to effectively determine the presence of malarial parasites in blood smear images. In addition, the IDTL-MPDC technique derives median filtering (MF) as a pre-processing step. In addition, a residual neural network (Res2Net) model was employed for the extraction of feature vectors, and its hyperparameters were optimally adjusted using the differential evolution (DE) algorithm. The <italic>k</italic>-nearest neighbor (KNN) classifier was used to assign appropriate classes to the blood smear images. The optimal selection of Res2Net hyperparameters by the DE model helps achieve enhanced classification outcomes. A wide range of simulation analyses of the IDTL-MPDC technique are carried out using a benchmark dataset, and its performance seems to be highly accurate (95.86&#x0025;), highly sensitive (95.82&#x0025;), highly specific (95.98&#x0025;), with a high F1 score (95.69&#x0025;), and high precision (95.86&#x0025;), and it has been proven to be better than the other existing methods.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Computer-aided diagnosis</kwd>
<kwd>malaria parasites</kwd>
<kwd>biomedical images</kwd>
<kwd>blood smear images</kwd>
<kwd>deep learning</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>Malaria is a life-threatening disease caused by the Plasmodium parasite, and is a serious health concern worldwide. According to reports by the World Health Organization (WHO) in 2017, nearly 219 million cases of malaria occurred in 87 countries worldwide [<xref ref-type="bibr" rid="ref-1">1</xref>]. The WHO selected the Eastern Mediterranean, Western Pacific, Americas, and Southeast Asia as high-risk regions. Malaria is curable and can be prevented when appropriate measures and initiatives are effectively taken, which rely mainly on earlier diagnoses of the malaria parasite [<xref ref-type="bibr" rid="ref-2">2</xref>]. Various methods have been reported to detect malarial parasites in the blood, such as microscopic diagnosis, medical diagnosis [<xref ref-type="bibr" rid="ref-3">3</xref>], polymerase chain reaction (PCR), and rapid diagnostic test (RDT) [<xref ref-type="bibr" rid="ref-4">4</xref>].</p>
<p>Traditional diagnostic approaches such as PCR and other clinical diagnostic methods are dependent on experimental settings; eventually, the accuracy and efficiency depend significantly on the purely subjective knowledge of individuals. This limited knowledge is unable to reach remote locations where malaria could be predominant. Microscopic diagnosis and the RDT are effective malaria diagnostic technologies that make a large contribution to malaria control in the present scenario [<xref ref-type="bibr" rid="ref-5">5</xref>]. The RDT is a powerful diagnostic method that does not require any microscope or trained professionals and can offer diagnoses within 15&#x2005;min. However, the RDT method has some limitations, including the inability to quantify parasite density, low sensitivity, susceptibility to damage by heat and humidity, high cost compared with light microscopy, and inability to differentiate between <italic>Plasmodium malariae</italic>, <italic>P. vivax</italic>, and <italic>P. ovale</italic>. These drawbacks can be overcome by the microscopic system and thus it is categorized as an efficient method to detect malarial parasites but requires the presence of a professional microscopist [<xref ref-type="bibr" rid="ref-6">6</xref>].</p>
<p>Microscopic inspection is considered a primary and typical technique for malaria diagnosis [<xref ref-type="bibr" rid="ref-7">7</xref>] to detect the occurrence of parasites from a blood drop in a thick blood smear. The investigation accuracy is based on an efficient technician examining and classifying the parasitized and uninfected blood cells found in the blood smear. Automated microscopic malaria parasite diagnosis could be a powerful diagnostic method that includes segmentation of cells and classification of infected cells and the acquisition of microscopic blood smear images [<xref ref-type="bibr" rid="ref-8">8</xref>]. It should be noted that the effective identification of malarial parasites and segmentation of blood cells could be utilized to carry out counting.</p>
<p>Conventional methods for malaria diagnosis are time consuming, might create incorrect reports because of human errors, and are not suitable for wide-ranging diagnosis. This motivated us to present an automated diagnosis of malaria using deep-learning (DL) algorithms. Various concepts exist towards the recognition of malaria parasites in microscopic images via a pre-trained variant of a convolutional neural network (CNN) [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-10">10</xref>]. Chakradeo et al. [<xref ref-type="bibr" rid="ref-11">11</xref>] introduced a visual geometry group (VGG)-based approach and compared it with previously presented methods for identifying diseased cells. It exceeds the accuracy of most previously presented methods in a range of metrics. Hence, it reduces the computational time and consumption of technical resources.</p>
<p>Fuhad et al. [<xref ref-type="bibr" rid="ref-12">12</xref>] presented an automatic CNN-based algorithm for malaria detection using microscopic blood smears. This involves different methods, such as data augmentation, knowledge distillation, and feature extraction. An autoencoder is categorized as a support vector machine (SVM) or <italic>k</italic>-nearest neighbor (KNN). CNN models execute the training process at three levels, autoencoder training, general training, and distillation training, to improve and optimize the inference performance and model accuracy.</p>
<p>Researchers have designed a traditional CNN method to distinguish between infected and healthy blood samples [<xref ref-type="bibr" rid="ref-13">13</xref>]. The proposed method contains fully connected (FC) layers and three convolutional layers. The neural network system proposed a cascade of numerous convolution layers having different filters existing in each layer that produces better accuracy according to the available resources. The method was implemented on various blood sample images to investigate its accuracy.</p>
<p>Li et al. [<xref ref-type="bibr" rid="ref-14">14</xref>] presented a DL method to detect malaria parasites at different levels from blood smears with deep transfer to a graph convolution network (DTGCN). This is the primary application of the graph convolution network (GCN) model for multistage malaria parasite detection in an image. Rahman et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] converted a malaria parasite object recognition dataset to data classification, which makes it the prime malaria classification dataset, and estimated the performance of many advanced deep neural network (DNN) frameworks pre-trained on medical and normal images on this novel dataset. Researchers analyzed the effects of pre-processing and found that a custom architecture, VGG-16, and a residual neural network (ResNet) formed in an earlier study have been employed [<xref ref-type="bibr" rid="ref-16">16</xref>]. The pre-processing method was investigated, which includes comprehensive normalization and gray-world normalization.</p>
<p>In this study, we developed an intelligent deep transfer learning-based malaria parasite detection and classification (IDTL-MPDC) model using blood-smear images. In addition, the IDTL-MPDC technique derives median filtering (MF) as a pre-processing step. The Res2Net model was employed for the extraction of feature vectors, and its hyperparameters were optimally adjusted using the differential evolution (DE) algorithm. Furthermore, the KNN classifier was used to assign appropriate classes to the blood smear images. The optimal selection of Res2Net hyperparameters by the DE model helps achieve enhanced classification outcomes. A wide range of simulation analyses of the IDTL-MPDC technique were performed using a benchmark dataset.</p>
</sec>
<sec id="s2"><label>2</label><title>The Proposed Model</title>
<p>In this study, a new IDTL-MPDC technique was developed to effectively determine the presence of malarial parasites using blood smear images. The IDTL-MPDC technique involves various sub-processes, namely, MF-based pre-processing, Res2Net-based feature extraction, DE-based hyperparameter optimization, and KNN-based classification.</p>
<sec id="s2_1"><label>2.1</label><title>Pre-processing Using the MF Technique</title>
<p>The major drawback of the blood smear image is the poor quality of the image owing to spot noise. Spot noise is a disadvantage because it affects single interpretation and recognition processes and undermines the image quality. Consequently, point refining is a major phase in the recognition, extraction, and analysis of healthcare images. In various effective approaches for removing noise from healthcare images, the MF technique is used because of its specificity, which has applications in healthcare image noise elimination [<xref ref-type="bibr" rid="ref-17">17</xref>]. The basic concept behind the median filter is to introduce an <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>m</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:math></inline-formula> neighborhood to select the median value of the ordered number, replace the central pixel, and assemble each neighborhood in ascending order. This can be expressed as
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2208;</mml:mo><mml:mi>C</mml:mi></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo><mml:mo>,</mml:mo></mml:math></disp-formula>where <italic>C</italic> signifies the neighborhood centered around the position <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>n</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> of an image. In this study, median filtering was adopted to remove digital noise from the input image, and a filter mask with a size of <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula> was applied.</p>
</sec>
<sec id="s2_2"><label>2.2</label><title>Feature Extraction Using the Res2Net Model</title>
<p>Next, the pre-processed blood smear image is passed to the Res2Net model to derive the feature vectors. The Res2Net block [<xref ref-type="bibr" rid="ref-18">18</xref>] is different from ResNet, which utilizes many sets of convolution functions and concepts of hierarchical influences in a single remaining block. It is distinct from the multi-scale feature removal techniques that use a layer-wise approach, as the Res2Net block removes multi-scale features at the granular level and improves the range of receptive domains of every convolution layer.</p>
<p>As illustrated in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, an input is primarily referred to as a group of <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> convolution kernels, and the resultant feature maps are separated into four sets, followed by <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> convolution. The primary set of feature maps <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> has no convolutional function. In the secondary set of feature maps <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, a group of <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula> convolution kernels is utilized for extracting the feature in it, and the outcome is <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. Then, <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and the tertiary set of feature maps <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are aimed at the secondary group of <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula> convolution kernels, and the outcome is <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. Subsequently, <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and the quarter set of feature maps <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are aimed at the tertiary set of <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula> convolution kernels, and the outcome is <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mo>.</mml:mo></mml:math></inline-formula> Eventually, the resultant feature map in every set is concatenated and aimed at other groups of 11 convolution kernels to fuse the feature. Related to the residual block under ResNet, Res2Net utilizes the remaining link to connect the input to the outcome of the final set of convolutional functions. As the input feature is changed to the resultant features with several paths, the receptive domains are improved if the group of convolution kernels is passed.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>(a) ResNet Model (b) Res2Net Model</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_25577-fig-1.png"/></fig>
</sec>
<sec id="s2_3"><label>2.3</label><title>Hyperparameter Tuning Using the DE Technique</title>
<p>The DE technique can be utilized to optimally adjust the hyperparameters of the Res2Net model. The DE technique has primarily been established in [<xref ref-type="bibr" rid="ref-19">19</xref>]. The vital model after the DE technique is a process to create a testing parameter vector and more weight variance between two population vectors to the third one. As another evolutionary technique, the DE approach aims at developing a population of <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>D</mml:mi></mml:math></inline-formula> dimension parameter vectors that are assumed as individuals that encode the candidate solution, for instance,
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mover><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo><mml:mo>,</mml:mo></mml:math></disp-formula>
where <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow><mml:mo>.</mml:mo></mml:math></inline-formula></p>
<p><bold>Step 1:</bold> Initialize every individual arbitrarily (in bounds <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn></mml:math></inline-formula> and <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mo>+</mml:mo><mml:mn>2</mml:mn></mml:math></inline-formula>) of <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> population
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>g</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mtext>where</mml:mtext></mml:mrow><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p><bold>Step 2:</bold> Mutation:</p>
<p>For <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> to <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, we create the mutation vector <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><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:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>g</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula> equivalent to the target vector <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> using
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:mtext>&#x201C;</mml:mtext></mml:mrow><mml:mi>D</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>1</mml:mn><mml:mo>:</mml:mo><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:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>g</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>g</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>best</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>g</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>g</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:mtext>g</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:mrow></mml:msubsup></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:mtext>g</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:mrow></mml:msubsup></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>The optimum value of <italic>F</italic> defined in this study was equivalent to 0.5.</p>
<p><bold>Step 3:</bold> Crossover:</p>
<p>Generate testing vector <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>u</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> to all target vectors <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo></mml:math></inline-formula> where</p>
<p><inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>u</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mtext>I</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>g</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula> as follows:</p>
<p>for <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> to <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>j</mml:mi><mml:mrow><mml:mi>R</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2217;</mml:mo><mml:mi>D</mml:mi></mml:mrow><mml:mo stretchy="false">]</mml:mo><mml:mo>;</mml:mo></mml:math></inline-formula> for <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mspace width="thickmathspace" /><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>D</mml:mi><mml:mo>.</mml:mo></mml:math></inline-formula>
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mtext>      if&#xA0;</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mtext>otherwise</mml:mtext></mml:mrow><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:math></disp-formula>end</p>
<p><bold>Step 4:</bold> Selection:</p>
<p>for <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> to <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo></mml:math></inline-formula>
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>g</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>u</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>g</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mtext>    if&#xA0;</mml:mtext></mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>u</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>g</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mtext>otherwise</mml:mtext></mml:mrow><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mspace width="thickmathspace" /></mml:math></disp-formula>end</p>
<p><bold>Step 5:</bold> Increase the generation number <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>g</mml:mi><mml:mo>=</mml:mo><mml:mi>g</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>.</p>
<p>Because the generation cycle is repeated in Step 2, the maximum number of generation cycles is attained. The great minimal error fitness and its equivalent better vectors containing <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>N</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> amount of <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mi>h</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> coefficient are defined. Eventually, an entire optimum filter coefficient equivalent to <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is attained by copy and concatenation of beyond coefficients to obtain the last optimum frequency spectrum of the finite impulse response (FIR) filter.
</p>
<fig id="fig-11"><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_25577-fig-11.png"/>
</fig>
</sec>
<sec id="s2_4"><label>2.4</label><title>Image Classification Using the KNN Technique</title>
<p>In the last stage, the KNN model receives the features as input and projects proper class labels. KNN is a simple machine learning (ML) technique. To define the classification of the testing data, KNN executes a test to check the amount of similarity among <italic>k</italic> trained data and documents to save a specific number of classified information [<xref ref-type="bibr" rid="ref-20">20</xref>]. As KNN categorizes instances, in this work, it would be benign and malicious code instances near the training space. The classification of unknown instances can be implemented by evaluating the distance between the unknown instances and training instances. As the instance is categorized according to the majority vote of neighbor, the most widespread neighbor is evaluated by a distance function. When <italic>k</italic>=1, the instance is allocated to the class of its adjacent neighbors. In <italic>n</italic>-dimensional space, distance between <italic>x</italic> and <italic>y</italic> can be attained by a distance function defined as follows:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msqrt><mml:munderover><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:mi>k</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:msqrt><mml:mo>.</mml:mo><mml:mspace width="thickmathspace" /></mml:math></disp-formula></p>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Experimental Validation</title>
<p>To examine the malaria detection performance of the IDTL-MPDC technique, an experimental result analysis was performed on the open-access malaria dataset. It comprises 27558 cell images under two categories, parasitized and uninfected cells, with identical numbers of samples, as shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<p><xref ref-type="table" rid="table-1">Tab. 1</xref> lists the overall malaria classification results of the IDTL-MPDC technique under varying epoch counts.</p>
<p><xref ref-type="fig" rid="fig-3">Fig. 3</xref> presents a brief <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><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> analysis of the IDTL-MPDC technique in the presence of distinct epochs. The figure shows that the IDTL-MPDC technique achieves better <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><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 for every epoch. For instance, the IDTL-MPDC technique achieved <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> of 95.85&#x0025; and 95.41&#x0025; under lower epoch counts of 100 and 200, respectively. Similarly, the IDTL-MPDC technique achieved <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><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&#x0025; and 95.46&#x0025; under maximum epoch counts of 900 and 1000, respectively.</p>
<p>A detailed <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><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> analysis of the IDTL-MPDC technique with various epochs is shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. The results revealed that the IDTL-MPDC technique offered increased values of <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><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>. For instance, with 100 epochs, the IDTL-MPDC technique has obtained <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><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> and <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><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 95.67&#x0025; and 95.99&#x0025;, respectively. Simultaneously, with 400 epochs, the IDTL-MPDC manner has achieved <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><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> and <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><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 95.86&#x0025; and 95.81&#x0025;, respectively. Moreover, after 700 epochs, the IDTL-MPDC technique achieved <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> and <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> of 95.19&#x0025; and 95.46&#x0025;, respectively. Eventually, after 1000 epochs, the IDTL-MPDC algorithm achieved <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><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> and <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><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 95.46&#x0025; and 95.09&#x0025;, respectively.</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>Sample images</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_25577-fig-2.png"/></fig>
<table-wrap id="table-1"><label>Table 1</label><caption><title>Malaria classification results analysis of IDTL-MPDC technique</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">No. of Epochs</th>
<th align="left">Precision</th>
<th align="left">Sensitivity</th>
<th align="left">Specificity</th>
<th align="left">Accuracy</th>
<th align="left">F1 score</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">100</td>
<td align="left">95.85</td>
<td align="left">95.67</td>
<td align="left">95.99</td>
<td align="left">95.85</td>
<td align="left">95.00</td>
</tr>
<tr>
<td align="left">200</td>
<td align="left">95.01</td>
<td align="left">95.45</td>
<td align="left">95.14</td>
<td align="left">95.41</td>
<td align="left">95.93</td>
</tr>
<tr>
<td align="left">300</td>
<td align="left">95.53</td>
<td align="left">95.47</td>
<td align="left">95.17</td>
<td align="left">95.51</td>
<td align="left">95.17</td>
</tr>
<tr>
<td align="left">400</td>
<td align="left">95.48</td>
<td align="left">95.86</td>
<td align="left">95.81</td>
<td align="left">95.67</td>
<td align="left">95.52</td>
</tr>
<tr>
<td align="left">500</td>
<td align="left">95.08</td>
<td align="left">95.77</td>
<td align="left">95.70</td>
<td align="left">95.73</td>
<td align="left">95.29</td>
</tr>
<tr>
<td align="left">600</td>
<td align="left">95.86</td>
<td align="left">95.82</td>
<td align="left">95.98</td>
<td align="left">95.86</td>
<td align="left">95.69</td>
</tr>
<tr>
<td align="left">700</td>
<td align="left">95.04</td>
<td align="left">95.19</td>
<td align="left">95.46</td>
<td align="left">95.06</td>
<td align="left">95.13</td>
</tr>
<tr>
<td align="left">800</td>
<td align="left">95.50</td>
<td align="left">95.17</td>
<td align="left">95.68</td>
<td align="left">95.42</td>
<td align="left">95.71</td>
</tr>
<tr>
<td align="left">900</td>
<td align="left">95.65</td>
<td align="left">95.57</td>
<td align="left">95.35</td>
<td align="left">95.59</td>
<td align="left">95.40</td>
</tr>
<tr>
<td align="left">1000</td>
<td align="left">95.47</td>
<td align="left">95.46</td>
<td align="left">95.09</td>
<td align="left">95.46</td>
<td align="left">95.05</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>A comprehensive <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><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-69"><mml:math id="mml-ieqn-69"><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mn>1</mml:mn><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> analysis of the IDTL-MPDC system with varying epochs is shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>. The results show that the IDTL-MPDC methodology can improve the values of <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><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-71"><mml:math id="mml-ieqn-71"><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mn>1</mml:mn><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>. For example, with 100 epochs, the IDTL-MPDC methodology obtained <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:mi>F</mml:mi><mml:mrow><mml:msub><mml:mn>1</mml:mn><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 95.85&#x0025; and 95&#x0025;, respectively. Simultaneously, with 400 epochs, the IDTL-MPDC technique achieved <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><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-75"><mml:math id="mml-ieqn-75"><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mn>1</mml:mn><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 95.48&#x0025; and 95.52&#x0025;, respectively. Moreover, after 700 epochs, the IDTL-MPDC system achieved <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><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-77"><mml:math id="mml-ieqn-77"><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mn>1</mml:mn><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 95.04&#x0025; and 95.13&#x0025;, respectively. Eventually, after 1000 epochs, the IDTL-MPDC technique obtained <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><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-79"><mml:math id="mml-ieqn-79"><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mn>1</mml:mn><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 95.47&#x0025; and 95.05&#x0025;, respectively.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>Result analysis of the IDTL-MPDC technique in terms of accuracy</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_25577-fig-3.png"/></fig>
<fig id="fig-4"><label>Figure 4</label><caption><title>Result analysis of the IDTL-MPDC technique in terms of <inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_25577-fig-4.png"/></fig>
<fig id="fig-5"><label>Figure 5</label><caption><title>Result analysis of the IDTL-MPDC technique in terms of <inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><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-95"><mml:math id="mml-ieqn-95"><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mn>1</mml:mn><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></title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_25577-fig-5.png"/></fig>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> depicts the receiver operating characteristic (ROC) curve analysis of the use of the IDTL-MPDC technique on the test dataset. The figure states that the IDTL-MPDC technique has attained improved outcomes with the maximal ROC of 98.6290.</p>
<fig id="fig-6"><label>Figure 6</label><caption><title>ROC analysis of IDTL-MPDC technique</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_25577-fig-6.png"/></fig>
<p><xref ref-type="fig" rid="fig-7">Fig. 7</xref> shows the ROC analysis of the IDTL-MPDC technique on the test dataset. The figure exposed that the IDTL-MPDC technique has reached an enhanced outcome with the minimum ROC of 97.9295.</p>
<p><xref ref-type="table" rid="table-2">Tab. 2</xref> provides an extensive comparative analysis of the IDTL-MPDC technique with other recent methods [<xref ref-type="bibr" rid="ref-21">21</xref>]. <xref ref-type="fig" rid="fig-8">Fig. 8</xref> depicts the <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> analysis of the IDTL-MPDC technique with other techniques. The figure shows that the AIPM-CM and ML-ASM techniques have lower <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> values of 73&#x0025; and 84&#x0025;, respectively. This is followed by the Inception-v3, You only look once (YOLO)v3, YOLO-v4, and Faster Region-Based Convolutional Neural Network (RCNN) models that exhibit moderate <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> values of 93.06&#x0025;, 93.15&#x0025;, 94.75&#x0025;, and 93.26&#x0025;, respectively. However, the IDTL-MPDC technique has outperformed the other techniques with a maximum <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> of 95.86&#x0025;.</p>
<p><xref ref-type="fig" rid="fig-9">Fig. 9</xref> illustrates the <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mn>1</mml:mn><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> analysis of the IDTL-MPDC method with other algorithms. The figure clearly shows that the AIPM-CM and ML-ASM techniques have reduced <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mn>1</mml:mn><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 of 79&#x0025; and 81&#x0025;, respectively. In addition, the Inception-v3, YOLO-v3, YOLO-v4, and Faster R-CNN models displayed moderate <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mn>1</mml:mn><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 of 93.06&#x0025;, 92&#x0025;, 91&#x0025;, and 89.71&#x0025;, respectively. The IDTL-MPDC model outperformed the other approaches with a maximum <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mn>1</mml:mn><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 95.69&#x0025;.</p>
<fig id="fig-7"><label>Figure 7</label><caption><title>ROC analysis of IDTL-MPDC technique</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_25577-fig-7.png"/></fig>
<table-wrap id="table-2"><label>Table 2</label><caption><title>Comparative analysis of the IDTL-MPDC technique with different measures</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Method</th>
<th align="left">Accuracy</th>
<th align="left">Sensitivity</th>
<th align="left">Specificity</th>
<th align="left">F1 score</th>
<th align="left">Precision</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">AIPM-CM</td>
<td align="left">73.00</td>
<td align="left">85.00</td>
<td align="left">72.00</td>
<td align="left">79.00</td>
<td align="left">76.00</td>
</tr>
<tr>
<td align="left">ML-ASM</td>
<td align="left">84.00</td>
<td align="left">98.10</td>
<td align="left">68.90</td>
<td align="left">81.00</td>
<td align="left">83.00</td>
</tr>
<tr>
<td align="left">Inception-v3 model</td>
<td align="left">93.06</td>
<td align="left">92.97</td>
<td align="left">93.13</td>
<td align="left">93.06</td>
<td align="left">93.06</td>
</tr>
<tr>
<td align="left">YOLO-V3</td>
<td align="left">93.15</td>
<td align="left">92.00</td>
<td align="left">93.25</td>
<td align="left">92.00</td>
<td align="left">91.00</td>
</tr>
<tr>
<td align="left">YOLO-V4</td>
<td align="left">94.75</td>
<td align="left">92.00</td>
<td align="left">95.23</td>
<td align="left">92.00</td>
<td align="left">92.00</td>
</tr>
<tr>
<td align="left">Faster R-CNN</td>
<td align="left">93.26</td>
<td align="left">86.90</td>
<td align="left">94.25</td>
<td align="left">89.71</td>
<td align="left">92.70</td>
</tr>
<tr>
<td align="left">IDTL-MPDC</td>
<td align="left">95.86</td>
<td align="left">95.82</td>
<td align="left">95.98</td>
<td align="left">95.69</td>
<td align="left">95.86</td>
</tr>
</tbody>
</table>
</table-wrap><p><xref ref-type="fig" rid="fig-10">Fig. 10</xref> depicts the <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><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> analysis of the IDTL-MPDC technique with other techniques. The figure stated that the AIPM-CM and ML-ASM techniques have portrayed lower <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><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> values of 76&#x0025; and 83&#x0025;, respectively. The Inception-v3, YOLO-v3, YOLO-v4, and Faster RCNN models have demonstrated moderate <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><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> values of 93.06&#x0025;, 91&#x0025;, 92&#x0025;, and 92.7&#x0025;, respectively. The IDTL-MPDC technique outperformed the other methods with a maximal <inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><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> of 95.86&#x0025;.</p>
<fig id="fig-8"><label>Figure 8</label><caption><title><inline-formula id="ieqn-96"><mml:math id="mml-ieqn-96"><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> analysis of the IDTL-MPDC technique with other existing approaches</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_25577-fig-8.png"/></fig>
<fig id="fig-9"><label>Figure 9</label><caption><title><inline-formula id="ieqn-97"><mml:math id="mml-ieqn-97"><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mn>1</mml:mn><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> analysis of the IDTL-MPDC technique with other existing approaches</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_25577-fig-9.png"/></fig>
<fig id="fig-10"><label>Figure 10</label><caption><title><inline-formula id="ieqn-98"><mml:math id="mml-ieqn-98"><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> analysis of the IDTL-MPDC technique with other existing approaches</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_25577-fig-10.png"/></fig>
</sec>
<sec id="s4"><label>4</label><title>Conclusion</title>
<p>In this study, a new IDTL-MPDC technique has been proposed to effectively determine the presence of malarial parasites in blood smear images. The IDTL-MPDC technique involves various sub-processes, namely, MF-based pre-processing, Res2Net-based feature extraction, DE-based hyperparameter optimization, and KNN-based classification. The optimal selection of Res2Net hyperparameters by the DE model helps achieve enhanced classification outcomes. A wide range of simulation analyses of the IDTL-MPDC technique have been carried out using a benchmark dataset, and the simulation results reported better outcomes than other related techniques. Therefore, the IDTL-MPDC technique can be utilized as a proficient tool for the detection and classification of malarial parasites. In the future, deep instance segmentation techniques should be included to improve the classification performance of the IDTL-MPDC technique.</p>
</sec>
</body>
<back>
<ack>
<p>The authors extend their appreciation to the Deanship of Scientific Research at Majmaah University for funding this study under project number R-2022-76.</p>
</ack>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> The authors received no specific funding for this study.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest regarding this study.</p></fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="web"><person-group person-group-type="author"><collab>Fact Sheet about Malaria</collab></person-group>. <year>2019</year>. Available online: <uri xlink:href="https://www.who.int/news-room/fact-sheets/detail/malaria">https://www.who.int/news-room/fact-sheets/detail/malaria</uri>.</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>I. M.</given-names> <surname>Masanja</surname></string-name>, <string-name><given-names>M. L.</given-names> <surname>McMorrow</surname></string-name>, <string-name><given-names>M. B.</given-names> <surname>Maganga</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Sumari</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Udhayakumar</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Quality assurance of malaria rapid diagnostic tests used for routine patient care in rural Tanzania: Microscopy versus real-time polymerase chain reaction</article-title>,&#x201D; <source>Malaria Journal</source>, vol. <volume>14</volume>, no. <issue>1</issue>, pp. <fpage>85</fpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Poostchi</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Silamut</surname></string-name>, <string-name><given-names>R. J.</given-names> <surname>Maude</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Jaeger</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Thoma</surname></string-name></person-group>, &#x201C;<article-title>Image analysis and machine learning for detecting malaria</article-title>,&#x201D; <source>Translational Research</source>, vol. <volume>194</volume>, pp. <fpage>36</fpage>&#x2013;<lpage>55</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E. I.</given-names> <surname>Obeagu</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Uo</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Is</surname></string-name></person-group>, &#x201C;<article-title>Malaria rapid diagnostic test (RDTs)</article-title>,&#x201D; <source>Annals of Clinical &#x0026; Laboratory Science</source>, vol. <volume>6</volume>, no. <issue>4</issue>:275, pp. <fpage>1</fpage>&#x2013;<lpage>3</lpage>, <year>2018.</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>B. A.</given-names> <surname>Mathison</surname></string-name> and <string-name><given-names>B. S.</given-names> <surname>Pritt</surname></string-name></person-group>, &#x201C;<article-title>Update on malaria diagnostics and test utilization</article-title>,&#x201D; <source>Journal of Clinical Microbiology</source>, vol. <volume>55</volume>, no. <issue>7</issue>, pp. <fpage>2009</fpage>&#x2013;<lpage>2017</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Rajaraman</surname></string-name>, <string-name><given-names>S. K.</given-names> <surname>Antani</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Poostchi</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Silamut</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Hossain</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Pre-trained convolutional neural networks as feature extractors toward improved malaria parasite detection in thin blood smear images</article-title>,&#x201D; <source>PeerJ</source>, vol. <volume>6</volume>, pp. <fpage>e4568</fpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J. A.</given-names> <surname>Quinn</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Nakasi</surname></string-name>, <string-name><given-names>P. K.</given-names> <surname>Mugagga</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Byanyima</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Lubega</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Deep convolutional neural networks for microscopy-based point of care diagnostics</article-title>,&#x201D; in <conf-name>Proc. of the Machine Learning for Healthcare Conf.</conf-name>, <conf-loc>Los Angeles, CA</conf-loc>, vol. <volume>56</volume>, pp. <fpage>271</fpage>&#x2013;<lpage>281</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Subramanian</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Duan</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Bai</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>A portable image-based cytometer for rapid malaria detection and quantification</article-title>,&#x201D; <source>PLoS ONE</source>, vol. <volume>12</volume>, no. <issue>6</issue>, pp. <fpage>e0179161</fpage>, <year>2017</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>J. E.</given-names> <surname>Arco</surname></string-name>, <string-name><given-names>J. M.</given-names> <surname>G&#x00F3;rriz</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Ram&#x00ED;rez</surname></string-name>, <string-name><given-names>I.</given-names> <surname>&#x00C1;lvarez</surname></string-name> and <string-name><given-names>C. G.</given-names> <surname>Puntonet</surname></string-name></person-group>, &#x201C;<article-title>Digital image analysis for automatic enumeration of malaria parasites using morphological operations</article-title>,&#x201D; <source>Expert Systems with Applications</source>, vol. <volume>42</volume>, no. <issue>6</issue>, pp. <fpage>3041</fpage>&#x2013;<lpage>3047</lpage>, <year>2015</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>D.</given-names> <surname>Bibin</surname></string-name>, <string-name><given-names>M. S.</given-names> <surname>Nair</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Punitha</surname></string-name></person-group>, &#x201C;<article-title>Malaria parasite detection from peripheral blood smear images using deep belief networks</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>5</volume>, pp. <fpage>9099</fpage>&#x2013;<lpage>9108</lpage>, <year>2017</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>K.</given-names> <surname>Chakradeo</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Delves</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Titarenko</surname></string-name></person-group>, &#x201C;<article-title>Malaria parasite detection using deep learning methods</article-title>,&#x201D; <source>International Journal of Computer and Information Engineering</source>, vol. <volume>15</volume>, no. <issue>2</issue>, pp. <fpage>175</fpage>&#x2013;<lpage>182</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>K. M. F.</given-names> <surname>Fuhad</surname></string-name>, <string-name><given-names>J. F.</given-names> <surname>Tuba</surname></string-name>, <string-name><given-names>M. R. A.</given-names> <surname>Sarker</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Momen</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Mohammed</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Deep learning based automatic malaria parasite detection from blood smear and its smartphone based application</article-title>,&#x201D; <source>Diagnostics</source>, vol. <volume>10</volume>, no. <issue>5</issue>, pp. <fpage>329</fpage>, <year>2020</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>D.</given-names> <surname>Shah</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Kawale</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Shah</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Randive</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Mapari</surname></string-name></person-group>, &#x201C;<article-title>Malaria parasite detection using deep learning: (Beneficial to humankind)</article-title>,&#x201D; in <conf-name>2020 4th Int. Conf. on Intelligent Computing and Control Systems (ICICCS)</conf-name>, <conf-loc>Madurai, India</conf-loc>,
pp. <fpage>984</fpage>&#x2013;<lpage>988</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Du</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Meng</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Multi-stage malaria parasite recognition by deep learning</article-title>,&#x201D; <source>GigaScience</source>, vol. <volume>10</volume>, no. <issue>6</issue>, pp. <fpage>giab040</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Rahman</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zunair</surname></string-name>, <string-name><given-names>T. R.</given-names> <surname>Reme</surname></string-name>, <string-name><given-names>M. S.</given-names> <surname>Rahman</surname></string-name> and <string-name><given-names>M. R. C.</given-names> <surname>Mahdy</surname></string-name></person-group>, &#x201C;<article-title>A comparative analysis of deep learning architectures on high variation malaria parasite classification dataset</article-title>,&#x201D; <source>Tissue and Cell</source>, vol. <volume>69</volume>, pp. <fpage>101473</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Swastika</surname></string-name>, <string-name><given-names>G. M.</given-names> <surname>Kristianti</surname></string-name> and <string-name><given-names>R. B.</given-names> <surname>Widodo</surname></string-name></person-group>, &#x201C;<article-title>Effective preprocessed thin blood smear images to improve malaria parasite detection using deep learning</article-title>,&#x201D; <source>Journal of Physics: Conference Series</source>, vol. <volume>1869</volume>, no. <issue>1</issue>, pp. <fpage>012092</fpage>, <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>Z.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>F. R.</given-names> <surname>Sheykhahmad</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Ghadimi</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Razmjooy</surname></string-name></person-group>, &#x201C;<article-title>Computer-aided diagnosis of skin cancer based on soft computing techniques</article-title>,&#x201D; <source>Open Medicine</source>, vol. <volume>15</volume>, no. <issue>1</issue>, pp. <fpage>860</fpage>&#x2013;<lpage>871</lpage>, <year>2020</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>S.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Cheng</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Yang</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Res2net: A new multi-scale backbone architecture</article-title>,&#x201D; <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>, vol. <volume>43</volume>, no. <issue>2</issue>, pp. <fpage>652</fpage>&#x2013;<lpage>662</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>S. K.</given-names> <surname>Saha</surname></string-name>, <string-name><given-names>S. P.</given-names> <surname>Ghoshal</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Kar</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Mandal</surname></string-name></person-group>, &#x201C;<article-title>Cat swarm optimization algorithm for optimal linear phase fir filter design</article-title>,&#x201D; <source>ISA Transactions</source>, vol. <volume>52</volume>, no. <issue>6</issue>, pp. <fpage>781</fpage>&#x2013;<lpage>794</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. B.</given-names> <surname>Hassanat</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Abbadi</surname></string-name>, <string-name><given-names>G. A.</given-names> <surname>Altarawneh</surname></string-name> and <string-name><given-names>A. A.</given-names> <surname>Alhasanat</surname></string-name></person-group>, &#x201C;<article-title>Solving the problem of the K parameter in the KNN classifier using an ensemble learning approach</article-title>,&#x201D; <source>International Journal of Computer Science and Information Security</source>, vol. <volume>12</volume>, no. <issue>8</issue>, pp. <fpage>33</fpage>&#x2013;<lpage>39</lpage>, <year>2014</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>Maqsood</surname></string-name>, <string-name><given-names>M. S.</given-names> <surname>Farid</surname></string-name>, <string-name><given-names>M. H.</given-names> <surname>Khan</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Grzegorzek</surname></string-name></person-group>, &#x201C;<article-title>Deep malaria parasite detection in thin blood smear microscopic images</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>11</volume>, no. <issue>5</issue>, pp. <fpage>2284</fpage>, <year>2021</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>