<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="2.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Oncol.</journal-id>
<journal-title>Frontiers in Oncology</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Oncol.</abbrev-journal-title>
<issn pub-type="epub">2234-943X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fonc.2023.1193746</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Oncology</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>A multi-class deep learning model for early lung cancer and chronic kidney disease detection using computed tomography images</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Bhattacharjee</surname>
<given-names>Ananya</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="author-notes" rid="fn003">
<sup>&#x2020;</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2314517"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Rabea</surname>
<given-names>Sameh</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="author-notes" rid="fn001">
<sup>*</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2010116"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Bhattacharjee</surname>
<given-names>Abhishek</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<xref ref-type="author-notes" rid="fn001">
<sup>*</sup>
</xref>
<xref ref-type="author-notes" rid="fn003">
<sup>&#x2020;</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Elkaeed</surname>
<given-names>Eslam B.</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1217694"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Murugan</surname>
<given-names>R.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="author-notes" rid="fn001">
<sup>*</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Selim</surname>
<given-names>Heba Mohammed Refat M.</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="aff" rid="aff4">
<sup>4</sup>
</xref>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Sahu</surname>
<given-names>Ram Kumar</given-names>
</name>
<xref ref-type="aff" rid="aff5">
<sup>5</sup>
</xref>
<xref ref-type="author-notes" rid="fn001">
<sup>*</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2197568"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Shazly</surname>
<given-names>Gamal A.</given-names>
</name>
<xref ref-type="aff" rid="aff6">
<sup>6</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Salem Bekhit</surname>
<given-names>Mounir M.</given-names>
</name>
<xref ref-type="aff" rid="aff6">
<sup>6</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1587850"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>Bio-Medical Imaging Laboratory (BIOMIL), Department of Electronics and Communication Engineering, National Institute of Technology Silchar</institution>, <addr-line>Silchar</addr-line>, <country>India</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>Department of Pharmaceutical Sciences, College of Pharmacy, AlMaarefa University</institution>, <addr-line>Riyadh</addr-line>, <country>Saudi Arabia</country>
</aff>
<aff id="aff3">
<sup>3</sup>
<institution>Department of Pharmaceutical Sciences, Assam University (A Central University)</institution>, <addr-line>Silchar</addr-line>, <country>India</country>
</aff>
<aff id="aff4">
<sup>4</sup>
<institution>Microbiology and Immunology Department, Faculty of Pharmacy (Girls); Al-Azhar University</institution>, <addr-line>Cairo</addr-line>, <country>Egypt</country>
</aff>
<aff id="aff5">
<sup>5</sup>
<institution>Department of Pharmaceutical Sciences, Hemvati Nandan Bahuguna Garhwal University (A Central University)</institution>, <addr-line>Tehri Garhwal</addr-line>, <country>India</country>
</aff>
<aff id="aff6">
<sup>6</sup>
<institution>Kayyali Chair for Pharmaceutical Industry, Department of Pharmaceutics, College of Pharmacy, King Saud University</institution>, <addr-line>Riyadh</addr-line>, <country>Saudi Arabia</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>Edited by: Subhadeep Roy, National Institute of Pharmaceutical Education and Research, Kolkata, India</p>
</fn>
<fn fn-type="edited-by">
<p>Reviewed by: Pradeep Pal, Mahakal Institute of Pharmaceutical Studies, India; Mogana Das Murtey, University of Science Malaysia (USM), Malaysia</p>
</fn>
<fn fn-type="corresp" id="fn001">
<p>*Correspondence: Sameh Rabea, <email xlink:href="mailto:srabea@mcst.edu.sa">srabea@mcst.edu.sa</email>;  Abhishek Bhattacharjee, <email xlink:href="mailto:abhishek.bhattacharjee@aus.ac.in">abhishek.bhattacharjee@aus.ac.in</email>;  R. Murugan, <email xlink:href="mailto:murugan.rmn@ece.nits.ac.in">murugan.rmn@ece.nits.ac.in</email>;  Ram Kumar Sahu, <email xlink:href="mailto:ramsahu79@gmail.com">ramsahu79@gmail.com</email>
</p>
</fn>
<fn fn-type="equal" id="fn003">
<p>&#x2020;These authors have contributed equally to this work</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>02</day>
<month>06</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>13</volume>
<elocation-id>1193746</elocation-id>
<history>
<date date-type="received">
<day>27</day>
<month>03</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>04</day>
<month>05</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2023 Bhattacharjee, Rabea, Bhattacharjee, Elkaeed, Murugan, Selim, Sahu, Shazly and Salem Bekhit</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Bhattacharjee, Rabea, Bhattacharjee, Elkaeed, Murugan, Selim, Sahu, Shazly and Salem Bekhit</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>Lung cancer is a fatal disease caused by an abnormal proliferation of cells in the lungs. Similarly, chronic kidney disorders affect people worldwide and can lead to renal failure and impaired kidney function. Cyst development, kidney stones, and tumors are frequent diseases impairing kidney function. Since these conditions are generally asymptomatic, early, and accurate identification of lung cancer and renal conditions is necessary to prevent serious complications. Artificial Intelligence plays a vital role in the early detection of lethal diseases. In this paper, we proposed a modified Xception deep neural network-based computer-aided diagnosis model, consisting of transfer learning based image net weights of Xception model and a fine-tuned network for automatic lung and kidney computed tomography multi-class image classification. The proposed model obtained 99.39% accuracy, 99.33% precision, 98% recall, and 98.67% F1-score for lung cancer multi-class classification. Whereas, it attained 100% accuracy, F1 score, recall and precision for kidney disease multi-class classification. Also, the proposed modified Xception model outperformed the original Xception model and the existing methods. Hence, it can serve as a support tool to the radiologists and nephrologists for early detection of lung cancer and chronic kidney disease, respectively.</p>
</abstract>
<kwd-group>
<kwd>lung cancer</kwd>
<kwd>kidney diseases</kwd>
<kwd>computed tomography</kwd>
<kwd>modified Xception model</kwd>
<kwd>fine-tuning</kwd>
<kwd>transfer learning</kwd>
<kwd>artificial intelligence</kwd>
</kwd-group>
<counts>
<fig-count count="9"/>
<table-count count="8"/>
<equation-count count="19"/>
<ref-count count="61"/>
<page-count count="17"/>
<word-count count="8050"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-in-acceptance</meta-name>
<meta-value>Cancer Imaging and Image-directed Interventions</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1" sec-type="intro">
<label>1</label>
<title>Introduction</title>
<p>Lung cancer is one of the world&#x2019;s most life-threatening diseases. In 2023, smoking cigarettes will directly cause around 81% lung cancer deaths, with second-hand smoke contributing to an additional 3,560 of the 127,070 fatalities Siegel et&#xa0;al. (<xref ref-type="bibr" rid="B1">1</xref>). There are two primary categories of lung nodules: benign and malignant. Lung nodules that are benign remain firmly in their original position and do not spread to other bodily areas Heuvelmans et&#xa0;al. (<xref ref-type="bibr" rid="B2">2</xref>). Most benign lung nodules are not malignant. Diet, stress, genetics, local damage, and radiation exposure are among the potential contributory factors to benign tumors Takamori et&#xa0;al. (<xref ref-type="bibr" rid="B3">3</xref>). Malignant lung nodules, on the other hand, spread uncontrollably throughout the body through the lymphatic or blood systems Gu et&#xa0;al. (<xref ref-type="bibr" rid="B4">4</xref>). A malignant lung tumor needs immediate treatment, and if detected early, the patient may be treated by surgery and chemotherapy. On the other hand, Chronic Kidney Disease (CKD) is a degenerative ailment that affects more than 10% of the world&#x2019;s population, leading to 800 million individuals (<xref ref-type="bibr" rid="B5">5</xref>). Persons with diabetes mellitus and hypertension, older adults and women are more likely to develop CKD. Low- and middle-income nations are particularly burdened by CKD, because they are least prepared to handle its effects Hill et&#xa0;al. (<xref ref-type="bibr" rid="B6">6</xref>). It is graded as the 16<italic>
<sup>th</sup>
</italic> leading cause of death worldwide and is anticipated to move up to 5<italic>
<sup>th</sup>
</italic> place by 2040 Foreman et&#xa0;al. (<xref ref-type="bibr" rid="B7">7</xref>). The most common kidney disorders that impair kidney function are renal cell carcinoma (kidney tumor), cyst development, and nephrolithiasis (kidney stones). A hard object made up of chemicals from the urine constitutes the kidney stone disease Alelign and Petros (<xref ref-type="bibr" rid="B8">8</xref>). On the other hand, a kidney cyst consists of fluid within a thin wall that develops on the surface of the kidney Sanna et&#xa0;al. (<xref ref-type="bibr" rid="B9">9</xref>). Whereas kidney tumor accounts for the 10 most prevailing cancers worldwide Hsieh et&#xa0;al. (<xref ref-type="bibr" rid="B10">10</xref>).</p>
<p>Computed tomography (CT) scan is one of the best methods for examining lung cancer and CKD patients, because it produces images with excellent contrast and provides 3D information Brisbane et&#xa0;al. (<xref ref-type="bibr" rid="B11">11</xref>). Due to a global shortage of nephrologists and radiologists, manual inspection of medical images is expensive and time consuming and may result in misdiagnosis. CT images play a crucial part in diagnosing many lung and kidney diseases. Still, the necessity for a second opinion owing to a shortage of healthcare professionals significantly impacts the process. Consequently, early detection of renal problems such as kidney stones, cysts, and tumors and lung diseases appear to be critical in preventing kidney failure Bi et&#xa0;al. (<xref ref-type="bibr" rid="B12">12</xref>) and lung cancer Monkam et&#xa0;al. (<xref ref-type="bibr" rid="B13">13</xref>).</p>
<p>Traditional healthcare management has its limits, but predictive techniques such as deep learning (DL) algorithms can help to overcome these constraints Chen et&#xa0;al. (<xref ref-type="bibr" rid="B14">14</xref>); Singh et&#xa0;al. (<xref ref-type="bibr" rid="B15">15</xref>); Krishnamurthy et&#xa0;al. (<xref ref-type="bibr" rid="B16">16</xref>); Bhattacharjee et&#xa0;al. (<xref ref-type="bibr" rid="B17">17</xref>). The application of DL-based detection may reduce invasive procedures, enhancing the efficacy and sustainability of current healthcare methods Akter et&#xa0;al. (<xref ref-type="bibr" rid="B18">18</xref>); Alsuhibany et&#xa0;al. (<xref ref-type="bibr" rid="B19">19</xref>); Ardila et&#xa0;al. (<xref ref-type="bibr" rid="B20">20</xref>). Nowadays, it is feasible to manage enormous and useful data to enhance lung cancer and CKD diagnosis in decision making by using DL classification algorithms Khan et&#xa0;al. (<xref ref-type="bibr" rid="B21">21</xref>); Bhaskar and Manikandan (<xref ref-type="bibr" rid="B22">22</xref>); Coudray et&#xa0;al. (<xref ref-type="bibr" rid="B23">23</xref>). When healthcare practitioners integrate this information with data from other sources, new solutions using predictive analytics can be developed for early CKD and lung cancer diagnosis, related health concerns, and precision therapy. DL algorithms applied to CT images offer an advantage over conventional techniques in medical image classification scenarios. It eliminates the need for subject expertise by automatically learning high-level features from annotated images. DL techniques contributed to advances in oncology and kidney-related domains by reducing manual interventions. Numerous cancer types, namely, prostate cancer Almeida and Tavares (<xref ref-type="bibr" rid="B24">24</xref>), pelvic cancer Kalantar et&#xa0;al. (<xref ref-type="bibr" rid="B25">25</xref>) and lung cancer Xie et&#xa0;al. (<xref ref-type="bibr" rid="B26">26</xref>) have benefited from DL-based classification algorithms. Therefore, the severe negative effects of CKD and lung cancer on many afflicted people, the global shortage of nephrologists and the onset of AI-based computer-aided diagnosis systems motivated us to propose a DL-based classification model that can assist in early CKD and lung cancer detection.</p>
<p>This paper proposes a DL-based modified Xception model for automatically classifying lung cancer patients and kidney diseases such as cysts, stones, and tumors. The Xception model is modified in such a way that both transfer learning-based pre-trained &#x201c;imagenet&#x201d; weights and fine-tuned structure is incorporated into the proposed model and hence, is the novelty of the proposed model. Its main contributions are listed below:</p>
<list list-type="order">
<list-item>
<p>An effective multi-class modified Xception model is proposed to ensure the least false positives and negative cases for lung cancer and renal diseases, respectively.</p>
</list-item>
<list-item>
<p>The proposed model improved the classification model&#x2019;s convergence by ensuring no overfitting cases.</p>
</list-item>
<list-item>
<p>The proposed model outperformed the existing state-of-the-art techniques.</p>
</list-item>
</list>
<p>The remainder of the paper is structured as follows. Section 2 contains the related literature survey. This paper&#x2019;s materials and methods, including the dataset and the architecture, are described in Section 3. Sections 4 and 5 discuss the obtained results and the inferences drawn from them. Finally, Section 6 presents the Conclusion.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related work</title>
<p>This section introduces the various DL architectures used for lung cancer and renal disease classification based on different image modalities. This section is broadly divided into two classes: binary and multi-class classifications of lung cancer and renal diseases, respectively.</p>
<p>A combination of VGG16, AlexNet, and LeNet models was employed for lung cancer diagnosis. The features were best extracted by AlexNet, which was then coupled with the KNN classifier to reach a classification accuracy of 98.74% To&#x11f;Check that all equations and special characters are displayed correctly.a&#xe7;ar et&#xa0;al. (<xref ref-type="bibr" rid="B27">27</xref>). A cross-residual CNN was employed for binary classification of lung CT images that achieved 92.19% accuracy Lyu et&#xa0;al. (<xref ref-type="bibr" rid="B28">28</xref>). A lung tumor identification technique was introduced that employed a deep CNN model for classification and achieved 97.3% accuracy Rani and Jawhar (<xref ref-type="bibr" rid="B29">29</xref>). A DL-based binary classification of Squamous Cell Carcinoma (SCC) and Adenocarcinoma (ADC) was performed that achieved AUC of 94.14 and 95.94%, respectively Chen et&#xa0;al. (<xref ref-type="bibr" rid="B30">30</xref>). Computer-aided diagnostic approach for determining the possibility of lung nodule malignancy was employed using a SVM classifier and achieved AUC score of 90.05% Gon&#xe7;alves et&#xa0;al. (<xref ref-type="bibr" rid="B31">31</xref>). A novel CNN method was employed for binary classification of lung CT images Asuntha and Srinivasan (<xref ref-type="bibr" rid="B32">32</xref>). A maximum intensity projection based CNN model for automatically detecting lung cancer system was introduced that achieved a sensitivity of 92.7% Zheng et&#xa0;al. (<xref ref-type="bibr" rid="B33">33</xref>). A radiomics and CNN approach was used for binary classification of SCC and ADC that yielded AUC of 71% Chaunzwa et&#xa0;al. (<xref ref-type="bibr" rid="B34">34</xref>). A ResNeXt feature extractor followed by DenseNet classifier was employed for binary lung CT image classification that obtained 93.78% accuracy Zhang et&#xa0;al. (<xref ref-type="bibr" rid="B35">35</xref>). A multi-view CNN was introduced for binary classification of lung benign and malignant CT images that attained 90.49% sensitivity Liu and Kang (<xref ref-type="bibr" rid="B36">36</xref>).</p>
<p>In lung multiclass classification, Reddy et&#xa0;al. (<xref ref-type="bibr" rid="B37">37</xref>) identified Malignant, Normal, and Benign (MNoB) CT images using an advanced CNN model and pre-trained Resnet50 and Xception models. The highest accuracy obtained was 97.40%. Kareem et&#xa0;al. (<xref ref-type="bibr" rid="B38">38</xref>) presented a computer vision system for lung cancer identification through five stages, namely, pre-processing, image enhancement, segmentation, feature extraction, and SVM classifier for multi-class classification of MNoB CT images and obtained an accuracy of 89.88%. A. Bhattacharjee et&#xa0;al. (<xref ref-type="bibr" rid="B39">39</xref>) compared the performances of DenseNet 121, NASNet Large, and modified EfficientNet networks for MNoB multi-class classification.</p>
<p>In kidney binary classification, an automated DL-based kidney stone detection model was proposed using CT images and obtained an accuracy of 96.82% Yildirim et&#xa0;al. (<xref ref-type="bibr" rid="B40">40</xref>). An FCN-based kidney segmentation followed by a fully automatic framework using abdominal CT scans was proposed for kidney cysts detection and achieved a true positive rate of 84.3% Blau et&#xa0;al. (<xref ref-type="bibr" rid="B41">41</xref>). A cascaded Convolutional Neural Network (CNN) was proposed for stone detection based on CT images and obtained the highest accuracy of 95% Parakh et&#xa0;al. (<xref ref-type="bibr" rid="B42">42</xref>). A morphological cascaded CNN on CT images was proposed for renal lesion detection and obtained an AUC of 87.1% Zhang et&#xa0;al. (<xref ref-type="bibr" rid="B43">43</xref>). The presence of kidney tumors in CT images were incorporated using 2D CNN, ResNet 50, and VGG16 of 6, 50, and 16 layers, respectively. The 2D CNN, VGG16, and ResNet 50 achieved accuracy of 97, 60, and 96%, respectively Alzu&#x2019;bi et&#xa0;al. (<xref ref-type="bibr" rid="B44">44</xref>). A residual dual attention-based U-Net model followed by convolution and softmax layer was used for kidney cysts segmentation and classification, respectively. Precision and recall for the model were 96.34 and 96.88%, respectively. Out of a total of 79 CT images, 27 were used as test images Fu et&#xa0;al. (<xref ref-type="bibr" rid="B45">45</xref>). An MLP and backpropagation-based ANN was proposed to classify the kidney stones ultrasound images and obtained an accuracy of 98.8% Viswanath and Gunasundari (<xref ref-type="bibr" rid="B46">46</xref>). A ResNet-based deep neural network was proposed to distinguish between renal stone and normal CT images and achieved 99.1% Caglayan et&#xa0;al. (<xref ref-type="bibr" rid="B47">47</xref>). A 3D U-Net model was used for kidney segmentation followed by a DL-based classification model for kidney stone detection Cui et&#xa0;al. (<xref ref-type="bibr" rid="B48">48</xref>). A novel ensembling classifier was proposed for four different types of models such as Bayesian, Decision Tree, ANN, and rule-based classifier. The proposed approach used a genetic algorithm for weight assignment and achieved 97.1% accuracy Kazemi and Mirroshandel (<xref ref-type="bibr" rid="B49">49</xref>). Different algorithms such as Random Forest (RF), Decision Tree, Multi-layer perceptron, Naive Bayes, K-Nearest Neighbor, Support Vector Machine (SVM), and CNN were applied to get the best x-ray image classification model for kidney stone and healthy patients. The decision tree model achieved the highest F1 score of 85.3% Aksakalli et&#xa0;al. (<xref ref-type="bibr" rid="B50">50</xref>). A conventional and DL transfer learning methods were integrated to feed as input to an SVM classifier, which obtained a maximum of 88% specificity in distinguishing between normal and unhealthy renal ultrasound images Zheng et&#xa0;al. (<xref ref-type="bibr" rid="B51">51</xref>).</p>
<p>In kidney multiclass classification, an ensembled deep neural network, consisting of ResNet 101, MobileNet V2, and ShuffleNet networks classified Normal, Cyst, Tumor, and Stone (NCTS) ultrasound images and obtained a maximum multi-class classification accuracy of 96.54% Sudharson and Kokil (<xref ref-type="bibr" rid="B52">52</xref>). A VGG19 model was customized by replacing the fully connected layers with a naive inception module and dense layers to classify NCTS CT images Asif et&#xa0;al. (<xref ref-type="bibr" rid="B53">53</xref>). This method yielded a classification accuracy of 99.25%. CNN model was employed to classify NCTS CT images and obtained an accuracy of 99.36% Narmada et&#xa0;al. (<xref ref-type="bibr" rid="B54">54</xref>). The NCTS CT images classification was performed by first extracting the features through a DenseNet model followed by RF classifier and obtained an accuracy of 99.44% Qadir and Abd (<xref ref-type="bibr" rid="B55">55</xref>). Six DL classifiers such as swin transformer, Compact Convolutional Transformer, External Attention Transformer, Inception V3, VGG16, and ResNet were used for NCTS CT images. The maximum accuracy obtained was 99.30% Islam et&#xa0;al. (<xref ref-type="bibr" rid="B56">56</xref>).</p>
<p>In summary, various image modalities such as x-ray, ultrasound and CT images were used for lung cancer and renal disease classification. However, the majority of the work is based on binary classification of abnormal and normal images instead of multi-class classification. Considering the gap in the research findings of the above articles and inspired by the work in Bhattacharjee et&#xa0;al. (<xref ref-type="bibr" rid="B17">17</xref>), we proposed a fine-tuned and pre-trained transfer learning technique based modified Xception model for automatic multi-class classification of MNoB lung CT images. The present study is also extended for kidney NCTS CT images.</p>
</sec>
<sec id="s3" sec-type="materials|methods">
<label>3</label>
<title>Materials and methods</title>
<p>The dataset utilized in this study and the proposed improved Xception architecture along with its mathematical equations are covered in detail in this section.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Materials</title>
<p>In this study, two datasets are used, namely, Iraq-Oncology Teaching Hospital/National Center for Cancer Diseases (IQ-OTH/NCCD) Kareem (<xref ref-type="bibr" rid="B57">57</xref>) and CT Kidney dataset Islam et&#xa0;al. (<xref ref-type="bibr" rid="B56">56</xref>).</p>
<p>The IQ-OTH/NCCD dataset consists of healthy and unhealthy subjects suffering from lung cancer in various stages. This dataset can also be accessed from the Kaggle website Kareem (<xref ref-type="bibr" rid="B57">57</xref>). In 2019, the data were gathered for more than 3 months. All of the slides were annotated by the radiologists and oncologists of these two centers. The dataset contains 1,190 images featuring CT scan slices from 110 different instances. The dataset is divided into three categories: MNoB. There are 55 normal cases, 40 malignant cases, and 15 benign cases. Digital Imaging and Communications in Medicine (DICOM) format was used to originally gather the images. However, the JPEG format was subsequently included by the IQ-OTH/NCCD dataset itself. Siemens SOMATOM scanner is employed. One millimeter thick slices are used. The dataset is approved by the institutional review boards of the participating hospitals. Each CT scan is composed of 80 to 200 distinct slices. Every slice is a representation of a distinct angle and side of the human chest. For the 40 malignant instances, there are a total of 561 CT images. The majority of the subjects are from Iraq&#x2019;s middle area. <xref ref-type="fig" rid="f1">
<bold>Figure&#xa0;1</bold>
</xref> shows sample images of each MNoB class.</p>
<fig id="f1" position="float">
<label>Figure&#xa0;1</label>
<caption>
<p>IQ-OTHNCCD dataset <bold>(A)</bold> Benign <bold>(B)</bold> Malignant <bold>(C)</bold> Normal.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-13-1193746-g001.tif"/>
</fig>
<p>The NCTS dataset was gathered from Dhaka hospital, Bangladesh. Proper consent was taken from all the subjects before collecting the data, which was then approved by Dhaka Central International Medical College and Hospital. The dataset consists of 12,446 total abdomen and urogram CT images, where the axial and coronal cuts were taken. Out of this, the number of NCTS images is 5077, 3709, 2283, and 1377, respectively. The dataset can be accessed from the Kaggle website Islam and Mehedi (<xref ref-type="bibr" rid="B58">58</xref>). The dataset was originally in DICOM format, which was later converted to JPEG images through the Sante Dicom editor tool. The CT images were annotated by the Philips IntelliSpace Portal application, which was re-verified by a physician and medical technician to avoid any incorrect annotations. <xref ref-type="fig" rid="f2">
<bold>Figure&#xa0;2</bold>
</xref> shows sample images of each NCTS class.</p>
<fig id="f2" position="float">
<label>Figure&#xa0;2</label>
<caption>
<p>CT Kidney dataset <bold>(A)</bold> Normal <bold>(B)</bold> Cyst <bold>(C)</bold> Tumor <bold>(D)</bold> Stone.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-13-1193746-g002.tif"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Methodology</title>
<p>The proposed modified Xception model, short for the &#x201c;modified Extreme Inception&#x201d; model, mainly consists of transferring the weights of the &#x201c;imagenet&#x201d; to the target network through transfer learning followed by the fine-tuned network, as shown in figure effig:3. The target network is the modified Xception architecture. In the beginning, the input image is first resized from <inline-formula>
<mml:math display="inline" id="im1">
<mml:mrow>
<mml:mn>512</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> to <inline-formula>
<mml:math display="inline" id="im2">
<mml:mrow>
<mml:mn>224</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>224</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> during pre-processing for reduced complexity. Then, there are mainly three stages, namely, STAGE-I, STAGE-II, and STAGE-III. First, the source &#x201c;imagenet&#x201d; dataset is fed to the original XceptionNet, which is passed over 36 convolutional (conv) layers. Out of these, the number of regular conv and depth-wise Separable Conv 2D layers (Sep Conv 2D) is 2 and 34, respectively. The first block consists of two conv layers of <inline-formula>
<mml:math display="inline" id="im3">
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>kernels, followed by a Batch Normalization (BN) and Rectified Linear Unit (ReLU) activation function. All blocks, except Blocks 1 and 14, contain a linear stack of residually connected Sep Conv 2D layers. The input (I/P) and output (O/P) dimensions determine whether the residual connections are identity or convolution blocks. When the I/P and O/P dimensions are identical, identity mapping is performed, as shown in Block 5 of <xref ref-type="fig" rid="f3">
<bold>Figure&#xa0;3</bold>
</xref>. Otherwise, a linear projection is executed using short connections to make the dimensions match each other. Blocks 2, 3, 4, and 13 have a linear projection of conv filter of <inline-formula>
<mml:math display="inline" id="im4">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>kernel. These blocks also undergo max-pooling operations to extract sharp and smooth features and lower the computing cost by decreasing the amount of parameters that must be learned. BN is included after every conv 2D and Sep Conv 2D layers circumvent the local minima issue by translating the activations to the zero mean and unit variance, hence allowing larger gradient steps for faster convergence Ioffe and Szegedy (<xref ref-type="bibr" rid="B59">59</xref>). The use of Sep Conv 2D overcomes the limitation of CNN by segregating the regular conv operations into depth-wise/spatial conv and sequential point-wise conv. This results in fewer parameters compared with regular conv and hence reduces the chances of overfitting Chollet (<xref ref-type="bibr" rid="B60">60</xref>). Block 5 is repeated five times having identity mappings. The last block 14 is fed to the softmax layer which finally classifies a thousand classes of imagenet dataset such as kite, bulbul, candle, corn, and so on.</p>
<fig id="f3" position="float">
<label>Figure&#xa0;3</label>
<caption>
<p>The proposed modified XceptionNet model.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-13-1193746-g003.tif"/>
</fig>
<p>Let the kernel &#x201c;W&#x201d; of size <inline-formula>
<mml:math display="inline" id="im5">
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>be convolved with the I/P image &#x201c;j(<italic>x</italic>, <italic>y</italic>)&#x201d; and the output &#x201c;K(<italic>x</italic>, <italic>y</italic>)&#x201d; is represented by Equation (1), which is then fed to a ReLU activation function &#x201c; <inline-formula>
<mml:math display="inline" id="im6">
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>K</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>&#x201c;, given by Equation (2). Similarly, the next Conv 2D outputs &#x201c;l(<italic>x</italic>, <italic>y</italic>),&#x201d; given by Equation (3) and then fed to ReLU activation function, given by Equation (4).</p>
<disp-formula>
<label>(1)</label>
<mml:math display="block" id="M1">
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mi>W</mml:mi>
<mml:mo>*</mml:mo>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(2)</label>
<mml:math display="block" id="M2">
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>k</mml:mi>
<mml:mo>&lt;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>k</mml:mi>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(3)</label>
<mml:math display="block" id="M3">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mi>W</mml:mi>
<mml:mo>*</mml:mo>
<mml:mi>k</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(4)</label>
<mml:math display="block" id="M4">
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>&#xa0;</mml:mi>
<mml:mi>l</mml:mi>
<mml:mo>&lt;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>&#xa0;</mml:mi>
<mml:mi>l</mml:mi>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Suppose the I/P dimension of the imagenet dataset be of size <inline-formula>
<mml:math display="inline" id="im7">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, where <inline-formula>
<mml:math display="inline" id="im8">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>is the I/P image size and C is the number of channels. Let the number of filters/kernels be D of size <inline-formula>
<mml:math display="inline" id="im9">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>q</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>q</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>For a regular conv, the output size will be <inline-formula>
<mml:math display="inline" id="im10">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. Let the number of multiplications per conv operation be n. Then the size of the filter will be <inline-formula>
<mml:math display="inline" id="im11">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>q</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>q</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. As D filters are present and every filter slides horizontally and vertically <inline-formula>
<mml:math display="inline" id="im12">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>times, the overall number of multiplications is given by Equation (5).</p>
<disp-formula>
<label>(5)</label>
<mml:math display="block" id="M5">
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>u</mml:mi>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>=</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#xd7;</mml:mo>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
<p>As Sep Conv 2D is combination of both depth-wise convolutions (d) and point-wise convolutions (p), let the number of &#x201c;d&#x201d; multiplications be D and &#x201c;p&#x201d; multiplications be P. Thus, the overall multiplications for Sep Conv 2D be given by Equation (6).</p>
<disp-formula>
<label>(6)</label>
<mml:math display="block" id="M6">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>u</mml:mi>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The dimension of filters for depth wise operations will be of size <inline-formula>
<mml:math display="inline" id="im13">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>q</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>q</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. Considering C channels for the I/P data, the number of such filters needed are &#x201c;C.&#x201d; Therefore, the output will be of dimension <inline-formula>
<mml:math display="inline" id="im14">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. Considering all &#x201c;C&#x201d; channels, the total multiplications (D) is given by Equation (7).</p>
<disp-formula>
<label>(7)</label>
<mml:math display="block" id="M7">
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mo>=</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>q</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>q</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>=</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#xd7;</mml:mo>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>q</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
<p>In point-wise operation, &#x201c;C&#x201d; channels are subjected to <inline-formula>
<mml:math display="inline" id="im15">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>convolution. Consequently, the filter dimension after this operation will be <inline-formula>
<mml:math display="inline" id="im16">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. For &#x201c;D&#x201d; such filters, the output dimension will be <inline-formula>
<mml:math display="inline" id="im17">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. For point-wise convolution, there will be <inline-formula>
<mml:math display="inline" id="im18">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>multiplications. Equation (8) provides the total number of point-wise convolution multiplications.</p>
<disp-formula>
<label>(8)</label>
<mml:math display="block" id="M8">
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Thus, the overall multiplications for Sep Conv 2D is given by Equation (9).</p>
<disp-formula>
<label>(9)</label>
<mml:math display="block" id="M9">
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>u</mml:mi>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#xd7;</mml:mo>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>q</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>+</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>=</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>q</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>+</mml:mo>
<mml:mi>D</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The relation between the complexity of regular conv and Sep Conv 2D is given by Equation (10).</p>
<disp-formula>
<label>(10)</label>
<mml:math display="block" id="M10">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>D</mml:mi>
</mml:mfrac>
<mml:mo>+</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>q</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Let Q(L) be the desired mapping and the original mapping be indicated by Q(L)+L, executed through shortcut connection followed by addition, as depicted in <xref ref-type="fig" rid="f3">
<bold>Figure&#xa0;3</bold>
</xref>.</p>
<p>Since in Block 2, I/P and output dimensions, namely, L and Q, are not equal, their dimensions are matched through a linear projection <inline-formula>
<mml:math display="inline" id="im19">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>A</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>using a shortcut connection. This is shown in Equation (11).</p><disp-formula>
<label>(11)</label>
<mml:math display="block" id="M11">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>e</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>A</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>L</mml:mi>
</mml:mrow>
</mml:math>
</disp-formula><p>where <inline-formula>
<mml:math display="inline" id="im20">
<mml:mrow>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>e</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>depicts the residual mapping and <inline-formula>
<mml:math display="inline" id="im21">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>e</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>is the weight layer. Ignoring BN for simplicity, <inline-formula>
<mml:math display="inline" id="im22">
<mml:mrow>
<mml:mi>Q</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>&#x3b3;</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mi>&#x3b3;</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>where <inline-formula>
<mml:math display="inline" id="im23">
<mml:mi>&#x3b3;</mml:mi>
</mml:math>
</inline-formula>indicates ReLU.</p>
<p>Similarly, the outputs of Block 3 and 4 are represented by Equations (12) and (13), respectively.</p>
<disp-formula>
<label>(12)</label>
<mml:math display="block" id="M12">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>f</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>B</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(13)</label>
<mml:math display="block" id="M13">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>g</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>C</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Now, the I/P and O/P dimensions from Block 5 to Block 12 are same. Hence, identity mapping is performed by shortcut connections, as shown in Equation (14). In this case, <inline-formula>
<mml:math display="inline" id="im24">
<mml:mrow>
<mml:mi>Q</mml:mi>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>&#x3b3;</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mi>&#x3b3;</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mi>L</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<disp-formula>
<label>(14)</label>
<mml:math display="block" id="M14">
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>5</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>6</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>5</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>5</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>12</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>11</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>o</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>11</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The output of Block 13 is given by Equation (15).</p>
<disp-formula>
<label>(15)</label>
<mml:math display="block" id="M15">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>13</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>12</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>D</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>k</mml:mi>
<mml:mn>12</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Now, the weights of the imagenet dataset trained on the original XceptionNet is transferred to the target network, which consists of customized top layers and fine-tuned blocks, thus assembling a transfer learning and fine-tuned based modified Xception model. As a result of transfer learning, the input CT kidney dataset and lung IQ-OTH/NCCD dataset fed through XceptionNet acts as feature extractors and the Block 14 is fed to our own customized top layers, which consists of Global Average Pooling (GAP) layers, Dropout (DROP) layer having dropout ratio of 0.05, 4, and 3 dense layers for NCTS and MNoB, respectively. Last, a softmax activation function is applied. Then, fine-tuning is performed by unfreezing the top 20 layers leaving BN layers frozen. If BN layers are set as trainable, the first epoch following unfreezing will result in a considerable reduction in accuracy. Thus, an efficient modified Xception approach is proposed that ensures higher performance in effective multi-class classification of NCTS and MNoB CT images. <xref ref-type="table" rid="T1">
<bold>Table&#xa0;1</bold>
</xref> explains the proposed architecture in detail.</p>
<table-wrap id="T1" position="float">
<label>Table&#xa0;1</label>
<caption>
<p>Architecture detail of the proposed model.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="left">Stage</th>
<th valign="middle" align="center">Block/Op</th>
<th valign="middle" align="center">Layer Type</th>
<th valign="middle" align="center">F/P size</th>
<th valign="middle" align="center">S/D</th>
<th valign="middle" align="center">O/P shape</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" align="left">I/P</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">(224 &#xd7; 224 &#xd7; 3)</td>
</tr>
<tr>
<td valign="middle" align="left">Stage I</td>
<td valign="middle" align="center">Block 1</td>
<td valign="middle" align="center">Conv 1</td>
<td valign="middle" align="center">3&#xd7;3, 32</td>
<td valign="middle" align="center">2</td>
<td valign="middle" align="center">(112 &#xd7; 112 &#xd7; 32)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">&#xa0;</td>
<td valign="middle" align="center">Conv 2</td>
<td valign="middle" align="center">3&#xd7;3, 64</td>
<td valign="middle" align="center">1</td>
<td valign="middle" align="center">(109 &#xd7; 109 &#xd7; 64)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">Block 2</td>
<td valign="middle" align="center">Sep Conv 1</td>
<td valign="middle" align="center">3&#xd7;3, 128</td>
<td valign="middle" align="center"/>
<td valign="middle" align="center">(109 &#xd7; 109 &#xd7; 128)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">&#xa0;</td>
<td valign="middle" align="center">Sep Conv 2</td>
<td valign="middle" align="center">3&#xd7;3, 128</td>
<td valign="middle" align="center">1</td>
<td valign="middle" align="center">(109 &#xd7; 109 &#xd7; 128)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">Maxpooling</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">2&#xd7;2</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">(55 &#xd7; 55 &#xd7; 128)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">&#xa0;</td>
<td valign="middle" align="center">Conv</td>
<td valign="middle" align="center">1&#xd7;1, 128</td>
<td valign="middle" align="center">2</td>
<td valign="middle" align="center">(55 &#xd7; 55 &#xd7; 128)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">add_0</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">(55 &#xd7; 55 &#xd7; 128)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">Block 3</td>
<td valign="middle" align="center">Sep Conv 1</td>
<td valign="middle" align="center">3&#xd7;3, 256</td>
<td valign="middle" align="center">1</td>
<td valign="middle" align="center">(55 &#xd7; 55 &#xd7; 256)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">&#xa0;</td>
<td valign="middle" align="center">Sep Conv 2</td>
<td valign="middle" align="center">3&#xd7;3, 256</td>
<td valign="middle" align="center">1</td>
<td valign="middle" align="center">(55 &#xd7; 55 &#xd7; 256)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">Maxpooling</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">2&#xd7;2</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">(28 &#xd7; 28 &#xd7; 256)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">&#xa0;</td>
<td valign="middle" align="center">Conv</td>
<td valign="middle" align="center">1&#xd7;1, 256</td>
<td valign="middle" align="center">2</td>
<td valign="middle" align="center">(28 &#xd7; 28 &#xd7; 256)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">add_1</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">(28 &#xd7; 28 &#xd7; 256)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">Block 4</td>
<td valign="middle" align="center">Sep Conv 1</td>
<td valign="middle" align="center">3&#xd7;3, 728</td>
<td valign="middle" align="center">1</td>
<td valign="middle" align="center">(28 &#xd7; 28 &#xd7; 728</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">&#xa0;</td>
<td valign="middle" align="center">Sep Conv 2</td>
<td valign="middle" align="center">33, 728</td>
<td valign="middle" align="center">1</td>
<td valign="middle" align="center">(28 &#xd7; 28 &#xd7; 728</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">Block 4</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">2&#xd7;2</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">(14 &#xd7; 14 &#xd7; 728)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">&#xa0;</td>
<td valign="middle" align="center">Conv</td>
<td valign="middle" align="center">1&#xd7;1, 728</td>
<td valign="middle" align="center">2</td>
<td valign="middle" align="center">(14 &#xd7; 14 &#xd7; 728)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">add_2</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">(14 &#xd7; 14 &#xd7; 728)</td>
</tr>
<tr>
<td valign="middle" rowspan="3" align="left">Stage II (repeated 8 times)</td>
<td valign="middle" align="center">Block 5</td>
<td valign="middle" align="center">Sep Conv 1</td>
<td valign="middle" align="center">3 &#xd7; 3, 728</td>
<td valign="middle" align="center">1</td>
<td valign="middle" align="center">(14 &#xd7; 14 &#xd7; 728)</td>
</tr>
<tr>
<td valign="middle" align="center">&#xa0;</td>
<td valign="middle" align="center">Sep Conv 2</td>
<td valign="middle" align="center">3 &#xd7; 3, 728</td>
<td valign="middle" align="center">1</td>
<td valign="middle" align="center">(14 &#xd7; 14 &#xd7; 728)</td>
</tr>
<tr>
<td valign="middle" align="center">&#xa0;</td>
<td valign="middle" align="center">Sep Conv 3</td>
<td valign="middle" align="center">3 &#xd7; 3, 728</td>
<td valign="middle" align="center">1</td>
<td valign="middle" align="center">(14 &#xd7; 14 &#xd7; 728)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">add_3</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">(14 &#xd7; 14 &#xd7; 728)</td>
</tr>
<tr>
<td valign="middle" align="left">Stage III</td>
<td valign="middle" align="center">Block 13</td>
<td valign="middle" align="center">Sep Conv 1</td>
<td valign="middle" align="center">3 &#xd7; 3, 728</td>
<td valign="middle" align="center">1</td>
<td valign="middle" align="center">(14 &#xd7; 14 &#xd7; 728)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">&#xa0;</td>
<td valign="middle" align="center">Sep Conv 2</td>
<td valign="middle" align="center">3 &#xd7;3, 1024</td>
<td valign="middle" align="center">1</td>
<td valign="middle" align="center">(14 &#xd7; 14 &#xd7; 1024)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">Maxpooling</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">2&#xd7;2</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">(7 &#xd7; 7 &#xd7; 1024)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">&#xa0;</td>
<td valign="middle" align="center">Conv</td>
<td valign="middle" align="center">1 &#xd7; 1, 1024</td>
<td valign="middle" align="center">2</td>
<td valign="middle" align="center">(7 &#xd7; 7 &#xd7; 1024)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">add_11</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">(7 &#xd7; 7 &#xd7; 1024)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">Block 14</td>
<td valign="middle" align="center">Sep Conv 1</td>
<td valign="middle" align="center">3 &#xd7; 3, 1536</td>
<td valign="middle" align="center">1</td>
<td valign="middle" align="center">(7 &#xd7; 7 &#xd7; 1536)</td>
</tr>
<tr>
<td valign="middle" align="left">&#xa0;</td>
<td valign="middle" align="center">&#xa0;</td>
<td valign="middle" align="center">Sep Conv 2</td>
<td valign="middle" align="center">3 &#xd7; 3, 1536</td>
<td valign="middle" align="center">1</td>
<td valign="middle" align="center">(7 &#xd7; 7 &#xd7; 2048)</td>
</tr>
<tr>
<td valign="middle" align="left">GAP</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">2048</td>
</tr>
<tr>
<td valign="middle" align="left">Dropout</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">0.5</td>
<td valign="middle" align="center">2048</td>
</tr>
<tr>
<td valign="middle" align="left">Dense</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">&#x2013;</td>
<td valign="middle" align="center">4</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Pseudocode</title>
<p>The NCTS and MNoB CT images are fed as input to the proposed model, which yields multi-class classified output. The input image shape is set as <inline-formula>
<mml:math display="inline" id="im25">
<mml:mrow>
<mml:mn>224</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>224</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>for both the cases. The batch size, learning rate (lr) and dense layers are set as 12, 0.00001 and 4, respectively. First, all the input image is appended from the NCTS and MNoB image directory. Subsequently, the labels for each of the case are also appended. Since there are four classes in NCTS and three in MNoB, the labels for NCTS (<inline-formula>
<mml:math display="inline" id="im26">
<mml:mrow>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mi>C</mml:mi>
<mml:mi>T</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>) range from 0 to 3 and <inline-formula>
<mml:math display="inline" id="im27">
<mml:mrow>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>N</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>B</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>range from 0 to 2, respectively. Second, the train test split is maintained in the ratio of 80 to 20%. Third, the Xception model is loaded with &#x201c;imagenet&#x201d; weights, and the topmost layers are replaced with GAP, DROP, and four dense layers. Then, fine-tuning is accomplished by defrosting the upper 20 layers while freezing the BN layers. If BN layers are set to trainable, the first epoch after unfreezing will result in a significant accuracy decrease. Later, the modified Xception model is compiled using Adam optimizer, sparse categorical cross-entropy loss function and accuracy metric. This process leads to a multiclassified NCTS and MNoB output. The <xref ref-type="statement" rid="st1">
<bold>Algorithm 1</bold>
</xref> describes the pseudocode of the proposed model.</p>
<statement id="st1">
<label>Algorithm 1 Pseudocode of the proposed model.</label>
<p>
<preformat>&#xD;<bold>Input:</bold> NCTS and MNoB CT images&#xD;<bold>Output:</bold> Multi-class classified output&#xD;<bold>Initialize:</bold> input_shape = (224, 224, 3), batch_size = 12, lr = 0.00001, Dense = 4, GAP: &#xD;Global Average Pooling, DROP: Dropout, BN: Batch Normalization&#xD;<bold>Procedure:</bold> l<sub>NCTS</sub> = {0, 1, 2, 3}&#xD;l<sub>MNoB</sub> = {0, 1, 2}&#xD;for image in image_directory:&#xD;data.append(image)&#xD;labels.append(l<sub>MNoB</sub> or l<sub>NCTS</sub>)&#xD;X_train, X_test, y_train, y_test = train_test_split (data, labels, test_size = 0.20)X = Xception (weights = &#x201c;imagenet,&#x201d; include_top=False, `input_shape=input_shape)&#xD;model.fc &#x2190; GAP, DROP, Dense&#xD;model &#x2190; Model(inputs = X.inputs, outputs = model.fc)&#xD;opt = Adam(lr = 0.00001)&#xD;for layer in model.layers[-20:]:&#xD;if not instance(layer, layers.BN):&#xD;layer.trainable = True&#xD;model.compile(optimizer=opt, loss = &#x201c;sparse_categorical_crossentropy&#x201d;, metrics=[&#x201c;accuracy&#x201d;])&#xD;end</preformat>
</p>
</statement>
</sec>
</sec>
<sec id="s4" sec-type="results">
<label>4</label>
<title>Results</title>
<p>This section comprises three subsections, namely, implementation detail, experimental setup, and experimental results.</p>
<sec id="s4_1">
<label>4.1</label>
<title>Implementation detail</title>
<p>Google colab pro plus was used for executing the proposed model, whose specifications are listed below. The python, keras and tensorflow version used are 3.8.10, 2.9.0 and 2.9.2, respectively. The GPU &#x201c;NVIDIA A100-SXM&#x201d; of 11.6 CUDA version and 83.48 GB RAM are used.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Experimental setup</title>
<p>The I/P RGB images of shape <inline-formula>
<mml:math display="inline" id="im28">
<mml:mrow>
<mml:mn>224</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>224</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>were divided into 80% training and 20% testing data. An experiment consisting of four networks, namely, Inception ResNet V2, Inception V3, NASNet and the proposed network, was conducted to get the bestNCTS model. The proposed model was trained with a batch size of 12 and an &#x201c;Adam&#x201d; optimizer with a learning rate equal to 0.00001 was used. The training was terminated <italic>via</italic> an early ending callback if the validation loss does not improve after nine epochs. The topmost layers of these networks were replaced with customized layers. Except the proposed model, all other networks were replaced with top layers having 2,048, 1024, and 512 dense layers followed by the ReLU activation function and four dense layers followed by the softmax activation function. Whereas, the proposed modified Xception model was replaced with GAP, DROP of 50% and four dense layers followed by a softmax activation function.</p>
<p>Similarly, an experiment was conducted for MNoB multi-class classification among the proposed model, Inception ResNet V2, Inception V3 and MobileNet V3 Small. The batch size, optimizer, learning rate, early stopping callback criteria and top layers all are kept the same as the NCTS case except three dense layers are used for MNoB classification instead of four.</p>
<p>The performance metrics such as Accuracy (Train, Test, and Validation), Precision, Recall and F1 score were used for evaluating the proposed modified Xception model and other pre-trained networks. Accuracy (Acc) describes closeness between the positively anticipated value and the actual samples, represented by Equation (16). Precision (Pr) is the percentage of correctly anticipated positives. It is given by Equation (17). Recall (Re) determines the fraction of anticipated positives that are accurate, givenby Equation (18). F1-score is the weighted harmonic mean of Re and Pr, represented by Equation (19).</p>
<disp-formula>
<label>(16)</label>
<mml:math display="block" id="M16">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>P</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>T</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>N</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>P</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>T</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>N</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>F</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>P</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>F</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>N</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where TruPos, TruNeg, FalPos, and FalNeg represent True Positives, True Negatives, False Positives, and False Negatives, respectively, and Acc represents Accuracy.</p>
<disp-formula>
<label>(17)</label>
<mml:math display="block" id="M17">
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>P</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>P</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>F</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>P</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(18)</label>
<mml:math display="block" id="M18">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>P</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>P</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>F</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>N</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(19)</label>
<mml:math display="block" id="M19">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mi>r</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>R</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>r</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>R</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Experimental result</title>
<p>
<xref ref-type="table" rid="T2">
<bold>Table&#xa0;2</bold>
</xref> shows the Train Acc, Validation Acc, and Test Acc for different models, such as Inception ResNet V2, Inception V3, NASNet Large, and the proposed modified Xception model. Inception ResNet V2 achieved least training, validation and testing accuracy of 40.79, 40.81, and 40.81%, respectively. Whereas, the proposed Xception model attained the maximum Train, Validation and Test Acc of 99.79, 99.92, and 100%, respectively.</p>
<table-wrap id="T2" position="float">
<label>Table&#xa0;2</label>
<caption>
<p>Train, Validation, and Test Accuracy for different models of kidney NCTS dataset.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Model</th>
<th valign="top" align="center">Train Acc (%)</th>
<th valign="top" align="center">Validation Acc (%)</th>
<th valign="top" align="center">Test Acc (%)</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Inception ResNet V2</td>
<td valign="top" align="center">40.79</td>
<td valign="top" align="center">40.81</td>
<td valign="top" align="center">40.81</td>
</tr>
<tr>
<td valign="top" align="left">Inception V3</td>
<td valign="top" align="center">97.24</td>
<td valign="top" align="center">97.91</td>
<td valign="top" align="center">98.82</td>
</tr>
<tr>
<td valign="top" align="left">NASNet Large</td>
<td valign="top" align="center">98.04</td>
<td valign="top" align="center">98.77</td>
<td valign="top" align="center">99.30</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>The proposed Xception model</bold>
</td>
<td valign="top" align="center">
<bold>99.79</bold>
</td>
<td valign="top" align="center">
<bold>99.92</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>Bold values represent best values obtained from the comparison by the proposed model.</p>
</table-wrap-foot>
</table-wrap>
<p>
<xref ref-type="table" rid="T3">
<bold>Table&#xa0;3</bold>
</xref> shows the performance metrics of different models for NCTS classification. Inception ResNet V2 obtained 0% Pr, Re, and F1-score for normal, tumor, and stone classes whereas, it obtained 41% precision, 100% recall and 58% F1-score for kidney cyst class. Thus, it means that it is inefficient in distinguishing among normal, tumor, and stone classes. On the otherhand, NASNet Large and Inception V3 outperformed the Inception ResNet V2 model. However, the proposed modified Xception model obtained the best results by achieving 100% Pr, Re, and F1-score for each of the NCTS classes.</p>
<table-wrap id="T3" position="float">
<label>Table&#xa0;3</label>
<caption>
<p>Performance metrics of different models for NCTS classification.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Metrics</th>
<th valign="top" colspan="4" align="center">Precision (%)</th>
<th valign="top" colspan="4" align="center">Recall (%)</th>
<th valign="top" colspan="4" align="center">F1-score (%)</th>
</tr>
<tr>
<th valign="top" align="left">Models</th>
<th valign="top" align="center">N</th>
<th valign="top" align="center">C</th>
<th valign="top" align="center">T</th>
<th valign="top" align="center">S</th>
<th valign="top" align="center">N</th>
<th valign="top" align="center">C</th>
<th valign="top" align="center">T</th>
<th valign="top" align="center">S</th>
<th valign="top" align="center">N</th>
<th valign="top" align="center">C</th>
<th valign="top" align="center">T</th>
<th valign="top" align="center">S</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Inception ResNet V2</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">41</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">100</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">58</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" align="left">Inception V3</td>
<td valign="top" align="center">98</td>
<td valign="top" align="center">100</td>
<td valign="top" align="center">96</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">98</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">97</td>
<td valign="top" align="center">99</td>
</tr>
<tr>
<td valign="top" align="left">NASNet Large</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">100</td>
<td valign="top" align="center">100</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">100</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">98</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">100</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">99</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Proposed model</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>Bold values represent best values obtained from the comparison by the proposed model.</p>
</table-wrap-foot>
</table-wrap>
<p>
<xref ref-type="fig" rid="f4">
<bold>Figure&#xa0;4</bold>
</xref> depicts the accuracy and loss curves for all the four different models mentioned above. Inception ResNet V2 showed the poorest accuracy and loss curves, showing accuracy of approximately 40%. The Inception V3 and NASNet Large showed training and validation accuracy of less than 100% and training and validation loss above 0%. However, the proposed model achieved the Train and Validation Acc of 100% and loss of 0%. Also, the epochs for the various NCTS models are not constant because an early termination callback was triggered if the validation loss did not decrease after 9 iterations of training.</p>
<fig id="f4" position="float">
<label>Figure&#xa0;4</label>
<caption>
<p>Train Acc, Validation Acc, Training loss, Validation loss curves of NCTS dataset <bold>(A)</bold> Inception ResNet V2 <bold>(B)</bold> Inception V3 <bold>(C)</bold> NASNet Large <bold>(D)</bold> Proposed model.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-13-1193746-g004.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="f5">
<bold>Figure&#xa0;5</bold>
</xref> depicts confusion matrix for each model. Since the Inception ResNet V2 achieved the poorest results, thus, it is unable to detect any other class except kidney cyst. Moreover, it misclassified other classes and considered them to be part of cyst class, whereas NASNet Large showed less misclassification classes than Inception V3. However, the proposed model showed no misclassification results and perfectly classified NCTS classes. Therefore, the proposed model is superior to the existing models for multi-class classification of NCTS classes.</p>
<fig id="f5" position="float">
<label>Figure&#xa0;5</label>
<caption>
<p>Confusion matrix of NCTS <bold>(A)</bold> Inception resnetv2 <bold>(B)</bold> Inception v3 <bold>(C)</bold> NASNet Large <bold>(D)</bold> Proposed model.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-13-1193746-g005.tif"/>
</fig>
<p>
<xref ref-type="table" rid="T4">
<bold>Table&#xa0;4</bold>
</xref> depicts the Train, Validation, and Test Acc of different models such as Inception ResNet V2, Inception V3, MobileNet V3 Small, and the proposed model for MNoB classes. Inception ResNet V2 obtained the least Train, Validation and Test Acc of 51.18, 50.91, and 50.91%, respectively. Although Inception V3 and MobileNet V3 Small achieved almost same training and validation accuracy, their testing accuracies are different. MobileNet achieved approximately 2% lower test accuracy than Inception V3, whereas the proposed modified Xception model obtained the highest Train, Validation, and Test Acc of 100, 99.39, and 99.39%, respectively. <xref ref-type="table" rid="T5">
<bold>Table&#xa0;5</bold>
</xref> shows the evaluation metrics such as Pr, Re and F1 score of the above mentioned models for each MNoB class. Inception ResNet V2 obtained 51% Pr, 100% Re and 67% F1-score for normal class. It is unable to detect malignant and benign class, thus, proving it to be inefficient. Inception V3 and MobileNet V3 Small performed better than Inception ResNet V2, whereas the proposed model obtained the highest Pr, Re, and F1-score of 100, 100, 98, 94, 100, 100, 97, 100, and 99%, respectively for each MNoB class.</p>
<table-wrap id="T4" position="float">
<label>Table&#xa0;4</label>
<caption>
<p>Train, Validation and Test Accuracy for different models of lung cancer dataset.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Models</th>
<th valign="top" align="center">Training Acc (%)</th>
<th valign="top" align="center">Validation Acc (%)</th>
<th valign="top" align="center">Testing Acc (%)</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Inception ResNet V2</td>
<td valign="top" align="center">51.18</td>
<td valign="top" align="center">50.91</td>
<td valign="top" align="center">50.91</td>
</tr>
<tr>
<td valign="top" align="left">Inception V3</td>
<td valign="top" align="center">98.18</td>
<td valign="top" align="center">93.33</td>
<td valign="top" align="center">96.36</td>
</tr>
<tr>
<td valign="top" align="left">MobileNet V3 Small</td>
<td valign="top" align="center">98.39</td>
<td valign="top" align="center">93.33</td>
<td valign="top" align="center">94.54</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Proposed model</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>99.39</bold>
</td>
<td valign="top" align="center">
<bold>99.39</bold>
</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>Bold values represent best values obtained from the comparison by the proposed model.</p>
</table-wrap-foot>
</table-wrap>
<table-wrap id="T5" position="float">
<label>Table&#xa0;5</label>
<caption>
<p>Performance metrics of different models for MNoB classification.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Metrics</th>
<th valign="top" colspan="3" align="center">Precision (%)</th>
<th valign="top" colspan="3" align="center">Recall (%)</th>
<th valign="top" colspan="3" align="center">F1-score (%)</th>
</tr>
<tr>
<th valign="top" align="left">Models</th>
<th valign="top" align="center">M</th>
<th valign="top" align="center">No</th>
<th valign="top" align="center">B</th>
<th valign="top" align="center">M</th>
<th valign="top" align="center">No</th>
<th valign="top" align="center">B</th>
<th valign="top" align="center">M</th>
<th valign="top" align="center">No</th>
<th valign="top" align="center">B</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Inception ResNet V2</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">51</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">100</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">67</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" align="left">Inception V3</td>
<td valign="top" align="center">100</td>
<td valign="top" align="center">95</td>
<td valign="top" align="center">97</td>
<td valign="top" align="center">78</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">98</td>
<td valign="top" align="center">88</td>
<td valign="top" align="center">97</td>
<td valign="top" align="center">98</td>
</tr>
<tr>
<td valign="top" align="left">MobileNet V3 Small</td>
<td valign="top" align="center">92</td>
<td valign="top" align="center">100</td>
<td valign="top" align="center">78</td>
<td valign="top" align="center">94</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">78</td>
<td valign="top" align="center">93</td>
<td valign="top" align="center">99</td>
<td valign="top" align="center">78</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Proposed model</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">98</td>
<td valign="top" align="center">
<bold>94</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">100</td>
<td valign="top" align="center">
<bold>97</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">99</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>Bold values represent best values obtained from the comparison by the proposed model.</p>
</table-wrap-foot>
</table-wrap>
<p>
<xref ref-type="fig" rid="f6">
<bold>Figure&#xa0;6</bold>
</xref> shows the Train Acc, Validation Acc, Train loss and Validation loss curves of the different models and the proposed model for MNoB classes. Inception ResNet V2 showed the poorest accuracy and loss curves, showing accuracy of approximately 50% and sparse categorical cross entropy loss of 0.9543. Inception V3 and MobileNet V3 fits the training data too closely but unable to generalize well on testing data, thus showing the sign of overfitting. However, the proposed Xception model obtained the highest Train Acc of 100% and sparse categorical cross entropy loss of 0.0015. Thus, the training loss curves obtained by NCTS model is better than the MNoB because of the reduced gap between the training and validation curves and, hence, it validates that there are no overfitting cases.</p>
<fig id="f6" position="float">
<label>Figure&#xa0;6</label>
<caption>
<p>Train Acc, Validation Acc, Train loss, Validation loss curves of lung cancer MNoB dataset <bold>(A)</bold> Inception ResNet V2 <bold>(B)</bold> Inception V3 <bold>(C)</bold> MobileNet V3 Small <bold>(D)</bold> Proposed model.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-13-1193746-g006.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7</bold>
</xref> depicts the confusion matrix for each of the MNoB models. Since the Inception ResNet V2 achieved the poorest results, thus, it is unable to detect any other class except normal. Moreover, it misclassified other classes and considered them to be part of normal class. Whereas Inception V3 showed less misclassification classes than MobileNet V3 small. However, the proposed model showed only one misclassification result by considering malignant class to be benign. Otherwise, it perfectly classified MNoB classes. Therefore, the proposed model is superior to existing models for multi-class classification of MNoB classes.</p>
<fig id="f7" position="float">
<label>Figure&#xa0;7</label>
<caption>
<p>Confusion matrix of MNoB <bold>(A)</bold> Inception resnetv2 <bold>(B)</bold> Inception v3 <bold>(C)</bold> MobileNet V3 Small <bold>(D)</bold> Proposed model.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-13-1193746-g007.tif"/>
</fig>
</sec>
</sec>
<sec id="s5" sec-type="discussion">
<label>5</label>
<title>Discussion</title>
<p>A highly effectual renal and lung cancer disease multi-class classifier aid in its early detection and reduces the chances of kidney failure and mortality rate of the affected patients, respectively. However, detecting renal ailments at the precise location in the CT images is challenging due to scarcity of nephrologists availability worldwide, especially in low-income countries Osman et&#xa0;al. (<xref ref-type="bibr" rid="B61">61</xref>). Also, manually detecting lung cancer from the CT images is laborious and error prone. Over the years, researchers have conducted substantial study on automatic renal and lung cancer disease classification, but mostly on binary classes. The present study overcomes this research gap by focusing on multi-class classification of several kidney ailments and lung cancer, respectively. The robustness test of the proposed model is conducted by comparing the proposed model with the original Xception model in terms of evaluation metrics and the state-of-the-art techniques.</p>
<p>The following are the key findings of the proposed model:</p>
<p>1. The modified Xception model outperforms the original Xception model in terms of computational time and evaluation metrics such as Average (Avg) Pr, Avg Re, Avg F1 score and test accuracy. The average is found out by taking the mean of all the four NCTS classes.</p>
<p>2. The proposed architecture surpasses the other pre-trained networks, namely, Inception ResNet V2, NASNet Large and Inception V3 in case of NCTS classification. Similarly, it outperforms the Inception ResNet V2, Inception V3 and MobileNet V3 Small in case of MNoB classification.</p>
<p>3. Invoking fine-tuning into the transfer learning based Xception architecture promotes faster training and reduced computational complexity.</p>
<p>4. The proposed model not only performed well on larger NCTS dataset containing approx. 12,000 CT images, but it performed good even in the case of smaller MNoB dataset containing approximately 1,200 images. Thus, the proposed model is a robust model.</p>
<p>5. The proposed model provides edge over performance to the state-of-the-art techniques.</p>
<sec id="s5_1">
<label>5.1</label>
<title>Comparison of computational time between the proposed model and the original Xception model</title>
<p>
<xref ref-type="fig" rid="f8">
<bold>Figure&#xa0;8</bold>
</xref> compares the proposed improved Xception model&#x2019;s computing time to that of the original Xception model in minutes. It is observed that the original Xception network took 14 min to train itself. Whereas, the proposed model took 12 min to train itself. Hence, fine tuning helped the proposed model in faster training and hence, reduced its computational complexity.</p>
<fig id="f8" position="float">
<label>Figure&#xa0;8</label>
<caption>
<p>Computational time comparison of the original Xception model and the proposed Xception model in minutes.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-13-1193746-g008.tif"/>
</fig>
</sec>
<sec id="s5_2">
<label>5.2</label>
<title>Comparison of the proposed model with the original Xception model</title>
<p>
<xref ref-type="table" rid="T6">
<bold>Table&#xa0;6</bold>
</xref> compares the proposed modified Xception model with the original Xception model in terms of performance metrics for both NCTS and MNoB cases. In NCTS case, the original model obtained 94.75% Average (Avg) precision, 97.5% Avg recall, 95.75% Avg F1 score and 97.07% test accuracy. On the other hand, the proposed model attained 100% of each of the performance metrics value. In MNoB case, the original Xception model obtained 58.33% Avg Pr, 65.33% Avg Re, 61.33% Avg F1 score and 87.27% Test Acc, whereas the proposed model obtained 99.33% Avg Pr, 98% Avg Re, 98.67% Avg F1 score and 99.39% Test Acc. Thus, it can be inferred that the original Xception model performed poorer for MNoB case compared with NCTS case, whereas, the proposed model performed equally good on both NCTS and MNoB cases. Hence, the proposed Xception model is appropriate for renal disease classification.</p>
<table-wrap id="T6" position="float">
<label>Table&#xa0;6</label>
<caption>
<p>Comparison of the proposed modified Xception model with the original Xception model.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Type</th>
<th valign="top" align="center">Models</th>
<th valign="top" align="center">Avg Pr (%)</th>
<th valign="top" align="center">Avg Re (%)</th>
<th valign="top" align="center">Avg F1 score (%)</th>
<th valign="top" align="center">Test Acc (%)</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">NCTS</td>
<td valign="top" align="center">Original Xception</td>
<td valign="top" align="center">94.75</td>
<td valign="top" align="center">97.5</td>
<td valign="top" align="center">95.75</td>
<td valign="top" align="center">97.07</td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="center">
<bold>Proposed modified Xception</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
</tr>
<tr>
<td valign="top" align="left">MNoB</td>
<td valign="top" align="center">Original Xception</td>
<td valign="top" align="center">58.33</td>
<td valign="top" align="center">65.33</td>
<td valign="top" align="center">61.33</td>
<td valign="top" align="center">87.27</td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="center">
<bold>Proposed modified Xception</bold>
</td>
<td valign="top" align="center">
<bold>99.33</bold>
</td>
<td valign="top" align="center">
<bold>98</bold>
</td>
<td valign="top" align="center">
<bold>98.67</bold>
</td>
<td valign="top" align="center">
<bold>99.39</bold>
</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>Bold values represent best values obtained from the comparison by the proposed model.</p>
</table-wrap-foot>
</table-wrap>
</sec>
<sec id="s5_3">
<label>5.3</label>
<title>Comparison of the proposed NCTS model with MNoB in terms of ROC curve</title>
<p>
<xref ref-type="fig" rid="f9">
<bold>Figure&#xa0;9</bold>
</xref> compares the ROC curve of both NCTS and MNoB models. Each class of NCTS and MNoB models obtained 100% AUC values. Thus, it is evident that both NCTS and MNoB models performed equally good in terms of ROC curve.</p>
<fig id="f9" position="float">
<label>Figure&#xa0;9</label>
<caption>
<p>ROC curves <bold>(A)</bold> NCTS <bold>(B)</bold> MNoB.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-13-1193746-g009.tif"/>
</fig>
</sec>
<sec id="s5_4">
<label>5.4</label>
<title>Comparison of the proposed model with the state-of-the-art techniques</title>
<p>The proposed NCTS model is compared with External Attention Transformer (EANET) Islam et&#xa0;al. (<xref ref-type="bibr" rid="B56">56</xref>), Compact Convolutional Transformer (CCT) Islam et&#xa0;al. (<xref ref-type="bibr" rid="B56">56</xref>), Swin Transformer Islam et&#xa0;al. (<xref ref-type="bibr" rid="B56">56</xref>), VGG 16 Islam et&#xa0;al. (<xref ref-type="bibr" rid="B56">56</xref>), Inception V3 Islam et&#xa0;al. (<xref ref-type="bibr" rid="B56">56</xref>), ResNet 50 Islam et&#xa0;al. (<xref ref-type="bibr" rid="B56">56</xref>), DenseNet 201 Qadir and Abd (<xref ref-type="bibr" rid="B55">55</xref>), Ensemble DNN Sudharson and Kokil (<xref ref-type="bibr" rid="B52">52</xref>), VGG 19 Asif et&#xa0;al. (<xref ref-type="bibr" rid="B53">53</xref>) and CNN Narmada et&#xa0;al. (<xref ref-type="bibr" rid="B54">54</xref>), as shown in <xref ref-type="table" rid="T7">
<bold>Table&#xa0;7</bold>
</xref>. The proposed model surpassed all the state-of-the-art techniques by achieving the highest Acc, Avg Pr, Avg Re and Avg F1-score of 100% each. Hence, the proposed model is felicitous for automatic CKD diagnosis.</p>
<table-wrap id="T7" position="float">
<label>Table&#xa0;7</label>
<caption>
<p>The proposed NCTS model comparison with the state-of-the-art techniques.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Ref</th>
<th valign="top" align="center">Models</th>
<th valign="top" align="center">Acc</th>
<th valign="top" align="center">Avg Pr</th>
<th valign="top" align="center">Avg Re</th>
<th valign="top" align="center">Avg F1-score</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Islam et&#xa0;al. (<xref ref-type="bibr" rid="B56">56</xref>)</td>
<td valign="top" align="center">EANET</td>
<td valign="top" align="center">77.02</td>
<td valign="top" align="center">81.6</td>
<td valign="top" align="center">78</td>
<td valign="top" align="center">77.18</td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="center">CCT</td>
<td valign="top" align="center">96.54</td>
<td valign="top" align="center">96.52</td>
<td valign="top" align="center">96.55</td>
<td valign="top" align="center">96.5</td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="center">Swin Transformer</td>
<td valign="top" align="center">99.30</td>
<td valign="top" align="center">99.15</td>
<td valign="top" align="center">99.15</td>
<td valign="top" align="center">99.12</td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="center">VGG16</td>
<td valign="top" align="center">98.20</td>
<td valign="top" align="center">98.22</td>
<td valign="top" align="center">98.12</td>
<td valign="top" align="center">98.17</td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="center">Inception V3</td>
<td valign="top" align="center">61.60</td>
<td valign="top" align="center">63.92</td>
<td valign="top" align="center">62</td>
<td valign="top" align="center">59.15</td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="center">ResNet 50</td>
<td valign="top" align="center">73.80</td>
<td valign="top" align="center">73.9</td>
<td valign="top" align="center">73.75</td>
<td valign="top" align="center">73.6</td>
</tr>
<tr>
<td valign="top" align="left">Qadir and Abd (<xref ref-type="bibr" rid="B55">55</xref>)</td>
<td valign="top" align="center">DenseNet 201</td>
<td valign="top" align="center">99.44</td>
<td valign="top" align="center">99.45</td>
<td valign="top" align="center">99.47</td>
<td valign="top" align="center">99.42</td>
</tr>
<tr>
<td valign="top" align="left">Sudharson and Kokil (<xref ref-type="bibr" rid="B52">52</xref>)</td>
<td valign="top" align="center">Ensemble DNN</td>
<td valign="top" align="center">96.54</td>
<td valign="top" align="center">96.25</td>
<td valign="top" align="center">96.5</td>
<td valign="top" align="center">96.5</td>
</tr>
<tr>
<td valign="top" align="left">Asif et&#xa0;al. (<xref ref-type="bibr" rid="B53">53</xref>)</td>
<td valign="top" align="center">VGG 19</td>
<td valign="top" align="center">96.37</td>
<td valign="top" align="center">96.25</td>
<td valign="top" align="center">96.5</td>
<td valign="top" align="center">96.5</td>
</tr>
<tr>
<td valign="top" align="left">Narmada et&#xa0;al. (<xref ref-type="bibr" rid="B54">54</xref>)</td>
<td valign="top" align="center">CNN</td>
<td valign="top" align="center">99.36</td>
<td valign="top" align="center">99.36</td>
<td valign="top" align="center">99.38</td>
<td valign="top" align="center">99.36</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>-</bold>
</td>
<td valign="top" align="center">Proposed</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
<td valign="top" align="center">
<bold>100</bold>
</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>Bold values represent best values obtained from the comparison by the proposed model.</p>
</table-wrap-foot>
</table-wrap>
<p>
<xref ref-type="table" rid="T8">
<bold>Table&#xa0;8</bold>
</xref> shows the comparison among the proposed MNoB model and the state-of-the-art models such as Advanced CNN Reddy et&#xa0;al. (<xref ref-type="bibr" rid="B37">37</xref>), Advanced CNN + Synthetic Minority Oversampling Technique SMOTE) Reddy et&#xa0;al. (<xref ref-type="bibr" rid="B37">37</xref>), Xception Reddy et&#xa0;al. (<xref ref-type="bibr" rid="B37">37</xref>) and ResNet 50 Reddy et&#xa0;al. (<xref ref-type="bibr" rid="B37">37</xref>), SVM Kareem et&#xa0;al. (<xref ref-type="bibr" rid="B38">38</xref>), DenseNet 121 Bhattacharjee et&#xa0;al. (<xref ref-type="bibr" rid="B39">39</xref>) and NASNet Large Bhattacharjee et&#xa0;al. (<xref ref-type="bibr" rid="B39">39</xref>). ResNet 50 Reddy et&#xa0;al. (<xref ref-type="bibr" rid="B37">37</xref>) performed the poorest followed by Xception Reddy et&#xa0;al. (<xref ref-type="bibr" rid="B37">37</xref>). However, the proposed modified MNoB Xception model outperformed all the state-of-the-art techniques by achieving the highest Acc, Avg Pr, Avg Re, and Avg F1-score of 99.39, 99.33, 98, and 98.67%, respectively.</p>
<table-wrap id="T8" position="float">
<label>Table&#xa0;8</label>
<caption>
<p>The proposed MNoB model comparison with the state-of-the-art techniques.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Ref</th>
<th valign="top" align="center">Models</th>
<th valign="top" align="center">Acc</th>
<th valign="top" align="center">Avg Pr</th>
<th valign="top" align="center">Avg Re</th>
<th valign="top" align="center">Avg F1-score</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Reddy et&#xa0;al. (<xref ref-type="bibr" rid="B37">37</xref>)</td>
<td valign="top" align="center">Advanced CNN</td>
<td valign="top" align="center">77.77</td>
<td valign="top" align="center">72</td>
<td valign="top" align="center">69</td>
<td valign="top" align="center">69</td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="center">Advanced CNN + SMOTE</td>
<td valign="top" align="center">97.40</td>
<td valign="top" align="center">96</td>
<td valign="top" align="center">97</td>
<td valign="top" align="center">97</td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="center">Xception</td>
<td valign="top" align="center">81.48</td>
<td valign="top" align="center">55</td>
<td valign="top" align="center">63</td>
<td valign="top" align="center">58</td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="center">ResNet 50</td>
<td valign="top" align="center">76.85</td>
<td valign="top" align="center">53</td>
<td valign="top" align="center">59</td>
<td valign="top" align="center">54</td>
</tr>
<tr>
<td valign="top" align="left">Bhattacharjee et&#xa0;al. (<xref ref-type="bibr" rid="B39">39</xref>)</td>
<td valign="top" align="center">DenseNet 121</td>
<td valign="top" align="center">95.76</td>
<td valign="top" align="center">98</td>
<td valign="top" align="center">92.67</td>
<td valign="top" align="center">93.67</td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="center">NASNet Large</td>
<td valign="top" align="center">86.67</td>
<td valign="top" align="center">77.67</td>
<td valign="top" align="center">79.67</td>
<td valign="top" align="center">78.33</td>
</tr>
<tr>
<td valign="top" align="left">Kareem et&#xa0;al. (<xref ref-type="bibr" rid="B38">38</xref>)</td>
<td valign="top" align="center">SVM</td>
<td valign="top" align="center">89.88</td>
<td valign="top" align="center">97.14</td>
<td valign="top" align="center">98</td>
<td valign="top" align="center">97.84</td>
</tr>
<tr>
<td valign="top" align="left">&#x2013;</td>
<td valign="top" align="center">
<bold>Proposed MNoB</bold>
</td>
<td valign="top" align="center">
<bold>99.39</bold>
</td>
<td valign="top" align="center">
<bold>99.33</bold>
</td>
<td valign="top" align="center">
<bold>98</bold>
</td>
<td valign="top" align="center">
<bold>98.67</bold>
</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>Bold values represent best values obtained from the comparison by the proposed model.</p>
</table-wrap-foot>
</table-wrap>
</sec>
<sec id="s5_5">
<label>5.5</label>
<title>Limitation of the proposed model</title>
<p>Despite encouraging results, the proposed MNoB model could not outperform the NCTS model due to the lack of training data. This issue can be solved by implementing data augmentation techniques to expand the training data. Moreover, since the proposed MNoB and NCTS models are two-dimensional, it cannot extract context from adjacent slices. This problem can be solved by introducing a 3D classification model that can take advantage of inter-slice context and, hence, enhance model&#x2019;s performance.</p>
</sec>
</sec>
<sec id="s6" sec-type="conclusions">
<label>6</label>
<title>Conclusions</title>
<p>In this article, we have proposed a fine tuned and pre-trained transfer learning based modified Xception model for automatic lung cancer and CKD diagnosis. The proposed model can distinguish among benign, normal and malignant lung CT images. Also, it can classify normal, tumor, cyst, and stone multi-classes renal CT images effectively. The proposed methodology composes of mainly four parts, namely, pre-processing, feature extraction, fine tuning, and customized top layers. Pre-processing is performed by resizing the input image from <inline-formula>
<mml:math display="inline" id="im29">
<mml:mrow>
<mml:mn>512</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>to <inline-formula>
<mml:math display="inline" id="im30">
<mml:mrow>
<mml:mn>224</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>224</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>for reduced complexity. Feature is extracted using pre-trained &#x201c;imagenet&#x201d; weights through Xception based transfer learning technique. The top 20 layers are unfreezed, keeping BN layers frozen to fine-tune the transfer learning based network so that an improved model is obtained. Last, the top most layers are customized using GAP, DROP, DENSE, and softmax layers for improving the potential and generalizibility of the model. The proposed modified Xception MNoB and NCTS model outperformed the existing Xception model and the state-of-the-art techniques. The NCTS model achieved 100% Acc, Pr, Re and F1-score. Whereas, the MNoB model obtained 99.39% Acc, 99.33% Avg Pr, 98% Avg Re, and 98.67% average F1 score. Hence, the proposed model is felicitous for early lung cancer and CKD prediction. It can ensure efficient management of lung cancer and CKD patients by aiding radiologists and nephrologists in diagnosing lung cancer and kidney abnormalities from CT images, respectively. The future scope of this study is that more advanced algorithms such as Squeeze and Excitation, Transformer Block and Dense Block can be incorporated for improved performance. An ensemble of squeeze and excitation, dense block and vision transformer can be implemented for enhanced performance. Also, the training data scarcity in case of MNoB can be addressed through data augmentation techniques or by using generative adversarial network. Moreover, 3D model can be leveraged in future to take into account the inter-slice context.</p>
</sec>
<sec id="s7" sec-type="data-availability">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material. Further inquiries can be directed to the corresponding authors.</p>
</sec>
<sec id="s8" sec-type="author-contributions">
<title>Author contributions</title>
<p>Conceptualization, AnB, AbB. Methodology, AnB, RM, AbB. Validation, AnB, SR, AbB. Formal analysis, RM, EE, HS. Writing&#x2014;original draft preparation, AnB, RM, AbB. Writing&#x2014;review and editing, AnB, AbB, RS, MSB, GS. Supervision, RM. All authors contributed to the article and approved the submitted version.</p>
</sec>
</body>
<back>
<sec id="s9" sec-type="funding-information">
<title>Funding</title>
<p>The authors extend their appreciation to the Deanship of Scientific Research, King Saud University for funding through the Vice Deanship of Scientific Research Chairs, Kayyali Chair for Pharmaceutical Industry, Department of Pharmaceutics, College of Pharmacy, for funding the publication of work through Grant Number MS-1-2023.</p>
</sec>
<ack>
<title>Acknowledgments</title>
<p>Authors would like to express their gratitude to AlMaarefa University, Riyadh, Saudi Arabia, for supporting this work.</p>
</ack>
<sec id="s10" sec-type="COI-statement">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="s11" sec-type="disclaimer">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<label>1</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Siegel</surname> <given-names>RL</given-names>
</name>
<name>
<surname>Miller</surname> <given-names>KD</given-names>
</name>
<name>
<surname>Wagle</surname> <given-names>NS</given-names>
</name>
<name>
<surname>Jemal</surname> <given-names>A</given-names>
</name>
</person-group>. <article-title>Cancer statistic</article-title>. <source>CA: Cancer J Clin</source> (<year>2023</year>) <volume>73</volume>:<fpage>17</fpage>&#x2013;<lpage>48</lpage>. doi: <pub-id pub-id-type="doi">10.3322/caac.21763</pub-id>
</citation>
</ref>
<ref id="B2">
<label>2</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Heuvelmans</surname> <given-names>MA</given-names>
</name>
<name>
<surname>van Ooijen</surname> <given-names>PM</given-names>
</name>
<name>
<surname>Ather</surname> <given-names>S</given-names>
</name>
<name>
<surname>Silva</surname> <given-names>CF</given-names>
</name>
<name>
<surname>Han</surname> <given-names>D</given-names>
</name>
<name>
<surname>Heussel</surname> <given-names>CP</given-names>
</name>
<etal/>
</person-group>. <article-title>Lung cancer prediction by deep learning to identify benign lung nodules</article-title>. <source>Lung Cancer</source> (<year>2021</year>) <volume>154</volume>:<fpage>1</fpage>&#x2013;<lpage>4</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.lungcan.2021.01.027</pub-id>
</citation>
</ref>
<ref id="B3">
<label>3</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Takamori</surname> <given-names>S</given-names>
</name>
<name>
<surname>Ishikawa</surname> <given-names>S</given-names>
</name>
<name>
<surname>Suzuki</surname> <given-names>J</given-names>
</name>
<name>
<surname>Oizumi</surname> <given-names>H</given-names>
</name>
<name>
<surname>Uchida</surname> <given-names>T</given-names>
</name>
<name>
<surname>Ueda</surname> <given-names>S</given-names>
</name>
<etal/>
</person-group>. <article-title>Differential diagnosis of lung cancer and benign lung lesion using salivary metabolites: a preliminary study</article-title>. <source>Thorac Cancer</source> (<year>2022</year>) <volume>13</volume>:<page-range>460&#x2013;5</page-range>. doi: <pub-id pub-id-type="doi">10.1111/1759-7714.14282</pub-id>
</citation>
</ref>
<ref id="B4">
<label>4</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gu</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Chi</surname> <given-names>J</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>J</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>L</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>B</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>D</given-names>
</name>
<etal/>
</person-group>. <article-title>A survey of computer-aided diagnosis of lung nodules from ct scans using deep learning</article-title>. <source>Comput Biol Med</source> (<year>2021</year>) <volume>137</volume>:<fpage>104806</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.compbiomed.2021.104806</pub-id>
</citation>
</ref>
<ref id="B5">
<label>5</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kovesdy</surname> <given-names>CP</given-names>
</name>
</person-group>. <article-title>Epidemiology of chronic kidney disease: an update 2022</article-title>. <source>Kidney Int Suppl</source> (<year>2022</year>) <volume>12</volume>:<fpage>7</fpage>&#x2013;<lpage>11</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.kisu.2021.11.003</pub-id>
</citation>
</ref>
<ref id="B6">
<label>6</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hill</surname> <given-names>NR</given-names>
</name>
<name>
<surname>Fatoba</surname> <given-names>ST</given-names>
</name>
<name>
<surname>Oke</surname> <given-names>JL</given-names>
</name>
<name>
<surname>Hirst</surname> <given-names>JA</given-names>
</name>
<name>
<surname>O&#x2019;Callaghan</surname> <given-names>CA</given-names>
</name>
<name>
<surname>Lasserson</surname> <given-names>DS</given-names>
</name>
<etal/>
</person-group>. <article-title>Global prevalence of chronic kidney disease&#x2013;a systematic review and meta-analysis</article-title>. <source>PloS One</source> (<year>2016</year>) <volume>11</volume>:<elocation-id>e0158765</elocation-id>. doi: <pub-id pub-id-type="doi">10.1371/journal.pone.0158765</pub-id>
</citation>
</ref>
<ref id="B7">
<label>7</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Foreman</surname> <given-names>KJ</given-names>
</name>
<name>
<surname>Marquez</surname> <given-names>N</given-names>
</name>
<name>
<surname>Dolgert</surname> <given-names>A</given-names>
</name>
<name>
<surname>Fukutaki</surname> <given-names>K</given-names>
</name>
<name>
<surname>Fullman</surname> <given-names>N</given-names>
</name>
<name>
<surname>McGaughey</surname> <given-names>M</given-names>
</name>
<etal/>
</person-group>. <article-title>Forecasting life expectancy, years of life lost, and all-cause and cause-specific mortality for 250 causes of death: reference and alternative scenarios for 2016&#x2013;40 for 195 countries and territories</article-title>. <source>Lancet</source> (<year>2018</year>) <volume>392</volume>:<page-range>2052&#x2013;90</page-range>. doi: <pub-id pub-id-type="doi">10.1016/S0140-6736(18)31694-5</pub-id>
</citation>
</ref>
<ref id="B8">
<label>8</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Alelign</surname> <given-names>T</given-names>
</name>
<name>
<surname>Petros</surname> <given-names>B</given-names>
</name>
</person-group>. <article-title>Kidney stone disease: an update on current concepts</article-title>. <source>Adv Urol</source> (<year>2018</year>) <volume>2018</volume>. doi: <pub-id pub-id-type="doi">10.1155/2018/3068365</pub-id>
</citation>
</ref>
<ref id="B9">
<label>9</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sanna</surname> <given-names>E</given-names>
</name>
<name>
<surname>Loukogeorgakis</surname> <given-names>S</given-names>
</name>
<name>
<surname>Prior</surname> <given-names>T</given-names>
</name>
<name>
<surname>Derwig</surname> <given-names>I</given-names>
</name>
<name>
<surname>Paramasivam</surname> <given-names>G</given-names>
</name>
<name>
<surname>Choudhry</surname> <given-names>M</given-names>
</name>
<etal/>
</person-group>. <article-title>Fetal abdominal cysts: antenatal course and postnatal outcomes</article-title>. <source>J Perinatal Med</source> (<year>2019</year>) <volume>47</volume>:<page-range>418&#x2013;21</page-range>. doi: <pub-id pub-id-type="doi">10.1515/jpm-2018-0311</pub-id>
</citation>
</ref>
<ref id="B10">
<label>10</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hsieh</surname> <given-names>JJ</given-names>
</name>
<name>
<surname>Purdue</surname> <given-names>MP</given-names>
</name>
<name>
<surname>Signoretti</surname> <given-names>S</given-names>
</name>
<name>
<surname>Swanton</surname> <given-names>C</given-names>
</name>
<name>
<surname>Albiges</surname> <given-names>L</given-names>
</name>
<name>
<surname>Schmidinger</surname> <given-names>M</given-names>
</name>
<etal/>
</person-group>. <article-title>Renal cell carcinoma</article-title>. <source>Nat Rev Dis Primers</source> (<year>2017</year>) <volume>3</volume>:<fpage>1</fpage>&#x2013;<lpage>19</lpage>. doi: <pub-id pub-id-type="doi">10.1038/nrdp.2017.9</pub-id>
</citation>
</ref>
<ref id="B11">
<label>11</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Brisbane</surname> <given-names>W</given-names>
</name>
<name>
<surname>Bailey</surname> <given-names>MR</given-names>
</name>
<name>
<surname>Sorensen</surname> <given-names>MD</given-names>
</name>
</person-group>. <article-title>An overview of kidney stone imaging techniques</article-title>. <source>Nat Rev Urol</source> (<year>2016</year>) <volume>13</volume>:<page-range>654&#x2013;62</page-range>. doi: <pub-id pub-id-type="doi">10.1038/nrurol.2016.154</pub-id>
</citation>
</ref>
<ref id="B12">
<label>12</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bi</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Shi</surname> <given-names>X</given-names>
</name>
<name>
<surname>Ren</surname> <given-names>J</given-names>
</name>
<name>
<surname>Yi</surname> <given-names>M</given-names>
</name>
<name>
<surname>Han</surname> <given-names>X</given-names>
</name>
</person-group>. <article-title>Transarterial chemoembolization of unresectable renal cell carcinoma with doxorubicin-loaded callispheres drug-eluting beads</article-title>. <source>Sci Rep</source> (<year>2022</year>) <volume>12</volume>:<fpage>1</fpage>&#x2013;<lpage>8</lpage>. doi: <pub-id pub-id-type="doi">10.1038/s41598-022-12334-x</pub-id>
</citation>
</ref>
<ref id="B13">
<label>13</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Monkam</surname> <given-names>P</given-names>
</name>
<name>
<surname>Qi</surname> <given-names>S</given-names>
</name>
<name>
<surname>Ma</surname> <given-names>H</given-names>
</name>
<name>
<surname>Gao</surname> <given-names>W</given-names>
</name>
<name>
<surname>Yao</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Qian</surname> <given-names>W</given-names>
</name>
</person-group>. <article-title>Detection and classification of pulmonary nodules using convolutional neural networks: a survey</article-title>. <source>IEEE Access</source> (<year>2019</year>) <volume>7</volume>:<page-range>78075&#x2013;91</page-range>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2019.2920980</pub-id>
</citation>
</ref>
<ref id="B14">
<label>14</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname> <given-names>G</given-names>
</name>
<name>
<surname>Ding</surname> <given-names>C</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Hu</surname> <given-names>X</given-names>
</name>
<name>
<surname>Li</surname> <given-names>X</given-names>
</name>
<name>
<surname>Ren</surname> <given-names>L</given-names>
</name>
<etal/>
</person-group>. <article-title>Prediction of chronic kidney disease using adaptive hybridized deep convolutional neural network on the internet of medical things platform</article-title>. <source>IEEE Access</source> (<year>2020</year>) <volume>8</volume>:<page-range>100497&#x2013;508</page-range>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2020.2995310</pub-id>
</citation>
</ref>
<ref id="B15">
<label>15</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Singh</surname> <given-names>V</given-names>
</name>
<name>
<surname>Asari</surname> <given-names>VK</given-names>
</name>
<name>
<surname>Rajasekaran</surname> <given-names>R</given-names>
</name>
</person-group>. <article-title>A deep neural network for early detection and prediction of chronic kidney disease</article-title>. <source>Diagnostics</source> (<year>2022</year>) <volume>12</volume>:<fpage>116</fpage>. doi: <pub-id pub-id-type="doi">10.3390/diagnostics12010116</pub-id>
</citation>
</ref>
<ref id="B16">
<label>16</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Krishnamurthy</surname> <given-names>S</given-names>
</name>
<name>
<surname>Ks</surname> <given-names>K</given-names>
</name>
<name>
<surname>Dovgan</surname> <given-names>E</given-names>
</name>
<name>
<surname>Lu&#x161;trek</surname> <given-names>M</given-names>
</name>
<name>
<surname>Gradi&#x161;ek Pileti&#x10d;</surname> <given-names>B</given-names>
</name>
<name>
<surname>Srinivasan</surname> <given-names>K</given-names>
</name>
<etal/>
</person-group>. <article-title>Machine learning prediction models for chronic kidney disease using national health insurance claim data in taiwan</article-title>. <source>Healthcare (MDPI)</source> (<year>2021</year>) <volume>9</volume>:<fpage>546</fpage>. doi: <pub-id pub-id-type="doi">10.3390/healthcare9050546</pub-id>
</citation>
</ref>
<ref id="B17">
<label>17</label>
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Bhattacharjee</surname> <given-names>A</given-names>
</name>
<name>
<surname>Murugan</surname> <given-names>R</given-names>
</name>
<name>
<surname>Goel</surname> <given-names>T</given-names>
</name>
<name>
<surname>Mirjalili</surname> <given-names>S</given-names>
</name>
</person-group>. <article-title>Pulmonary nodule segmentation framework based on fine-tuned and pre-trained deep neural network using ct images</article-title>(<year>2023</year>) (Accessed <access-date>IEEE Transactions on Radiation and Plasma Medical Sciences</access-date>).</citation>
</ref>
<ref id="B18">
<label>18</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Akter</surname> <given-names>S</given-names>
</name>
<name>
<surname>Habib</surname> <given-names>A</given-names>
</name>
<name>
<surname>Islam</surname> <given-names>MA</given-names>
</name>
<name>
<surname>Hossen</surname> <given-names>MS</given-names>
</name>
<name>
<surname>Fahim</surname> <given-names>WA</given-names>
</name>
<name>
<surname>Sarkar</surname> <given-names>PR</given-names>
</name>
<etal/>
</person-group>. <article-title>Comprehensive performance assessment of deep learning models in early prediction and risk identification of chronic kidney disease</article-title>. <source>IEEE Access</source> (<year>2021</year>) <volume>9</volume>:<page-range>165184&#x2013;206</page-range>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2021.3129491</pub-id>
</citation>
</ref>
<ref id="B19">
<label>19</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Alsuhibany</surname> <given-names>SA</given-names>
</name>
<name>
<surname>Abdel-Khalek</surname> <given-names>S</given-names>
</name>
<name>
<surname>Algarni</surname> <given-names>A</given-names>
</name>
<name>
<surname>Fayomi</surname> <given-names>A</given-names>
</name>
<name>
<surname>Gupta</surname> <given-names>D</given-names>
</name>
<name>
<surname>Kumar</surname> <given-names>V</given-names>
</name>
<etal/>
</person-group>. <article-title>Ensemble of deep learning based clinical decision support system for chronic kidney disease diagnosis in medical internet of things environment</article-title>. <source>Comput Intell Neurosci</source> (<year>2021</year>) <volume>2021</volume>. doi: <pub-id pub-id-type="doi">10.1155/2021/4931450</pub-id>
</citation>
</ref>
<ref id="B20">
<label>20</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ardila</surname> <given-names>D</given-names>
</name>
<name>
<surname>Kiraly</surname> <given-names>AP</given-names>
</name>
<name>
<surname>Bharadwaj</surname> <given-names>S</given-names>
</name>
<name>
<surname>Choi</surname> <given-names>B</given-names>
</name>
<name>
<surname>Reicher</surname> <given-names>JJ</given-names>
</name>
<name>
<surname>Peng</surname> <given-names>L</given-names>
</name>
<etal/>
</person-group>. <article-title>End-to-end lung cancer screening with three-dimensional deep learning on low-dose chest computed tomography</article-title>. <source>Nat Med</source> (<year>2019</year>) <volume>25</volume>:<page-range>954&#x2013;61</page-range>. doi: <pub-id pub-id-type="doi">10.1038/s41591-019-0447-x</pub-id>
</citation>
</ref>
<ref id="B21">
<label>21</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Khan</surname> <given-names>B</given-names>
</name>
<name>
<surname>Naseem</surname> <given-names>R</given-names>
</name>
<name>
<surname>Muhammad</surname> <given-names>F</given-names>
</name>
<name>
<surname>Abbas</surname> <given-names>G</given-names>
</name>
<name>
<surname>Kim</surname> <given-names>S</given-names>
</name>
</person-group>. <article-title>An empirical evaluation of machine learning techniques for chronic kidney disease prophecy</article-title>. <source>IEEE Access</source> (<year>2020</year>) <volume>8</volume>:<page-range>55012&#x2013;22</page-range>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2020.2981689</pub-id>
</citation>
</ref>
<ref id="B22">
<label>22</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bhaskar</surname> <given-names>N</given-names>
</name>
<name>
<surname>Manikandan</surname> <given-names>S</given-names>
</name>
</person-group>. <article-title>A deep-learning-based system for automated sensing of chronic kidney disease</article-title>. <source>IEEE Sensors Lett</source> (<year>2019</year>) <volume>3</volume>:<fpage>1</fpage>&#x2013;<lpage>4</lpage>. doi: <pub-id pub-id-type="doi">10.1109/LSENS.2019.2942145</pub-id>
</citation>
</ref>
<ref id="B23">
<label>23</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Coudray</surname> <given-names>N</given-names>
</name>
<name>
<surname>Ocampo</surname> <given-names>PS</given-names>
</name>
<name>
<surname>Sakellaropoulos</surname> <given-names>T</given-names>
</name>
<name>
<surname>Narula</surname> <given-names>N</given-names>
</name>
<name>
<surname>Snuderl</surname> <given-names>M</given-names>
</name>
<name>
<surname>Feny&#xf6;</surname> <given-names>D</given-names>
</name>
<etal/>
</person-group>. <article-title>Classification and mutation prediction from non&#x2013;small cell lung cancer histopathology images using deep learning</article-title>. <source>Nat Med</source> (<year>2018</year>) <volume>24</volume>:<page-range>1559&#x2013;67</page-range>. doi: <pub-id pub-id-type="doi">10.1038/s41591-018-0177-5</pub-id>
</citation>
</ref>
<ref id="B24">
<label>24</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Almeida</surname> <given-names>G</given-names>
</name>
<name>
<surname>Tavares</surname> <given-names>JMR</given-names>
</name>
</person-group>. <article-title>Deep learning in radiation oncology treatment planning for prostate cancer: a systematic review</article-title>. <source>J Med Syst</source> (<year>2020</year>) <volume>44</volume>:<fpage>1</fpage>&#x2013;<lpage>15</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s10916-020-01641-3</pub-id>
</citation>
</ref>
<ref id="B25">
<label>25</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kalantar</surname> <given-names>R</given-names>
</name>
<name>
<surname>Lin</surname> <given-names>G</given-names>
</name>
<name>
<surname>Winfield</surname> <given-names>JM</given-names>
</name>
<name>
<surname>Messiou</surname> <given-names>C</given-names>
</name>
<name>
<surname>Lalondrelle</surname> <given-names>S</given-names>
</name>
<name>
<surname>Blackledge</surname> <given-names>MD</given-names>
</name>
<etal/>
</person-group>. <article-title>Automatic segmentation of pelvic cancers using deep learning: state-of-the-art approaches and challenges</article-title>. <source>Diagnostics</source> (<year>2021</year>) <volume>11</volume>:<fpage>1964</fpage>. doi: <pub-id pub-id-type="doi">10.3390/diagnostics11111964</pub-id>
</citation>
</ref>
<ref id="B26">
<label>26</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xie</surname> <given-names>H</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>J-F</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Q</given-names>
</name>
</person-group>. <article-title>Application of deep convolution network to automated image segmentation of chest ct for patients with tumor</article-title>. <source>Front Oncol</source> (<year>2021</year>) <volume>11</volume>, <elocation-id>3959</elocation-id>. doi: <pub-id pub-id-type="doi">10.3389/fonc.2021.719398</pub-id>
</citation>
</ref>
<ref id="B27">
<label>27</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>To&#x11f;a&#xe7;ar</surname> <given-names>M</given-names>
</name>
<name>
<surname>Ergen</surname> <given-names>B</given-names>
</name>
<name>
<surname>C&#xf6;mert</surname> <given-names>Z</given-names>
</name>
</person-group>. <article-title>Detection of lung cancer on chest ct images using minimum redundancy maximum relevance feature selection method with convolutional neural networks</article-title>. <source>Biocybernet Biomed Eng</source> (<year>2020</year>) <volume>40</volume>:<fpage>23</fpage>&#x2013;<lpage>39</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.bbe.2019.11.004</pub-id>
</citation>
</ref>
<ref id="B28">
<label>28</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lyu</surname> <given-names>J</given-names>
</name>
<name>
<surname>Bi</surname> <given-names>X</given-names>
</name>
<name>
<surname>Ling</surname> <given-names>SH</given-names>
</name>
</person-group>. <article-title>Multi-level cross residual network for lung nodule classification</article-title>. <source>Sensors</source> (<year>2020</year>) <volume>20</volume>:<fpage>2837</fpage>. doi: <pub-id pub-id-type="doi">10.3390/s20102837</pub-id>
</citation>
</ref>
<ref id="B29">
<label>29</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rani</surname> <given-names>KV</given-names>
</name>
<name>
<surname>Jawhar</surname> <given-names>SJ</given-names>
</name>
</person-group>. <article-title>Superpixel with nanoscale imaging and boosted deep convolutional neural network concept for lung tumor classification</article-title>. <source>Int J Imaging Syst Technol</source> (<year>2020</year>) <volume>30</volume>:<fpage>899</fpage>&#x2013;<lpage>915</lpage>. doi: <pub-id pub-id-type="doi">10.1002/ima.22422</pub-id>
</citation>
</ref>
<ref id="B30">
<label>30</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname> <given-names>C-L</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>C-C</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>W-H</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>S-H</given-names>
</name>
<name>
<surname>Chang</surname> <given-names>Y-C</given-names>
</name>
<name>
<surname>Hsu</surname> <given-names>T-I</given-names>
</name>
<etal/>
</person-group>. <article-title>An annotation-free whole-slide training approach to pathological classification of lung cancer types using deep learning</article-title>. <source>Nat Commun</source> (<year>2021</year>) <volume>12</volume>:<fpage>1193</fpage>. doi: <pub-id pub-id-type="doi">10.1038/s41467-021-21467-y</pub-id>
</citation>
</ref>
<ref id="B31">
<label>31</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gon&#xe7;alves</surname> <given-names>L</given-names>
</name>
<name>
<surname>Novo</surname> <given-names>J</given-names>
</name>
<name>
<surname>Cunha</surname> <given-names>A</given-names>
</name>
<name>
<surname>Campilho</surname> <given-names>A</given-names>
</name>
</person-group>. <article-title>Learning lung nodule malignancy likelihood from radiologist annotations or diagnosis data</article-title>. <source>J Med Biol Eng</source> (<year>2018</year>) <volume>38</volume>:<page-range>424&#x2013;42</page-range>. doi: <pub-id pub-id-type="doi">10.1007/s40846-017-0317-2</pub-id>
</citation>
</ref>
<ref id="B32">
<label>32</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Asuntha</surname> <given-names>A</given-names>
</name>
<name>
<surname>Srinivasan</surname> <given-names>A</given-names>
</name>
</person-group>. <article-title>Deep learning for lung cancer detection and classification</article-title>. <source>Multimedia Tools Appl</source> (<year>2020</year>) <volume>79</volume>:<page-range>7731&#x2013;62</page-range>. doi: <pub-id pub-id-type="doi">10.1007/s11042-019-08394-3</pub-id>
</citation>
</ref>
<ref id="B33">
<label>33</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zheng</surname> <given-names>S</given-names>
</name>
<name>
<surname>Guo</surname> <given-names>J</given-names>
</name>
<name>
<surname>Cui</surname> <given-names>X</given-names>
</name>
<name>
<surname>Veldhuis</surname> <given-names>RN</given-names>
</name>
<name>
<surname>Oudkerk</surname> <given-names>M</given-names>
</name>
<name>
<surname>Van Ooijen</surname> <given-names>PM</given-names>
</name>
</person-group>. <article-title>Automatic pulmonary nodule detection in ct scans using convolutional neural networks based on maximum intensity projection</article-title>. <source>IEEE Trans Med Imaging</source> (<year>2019</year>) <volume>39</volume>:<fpage>797</fpage>&#x2013;<lpage>805</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TMI.2019.2935553</pub-id>
</citation>
</ref>
<ref id="B34">
<label>34</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chaunzwa</surname> <given-names>TL</given-names>
</name>
<name>
<surname>Hosny</surname> <given-names>A</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Shafer</surname> <given-names>A</given-names>
</name>
<name>
<surname>Diao</surname> <given-names>N</given-names>
</name>
<name>
<surname>Lanuti</surname> <given-names>M</given-names>
</name>
<etal/>
</person-group>. <article-title>Deep learning classification of lung cancer histology using ct images</article-title>. <source>Sci Rep</source> (<year>2021</year>) <volume>11</volume>:<fpage>1</fpage>&#x2013;<lpage>12</lpage>. doi: <pub-id pub-id-type="doi">10.1038/s41598-021-84630-x</pub-id>
</citation>
</ref>
<ref id="B35">
<label>35</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>G</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>Z</given-names>
</name>
<name>
<surname>Gong</surname> <given-names>L</given-names>
</name>
<name>
<surname>Jiang</surname> <given-names>S</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>L</given-names>
</name>
</person-group>. <article-title>Classification of benign and malignant lung nodules from ct images based on hybrid features</article-title>. <source>Phys Med Biol</source> (<year>2019</year>) <volume>64</volume>:<fpage>125011</fpage>. doi: <pub-id pub-id-type="doi">10.1088/1361-6560/ab2544</pub-id>
</citation>
</ref>
<ref id="B36">
<label>36</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname> <given-names>K</given-names>
</name>
<name>
<surname>Kang</surname> <given-names>G</given-names>
</name>
</person-group>. <article-title>Multiview convolutional neural networks for lung nodule classification</article-title>. <source>Int J Imaging Syst Technol</source> (<year>2017</year>) <volume>27</volume>:<fpage>12</fpage>&#x2013;<lpage>22</lpage>. doi: <pub-id pub-id-type="doi">10.1002/ima.22206</pub-id>
</citation>
</ref>
<ref id="B37">
<label>37</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Reddy</surname> <given-names>S</given-names>
</name>
<name>
<surname>Bhuvaneshwari</surname> <given-names>V</given-names>
</name>
<name>
<surname>Tikariha</surname> <given-names>AK</given-names>
</name>
<name>
<surname>Amballa</surname> <given-names>YS</given-names>
</name>
<name>
<surname>Raj</surname> <given-names>BSS</given-names>
</name>
</person-group>. <article-title>Automatic pulmonary nodule detection in ct scans using xception, resnet50 and advanced convolutional neural networks models</article-title>. <source>Int Res J EngTechnol</source> (<year>2022</year>) <volume>9</volume>(<issue>4</issue>), <page-range>3226&#x2013;3237</page-range>.</citation>
</ref>
<ref id="B38">
<label>38</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kareem</surname> <given-names>HF</given-names>
</name>
<name>
<surname>AL-Husieny</surname> <given-names>MS</given-names>
</name>
<name>
<surname>Mohsen</surname> <given-names>FY</given-names>
</name>
<name>
<surname>Khalil</surname> <given-names>EA</given-names>
</name>
<name>
<surname>Hassan</surname> <given-names>ZS</given-names>
</name>
</person-group>. <article-title>Evaluation of svm performance in the detection of lung cancer in marked ct scan dataset</article-title>. <source>Indones J Electr Eng Comput Sci</source> (<year>2021</year>) <volume>21</volume>:<fpage>1731</fpage>. doi: <pub-id pub-id-type="doi">10.11591/ijeecs.v21.i3.pp1731-1738</pub-id>
</citation>
</ref>
<ref id="B39">
<label>39</label>
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Bhattacharjee</surname> <given-names>A</given-names>
</name>
<name>
<surname>Shankar</surname> <given-names>K</given-names>
</name>
<name>
<surname>Murugan</surname> <given-names>R</given-names>
</name>
<name>
<surname>Goel</surname> <given-names>T</given-names>
</name>
</person-group>. (<year>2022</year>). <article-title>A powerful transfer learning technique for multiclass classification of lung cancer ct images</article-title>, in: <conf-name>2022 International Conference on Engineering and Emerging Technologies (ICEET)</conf-name>, . pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>.</citation>
</ref>
<ref id="B40">
<label>40</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yildirim</surname> <given-names>K</given-names>
</name>
<name>
<surname>Bozdag</surname> <given-names>PG</given-names>
</name>
<name>
<surname>Talo</surname> <given-names>M</given-names>
</name>
<name>
<surname>Yildirim</surname> <given-names>O</given-names>
</name>
<name>
<surname>Karabatak</surname> <given-names>M</given-names>
</name>
<name>
<surname>Acharya</surname> <given-names>UR</given-names>
</name>
</person-group>. <article-title>Deep learning model for automated kidney stone detection using coronal ct images</article-title>. <source>Comput Biol Med</source> (<year>2021</year>) <volume>135</volume>:<fpage>104569</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.compbiomed.2021.104569</pub-id>
</citation>
</ref>
<ref id="B41">
<label>41</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Blau</surname> <given-names>N</given-names>
</name>
<name>
<surname>Klang</surname> <given-names>E</given-names>
</name>
<name>
<surname>Kiryati</surname> <given-names>N</given-names>
</name>
<name>
<surname>Amitai</surname> <given-names>M</given-names>
</name>
<name>
<surname>Portnoy</surname> <given-names>O</given-names>
</name>
<name>
<surname>Mayer</surname> <given-names>A</given-names>
</name>
</person-group>. <article-title>Fully automatic detection of renal cysts in abdominal ct scans</article-title>. <source>Int J Comput Assist Radiol Surg</source> (<year>2018</year>) <volume>13</volume>:<page-range>957&#x2013;66</page-range>. doi: <pub-id pub-id-type="doi">10.1007/s11548-018-1726-6</pub-id>
</citation>
</ref>
<ref id="B42">
<label>42</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Parakh</surname> <given-names>A</given-names>
</name>
<name>
<surname>Lee</surname> <given-names>H</given-names>
</name>
<name>
<surname>Lee</surname> <given-names>JH</given-names>
</name>
<name>
<surname>Eisner</surname> <given-names>BH</given-names>
</name>
<name>
<surname>Sahani</surname> <given-names>DV</given-names>
</name>
<name>
<surname>Do</surname> <given-names>S</given-names>
</name>
</person-group>. <article-title>Urinary stone detection on ct images using deep convolutional neural networks: evaluation of model performance and generalization</article-title>. <source>Radiol: Artif Intell</source> (<year>2019</year>) <volume>1</volume>:<elocation-id>e180066</elocation-id>. doi: <pub-id pub-id-type="doi">10.1148/ryai.2019180066</pub-id>
</citation>
</ref>
<ref id="B43">
<label>43</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>H</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Song</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Xiong</surname> <given-names>Z</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>QJ</given-names>
</name>
</person-group>. <article-title>Automatic kidney lesion detection for ct images using morphological cascade convolutional neural networks</article-title>. <source>IEEE Access</source> (<year>2019</year>) <volume>7</volume>:<page-range>83001&#x2013;11</page-range>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2019.2924207</pub-id>
</citation>
</ref>
<ref id="B44">
<label>44</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Alzu&#x2019;bi</surname> <given-names>D</given-names>
</name>
<name>
<surname>Abdullah</surname> <given-names>M</given-names>
</name>
<name>
<surname>Hmeidi</surname> <given-names>I</given-names>
</name>
<name>
<surname>AlAzab</surname> <given-names>R</given-names>
</name>
<name>
<surname>Gharaibeh</surname> <given-names>M</given-names>
</name>
<name>
<surname>El-Heis</surname> <given-names>M</given-names>
</name>
<etal/>
</person-group>. <article-title>Kidney tumor detection and classification based on deep learning approaches: a new dataset in ct scans</article-title>. <source>J Healthcare Eng</source> (<year>2022</year>) <volume>2022</volume>. doi: <pub-id pub-id-type="doi">10.1155/2022/3861161</pub-id>
</citation>
</ref>
<ref id="B45">
<label>45</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Fu</surname> <given-names>X</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>H</given-names>
</name>
<name>
<surname>Bi</surname> <given-names>X</given-names>
</name>
<name>
<surname>Gong</surname> <given-names>X</given-names>
</name>
</person-group>. <article-title>Deep-learning-based ct imaging in the quantitative evaluation of chronic kidney diseases</article-title>. <source>J Healthcare Eng</source> (<year>2021</year>) <volume>2021</volume>. doi: <pub-id pub-id-type="doi">10.1155/2021/3774423</pub-id>
</citation>
</ref>
<ref id="B46">
<label>46</label>
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Viswanath</surname> <given-names>K</given-names>
</name>
<name>
<surname>Gunasundari</surname> <given-names>R</given-names>
</name>
</person-group>. <article-title>Design and analysis performance of kidney stone detection from ultrasound image by level set segmentation and ann classification</article-title>(<year>2014</year>) (Accessed <access-date>2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI)</access-date>).</citation>
</ref>
<ref id="B47">
<label>47</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Caglayan</surname> <given-names>A</given-names>
</name>
<name>
<surname>Horsanali</surname> <given-names>MO</given-names>
</name>
<name>
<surname>Kocadurdu</surname> <given-names>K</given-names>
</name>
<name>
<surname>Ismailoglu</surname> <given-names>E</given-names>
</name>
<name>
<surname>Guneyli</surname> <given-names>S</given-names>
</name>
</person-group>. <article-title>Deep learning model-assisted detection of kidney stones on computed tomography</article-title>. <source>Int Braz J Urol</source> (<year>2022</year>) <volume>48</volume>:<page-range>830&#x2013;9</page-range>. doi: <pub-id pub-id-type="doi">10.1590/s1677-5538.ibju.2022.0132</pub-id>
</citation>
</ref>
<ref id="B48">
<label>48</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cui</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>Z</given-names>
</name>
<name>
<surname>Ma</surname> <given-names>S</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>W</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>X</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>X</given-names>
</name>
<etal/>
</person-group>. <article-title>Automatic detection and scoring of kidney stones on noncontrast ct images using stone nephrolithometry: combined deep learning and thresholding methods</article-title>. <source>Mol Imaging Biol</source> (<year>2021</year>) <volume>23</volume>:<page-range>436&#x2013;45</page-range>. doi: <pub-id pub-id-type="doi">10.1007/s11307-020-01554-0</pub-id>
</citation>
</ref>
<ref id="B49">
<label>49</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kazemi</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Mirroshandel</surname> <given-names>SA</given-names>
</name>
</person-group>. <article-title>A novel method for predicting kidney stone type using ensemble learning</article-title>. <source>Artif Intell Med</source> (<year>2018</year>) <volume>84</volume>:<page-range>117&#x2013;26</page-range>. doi: <pub-id pub-id-type="doi">10.1016/j.artmed.2017.12.001</pub-id>
</citation>
</ref>
<ref id="B50">
<label>50</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Aksakalli</surname> <given-names>I</given-names>
</name>
<name>
<surname>Ka&#xe7;dio&#x11f;lu</surname> <given-names>S</given-names>
</name>
<name>
<surname>Hanay</surname> <given-names>YS</given-names>
</name>
</person-group>. <article-title>Kidney x-ray images classification using machine learning and deep learning methods</article-title>. <source>Balkan J Electr Comput Eng</source> (<year>2021</year>) <volume>9</volume>:<page-range>144&#x2013;51</page-range>. doi: <pub-id pub-id-type="doi">10.17694/bajece.878116</pub-id>
</citation>
</ref>
<ref id="B51">
<label>51</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zheng</surname> <given-names>Q</given-names>
</name>
<name>
<surname>Furth</surname> <given-names>SL</given-names>
</name>
<name>
<surname>Tasian</surname> <given-names>GE</given-names>
</name>
<name>
<surname>Fan</surname> <given-names>Y</given-names>
</name>
</person-group>. <article-title>Computer-aided diagnosis of congenital abnormalities of the kidney and urinary tract in children based on ultrasound imaging data by integrating texture image features and deep transfer learning image features</article-title>. <source>J Pediatr Urol</source> (<year>2019</year>) <volume>15</volume>:<fpage>75</fpage>&#x2013;<lpage>e1</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.jpurol.2018.10.020</pub-id>
</citation>
</ref>
<ref id="B52">
<label>52</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sudharson</surname> <given-names>S</given-names>
</name>
<name>
<surname>Kokil</surname> <given-names>P</given-names>
</name>
</person-group>. <article-title>An ensemble of deep neural networks for kidney ultrasound image classification</article-title>. <source>Comput Methods Programs Biomed</source> (<year>2020</year>) <volume>197</volume>:<fpage>105709</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.cmpb.2020.105709</pub-id>
</citation>
</ref>
<ref id="B53">
<label>53</label>
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Asif</surname> <given-names>S</given-names>
</name>
<name>
<surname>Wenhui</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Jinhai</surname> <given-names>S</given-names>
</name>
<name>
<surname>Ain</surname> <given-names>QU</given-names>
</name>
<name>
<surname>Yueyang</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Jin</surname> <given-names>H</given-names>
</name>
</person-group>. <article-title>Modeling a fine-tuned deep convolutional neural network for diagnosis of kidney diseases from ct images</article-title>(<year>2022</year>). <publisher-name>IEEE</publisher-name> (Accessed <access-date>2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)</access-date>).</citation>
</ref>
<ref id="B54">
<label>54</label>
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Narmada</surname> <given-names>N</given-names>
</name>
<name>
<surname>Shekhar</surname> <given-names>V</given-names>
</name>
<name>
<surname>Singh</surname> <given-names>T</given-names>
</name>
</person-group>. <article-title>Classification of kidney ailments using cnn in ct images</article-title>(<year>2022</year>) (Accessed <access-date>2022 13th International Conference on Computing Communication and Networking Technologies (ICCCNT)</access-date>).</citation>
</ref>
<ref id="B55">
<label>55</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Qadir</surname> <given-names>AM</given-names>
</name>
<name>
<surname>Abd</surname> <given-names>DF</given-names>
</name>
</person-group>. <article-title>Kidney diseases classification using hybrid transfer-learning densenet201-based and random forest classifier</article-title>. <source>Kurdistan J Appl Res</source> (<year>2023</year>) <volume>7</volume>(<issue>2</issue>), <page-range>131&#x2013;44</page-range>. doi: <pub-id pub-id-type="doi">10.24017/Science.2022.2.11</pub-id>
</citation>
</ref>
<ref id="B56">
<label>56</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Islam</surname> <given-names>MN</given-names>
</name>
<name>
<surname>Hasan</surname> <given-names>M</given-names>
</name>
<name>
<surname>Hossain</surname> <given-names>MK</given-names>
</name>
<name>
<surname>Alam</surname> <given-names>MGR</given-names>
</name>
<name>
<surname>Uddin</surname> <given-names>MZ</given-names>
</name>
<name>
<surname>Soylu</surname> <given-names>A</given-names>
</name>
</person-group>. <article-title>Vision transformer and explainable transfer learning models for auto detection of kidney cyst, stone and tumor from ct-radiography</article-title>. <source>Sci Rep</source> (<year>2022</year>) <volume>12</volume>:<fpage>11440</fpage>. doi: <pub-id pub-id-type="doi">10.1038/s41598-022-15634-4</pub-id>
</citation>
</ref>
<ref id="B57">
<label>57</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kareem</surname> <given-names>HF</given-names>
</name>
</person-group>. <source>The iq-oth/nccd lung cancer dataset</source>. (<year>2020</year>). doi:&#xa0;<pub-id pub-id-type="doi">10.17632/bhmdr45bh2.1</pub-id>.</citation>
</ref>
<ref id="B58">
<label>58</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Islam</surname> <given-names>MN</given-names>
</name>
<name>
<surname>Mehedi</surname> <given-names>MHK</given-names>
</name>
</person-group>. <source>Ct kidney dataset: normal-cyst-tumor and stone</source>. (<year>2022</year>).</citation>
</ref>
<ref id="B59">
<label>59</label>
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Ioffe</surname> <given-names>S</given-names>
</name>
<name>
<surname>Szegedy</surname> <given-names>C</given-names>
</name>
</person-group>. <article-title>Batch normalization: accelerating deep network training by reducing internal covariate shift</article-title>(<year>2015</year>) (Accessed <access-date>International conference on machine learning (pmlr)</access-date>).</citation>
</ref>
<ref id="B60">
<label>60</label>
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Chollet</surname> <given-names>F</given-names>
</name>
</person-group>. <article-title>Xception: deep learning with depthwise separable convolutions</article-title>(<year>2017</year>) (Accessed <access-date>Proceedings of the IEEE conference on computer vision and pattern recognition</access-date>).</citation>
</ref>
<ref id="B61">
<label>61</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Osman</surname> <given-names>MA</given-names>
</name>
<name>
<surname>Alrukhaimi</surname> <given-names>M</given-names>
</name>
<name>
<surname>Ashuntantang</surname> <given-names>GE</given-names>
</name>
<name>
<surname>Bellorin-Font</surname> <given-names>E</given-names>
</name>
<name>
<surname>Gharbi</surname> <given-names>MB</given-names>
</name>
<name>
<surname>Braam</surname> <given-names>B</given-names>
</name>
<etal/>
</person-group>. <article-title>Global nephrology workforce: gaps and opportunities toward a sustainable kidney care system</article-title>. <source>Kidney Int Suppl</source> (<year>2018</year>) <volume>8</volume>:<fpage>52</fpage>&#x2013;<lpage>63</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.kisu.2017.10.009</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>