<?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">16816</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2021.016816</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>COVID19 Classification Using CT Images via Ensembles of Deep Learning Models</article-title>
<alt-title alt-title-type="left-running-head">COVID19 Classification Using CT Images Via Ensembles of Deep Learning Models</alt-title>
<alt-title alt-title-type="right-running-head">COVID19 Classification Using CT Images Via Ensembles of Deep Learning Models</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Majid</surname><given-names>Abdul</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Khan</surname><given-names>Muhammad Attique</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-3" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Nam</surname><given-names>Yunyoung</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref>
<xref ref-type="corresp" rid="cor1">&#x002A;</xref>
</contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Tariq</surname><given-names>Usman</given-names></name>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Roy</surname><given-names>Sudipta</given-names></name>
<xref ref-type="aff" rid="aff-4">4</xref>
</contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Mostafa</surname><given-names>Reham R.</given-names></name>
<xref ref-type="aff" rid="aff-5">5</xref>
</contrib>
<contrib id="author-7" contrib-type="author">
<name name-style="western"><surname>Sakr</surname><given-names>Rasha H.</given-names></name>
<xref ref-type="aff" rid="aff-6">6</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Science, HITEC University Taxila</institution>, <addr-line>Taxila, 47080</addr-line>, <country>Pakistan</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Science and Engineering, Soonchunhyang University</institution>, <addr-line>Asan</addr-line>, <country>Korea</country></aff>
<aff id="aff-3"><label>3</label><institution>College of Computer Engineering and Sciences, Prince Sattam Bin Abdulaziz University</institution>, <addr-line>Al-Khraj</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>PRTTL, Washington University in Saint Louis</institution>, <addr-line>Saint Louis, MO 63110</addr-line>, <country>USA</country></aff>
<aff id="aff-5"><label>5</label><institution>Department of Information Systems, Faculty of Computers and Information Sciences, Mansoura University</institution>, <addr-line>Mansoura, 35516</addr-line>, <country>Egypt</country></aff>
<aff id="aff-6"><label>6</label><institution>Department of Computer Science, Faculty of Computers and Information Sciences, Mansoura University</institution>, <addr-line>Mansoura, 35516</addr-line>, <country>Egypt</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1">&#x002A;Corresponding Author: Yunyoung Nam. Email: <email>ynam@sch.ac.kr</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2021-05-31"><day>31</day><month>05</month><year>2021</year></pub-date>
<volume>69</volume>
<issue>1</issue>
<fpage>319</fpage>
<lpage>337</lpage>
<history>
<date date-type="received"><day>12</day><month>1</month><year>2021</year></date>
<date date-type="accepted"><day>20</day><month>3</month><year>2021</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2021 Majid et al.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Majid et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_16816.pdf"></self-uri>
<abstract>
<p>The recent COVID-19 pandemic caused by the novel coronavirus, severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), has had a significant impact on human life and the economy around the world. A reverse transcription polymerase chain reaction (RT-PCR) test is used to screen for this disease, but its low sensitivity means that it is not sufficient for early detection and treatment. As RT-PCR is a time-consuming procedure, there is interest in the introduction of automated techniques for diagnosis. Deep learning has a key role to play in the field of medical imaging. The most important issue in this area is the choice of key features. Here, we propose a set of deep learning features based on a system for automated classification of computed tomography (CT) images to identify COVID-19. Initially, this method was used to prepare a database of three classes: Pneumonia, COVID-19, and Healthy. The dataset consisted of 6000 CT images refined by a hybrid contrast stretching approach. In the next step, two advanced deep learning models (ResNet50 and DarkNet53) were fine-tuned and trained through transfer learning. The features were extracted from the second last feature layer of both models and further optimized using a hybrid optimization approach. For each deep model, the Rao-1 algorithm and the PSO algorithm were combined in the hybrid approach. Later, the selected features were merged using the new minimum parallel distance non-redundant (PMDNR) approach. The final fused vector was finally classified using the extreme machine classifier. The experimental process was carried out on a set of prepared data with an overall accuracy of 95.6&#x0025;. Comparing the different classification algorithms at the different levels of the features demonstrated the reliability of the proposed framework.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>COVID19</kwd>
<kwd>preprocessing</kwd>
<kwd>deep learning</kwd>
<kwd>information fusion</kwd>
<kwd>firefly algorithm</kwd>
<kwd>extreme learning machine</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label><title>Introduction</title>
<p>Coronavirus Disease 2019 (COVID-19) is a contagious disease caused by the novel coronavirus, severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) [<xref ref-type="bibr" rid="ref-1">1</xref>], which was first recognized in Wuhan, China, at the end of 2019 [<xref ref-type="bibr" rid="ref-2">2</xref>]. The COVID-19 pandemic has had a major effect on public health around the world. The symptoms of COVID-19 include fever, headache, shortness of breath, muscle pain, fatigue, and sore throat [<xref ref-type="bibr" rid="ref-3">3</xref>]. Severe outcomes of this disease include organ failure, severe respiratory problems, and death. Approximately 20&#x0025; of COVID-19 cases become severe, and it has an estimated mortality rate of 3&#x0025; [<xref ref-type="bibr" rid="ref-4">4</xref>]. This disease is detected by a reverse transcription polymerase chain reaction (RT-PCR) test, but as the RT-PCR test has low sensitivity it is not sufficient for early detection and treatment [<xref ref-type="bibr" rid="ref-5">5</xref>]. As RT-PCR is a time-consuming procedure, the application of artificial intelligence (AI) and deep learning-based systems would save a great deal of time for physicians [<xref ref-type="bibr" rid="ref-6">6</xref>]. As of February 2021, the total number of recorded COVID-19 cases worldwide is 106,440,335, with 2,322,351 deaths. These statistics show that approximately 3.4&#x0025; of deaths around the entire world are due to COVID-19.</p>
<p>Deep learning has been successfully applied in medical imaging [<xref ref-type="bibr" rid="ref-7">7</xref>&#x2013;<xref ref-type="bibr" rid="ref-9">9</xref>]. The major areas where medical imaging is applied are in the detection of skin cancer [<xref ref-type="bibr" rid="ref-10">10</xref>], brain tumors [<xref ref-type="bibr" rid="ref-11">11</xref>], stomach cancer [<xref ref-type="bibr" rid="ref-12">12</xref>], lung cancer [<xref ref-type="bibr" rid="ref-13">13</xref>], breast cancer [<xref ref-type="bibr" rid="ref-14">14</xref>], blood cancer [<xref ref-type="bibr" rid="ref-15">15</xref>], and COVID-19 [<xref ref-type="bibr" rid="ref-16">16</xref>,<xref ref-type="bibr" rid="ref-17">17</xref>]. Several techniques have been introduced by computer vision (CV) researchers for early coronavirus recognition using chest X-ray [<xref ref-type="bibr" rid="ref-18">18</xref>] and computed tomography (CT) [<xref ref-type="bibr" rid="ref-19">19</xref>] images, and AI and deep learning models have been applied for accurate classification [<xref ref-type="bibr" rid="ref-20">20</xref>,<xref ref-type="bibr" rid="ref-21">21</xref>]. A system has been designed for prediction and detection of COVID-19 on chest X-rays using deep learning [<xref ref-type="bibr" rid="ref-22">22</xref>]. This method is based on AI and uses the features of a convolution neural network (CNN). In the detection phase, three algorithms are used, i.e., the Autoregressive Integrated Moving Average (ARIMA) method, the Prophet Algorithm (PA), and the Long Short-Term Memory (LSTM) neural network. Many other methods are also discussed in the Related Work section.</p>
<p>Several issues remain that are related to the classification of COVID-19 using CT images. The first is the availability of high-dimensional datasets, as an extensive dataset is always needed to train a deep learning model. The second is the selection of a deep model for feature extraction. Several deep models are available for classification purposes and, therefore, the most useful model must be chosen. The third and most important issue is the existence of redundant and irrelevant features that increase the computational time and affect the accuracy of classification. However, some relevant features that are important for improving accuracy are sometimes discarded during the selection of important features.</p>
<p>Here, we propose a new method based on a set of deep learning models. The main purpose of this work was to allow the selection of optimal features from two pre-trained deep learning models and then combine their information. As mentioned above, important features may also be lost in the selection stage. Therefore, optimal information from the two models is used to fill the gap, which improves the accuracy of classification. In this work, we prepared a database of three classes: Pneumonia, COVID-19, and Healthy. The prepared dataset consisted of a total of 6000 CT images adjusted with two pre-trained deep learning models (ResNet50 and DarkNet53) and trained by transfer learning. Later, the features were extracted from the second last layer called the feature layer. A hybrid optimization method is proposed based on the hybrid Rao-1 algorithm and the PSO algorithm. The features of both deep models were optimized by this hybrid method for the next step. Optimal features were merged using a new approach called Parallel Minimum Distance Non-Redundant (PMDNR).</p>
<p>The rest of the article is organized as follows. Related work is discussed in Section 2. Section 3 presents the proposed methodology with the detailed mathematical formulation. The results and discussion are presented in Section 4. Section 5 presents the conclusion.</p>
</sec>
<sec id="s2">
<label>2</label><title>Related Work</title>
<p>In 2020, image processing and CV researchers worked to develop systems for diagnosing and recognizing COVID-19 on CT and X-ray images. These detection systems focused mainly on deep learning to improve efficiency and performance. Apostolopoulos et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] introduced a deep learning-based approach for recognizing COVID-19 on X-ray images. In this method, transfer learning was performed using state-of-the-art CNN models, including VGG-19, Inception ResNet v2, Inception, Xception, and MobileNet v2. The best results were obtained with MobileNet v2, with specificity, accuracy, and sensitivity of 96.46&#x0025;, 96.78&#x0025;, and 98.66&#x0025;, respectively. Ozturk et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] developed a CNN-based automated system for recognizing coronavirus in chest X-ray images, which implemented You Only Look Once (YOLO) and used the DarkNet network for classification to achieve a binary class recognition rate of 98.08&#x0025;. Ismael et al. [<xref ref-type="bibr" rid="ref-25">25</xref>] presented a CNN approach to recognizing COVID-19 in chest X-ray images. In this approach, different deep learning models were used for feature extraction. The extracted features were then passed to a disease-recognition support vector machine (SVM). The maximum accuracy achieved by this method was 94.7&#x0025;. Panwar et al. [<xref ref-type="bibr" rid="ref-26">26</xref>] developed a CNN-based technique for the rapid detection of COVID-19 on chest CT and X-ray images. The transfer learning approach was implemented on three different datasets. This technique detected COVID-19 in less than 2 min and produced more accurate results from CT images than the X-ray dataset. A new CNN framework called CoroDet [<xref ref-type="bibr" rid="ref-27">27</xref>] was introduced to recognize COVID-19 on chest X-ray and CT images. The network consisted of 22 layers, and had a recognition rate of 99.1&#x0025; for binary class classification, 94.2&#x0025; for three classes, and 91.2&#x0025; for four classes. Islam et al. [<xref ref-type="bibr" rid="ref-28">28</xref>] presented a CNN-based method for the detection of COVID-19. In this method, the CNN extracted features that were then used to classify the dataset into normal and COVID-19 images using LSTM. This technique achieved an area under the receiver operating characteristic (ROC) curve (AUC) of 99.9&#x0025;, accuracy of 99.4&#x0025;, sensitivity of 99.3&#x0025;, specificity of 99.2&#x0025;, and F1 score of 98.9&#x0025;.</p>
<p>A new artificial neural network (ANN), CapsNet [<xref ref-type="bibr" rid="ref-29">29</xref>], was introduced to detect COVID-19 in a chest X-ray image dataset. The network showed recognition accuracies for binary and multi-class classification of 97.24&#x0025; and 84.22&#x0025;, respectively. A dual-branch combination network (DCN) [<xref ref-type="bibr" rid="ref-30">30</xref>] was established to detect and diagnose COVID-19 on chest CT. The lesion area was first segmented to obtain more accurate results in the classification phase, and the DCN model achieved an accuracy of 96.74&#x0025;. Horry et al. [<xref ref-type="bibr" rid="ref-31">31</xref>] used the transfer learning approach to diagnose COVID-19 in ultrasound, X-ray, and CT images. They selected the VGG-19 network to perform transfer learning and made appropriate changes to the parameters to fine-tune the model. The technique showed accuracies of 100&#x0025;, 86&#x0025;, and 84&#x0025; for ultrasound, X-ray, and CT images, respectively. A number of other methods using statistical modeling [<xref ref-type="bibr" rid="ref-32">32</xref>], a cloud-based framework model [<xref ref-type="bibr" rid="ref-33">33</xref>], and machine learning [<xref ref-type="bibr" rid="ref-34">34</xref>] have also been reported, all of which focused on pre-trained models for COVID-19 image classification. However, they focused only on classification accuracy rather than computational time, which is a vital functionality of any computerized method.</p>
</sec>
<sec id="s3">
<label>3</label><title>Proposed Framework</title>
<p>The proposed automated set of deep learning methods is presented in this section with the detailed mathematical formulation and visible results. The main flow of the proposed method is shown in <?A3B2 "fig1",5,"anchor"?><xref ref-type="fig" rid="fig-1">Fig. 1</xref>. As shown in this figure, the initially collected dataset is processed and the contrast is improved using a hybrid method. Then, two pre-trained models are fine-tuned and trained by transfer learning. Both fine-tuned models are trained in a dataset consisting of three classes: Pneumonia, COVID-19, and Healthy. Features are extracted from these two fine-tuned models and optimized using a hybrid Rao-1 and PSO algorithm. The selected optimum features are blended using a novel approach called Parallel Minimum Distance Non-Redundant (PMDNR). The final fused vector features are classified using an extreme learning machine (ELM) classifier. The details of each step are presented below.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>Proposed diagram for COVID19 classification using CT Images based on ensembles of deep learning models</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_16816-fig-1.png"/></fig>
<sec id="s3_1">
<label>3.1</label><title>Dataset Preparation</title>
<p>In this work, we collected a dataset from the Radiopaedia Website (<uri xlink:href="https://radiopaedia.org">https://radiopaedia.org</uri>). This website has CT images of more than 100 COVID-19-positive patients. We used the data from the first 80 patients, which included a total of 4000 CT images. Later, we collected 3000 CT images of healthy individuals and 2500 CT images of patients with pneumonia from the same website. Due to the imbalance in numbers between the classes, we performed data augmentation with horizontal flip and vertical flip operations. Mathematically, these flip operations are defined as follows:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:msup><mml:mi>O</mml:mi><mml:mi>H</mml:mi></mml:msup></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:msup><mml:mi>O</mml:mi><mml:mi>V</mml:mi></mml:msup></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></disp-formula>
where <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mrow><mml:msup><mml:mi>O</mml:mi><mml:mi>H</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> represents a horizontal flip operation, <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mrow><mml:msup><mml:mi>O</mml:mi><mml:mi>V</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> denotes a vertical flip operation, and <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>I</mml:mi><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:math></inline-formula> denotes the original image of dimensions <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>n</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>m</mml:mi></mml:math></inline-formula>. Based on these operations, all classes were in the range of 4000. Then, we randomly split the entire dataset at a 50:50 ratio for training and testing. A few sample images are shown in <?A3B2 "fig2",5,"anchor"?><xref ref-type="fig" rid="fig-2">Fig. 2</xref>. This figure illustrates that the COVID-19 and Pneumonia classes have very high degrees of similarity with each other and, therefore, the chances of misclassification were also very high. To handle these similarity issues, we first implemented a hybrid contrast enhancement approach, as described below.</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>Sample CT images of COVID19, Pneumonia, and Healthy</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_16816-fig-2.png"/></fig>
</sec>
<sec id="s3_2">
<label>3.2</label><title>Contrast Enhancement</title>
<p>Contrast enhancement improves the quality of input images for useful feature extraction in the pattern recognition step [<xref ref-type="bibr" rid="ref-35">35</xref>]. Here, we implemented a hybrid approach for CT image contrast enhancement. The main purpose of this step was to show a difference between COVID-19 and Pneumonia images. The hybrid approach is based on a new threshold function defined using closing and opening operations, which are applied on original images with a constant parameter. The constant parameter controls the image pixel values and far from zero.</p>
<p>Consider <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow></mml:math></inline-formula> as a database, <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msubsup><mml:mi>I</mml:mi><mml:mi>k</mml:mi><mml:mi>N</mml:mi></mml:msubsup><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:math></inline-formula>, one image <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>I</mml:mi><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:mo>&#x2208;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula>, where the size of the image is <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>n</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>m</mml:mi></mml:math></inline-formula>, and <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>256</mml:mn></mml:math></inline-formula>. The opening operation is applied on image <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>I</mml:mi><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:math></inline-formula> as follows:
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>O</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub></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:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>I</mml:mi><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:mo>&#x2212;</mml:mo><mml:mi>I</mml:mi><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:mo stretchy="false">)</mml:mo><mml:mo>&#x2218;</mml:mo><mml:mi>C</mml:mi><mml:mo>+</mml:mo><mml:mi>r</mml:mi></mml:math></disp-formula>
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></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:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>I</mml:mi><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:mo>.</mml:mo><mml:mi>C</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>I</mml:mi><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:mo>+</mml:mo><mml:mi>r</mml:mi></mml:math></disp-formula>
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>f</mml:mi></mml:msub></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:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>O</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub></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:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></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:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>I</mml:mi><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:mo>+</mml:mo><mml:mi>r</mml:mi></mml:math></disp-formula>
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><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:mi>m</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>O</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><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:mi>m</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mrow><mml:mover><mml:mi>&#x03BC;</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mi>T</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi><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:mi>U</mml:mi><mml:mi>p</mml:mi><mml:mi>d</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>f</mml:mi></mml:msub></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:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>f</mml:mi></mml:msub></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:mo>&#x2265;</mml:mo><mml:mrow><mml:mover><mml:mi>&#x03BC;</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>f</mml:mi></mml:msub></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:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>E</mml:mi><mml:mi>l</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></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>
where <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>O</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub></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:math></inline-formula> denotes the modified opening function formulation, <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> denotes the modified closing operation formulation, <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>f</mml:mi></mml:msub></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:math></inline-formula> is the combined pixel information formulation, and <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mrow><mml:mover><mml:mi>&#x03BC;</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> is the overall mean value. The threshold function <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>T</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> is described as follows: if <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>f</mml:mi></mml:msub></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:math></inline-formula> image pixels are greater than or equal or <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mrow><mml:mover><mml:mi>&#x03BC;</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula>, then update the pixels&#x2019; values with the mean value; otherwise, the original pixel is considered. This process is completed for all pixel values, and a new enhanced image is obtained. These steps are illustrated in <?A3B2 "fig3",5,"anchor"?><xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>Hybrid contrast enhancement approach results</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_16816-fig-3.png"/>
</fig>
</sec>
<sec id="s3_3">
<label>3.3</label><title>Deep Learning Features Extraction</title>
<p>Deep learning has been an important area of machine learning research for the last 5 years [<xref ref-type="bibr" rid="ref-36">36</xref>]. Many deep learning methods have been introduced for classification purposes, such as object classification [<xref ref-type="bibr" rid="ref-37">37</xref>], medical infections, etc. CNN is a type of deep learning, and consists of many intermediate layers, such as the convolutional layer, pooling layers (max pooling and average pooling), ReLu layer for activation, fully connected layer, and Softmax. The convolutional layer extracts the features of input images based on the filter size. The parameters of this layer are filter size, number of channels, and stride. The pooling layers, such as the max pooling layer, can be useful to handle the issue of overfitting. In this layer, the main parameters are filter size and stride. Usually, the filter size is <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula> and stride is 1. Some of the feature values of the convolutional layers are negative, and it is therefore essential to convert them to positive values. For this purpose, the features are converted into positives through the ReLu activation layer. This layer converted features into zero. The fully connected layer, also called the feature layer, is useful for extracting the features of input images that are transformed through convolutional layers, pooling layers, etc. The final layer is Softmax, used for classification. Here, we used two pre-trained models for deep feature extraction. The details of each model are described below.</p>
<sec id="s3_3_1">
<label>3.3.1</label><title>The Modified Darknet53 Model</title>
<p>The CNN-based model DarkNet53 [<xref ref-type="bibr" rid="ref-38">38</xref>] is utilized to extract deep features. Two deep networks named YOLOv2 DarkNet19 [<xref ref-type="bibr" rid="ref-39">39</xref>] and the deep Residual Network [<xref ref-type="bibr" rid="ref-40">40</xref>] were combined to develop this model. The deep structure of DarkNet53 consists of 53 layers. The convolution layer utilized in this network is <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>, and the size of the consecutive residual is <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula>. The input of this network is always 224 <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mo>&#x00D7;</mml:mo></mml:math></inline-formula> 224<inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mspace width="thickmathspace" /><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mtext>\;&#xA0;</mml:mtext></mml:mrow></mml:math></inline-formula>3. The minimal component of DarkNet53 consists of three elements: convolution, Batch Normalization (BN), and LeakyReLU layers. The mathematical modeling of the convolutional layer can be described as:
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msubsup><mml:mi>x</mml:mi><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mi>l</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x2217;</mml:mo><mml:msubsup><mml:mi>H</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>b</mml:mi><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msubsup></mml:math></disp-formula>
where the number of generated feature maps is <italic>n</italic> by convoluting the input image using <italic>n</italic> different convolution kernels, and <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:msubsup><mml:mi>x</mml:mi><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msubsup></mml:math></inline-formula> are the <italic>n</italic> generated feature maps in layer <italic>k</italic>. A feature vector is represented as <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msubsup><mml:mi>H</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msubsup></mml:math></inline-formula> represents the <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>l</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:math></inline-formula> element of the <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>n</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:math></inline-formula> number of convolution kernels in layer <italic>k</italic>. <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msubsup><mml:mi>b</mml:mi><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msubsup></mml:math></inline-formula> is the <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mrow><mml:mi>n</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> bias of the layer <italic>k</italic>, and the convolutional operator is &#x002A;. The output is normalized using the BN layer. After applying convolution, the BN layer can increase the convergence rate of the network and resolve the problems of overfitting. The mathematical model of the BN layer is:
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BC;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msqrt><mml:mrow><mml:msup><mml:mi>&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:msqrt><mml:mo>+</mml:mo><mml:mi>&#x03B5;</mml:mi></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:mi>&#x03B3;</mml:mi></mml:math></disp-formula>
</p>
<p>The result of the BN layer is <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. The scaling factor is represented as <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula>, the mean value of inputs is <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>&#x03BC;</mml:mi></mml:math></inline-formula>, the input variance value is denoted by <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mi>&#x03C3;</mml:mi></mml:math></inline-formula>, the offset value is <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>&#x03B5;</mml:mi></mml:math></inline-formula> represents a constant, and <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> denotes the result of the convolution process. LeakyReLU increases the nonlinearity of the network. This is the activation function and can be defined as:
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><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:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mn>0</mml:mn></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>
where <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the activation function, the input value is <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, and <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents a constant parameter with values between <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>+</mml:mo><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>.</p>
<p>Here, we fine-tuned this model and removed the last classification layer. A new classification layer was added, which included three instead of 1000 classes. The same weights were used for the fine-tuned model. Later, transfer learning was applied to train this model. The transfer learning process is shown in <?A3B2 "fig4",5,"anchor"?><xref ref-type="fig" rid="fig-4">Fig. 4</xref>. As shown in the figure, the feature weights of the original model were transferred to the fine-tuned model. The last features were extracted from the convolutional 53 layers of dimension <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>1024</mml:mn></mml:math></inline-formula>.</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>Transfer learning based features extraction</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_16816-fig-4.png"/></fig>
</sec>
<sec id="s3_3_2">
<label>3.3.2</label><title>Modified ResNet50 Model</title>
<p>ResNet50 [<xref ref-type="bibr" rid="ref-40">40</xref>] is a 50-layer deep neural network based on residual learning that consists of 16 bottleneck residual blocks. The convolution size for each residual block is <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>, <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula>, and <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>. In the first three residual blocks, the feature map sizes are 64 and 256. The next four blocks have a feature map size of 128 and 512. After this, six residual blocks contain feature maps with sizes of 256 and 1024. The last three blocks have feature map sizes of 512 and 2048. The image input size for ResNet50 is <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mn>224</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>224</mml:mn></mml:math></inline-formula>, and the feature output size is 2048. This model was trained on the ImageNet database, a large dataset of millions of images [<xref ref-type="bibr" rid="ref-41">41</xref>]. The output of this original model is 1000 classes, as shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. We fine-tuned the model and removed the last FC and Softmax layers. A new layer consisting of three classes was added, as shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. This figure shows that the features weights of the original model were transferred to the fine-tuned model. In the last, features are extracted from the global average pool layer, where the size of extracted features is <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>2048</mml:mn></mml:math></inline-formula>.</p>
</sec>
</sec>
<sec id="s3_4">
<label>3.4</label><title>Features Selection</title>
<p>Selection of the best features always helps to achieve faster execution in supervised learning methods. The irrelevant and redundant features mislead the classification accuracy and increase the overall system time [<xref ref-type="bibr" rid="ref-42">42</xref>]. Here, we must deal with both issues of feature redundancy and irrelevant features. Therefore, we proposed a hybrid algorithm based on Rao-1 [<xref ref-type="bibr" rid="ref-43">43</xref>] and PSO [<xref ref-type="bibr" rid="ref-44">44</xref>] to select the most important features. We initially implemented both algorithms separately, identified the correlations among features of both techniques, and selected the most positively correlated features. Finally, the features selected by both approaches were fused using the new PMDNR approach.</p>
<p><bold>Particle Swarm Optimization:</bold> This algorithm finds the best possible solution from the given solutions. A swarm is referred to as possible solutions, and each solution is considered a particle. In the search space, each particle set its set and accelerates with some velocity. After each iteration, PSO selected the best solution and changed its position. The new position of the particle is based on previous learning. The evaluation of each particle is measured according to the defined fitness function [<xref ref-type="bibr" rid="ref-45">45</xref>]. At the end of the iterations, PSO produces an optimal solution. Let the search space be N-dimensional with <italic>n</italic> number of particles or solutions; the N-dimensional vector is denoted by <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> for the <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> particle of the swarm. <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the prior best position of the <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> particle, which results in the best fitness value. <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>g</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denotes the particle with the lowest function value. The velocity is represented as <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> for the <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> particle. The particles are manipulated according to the following equations:
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>y</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mi>y</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mi>y</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mi>y</mml:mi></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>R</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mi>a</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mi>y</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mi>y</mml:mi></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></disp-formula>
where <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>b</mml:mi><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>N</mml:mi></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>&#x03C9;</mml:mi></mml:math></inline-formula> is the inertia weight, and random functions are represented by <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><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:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><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:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, which generate random values from the range [0, 1]. <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are the constant positive integer cognitive, and social parameters, respectively. In the first equation, velocity is calculated at each iteration for the <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> particle. <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mi>y</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mi>y</mml:mi></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> computes the distance between the personal best location and the <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> particle. <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>R</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mi>a</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mi>y</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mi>y</mml:mi></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> gives the distance between the global best location and the <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> particle. The second equation calculates the new position of the <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> particle. The functions <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><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:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><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:mo stretchy="false">)</mml:mo></mml:math></inline-formula> provide randomness and make the algorithm more flexible. Through this algorithm, a best-selected feature vector is obtained of dimension <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>820</mml:mn></mml:math></inline-formula> for feature vector 2 (ResNet features) and <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>410</mml:mn></mml:math></inline-formula> for feature vector 1 (DarkNet 53 features). This dimension shows that almost 60&#x0025; of features are removed from the original list.</p>
<p><bold>Rao-1 Algorithm:</bold> This algorithm is computationally complex, easy to implement, and to the point. This algorithm solves the optimization problem more efficiently than other metaheuristic algorithms. The search process for finding an optimal solution is based on the best and worst candidate solutions within a random and entire population.</p>
<p>This algorithm first initializes the parameters, such as the number of solutions, design variables, lower and upper bounds, and maximum iterations. Then, the candidate solutions are generated and a fitness function is applied for evaluation. Initially, the fitness function counter and interactions are zero. Based on the fitness values, the best and worst feature values are then identified. In the later stage, the solutions are updated through the following equation:
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:msubsup><mml:mi>S</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><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:mn>1</mml:mn><mml:mspace width="thickmathspace" /><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
where the original candidates are denoted by <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, updated candidate solutions are denoted by <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:msubsup><mml:mi>S</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, best candidate solutions are represented by <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, and worst candidate solutions are represented by <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. Then, a check is performed to determine if the new solution is better than the older solution and it replaces the old candidate solutions; otherwise, old candidate solutions are considered. This process is continued until the termination criteria are not met. The selected features are again evaluated through the fitness function and replace with the older features. Here, we obtained a feature vector of dimension <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>1104</mml:mn></mml:math></inline-formula> for feature vector 2 (ResNet features) and <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>522</mml:mn></mml:math></inline-formula> for feature vector 1 (DarkNet features).</p>
<p><bold>Hybridization:</bold> Consider, <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> denoting the selected optimal feature vector for ResNet101 through PSO of dimension <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>820</mml:mn></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>k</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the optimal feature vector for ResNet101 selected through the Rao-1 algorithm. Then, we find the correlation between features of <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. The features that have a strong correlation were selected. The Pearson correlation was used here to determine the correlation. The final vector for ResNet101 is denoted by <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mover><mml:mi>k</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> of dimension <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>926</mml:mn></mml:math></inline-formula>. Similarly, this process was performed on DarkNet53 features and obtained a feature vector of dimension <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>476</mml:mn></mml:math></inline-formula> denoted by <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mover><mml:mi>k</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. Finally, both vectors were fused using the new PMDNR approach, which initially computes the standard deviation of the minimum length feature vector and performs padding according to the higher dimensional feature vector. Then, the Euclidean Distance (ED) between both vectors was calculated, and only those features with the minimum distance were considered. The ED is defined as follows:
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mi>D</mml:mi><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:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mover><mml:mi>k</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mover><mml:mi>k</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mn>1</mml:mn><mml:mi>j</mml:mi></mml:mrow></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:math></disp-formula>
&#x00A0; This formula was applied to all features, and we finally obtained a fused vector of dimension <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>1042</mml:mn></mml:math></inline-formula>. However, we noted that this vector contained few redundant features and, therefore, compared all features through the Union method and considered the same value features only once in the final fused vector. Through this process, the final feature vector of dimension <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>840</mml:mn></mml:math></inline-formula> was obtained. These features were finally classified using an ELM classifier [<xref ref-type="bibr" rid="ref-46">46</xref>]. The predicted labeled results of ELM are illustrated in <?A3B2 "fig5",5,"anchor"?><xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label><title>Experimental Results and Analysis</title>
<p>This section presents the experimental process. The classification results were computed for several classifiers using a 50:50 approach of training and testing. All classification results were computed using 10-fold validation. In the training process, we used Stochastic Gradient Descent for the learning of fine-tuned models. Moreover, the learning rate was 0.00001, the mini-batch size was 64, and 100 epochs were used. The selected classifiers were ELM, Fine Tree, SVM, fine-KNN, and ensemble trees. The main classifier was ELM, which was used in this work for prediction, while the rest of the classifiers were considered for classification comparison. Each classifier&#x0027;s performance was calculated according to the following measures: sensitivity rate, precision rate, F1-score, accuracy, FNR, and testing time. Time was the most important measure in this work due to the optimization algorithms. All experiments are performed in MATLAB 2020b on a PC with 512 SSD storage, 16 GB RAM, and an 8 GB graphics card.</p>
<fig id="fig-5"><label>Figure 5</label><caption><title>Proposed prediction results in terms of labeled data</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_16816-fig-5.png"/></fig>
<sec id="s4_1">
<label>4.1</label><title>Numerical Results: Experiment 1</title>
<p>The numerical results with accompanying evidence are presented in this section. The results were computed for each step. <?A3B2 "tbl1",5,"anchor"?><xref ref-type="table" rid="table-1">Tab. 1</xref> presents the classification results after applying a hybrid optimization algorithm on fine-tuned ResNet50 model features. The results shown in this table were calculated for several classifiers using the selected performance measures. The greatest accuracy of this experiment was 92.7&#x0025; for the ELM classifier. The computed accuracies for the remaining classifiers, i.e., Fine Tree to Softmax, were 86.2&#x0025;, 84.7&#x0025;, 83.2&#x0025;, 90.8&#x0025;, 90.7&#x0025;, 91.2&#x0025;, 91.4&#x0025;, and 92.1&#x0025;, respectively. These results indicated that the ELM classifier had the best performance. A number of other measures were also computed to support the performance of ELM; ELM showed sensitivity of 92.67&#x0025;, precision of 93&#x0025;, F1-Score of 92.83&#x0025;, and FNR of 7.33&#x0025;. To verify the sensitivity of ELM, a confusion matrix was added as shown in <?A3B2 "fig6",5,"anchor"?><xref ref-type="fig" rid="fig-6">Fig. 6</xref>. This figure shows that the COVID-19 class correct prediction rate was 94&#x0025;, and the correct prediction rates for Pneumonia and Normal classes were 96&#x0025; and 88&#x0025;, respectively. Thus, the prediction accuracy was best for the Pneumonia class followed by the COVID-19 class. The best time for this experiment was 25.706 s, which was noted during the testing process of all 50&#x0025; of images, indicating that the hybrid optimization algorithm minimized computational time in real-time testing.</p>
<table-wrap id="table-1"> 
<label>Table 1</label>
<caption>
<title>Proposed classification results after employing a hybrid optimization algorithm on fine-tuned ResNet50 deep feature vector</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
 </colgroup>
<thead>
<tr>
<th align="left" rowspan="2">Classifier</th>
<th align="left" colspan="6">Evaluation Protocols</th> 
</tr> 
<tr>
<th align="left">Sensitivity (&#x0025;)</th>
<th align="left">Precision (&#x0025;)</th>
<th align="left">F1-Score (&#x0025;)</th>
<th align="left">Accuracy (&#x0025;)</th>
<th align="left">FNR (&#x0025;)</th>
<th align="left">Time (Sec)</th>
</tr> 
</thead>
<tbody>
<tr>
<td align="left">Fine Tree</td>
<td align="left">86.33</td>
<td align="left">86.0</td>
<td align="left">86.16</td>
<td align="left">86.2</td>
<td align="left">13.67</td>
<td align="left">30.314</td>
</tr>
<tr>
<td align="left">GN Bayes</td>
<td align="left">84.66</td>
<td align="left">85.3</td>
<td align="left">84.98</td>
<td align="left">84.7</td>
<td align="left">15.34</td>
<td align="left">49.532</td>
</tr>
<tr>
<td align="left">L-SVM</td>
<td align="left">83.33</td>
<td align="left">83.3</td>
<td align="left">83.31</td>
<td align="left">83.2</td>
<td align="left">16.67</td>
<td align="left">22.965</td>
</tr>
<tr>
<td align="left">MG-SVM</td>
<td align="left">91.00</td>
<td align="left">91.0</td>
<td align="left">91.00</td>
<td align="left">90.8</td>
<td align="left">9.00</td>
<td align="left">31.912</td>
</tr>
<tr>
<td align="left">C- KNN</td>
<td align="left">90.67</td>
<td align="left">91.0</td>
<td align="left">90.83</td>
<td align="left">90.7</td>
<td align="left">9.33</td>
<td align="left">47.091</td>
</tr>
<tr>
<td align="left">W-KNN</td>
<td align="left">91.33</td>
<td align="left">91.0</td>
<td align="left">91.16</td>
<td align="left">91.2</td>
<td align="left">8.67</td>
<td align="left"><bold>25.706</bold></td>
</tr>
<tr>
<td align="left">EBT</td>
<td align="left">91.30</td>
<td align="left">91.3</td>
<td align="left">91.30</td>
<td align="left">91.4</td>
<td align="left">8.70</td>
<td align="left">37.103</td>
</tr>
<tr>
<td align="left">Softmax</td>
<td align="left">92.00</td>
<td align="left">92.0</td>
<td align="left">92.00</td>
<td align="left">92.1</td>
<td align="left">8.00</td>
<td align="left">24.014</td>
</tr>
<tr>
<td align="left">ELM</td>
<td align="left">92.67</td>
<td align="left">93.0</td>
<td align="left">92.83</td>
<td align="left">92.7</td>
<td align="left">7.33</td>
<td align="left">30.775</td>
</tr>
</tbody>
</table> 
</table-wrap>
<fig id="fig-6"> 
<label>Figure 6</label><caption><title>Confusion matrix of ELM for optimal ResNet50 deep learning features</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_16816-fig-6.png"/></fig>
</sec>
<sec id="s4_2">
<label>4.2</label><title>Numerical Results: Experiment 2</title>
<p><?A3B2 "tbl2",5,"anchor"?><xref ref-type="table" rid="table-2">Tab. 2</xref> presents the classification results after applying the hybrid optimization algorithm on fine-tuned DarkNet53 model features. The results shown in this table were calculated for several classifiers using selected performance measures. The ELM classifier showed the highest accuracy of 92.40&#x0025; in this experiment, which was 0.3&#x0025; lower than in the experiment shown in <xref ref-type="table" rid="table-1">Tab. 1</xref>. The computed accuracies for the remaining classifiers, i.e., Fine Tree to Softmax, were 87.4&#x0025;, 88.2&#x0025;, 90.2&#x0025;, 90.6&#x0025;, 91.0&#x0025;, 90.4&#x0025;, 91.9&#x0025;, and 91.6&#x0025;, respectively. These results indicated that the ELM classifier had the best performance, and that the performance in this experiment was better than that in <xref ref-type="table" rid="table-1">Tab. 1</xref>. A number of other measures were also computed to support the performance of ELM; ELM showed sensitivity of 92.40&#x0025;, precision of 92.7&#x0025;, F1-Score of 92.55&#x0025;, and FNR of 7.66&#x0025;. To verify the sensitivity of ELM, a confusion matrix was added as shown in <?A3B2 "fig7",5,"anchor"?><xref ref-type="fig" rid="fig-7">Fig. 7</xref>. The time was also noted, and the best time for this experiment was 23.927 s showing that the accuracy of the ELM classifier using a hybrid optimized approach for DarkNet features executed faster than ResNet50 features. The performance of optimized DarkNet53 features was also better in comparison to <xref ref-type="table" rid="table-1">Tab. 1</xref>.</p>
<table-wrap id="table-2">
<label>Table 2</label><caption><title>Proposed classification results after employing a hybrid optimization algorithm on fine-tuned Darknet53 deep feature vector</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th rowspan="2">&#x00A0;<break/>Classifier</th>
<th colspan="6">Evaluation Protocols</th>
</tr> 
<tr>
<th align="left">Sensitivity (&#x0025;)</th>
<th align="left">Precision (&#x0025;)</th>
<th align="left">F1-Score (&#x0025;)</th>
<th align="left">Accuracy (&#x0025;)</th>
<th align="left">FNR (&#x0025;)</th>
<th align="left">Time (Sec)</th>
</tr> 
</thead>
<tbody>
<tr>
<td align="left">Fine Tree</td>
<td align="left">87.47</td>
<td align="left">87.5</td>
<td align="left">87.48</td>
<td align="left">87.4</td>
<td align="left">12.53</td>
<td align="left">36.652</td>
</tr>
<tr>
<td align="left">GN Bayes</td>
<td align="left">88.27</td>
<td align="left">88.3</td>
<td align="left">88.28</td>
<td align="left">88.2</td>
<td align="left">11.73</td>
<td align="left">29.232</td>
</tr>
<tr>
<td align="left">L-SVM</td>
<td align="left">90.27</td>
<td align="left">90.3</td>
<td align="left">90.28</td>
<td align="left">90.2</td>
<td align="left">9.73</td>
<td align="left">31.183</td>
</tr>
<tr>
<td align="left">MG-SVM</td>
<td align="left">90.60</td>
<td align="left">90.6</td>
<td align="left">90.60</td>
<td align="left">90.6</td>
<td align="left">9.40</td>
<td align="left">35.348</td>
</tr>
<tr>
<td align="left">C- KNN</td>
<td align="left">91.07</td>
<td align="left">91.3</td>
<td align="left">91.18</td>
<td align="left">91.0</td>
<td align="left">8.93</td>
<td align="left">34.172</td>
</tr>
<tr>
<td align="left">W-KNN</td>
<td align="left">90.40</td>
<td align="left">90.5</td>
<td align="left">90.45</td>
<td align="left">90.4</td>
<td align="left">9.60</td>
<td align="left">32.772</td>
</tr>
<tr>
<td align="left">EBT</td>
<td align="left">92.00</td>
<td align="left">92.0</td>
<td align="left">92.00</td>
<td align="left">91.9</td>
<td align="left">8.0</td>
<td align="left">43.216</td>
</tr>
<tr>
<td align="left">Softmax</td>
<td align="left">91.33</td>
<td align="left">92.0</td>
<td align="left">91.66</td>
<td align="left">91.6</td>
<td align="left">8.67</td>
<td align="left"><bold>23.927</bold></td>
</tr>
<tr>
<td align="left">ELM</td>
<td align="left">92.40</td>
<td align="left">92.7</td>
<td align="left">92.55</td>
<td align="left">92.4</td>
<td align="left">7.60</td>
<td align="left">36.454</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-7"><label>Figure 7</label><caption><title>Confusion matrix of ELM for optimal DarkNet53 deep learning features</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_16816-fig-7.png"/></fig> 
<table-wrap id="table-3"><label>Table 3</label><caption><title>Proposed classification results after ensembles of deep learning models information fusion</title></caption>
<table frame="hsides">
 <colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th rowspan="2">Classifier</th>
<th colspan="6">Evaluation Protocols</th>
</tr> 
<tr>
<th align="left">Sensitivity (&#x0025;)</th>
<th align="left">Precision (&#x0025;)</th>
<th align="left">F1-Score (&#x0025;)</th>
<th align="left">Accuracy (&#x0025;)</th>
<th align="left">FNR (&#x0025;)</th>
<th align="left">Time (Sec)</th>
</tr> 
</thead>
<tbody>
<tr>
<td align="left">Fine Tree</td>
<td align="left">89.67</td>
<td align="left">90.00</td>
<td align="left">89.83</td>
<td align="left">89.8</td>
<td align="left">10.33</td>
<td align="left">25.336</td>
</tr>
<tr>
<td align="left">GN Bayes</td>
<td align="left">94.13</td>
<td align="left">94.33</td>
<td align="left">94.23</td>
<td align="left">94.5</td>
<td align="left">5.87</td>
<td align="left">21.325</td>
</tr>
<tr>
<td align="left">L-SVM</td>
<td align="left">93.13</td>
<td align="left">93.67</td>
<td align="left">93.40</td>
<td align="left">93.6</td>
<td align="left">6.87</td>
<td align="left"><bold>15.609</bold></td>
</tr>
<tr>
<td align="left">MG-SVM</td>
<td align="left">94.10</td>
<td align="left">94.33</td>
<td align="left">94.21</td>
<td align="left">94.4</td>
<td align="left">5.90</td>
<td align="left">19.859</td>
</tr>
<tr>
<td align="left">C- KNN</td>
<td align="left">94.00</td>
<td align="left">94.00</td>
<td align="left">94.00</td>
<td align="left">94.1</td>
<td align="left">6.00</td>
<td align="left">26.194</td>
</tr>
<tr>
<td align="left">W-KNN</td>
<td align="left">93.03</td>
<td align="left">93.33</td>
<td align="left">93.18</td>
<td align="left">93.4</td>
<td align="left">6.97</td>
<td align="left">17.312</td>
</tr>
<tr>
<td align="left">EBT</td>
<td align="left">93.00</td>
<td align="left">93.33</td>
<td align="left">93.16</td>
<td align="left">93.0</td>
<td align="left">7.00</td>
<td align="left">23.010</td>
</tr>
<tr>
<td align="left">Softmax</td>
<td align="left">94.33</td>
<td align="left">94.60</td>
<td align="left">94.46</td>
<td align="left">94.7</td>
<td align="left">5.67</td>
<td align="left">22.699</td>
</tr>
<tr>
<td align="left">ELM</td>
<td align="left">95.33</td>
<td align="left">95.67</td>
<td align="left">95.50</td>
<td align="left">95.6</td>
<td align="left">4.67</td>
<td align="left">20.003</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-8"><label>Figure 8</label><caption><title>Confusion matrix of ELM after ensembles of deep learning models information fusion</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_16816-fig-8.png"/></fig>
</sec>
<sec id="s4_3">
<label>4.3</label><title>Numerical Results: Experiment 3</title>
<p>The optimal features of both models were fused using the proposed PMDNR approach, and the results are presented in <?A3B2 "tbl3",5,"anchor"?><xref ref-type="table" rid="table-3">Tab. 3</xref>. The results shown in this table indicated that the highest accuracy achieved was 95.6&#x0025; for the ELM classifier. The other measures were sensitivity of 95.33&#x0025;, precision of 95.67&#x0025;, F1-Score of 95.50&#x0025;, and FNR of 4.67&#x0025;. The noted computational time of ELM was 20.003 s, which was less than in <xref ref-type="table" rid="table-1">Tabs. 1</xref> and <xref ref-type="table" rid="table-2">2</xref>. In addition, the accuracy of ELM after fusion was improved compared to <xref ref-type="table" rid="table-1">Tabs. 1</xref> and <xref ref-type="table" rid="table-2">2</xref>. <?A3B2 "fig8",5,"anchor"?><xref ref-type="fig" rid="fig-8">Fig. 8</xref> shows a confusion matrix, which can be used to verify the sensitivity of ELM. As shown in this figure, the correct prediction rates for Pneumonia and COVID-19 images were 99&#x0025; and 96&#x0025;, respectively, representing significant improvements compared to <xref ref-type="fig" rid="fig-6">Figs. 6</xref> and <xref ref-type="fig" rid="fig-7">7</xref>.</p>
<p>Finally, we discuss the overall experimental process of our proposed framework. <?A3B2 "fig9",5,"anchor"?><xref ref-type="fig" rid="fig-9">Fig. 9</xref> shows the proposed framework accuracy with individual steps. Initially, the results were computed using original ResNet50 (<italic>O_Res_F</italic>) features and achieved an accuracy of 87.86&#x0025;. For the original DarkNet53 (<italic>O_Drk_F</italic>) features, the results accuracy was 85.62&#x0025;. The results of optimal ResNet50 features were 92.7&#x0025;, which were improved compared to <italic>O_Res_F</italic>. Similarly, the results were improved after employing optimal DarkNet53 (<italic>Op_Drk_F</italic>) and reached 92.4&#x0025;. The results are illustrated for a proposed framework of accuracy of 95.6&#x0025;. The proposed framework results demonstrated the significance for classification of COVID-19 on CT images. Similarly, the F1-Score-based comparison was also conducted as shown in <?A3B2 "fig10",5,"anchor"?><xref ref-type="fig" rid="fig-10">Fig. 10</xref>. This figure shows that the proposed framework achieved better results on the ELM classifier. A time-based comparison was also conducted shown in <xref ref-type="fig" rid="fig-11">Fig. 11</xref>, which indicated that the ensembles of deep features executed faster, compared to the ResNet and DarkNet features.</p>
<fig id="fig-9">
<label>Figure 9</label><caption><title>Proposed ensemble method accuracy comparison with individual steps</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_16816-fig-9.png"/></fig>
 
<fig id="fig-10"><label>Figure 10</label><caption><title>F1-Score based comparison among each step for the selected classifiers</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_16816-fig-10.png"/></fig>
<fig id="fig-11"><label>Figure 11</label><caption><title> Time plot to compare the performance of each step</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_16816-fig-11.png"/></fig>
</sec>
</sec>
<sec id="s5">
<label>5</label><title>Conclusion</title>
<p>To classify COVID-19 CT images, a set of optimal deep learning features based on a computerized framework was presented. This work allowed the selection of the most optimal features using a hybrid algorithm and the fusion of features through the proposed PMDNR approach. Finally, the fused features were classified using an ELM classifier. The results were computed on the prepared database and showed 95.6&#x0025; accuracy. The results indicated that the proposed method works better with the ELM classifier. Pre-processing of the original images improved the visibility of infected and curative CT images from the results. Use of improved contrast images often allowed the extraction of more useful deep learning features. In addition, optimizing features improved the accuracy of the system and minimized the number of predictors required. With fewer predictors, the procedure was completed quickly, which is helpful for improving the performance of the real-time system. We also concluded that the fusion of features using the proposed approach further impaired accuracy. In future, the features will be extracted through two or three stream networks and fused for more accurate classification accuracy.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> This research was supported by X-mind Corps program of National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT (No. 2019H1D8A1105622) and the Soonchunhyang University Research Fund.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p></fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. B.</given-names> <surname>Stoecklin</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Rolland</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Silue</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Mailles</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Campese</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>First cases of coronavirus disease 2019 (COVID-19) in France: Surveillance, investigations and control measures</article-title>,&#x201D; <source>Eurosurveillance</source>, vol. <volume>25</volume>, no. <issue>3</issue>, pp. <fpage>2000094</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Zhu</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Yang</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>A novel coronavirus from patients with pneumonia in China</article-title>,&#x201D; <source>New England Journal of Medicine</source>, vol. <volume>4</volume>, no. <issue>7</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>4</lpage>, <year>2020</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>T.</given-names> <surname>Singhal</surname></string-name></person-group>, &#x201C;<article-title>A review of coronavirus disease-2019 (COVID-19)</article-title>,&#x201D; <source>Indian Journal of Pediatrics</source>, vol. <volume>6</volume>, no. <issue>2</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>6</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>C.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>P. W.</given-names> <surname>Horby</surname></string-name>, <string-name><given-names>F. G.</given-names> <surname>Hayden</surname></string-name> and <string-name><given-names>G. F.</given-names> <surname>Gao</surname></string-name></person-group>, &#x201C;<article-title>A novel coronavirus outbreak of global health concern</article-title>,&#x201D; <source>Lancet</source>, vol. <volume>395</volume>, no. <issue>2</issue>, pp. <fpage>470</fpage>&#x2013;<lpage>473</lpage>, <year>2020</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>T.</given-names> <surname>Ai</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Hou</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Zhan</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Chen</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Correlation of chest CT and RT-pCR testing in coronavirus disease 2019 (COVID-19) in China: A report of 1014 cases</article-title>,&#x201D; <source>Radiology</source>, vol. <volume>7</volume>, no. <issue>11</issue>, pp. <fpage>200642</fpage>, <year>2020</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>F. M.</given-names> <surname>Salman</surname></string-name>, <string-name><given-names>S. S.</given-names> <surname>Abu-Naser</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Alajrami</surname></string-name>, <string-name><given-names>B. S.</given-names> <surname>Abu-Nasser</surname></string-name> and <string-name><given-names>B. A.</given-names> <surname>Alashqar</surname></string-name></person-group>, &#x201C;<article-title>Covid-19 detection using artificial intelligence</article-title>,&#x201D; <source>International Journal of Academic Engineering Research</source>, vol. <volume>4</volume>, no. <issue>3</issue>, pp. <fpage>18</fpage>&#x2013;<lpage>25</lpage>, <year>2020</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>A.</given-names> <surname>Mittal</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Mittal</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Saba</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Abunadi</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Detecting pneumonia using convolutions and dynamic capsule routing for chest X-ray images</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>20</volume>, no. <issue>1</issue>, pp. <fpage>1068</fpage>, <year>2020</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>M. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M. S.</given-names> <surname>Sarfraz</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Alhaisoni</surname></string-name>, <string-name><given-names>A. A.</given-names> <surname>Albesher</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Wang</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Stomachnet: Optimal deep learning features fusion for stomach abnormalities classification</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, no. <issue>11</issue>, pp. <fpage>197969</fpage>&#x2013;<lpage>197981</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Rehman</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Saba</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Mehmood</surname></string-name>, <string-name><given-names>U.</given-names> <surname>Tariq</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Microscopic brain tumor detection and classification using 3D CNN and feature selection architecture</article-title>,&#x201D; <source>Microscopy Research and Technique</source>, vol. <volume>5</volume>, no. <issue>3</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>21</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. A. C.</given-names> <surname>Bukhari</surname></string-name> and <string-name><given-names>R. S.</given-names> <surname>Nayak</surname></string-name></person-group>, &#x201C;<article-title>Developed newton-raphson based deep features selection framework for skin lesion recognition</article-title>,&#x201D; <source>Pattern Recognition Letters</source>, vol. <volume>129</volume>, no. <issue>2</issue>, pp. <fpage>293</fpage>&#x2013;<lpage>303</lpage>, <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>M.</given-names> <surname>Alhaisoni</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Dama&#x0161;evi&#x010D;ius</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Scherer</surname></string-name></person-group>, &#x201C;<article-title>Multimodal brain tumor classification using deep learning and robust feature selection: A machine learning application for radiologists</article-title>,&#x201D; <source>Diagnostics</source>, vol. <volume>10</volume>, pp. 565, <year>2020</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>M. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Kadry</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Alhaisoni</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Nam</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhang</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Computer-aided gastrointestinal diseases analysis from wireless capsule endoscopy: A framework of best features selection</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, no. <issue>7</issue>, pp. <fpage>132850</fpage>&#x2013;<lpage>132859</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Rubab</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Kashif</surname></string-name>, <string-name><given-names>M. I.</given-names> <surname>Sharif</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Muhammad</surname></string-name></person-group>, &#x201C;<article-title>Lungs cancer classification from CT images: An integrated design of contrast based classical features fusion and selection</article-title>,&#x201D; <source>Pattern Recognition Letters</source>, vol. <volume>129</volume>, pp. <fpage>77</fpage>&#x2013;<lpage>85</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>S.</given-names> <surname>Zahoor</surname></string-name>, <string-name><given-names>I. U.</given-names> <surname>Lali</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Javed</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Mehmood</surname></string-name></person-group>, &#x201C;<article-title>Breast cancer detection and classification using traditional computer vision techniques: A comprehensive review</article-title>,&#x201D; <source>Current Medical Imaging</source>, vol. <volume>7</volume>, no. <issue>17</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>31</lpage>, <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>H. M. J.</given-names> <surname>Lodhi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Nazir</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Javed</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Qasim</surname></string-name></person-group>, &#x201C;<article-title>Automated design for recognition of blood cells diseases from hematopathology using classical features selection and ELM</article-title>,&#x201D; <source>Microscopy Research and Technique</source>, vol. <volume>7</volume>, no. <issue>5</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>19</lpage>, <year>2020</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>G. R.</given-names> <surname>Shinde</surname></string-name>, <string-name><given-names>A. B.</given-names> <surname>Kalamkar</surname></string-name>, <string-name><given-names>P. N.</given-names> <surname>Mahalle</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Dey</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Chaki</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Forecasting models for coronavirus disease (COVID-19): A survey of the state-of-the-art</article-title>,&#x201D; <source>SN Computer Science</source>, vol. <volume>1</volume>, no. <issue>3</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2020</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>S.-H.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>Y.-D.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Tang</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Diagnosis of COVID-19 by wavelet renyi entropy and three-segment biogeography-based optimization</article-title>,&#x201D; <source>International Journal of Computational Intelligence Systems</source>, vol. <volume>13</volume>, pp. <fpage>1332</fpage>&#x2013;<lpage>1344</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>Y.-D.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>S. C.</given-names> <surname>Satapathy</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>G.-R.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>A five-layer deep convolutional neural network with stochastic pooling for chest CT-based COVID-19 diagnosis</article-title>,&#x201D; <source>Machine Vision and Applications</source>, vol. <volume>32</volume>, no. <issue>2</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>, <year>2020</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>Y.-D.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>S. C.</given-names> <surname>Satapathy</surname></string-name>, <string-name><given-names>L.-Y.</given-names> <surname>Zhu</surname></string-name>, <string-name><given-names>J. M.</given-names> <surname>G&#x00F3;rriz</surname></string-name> and <string-name><given-names>S.-H.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>A seven-layer convolutional neural network for chest CT based COVID-19 diagnosis using stochastic pooling</article-title>,&#x201D; <source>IEEE Sensors Journal</source>, vol. <volume>1</volume>, no. <issue>13</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>9</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Lu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>S.-H.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>Y.-D.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Resgnet-c: A graph convolutional neural network for detection of COVID-19</article-title>,&#x201D; <source>Neurocomputing</source>, vol. <volume>3</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>18</lpage>, <year>2020</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>S.-H.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>D. R.</given-names> <surname>Nayak</surname></string-name>, <string-name><given-names>D. S.</given-names> <surname>Guttery</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, and <string-name><given-names>Y.-D.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>COVID-19 classification by CCSHNet with deep fusion using transfer learning and discriminant correlation analysis</article-title>,&#x201D; <source>Information Fusion</source>, vol. <volume>68</volume>, pp. <fpage>131</fpage>&#x2013;<lpage>148</lpage>, <year>2020</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>M.</given-names> <surname>Alazab</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Awajan</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Mesleh</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Abraham</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Jatana</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>COVID-19 prediction and detection using deep learning</article-title>,&#x201D; <source>International Journal of Computer Information Systems and Industrial Management Applications</source>, vol. <volume>12</volume>, no. <issue>26</issue>, pp. <fpage>168</fpage>&#x2013;<lpage>181</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I. D.</given-names> <surname>Apostolopoulos</surname></string-name> and <string-name><given-names>T. A.</given-names> <surname>Mpesiana</surname></string-name></person-group>, &#x201C;<article-title>Covid-19: Automatic detection from x-ray images utilizing transfer learning with convolutional neural networks</article-title>,&#x201D; <source>Physical and Engineering Sciences in Medicine</source>, vol. <volume>6</volume>, no. <issue>2</issue>, pp. <fpage>1</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Ozturk</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Talo</surname></string-name>, <string-name><given-names>E. A.</given-names> <surname>Yildirim</surname></string-name>, <string-name><given-names>U. B.</given-names> <surname>Baloglu</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Yildirim</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Automated detection of COVID-19 cases using deep neural networks with X-ray images</article-title>,&#x201D; <source>Computers in Biology and Medicine</source>, vol. <volume>23</volume>, pp. <fpage>103792</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. M.</given-names> <surname>Ismael</surname></string-name> and <string-name><given-names>A.</given-names> <surname>&#x015E;eng&#x00FC;r</surname></string-name></person-group>, &#x201C;<article-title>Deep learning approaches for COVID-19 detection based on chest X-ray images</article-title>,&#x201D; <source>Expert Systems with Applications</source>, vol. <volume>164</volume>, pp. <fpage>114054</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Panwar</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Gupta</surname></string-name>, <string-name><given-names>M. K.</given-names> <surname>Siddiqui</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Morales-Menendez</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Bhardwaj</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>A deep learning and grad-cAM based color visualization approach for fast detection of COVID-19 cases using chest X-ray and CT-scan images chaos</article-title>,&#x201D; <source>Solitons &#x0026; Fractals</source>, vol. <volume>140</volume>, pp. <fpage>110190</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E.</given-names> <surname>Hussain</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Hasan</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Rahman</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Lee</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Tamanna</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Corodet: A deep learning based classification for COVID-19 detection using chest X-ray images chaos</article-title>,&#x201D; <source>Solitons &#x0026; Fractals</source>, vol. <volume>11</volume>, pp. <fpage>110495</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. Z.</given-names> <surname>Islam</surname></string-name>, <string-name><given-names>M. M.</given-names> <surname>Islam</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Asraf</surname></string-name></person-group>, &#x201C;<article-title>A combined deep CNN-lSTM network for the detection of novel coronavirus (COVID-19) using X-ray images</article-title>,&#x201D; <source>Informatics in Medicine Unlocked</source>, vol. <volume>20</volume>, no. <issue>6</issue>, pp. <fpage>100412</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Toraman</surname></string-name>, <string-name><given-names>T. B.</given-names> <surname>Alakus</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Turkoglu</surname></string-name></person-group>, &#x201C;<article-title>Convolutional capsnet: A novel artificial neural network approach to detect COVID-19 disease from X-ray images using capsule networks chaos</article-title>,&#x201D; <source>Solitons &#x0026; Fractals</source>, vol. <volume>140</volume>, pp. <fpage>110122</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Su</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Jiang</surname></string-name>, <string-name><given-names>L.-L.</given-names> <surname>Zeng</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Feng</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Dual-branch combination network (DCN): Towards accurate diagnosis and lesion segmentation of COVID-19 using CT images</article-title>,&#x201D; <source>Medical Image Analysis</source>, vol. <volume>67</volume>, no. <issue>1</issue>, pp. <fpage>101836</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. J.</given-names> <surname>Horry</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Chakraborty</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Paul</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Ulhaq</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Pradhan</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>COVID-19 detection through transfer learning using multimodal imaging data</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>149808</fpage>&#x2013;<lpage>149824</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Arora</surname></string-name>, <string-name><given-names>L. M.</given-names> <surname>Goyal</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Chintalapudi</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Mittal</surname></string-name></person-group>, &#x201C;<article-title>Factors affecting digital education during COVID-19: a statistical modeling approach</article-title>,&#x201D; in <conf-name>2020 5th Int. Conf. on Computing, Communication and Security (ICCCS)</conf-name>, <publisher-loc>Patna, India</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Mittal</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Battineni</surname></string-name>, <string-name><given-names>L. M.</given-names> <surname>Goyal</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Chhetri</surname></string-name>, <string-name><given-names>S. V.</given-names> <surname>Oberoi</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Cloud-based framework to mitigate the impact of COVID-19 on seafarers&#x2019; mental health</article-title>,&#x201D; <source>International Maritime Health</source>, vol. <volume>71</volume>, pp. <fpage>213</fpage>&#x2013;<lpage>214</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. K.</given-names> <surname>Sethi</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Mittal</surname></string-name></person-group>, &#x201C;<article-title>Monitoring the impact of air quality on the COVID-19 fatalities in Delhi, India: Using machine learning techniques</article-title>,&#x201D; <source>Disaster Medicine and Public Health Preparedness</source>, vol. <volume>8</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>8</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Liaqat</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Sharif</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Mittal</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Saba</surname></string-name></person-group>, &#x201C;<article-title>Gastric tract infections detection and classification from wireless capsule endoscopy using computer vision techniques: A review</article-title>,&#x201D; <source>Current Medical Imaging</source>, vol. <volume>22</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>31</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Mittal</surname></string-name>, <string-name><given-names>L. M.</given-names> <surname>Goyal</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Kaur</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Kaur</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Verma</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Deep learning based enhanced tumor segmentation approach for MR brain images</article-title>,&#x201D; <source>Applied Soft Computing</source>, vol. <volume>78</volume>, pp. <fpage>346</fpage>&#x2013;<lpage>354</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Rashid</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Alhaisoni</surname></string-name>, <string-name><given-names>S.-H.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>S. R.</given-names> <surname>Naqvi</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>A sustainable deep learning framework for object recognition using multi-layers deep features fusion and selection</article-title>,&#x201D; <source>Sustainability</source>, vol. <volume>12</volume>, pp. <fpage>5037</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Farhadi</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Redmon</surname></string-name></person-group>, &#x201C;<article-title>Yolov3: An incremental improvement</article-title>,&#x201D; <source>Computer Vision and Pattern Recognition</source>, vol. <volume>2</volume>, no. <issue>7</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Redmon</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Farhadi</surname></string-name></person-group>,&#x201C;<article-title>YOLO9000: Better, faster, stronger</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Honolulu, Hawaii</publisher-loc>, pp. <fpage>7263</fpage>&#x2013;<lpage>7271</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>He</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Ren</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Sun</surname></string-name></person-group>, &#x201C;<article-title>Deep residual learning for image recognition</article-title>,&#x201D; <conf-name>in Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Las Vegas, Nevada</publisher-loc>, pp. <fpage>770</fpage>&#x2013;<lpage>778</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Deng</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Dong</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Socher</surname></string-name>, <string-name><given-names>L.-J.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Li</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Imagenet: A large-scale hierarchical image database</article-title>,&#x201D; in <conf-name>&#x00A0;2009 IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Miami, FL, USA</publisher-loc>, pp. <fpage>248</fpage>&#x2013;<lpage>255</lpage>, <year>2009</year>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Naheed</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Shaheen</surname></string-name>, <string-name><given-names>S. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Alawairdhi</surname></string-name> and <string-name><given-names>M. A.</given-names> <surname>Khan</surname></string-name></person-group>, &#x201C;<article-title>Importance of features selection, attributes selection, challenges and future directions for medical imaging data: A review</article-title>,&#x201D; <source>Computer Modeling in Engineering &#x0026; Sciences</source>, vol. <volume>125</volume>, no. <issue>3</issue>, pp. <fpage>314</fpage>&#x2013;<lpage>344</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R. V.</given-names> <surname>Rao</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Pawar</surname></string-name></person-group>, &#x201C;<article-title>Constrained design optimization of selected mechanical system components using rao algorithms</article-title>,&#x201D; <source>Applied Soft Computing</source>, vol. <volume>89</volume>, no. <issue>4</issue>, pp. <fpage>106141</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Yadav</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Ekbal</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Saha</surname></string-name></person-group>, &#x201C;<article-title>Feature selection for entity extraction from multiple biomedical corpora: A PSO-based approach</article-title>,&#x201D; <source>Soft Computing</source>, vol. <volume>22</volume>, no. <issue>11</issue>, pp. <fpage>6881</fpage>&#x2013;<lpage>6904</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-45"><label>[45]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Amoozegar</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Minaei-Bidgoli</surname></string-name></person-group>, &#x201C;<article-title>Optimizing multi-objective PSO based feature selection method using a feature elitism mechanism</article-title>,&#x201D; <source>Expert Systems with Applications</source>, vol. <volume>113</volume>, no. <issue>26</issue>, pp. <fpage>499</fpage>&#x2013;<lpage>514</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-46"><label>[46]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.-B.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Ding</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Zhou</surname></string-name></person-group>, &#x201C;<article-title>Optimization method based extreme learning machine for classification</article-title>,&#x201D; <source>Neurocomputing</source>, vol. <volume>74</volume>, no. <issue>2</issue>, pp. <fpage>155</fpage>&#x2013;<lpage>163</lpage>, <year>2010</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>