<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Physiol.</journal-id>
<journal-title>Frontiers in Physiology</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Physiol.</abbrev-journal-title>
<issn pub-type="epub">1664-042X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1511716</article-id>
<article-id pub-id-type="doi">10.3389/fphys.2025.1511716</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Physiology</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Cnidaria herd optimized fuzzy C-means clustering enabled deep learning model for lung nodule detection</article-title>
<alt-title alt-title-type="left-running-head">Prasada Rao and Goswami</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fphys.2025.1511716">10.3389/fphys.2025.1511716</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Prasada Rao</surname>
<given-names>R. Hari</given-names>
</name>
<uri xlink:href="https://loop.frontiersin.org/people/2862807/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Goswami</surname>
<given-names>Agam Das</given-names>
</name>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2974957/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
</contrib-group>
<aff>
<institution>School of Electronics Engineering</institution>, <institution>VIT-AP University</institution>, <addr-line>Amaravati</addr-line>, <addr-line>Andhra Pradesh</addr-line>, <country>India</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1185415/overview">Feng Liu</ext-link>, The University of Queensland, Australia</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1684197/overview">Mario Versaci</ext-link>, Mediterranea University of Reggio Calabria, Italy</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/2136780/overview">Hua Zhang</ext-link>, The University of Queensland, Australia</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Agam Das Goswami, <email>agam.goswami@vitap.ac.in</email>
</corresp>
</author-notes>
<pub-date pub-type="epub">
<day>18</day>
<month>03</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="collection">
<year>2025</year>
</pub-date>
<volume>16</volume>
<elocation-id>1511716</elocation-id>
<history>
<date date-type="received">
<day>15</day>
<month>10</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>12</day>
<month>02</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2025 Prasada Rao and Goswami.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Prasada Rao and Goswami</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>
<sec>
<title>Introduction</title>
<p>Lung nodule detection is a crucial task for diagnosis and lung cancer prevention. However, it can be extremely difficult to identify tiny nodules in medical images since pulmonary nodules vary greatly in shape, size, and location. Further, the implemented methods have certain limitations including scalability, robustness, data availability, and false detection rate.</p>
</sec>
<sec>
<title>Methods</title>
<p>To overcome the limitations in the existing techniques, this research proposes the Cnidaria Herd Optimization (CHO) algorithm-enabled Bi-directional Long Short-Term Memory (CHSTM) model for effective lung nodule detection. Furthermore, statistical and texture descriptors extract the significant features that aid in improving the detection accuracy. In addition, the FC2R segmentation model combines the optimized fuzzy C-means clustering algorithm and the Resnet &#x2212;101 deep learning approach that effectively improves the performance of the model. Specifically, the CHO algorithm is modelled using the combination of the induced movement strategy of krill with the time control mechanism of the cnidaria to find the optimal solution and improve the CHSTM model&#x2019;s performance.</p>
</sec>
<sec>
<title>Results</title>
<p>According to the experimental findings of a performance comparison between other established methods, the FC2R &#x2b; CHSTM model achieves 98.09% sensitivity, 97.71% accuracy, and 97.03% specificity for TP 80 utilizing the LUNA-16 dataset. Utilizing the LIDC/IDRI dataset, the proposed approach attained a high accuracy of 97.59%, sensitivity of 96.77%, and specificity of 98.41% with k-fold validation outperforming the other existing techniques.</p>
</sec>
<sec>
<title>Conclusion</title>
<p>The proposed FC2R &#x2b; CHSTM model effectively detects lung nodules with minimum loss and better accuracy.</p>
</sec>
</abstract>
<kwd-group>
<kwd>lung nodule detection</kwd>
<kwd>fuzzy c-means clustering</kwd>
<kwd>Resnet &#x2212;101</kwd>
<kwd>cnidaria herd optimization</kwd>
<kwd>lobe segmentation</kwd>
<kwd>deep learning</kwd>
</kwd-group>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Computational Physiology and Medicine</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>Lung nodule detection is the initial stage of lung cancer screening in clinical medicine (<xref ref-type="bibr" rid="B40">Sharma et al., 2019</xref>) enabling prompt and appropriate treatment that can significantly lower the death rate (<xref ref-type="bibr" rid="B38">Schabath and Cote, 2019</xref>; <xref ref-type="bibr" rid="B20">Ji et al., 2023</xref>) Medical image analysis has long made use of image processing techniques (<xref ref-type="bibr" rid="B32">Naseer et al., 2023</xref>). Physicians use a variety of diagnostic techniques to identify malignant lung nodules early on. In clinical settings, these techniques include needle prick biopsy analysis, Computed Tomography (CT) scan analysis, and morphological assessment (<xref ref-type="bibr" rid="B33">Nasrullah et al., 2019</xref>; <xref ref-type="bibr" rid="B5">Chen et al., 2021</xref>). The hit ratio for manually detecting lung cancer may be lowered by two major issues. The availability of people and technology comes first since there might not be enough radiological resources to meet demand (<xref ref-type="bibr" rid="B44">Thallam et al., 2020</xref>). Secondly, a considerable proportion of false positive cases can be attributed to the initial flaw. Thus, radiologists who interpret the images should have excellent training. As a result, improvements are still needed in the detection and classification precision of current systems (<xref ref-type="bibr" rid="B28">Mahum and AlSalman, 2023</xref>). Additionally, the tiny size and variety of shapes of pulmonary nodules in general medical imaging further complicate identification and raise the possibility of an incorrect or missing diagnosis (<xref ref-type="bibr" rid="B20">Ji et al., 2023</xref>).</p>
<p>Therefore, systems for computer-aided detection (CAD) are suggested as a means of automatically detecting lung nodules in CT scan images. A common diagnostic imaging technique called CT enables radiologists to look for and assess any worrisome lung nodules on CT scans (<xref ref-type="bibr" rid="B34">Nguyen et al., 2021</xref>). Conventional CAD systems typically do false positive reduction using traditional classifiers (<xref ref-type="bibr" rid="B30">Murphy et al., 2009</xref>; <xref ref-type="bibr" rid="B43">Sui et al., 2015</xref>) and produce nodule candidates using manually constructed nodule features such as morphological features (<xref ref-type="bibr" rid="B19">Jacobs et al., 2014</xref>) or intensity thresholding (<xref ref-type="bibr" rid="B1">Akram et al., 2016</xref>). Due to the abnormal structure of lung tissues (<xref ref-type="bibr" rid="B45">Tong et al., 2020</xref>) these techniques rarely produce adequate results (<xref ref-type="bibr" rid="B34">Nguyen et al., 2021</xref>). However, the manual techniques require more time and the ML techniques have limited generalization ability because of limited training samples. One method for diagnosing lung cancer is to employ segmentation techniques (<xref ref-type="bibr" rid="B27">Liu et al., 2021a</xref>). Based on the image&#x2019;s color, and texture, the ROI is chosen as a segmented area. Three common segmentation techniques are thresholding, atlas, and region growth. The retrieved attributes of the segmented area have a substantial impact on the performance of segmentation-based methods. Approaches based on segmentation have shown encouraging outcomes in the identification of lung cancer. These methods must be adjusted to reduce their false ratio, as they are still not applicable to samples that have not yet been observed (<xref ref-type="bibr" rid="B28">Mahum and AlSalman, 2023</xref>).</p>
<p>Deep learning (DL) approaches have been used with promising results in the categorization of lung nodules in recent years (<xref ref-type="bibr" rid="B6">Chen et al., 2020</xref>; <xref ref-type="bibr" rid="B23">Li et al., 2020</xref>; <xref ref-type="bibr" rid="B48">Wang et al., 2019</xref>; <xref ref-type="bibr" rid="B42">Sreekumar et al., 2020</xref>). However, persistently applying local processes within Convolutional Neural Network (CNN) layers to analyse texture characteristics does not adequately capture the intricate composition and long-range relationships present within a lung nodule (<xref ref-type="bibr" rid="B37">Saihood et al., 2023</xref>). Additionally, pooling layers serve as the foundation for attention-based multiple-instance learning techniques. Since the features that are retrieved from both modalities have varying characteristics, these models cannot be used statically and must be fused proportionately. Here the step convolution module (SCM), which adopts a parallel structure design and has receptive fields of different sizes and a residual squeeze and excitation attention module (RSEAM), improves the useful feature gain through space and channel. Moreover, it cannot be used statically instead of that a fusion must done proportionately with the U-Net. The U-Net mainly operates to obtain image features through a series of convolutional and pooling operations. However, the RSEA-Net requires a precoding network to provide the gate signal and the SCM structure is complicated (<xref ref-type="bibr" rid="B24">Liang et al., 2022</xref>). A feature pyramid network (FPN) (<xref ref-type="bibr" rid="B25">Lin et al., 2017</xref>) is a tool used in some techniques to extract multi-scale information from nodules. Many down-sampled features are restored by the feature pyramid through up-sampling; nevertheless, the up-sampled features&#x2019; pixel values and positions differ from the original feature images without down-sampling (<xref ref-type="bibr" rid="B53">Zhang et al., 2022</xref>). Without human involvement, DL approaches may effectively extract significant features in the best possible way. In the medical field, these methods can increase the accuracy of disease detection (<xref ref-type="bibr" rid="B32">Naseer et al., 2023</xref>).</p>
<p>Existing methods have limitations in scalability, robustness, data availability, and false detection rates. To address these issues, a novel deep-learning model is for accurate lung nodule detection. This research aims to employ the FC2R &#x2b; CHSTM model to identify lung nodules from CT scans. By combining the benefits of Resnet &#x2212;101 and FCM, the FC2R segmentation model successfully separates the lung nodules from the healthy regions. Furthermore, from the segmentation output, the ResNet-101 features, statistical features, and texture information are extracted which improves the nodule detection accuracy. The combination of the induced movement strategy of krill with the time control mechanism of the cnidaria improves the CHSTM model&#x2019;s performance to attain better detection accuracy.</p>
<sec id="s1-1">
<title>1.1 Cnidaria herd optimization enabled the Bi-directional long short-term memory</title>
<p>The CHO algorithm mimics the food-searching behaviour of the cnidaria and the herding characteristics of krill. The combination of the induced movement strategy of krill with the time control mechanism of the cnidaria improves the CHSTM model&#x2019;s performance to attain better detection accuracy.</p>
</sec>
<sec id="s1-2">
<title>1.2 Optimized fuzzy C-means clustering algorithm and the Resnet -101 deep learning model</title>
<p>The FC2R method for lung nodule segmentation accurately segments the nodule regions using the FCM with the Resnet &#x2212;101 model. The proposed optimization is used to compute the coefficient features and the Resnet &#x2212;101 model generates the flow maps that lead to improving the performance of the model.</p>
</sec>
<sec id="s1-3">
<title>1.3 Cnidaria herd optimization algorithm enabled BiLSTM model with fuzzy C-means clustering algorithm and the Resnet &#x2212;101 deep learning model</title>
<p>The combined CHSTM &#x2b; FC2R approach integrates the advantages of bio-inspired optimization algorithm with the novel segmentation technique which aids the model to detect lung nodules with superior performance. In addition, the CHSTM &#x2b; FC2R model increases the system reliability minimizes the overfitting issues caused by data imbalance problems, and increases the computational efficiency of the lung nodule detection tasks.</p>
<p>The organization of the manuscript is described as follows: <xref ref-type="sec" rid="s2">Section 2</xref> covers the limits of the linked works&#x2019; literature evaluation. <xref ref-type="sec" rid="s3">Section 3</xref> discusses the suggested methodology for lung nodule identification along with its methodology flow. <xref ref-type="sec" rid="s4">Sections 4</xref>, <xref ref-type="sec" rid="s5">5</xref> explain the research outcomes and conclusion respectively.</p>
</sec>
</sec>
<sec id="s2">
<title>2 Motivation</title>
<p>To detect effective lung nodules many existing methods are utilized and they have limitations in scalability, robustness, data availability, and false detection rates. To overcome all these issues a novel deep learning is developed for accurate lung nodule detection. This research aims to employ an FC2R &#x2b; CHSTM model to identify the lung nodule from the CT scans. The FC2R segmentation helps to separate the lung nodule from the healthy region. The CHO algorithm helps to fine-tune the hyperparameters of the model and the combination of the induced movement strategy of krill with the time control mechanism of the cnidaria improves the CHSTM model&#x2019;s performance to attain better detection accuracy.</p>
<sec id="s2-1">
<title>2.1 Literature review</title>
<p>The existing methods implemented for lung nodule detection with their limitations and advantages are explained in the following section.</p>
<p>
<xref ref-type="bibr" rid="B53">Zhang et al. (2022)</xref> utilized an attention deep learning model that comprised the 3D Resnet model, which effectively refined the important features. In addition, the channel and spatial attention techniques minimized the computational cost and time. However, the focal loss could mitigate the data imbalance problem. Even though the right steps were taken to improve the data, the model also required more data as the network got deeper to expand the model&#x2019;s capabilities.</p>
<p>A multi-task learning model was utilized <xref ref-type="bibr" rid="B26">Liu et al. (2021)</xref>, which identified the size of the nodule by using the anchor-free method. The model did not need the troublesome anchor-based strategy, the anchor-free method is more reliable and simpler to implement. However, the approach has a higher rate of missed detections because of interference from numerous potential false positives outside of the lung area.</p>
<p>
<xref ref-type="bibr" rid="B5">Chen et al. (2021)</xref> initiated a dense neural network that could get superior accuracy compared to other current techniques while dealing with varying experimental targets and input lung CT image pixel sizes. Since LDNNET did not employ semantic segmentation and location, it was simpler to set up and operate in real-world scenarios. However, the model necessitated more parameters for learning that increased the training time.</p>
<p>
<xref ref-type="bibr" rid="B20">Ji et al. (2023)</xref> designed an improved DL model with an attention method that improved the model&#x2019;s detection performance and reduced the medical image interference features. In addition, the pyramid pooling module obtained the multi-scale contextual information and detected the lung nodules effectively. However, the model found trouble in detecting lung nodules when they were partly or obscured by other nodules, which could result in missed diagnoses or false positives.</p>
<p>
<xref ref-type="bibr" rid="B32">Naseer et al. (2023)</xref> initiated an Alex Net-Support Vector Machine model for nodule detection and modified U-Net for segmentation, which demonstrated improved outcomes for the precise and efficient diagnosis of lung tumor. Nevertheless, the model required high computational time and reduced the interpretability and generalizability of lung nodule detection tasks.</p>
<p>A Retina Net model was implemented by <xref ref-type="bibr" rid="B28">Mahum and AlSalman (2023)</xref> that utilized a dependable feature fusion-based approach that could combine various network layers and concurrently boost the semantic shallow layer for efficient prediction. Additionally, at every network level, a context-dilated module is integrated with a down-sampled fusion block, which enhances the network&#x2019;s capacity to extract useful features. However, the model could not distinguish microscopic cancers from background tissues if there was a lot of clutter or noise in the images.</p>
<p>The faster R-CNN model was utilized by <xref ref-type="bibr" rid="B34">Nguyen et al. (2021)</xref> for lung nodule detection, which minimized the false positives. The mean-shift clustering technique effectively learned the intricate features from the training dataset. Although the approach improved nodule detection performance, there are still several issues. First off, there was still a small volume of data available for the model&#x2019;s training and validation. CNN increases network complexity to improve performance.</p>
<p>A multi-orientation-based attention mechanism was developed by <xref ref-type="bibr" rid="B37">Saihood et al. (2023)</xref> that provided a great degree of flexibility in focusing on relevant data that was non-locally gathered from different nodule regions. Although the research showed encouraging advancements, their practical application in healthcare settings required that their clinical efficacy be verified on actual patient data.</p>
<p>
<xref ref-type="bibr" rid="B15">Gugulothu and Balaji (2024)</xref> introduced lung nodule detection and classification with CT images based on hybrid deep learning (LNDC-HDL) techniques. The use of computed tomography demonstrates the efficiency and importance of the HDE-NN specific structure for detecting lung nodes on CT scans, increases sensitivity, and reduces false positives. However, the major constraint of the research is computational complexity.</p>
<p>
<xref ref-type="bibr" rid="B39">Sebastian and Dua (2023)</xref> implemented a DL model for the detection of lung nodules. To identify every lung lesion in every CT scan as completely as feasible without resorting to forced consensus this procedure is designed. However, the model suffers from computational time.</p>
<p>
<xref ref-type="bibr" rid="B46">UrRehman et al. (2024)</xref> presented a CNN model with a dual attention mechanism for effective lung nodule detection. The CNN model extracts informative features from the images, while the attention module incorporates both channel attention and spatial attention mechanisms to selectively highlight significant features. However, a small volume of data was available for the model&#x2019;s training and validation.</p>
<p>
<xref ref-type="bibr" rid="B17">Harsono et al. (2022)</xref> introduced the Transfer learning-enabled one stage detector model, I3DR-Net for the detection of lung nodules. In particular, the I3DR-Net approach integrated the I3D backbone, with RetinaNet and modified FPN framework over the small number of high-quality trainable CT images and reduced the training time. Moreover, this approach demonstrated that weight transfer learning from natural image datasets improves the detection performance as well as minimizes the training time.</p>
<p>
<xref ref-type="bibr" rid="B49">Wankhade, and Vigneshwari (2023)</xref> developed the Hybrid Neural Network approach which integrated the 3D CNN and RNN to enhance the detection performance. In addition, the hybrid approach precisely determined the lung nodule count in the pulmonary region. However, additional research was required to validate the results and address the potential challenges, including obtaining adequate high-quality training data and enhancing the comprehensibility of DL models.</p>
<p>
<xref ref-type="bibr" rid="B51">Xing et al. (2024)</xref> developed an improved ML model integrating the Fuzzy K-Nearest Neighbor (FKNN) for lung disease detection. In addition, the EMRFO algorithm was applied to choose the optimal feature subset, and the FKNN model was utilized as the fitness evaluator. More specifically, the EMRFO algorithm presents the position information of the suboptimal solution in order to continuously approach the optimal solution with disturbance, thus improving the convergence of the algorithm.</p>
</sec>
<sec id="s2-2">
<title>2.2 Challenges</title>
<p>
<list list-type="simple">
<list-item>
<p>&#x27a2; The R-CNN architectures could face difficulties in precisely detecting borders, particularly for tumors with fuzzy or intricate features. Post-processing techniques are often necessary to improve border correctness (<xref ref-type="bibr" rid="B34">Nguyen, et al., 2021</xref>).</p>
</list-item>
<list-item>
<p>&#x27a2; Lung Retina-net is specifically engineered to identify lung tumors in CT scans. It might not be appropriate for different anatomical structures or other imaging modalities when it comes to detecting cancers (<xref ref-type="bibr" rid="B28">Mahum and AlSalman, 2023</xref>).</p>
</list-item>
<list-item>
<p>&#x27a2; Yolov5 struggles to discern cancers from intricate backgrounds, which might result in false positives or overlooked identifications in congested environments (<xref ref-type="bibr" rid="B20">Ji et al., 2023</xref>).</p>
</list-item>
<list-item>
<p>&#x27a2; Although focus loss was utilized to rectify data imbalance, it was recognized that its consequences might not be entirely eradicated. To mitigate this problem, more efforts were required (<xref ref-type="bibr" rid="B53">Zhang, et al., 2022</xref>).</p>
</list-item>
<list-item>
<p>&#x27a2; The AlexNet-SVM might not be easily interpreted, which could make it difficult to comprehend the rationale behind particular diagnoses. Additional verification, an evaluation of generalizability, and practical execution issues were required for clinical adoption (<xref ref-type="bibr" rid="B32">Naseer, et al., 2023</xref>).</p>
</list-item>
</list>
</p>
</sec>
</sec>
<sec id="s3">
<title>3 Proposed CHSTM model for lung nodule detection</title>
<p>Lung cancer diagnosis relies on detecting pulmonary nodules, but identifying small nodules in medical images can be challenging due to their varying shapes, sizes, and locations. Existing methods have limitations in scalability, robustness, data availability, and false detection rates. To address these issues, a novel deep-learning model is for accurate lung nodule detection. Initially the input CT images from the Luna 16 database undergo an image enhancement task in the pre-processing stage. The enhanced CT images are used to segment lung lobes, defining regions of interest (ROI). The pre-processing techniques used in lobe segmentation are erosion and fill holes. The segmented lobes are fed into the FC2R model for nodule segmentation. The proposed optimization is used to compute the coefficient features and the Resnet &#x2212;101 model generates the flow maps that lead to improving the performance of the model. From the segmentation output, the Resnet &#x2212;101 features, statistical features, and texture information are extracted which improve the nodule detection accuracy. These features are concatenated and input into the CHSTM classifier, which accurately detects lung nodules. The CHO algorithm which is inspired by jellyfish and krill fish characteristics, employed to fine-tune the hyperparameters of the model for optimal results. The combination of the induced movement strategy of krill with the time control mechanism of the cnidaria improves the CHSTM model&#x2019;s performance to attain better detection accuracy. The proposed model aims to improve accuracy in detecting lung nodules from CT images and detect the lung nodules as malignant or benign. <xref ref-type="fig" rid="F1">Figure 1</xref> visualizes the flow diagram of this proposed approach.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Flow diagram of the FC2R &#x002B; CHSTM model for lung nodule detection.</p>
</caption>
<graphic xlink:href="fphys-16-1511716-g001.tif"/>
</fig>
<sec id="s3-1">
<title>3.1 Input for lung nodule detection</title>
<p>The Luna 16 database serves as the input source of this research, which consists of lung CT scans with the size of <inline-formula id="inf1">
<mml:math id="m1">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mn>1</mml:mn>
<mml:mo>&#x2a;</mml:mo>
<mml:mn>512</mml:mn>
<mml:mo>&#x2a;</mml:mo>
<mml:mn>512</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>. The input for lung nodule detection is mathematically expressed in <xref ref-type="disp-formula" rid="e1">Equation 1</xref> as follows,<disp-formula id="e1">
<mml:math id="m2">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>N</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>where <inline-formula id="inf2">
<mml:math id="m3">
<mml:mrow>
<mml:mi>L</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> specifies the dataset and the number of CT scans in the database is represented as <inline-formula id="inf3">
<mml:math id="m4">
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>N</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s3-2">
<title>3.2 Pre-processing</title>
<p>Pre-processing is a significant stage in image processing tasks, in this research it is employed to enhance the input image quality. In addition, lobe segmentation and ROI extraction are performed in this stage to improve the visibility of the image and improve the detection accuracy.</p>
<sec id="s3-2-1">
<title>3.2.1 Lobe segmentation</title>
<p>The lungs are made up of five lobes, split by the lobar fissures, with three lobes in the right lung and two in the left. The lobes receive blood and oxygen from different blood arteries, they are typically functionally independent. Moreover, illnesses frequently cannot spread between lobes because of the fissure border (<xref ref-type="bibr" rid="B11">Ferreira et al., 2018</xref>). To improve the detection accuracy of the CHSTM model, the lung lobes can be precisely segmented. The pre-processing techniques used in lobe segmentation are erosion and fill holes. The lobe segmentation in this research can be carried out in the following ways:<list list-type="simple">
<list-item>
<p>Step 1: Transform the CT image into a binary image</p>
</list-item>
<list-item>
<p>Step 2: Eliminate the blobs that are connected to the image&#x2019;s border.</p>
</list-item>
<list-item>
<p>Step 3: Label the image.</p>
</list-item>
<list-item>
<p>Step 4: Keep the labels with the two largest regions</p>
</list-item>
<list-item>
<p>Step 5: Using a disk with a radius of two, do erosion. During this procedure, the lung nodules that are linked to the blood vessels are separated.</p>
</list-item>
<list-item>
<p>Step 6: Closure operation utilizing a 10-radius disk. The goal of this procedure is to maintain nodules affixed to the lung wall.</p>
</list-item>
</list>
</p>
<p>The technique held up well to varying inspiration levels, low-quality images, and varying disease severity, which makes it possible to do reliable and effective regional analysis on big datasets (<xref ref-type="bibr" rid="B14">Gerard and Reinhardt, 2019</xref>). The output of lobe segmentation <inline-formula id="inf4">
<mml:math id="m5">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:msup>
<mml:mi>l</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msup>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is transferred into the ROI extraction process.</p>
</sec>
<sec id="s3-2-2">
<title>3.2.2 Region of interest extraction</title>
<p>ROI extraction is the procedure of finding the parenchyma mask that may contain suspect lung nodules which reduces the system&#x2019;s computation and detection times (<xref ref-type="bibr" rid="B36">Ozekes and Osman, 2010</xref>). The key objective of this process is to precisely evaluate lung images and extract the pertinent nodule regions while eliminating the background regions. The pre-processing technique used in ROI extraction is fill holes. In this research, the ROI extraction is mathematically defined in <xref ref-type="disp-formula" rid="e2">Equation 2</xref> as follows,<disp-formula id="e2">
<mml:math id="m6">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mo>&#x223c;</mml:mo>
<mml:mspace width="-0.3em"/>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:msup>
<mml:mi>l</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msup>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>
</p>
<p>The output obtained from ROI extraction <inline-formula id="inf5">
<mml:math id="m7">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> is provided in the FC2R model for nodule segmentation.</p>
</sec>
</sec>
<sec id="s3-3">
<title>3.3 Cnidaria herd optimization algorithm for lung nodule detection</title>
<sec id="s3-3-1">
<title>3.3.1 Motivation</title>
<p>The CHO algorithm mimics the food-searching behaviour of the cnidaria and the herding features of the krill. The standard algorithms maintain a positive balance between local and global searches and have a solid population usage rate. However, the algorithm&#x2019;s speed of convergence and capacity for exploration and exploitation is less. In addition, the algorithms require an optimal strategy to initiate the distribution process. To address these issues, the research presented a novel CHO algorithm that enhances the model&#x2019;s performance and increases detection accuracy by fusing the induced movement strategy of krill with the temporal control mechanism of cnidaria.</p>
</sec>
<sec id="s3-3-2">
<title>3.3.2 Inspiration</title>
<p>Jellyfish also known as cnidaria can be found in water with a range of temperatures and depths, which resemble the bell-like structure and have unique characteristics that allow them to regulate their motion. To move their bodies forward, their undersides close like an umbrella, forcing water out. Even with this ability, they primarily float on the water, meaning that tides and currents control their movement. Specifically, cnidaria are weak swimmers, their orientations concerning currents are particularly important for maintaining blooms and preventing stranding. A swarm&#x2019;s development is influenced by a variety of elements, such as temperature, predator presence, oxygen availability, available nutrition, and accessible nutrients. Ocean currents are the most significant of them since they can gather cnidaria into swarms. Because they tended to swarm, move about within swarms, and generate blooms as they follow ocean currents. As a result, cnidaria evaluates the quantity of food offered at several locations and chooses the finest one (<xref ref-type="bibr" rid="B7">Chou and Molla, 2022</xref>). The krill use a food search strategy, which involves locating places with large concentrations of food, and density-dependent attraction, to move toward the global minima. In this method, each krill looks for the highest density and food, and it travels in the direction of the best solution. In other words, the objective function decreases with increasing distance from the high density and food. For a single goal, it is generally necessary to define some coefficients when employing multi-objective herding behavior (<xref ref-type="bibr" rid="B12">Gandomi and Alavi, 2012</xref>). The hybrid algorithm solves the global optimization problems and tunes the hyperparameters of the CHSTM technique for precise detection of lung nodules.</p>
<sec id="s3-3-2-1">
<title>3.3.2.1 Initialization</title>
<p>The solution&#x2019;s population is normally initialized as random; the solution&#x2019;s position is mathematically formulated in <xref ref-type="disp-formula" rid="e3">Equation 3</xref> as follows,<disp-formula id="e3">
<mml:math id="m8">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>where <inline-formula id="inf6">
<mml:math id="m9">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> indicates the solution&#x2019;s current position, <inline-formula id="inf7">
<mml:math id="m10">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> denotes the previous position of the solution, <inline-formula id="inf8">
<mml:math id="m11">
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> signifies the velocity of the solution at the previous iteration, and <inline-formula id="inf9">
<mml:math id="m12">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> indicates the positional factor, the lower and upper bounds are denoted as <inline-formula id="inf10">
<mml:math id="m13">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf11">
<mml:math id="m14">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s3-3-2-2">
<title>3.3.2.2 Fitness evaluation</title>
<p>The solution&#x2019;s fitness can be assessed using <xref ref-type="disp-formula" rid="e4">Equation 4</xref>, the higher fitness value indicates the best solution and the lower value denotes the worst solution.<disp-formula id="e4">
<mml:math id="m15">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi mathvariant="italic">max</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>
</p>
<p>Phase 1: Exploration phase <inline-formula id="inf12">
<mml:math id="m16">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3e;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3b6;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
<p>When the random simulated movement of the solution is superior to the time control function the exploration phase is activated. The exploration phase describes that the solution should be in motion towards ocean currents. At this phase, the solution includes its foraging behaviors in a wide range around the search space. In terms of two primary effective parameters, the foraging movement towards the ocean current is formulated. The location of the food is the first element, and previous knowledge of the place is the second. Thus, the foraging behavior as its passive motion towards the search space has been mathematically formulated in <xref ref-type="disp-formula" rid="e5">Equation 5</xref> as,<disp-formula id="e5">
<mml:math id="m17">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3d6;</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>G</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>a</mml:mi>
<mml:mi>&#x3bc;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>where, <inline-formula id="inf13">
<mml:math id="m18">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> denotes the random simulated movement of the solution, and <inline-formula id="inf14">
<mml:math id="m19">
<mml:mrow>
<mml:mi>&#x3b6;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> indicates the time control function, which is explained in <xref ref-type="disp-formula" rid="e6">Equation 6</xref> as,<disp-formula id="e6">
<mml:math id="m20">
<mml:mrow>
<mml:mi>&#x3b6;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>here, <inline-formula id="inf15">
<mml:math id="m21">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> signifies the hectic factor, the recursive factor is indicated as <inline-formula id="inf16">
<mml:math id="m22">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>0.1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf17">
<mml:math id="m23">
<mml:mrow>
<mml:mi>&#x3bc;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> represents the mean position of all solutions in the swarm, <inline-formula id="inf18">
<mml:math id="m24">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> signifies the trial factor, <inline-formula id="inf19">
<mml:math id="m25">
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the foraging speed factor, <inline-formula id="inf20">
<mml:math id="m26">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>G</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> signifies the global best solution, the adaptive weightage factor is denoted as <inline-formula id="inf21">
<mml:math id="m27">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3d6;</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, the differential fitness factor <inline-formula id="inf22">
<mml:math id="m28">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is described in <xref ref-type="disp-formula" rid="e7">Equation 7</xref> as follows,<disp-formula id="e7">
<mml:math id="m29">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>G</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>where <inline-formula id="inf23">
<mml:math id="m30">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> indicates the fitness value of the solution, <inline-formula id="inf24">
<mml:math id="m31">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>G</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the fitness function of the global best solution.</p>
<p>Phase 2: Exploitation phase <inline-formula id="inf25">
<mml:math id="m32">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3c;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3b6;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
<p>In the exploitation phase, the solution exhibits movement inside the swarm behavior (active motion), and this movement of the solutions is considered as the exploitation phase. This phase is achieved by using the induced movement behavior of the solutions in which the individual solutions try to conserve a high density and move due to their mutual effects. Thus the solution obtains safety search inside the swarm and increased efficiency while maintaining inside the swarm is expressed in <xref ref-type="disp-formula" rid="e8">Equation 8</xref> as follows,<disp-formula id="e8">
<mml:math id="m33">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b3;</mml:mi>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>4</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>G</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>&#x3c6;</mml:mi>
<mml:mi>B</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3d6;</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>where <inline-formula id="inf26">
<mml:math id="m34">
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> denotes the sensitive factor, <inline-formula id="inf27">
<mml:math id="m35">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>4</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represents the cooperative movement behavior of solutions, and the effective factor <inline-formula id="inf28">
<mml:math id="m36">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c6;</mml:mi>
<mml:mi>B</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the combination of the local effect <inline-formula id="inf29">
<mml:math id="m37">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi>&#x3c6;</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> and the target direction effect <inline-formula id="inf30">
<mml:math id="m38">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi>&#x3c6;</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="italic">arg</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> which is mathematically explained in <xref ref-type="disp-formula" rid="e9">Equation 9</xref> as follows,<disp-formula id="e9">
<mml:math id="m39">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c6;</mml:mi>
<mml:mi>B</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mi>&#x3c6;</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mi>&#x3c6;</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="italic">arg</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>
</p>
<p>The effect of the neighboring solutions in a movement can be evaluated in <xref ref-type="disp-formula" rid="e10">Equation 10</xref> as follows,<disp-formula id="e10">
<mml:math id="m40">
<mml:mrow>
<mml:msup>
<mml:mi>&#x3c6;</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msub>
<mml:mover accent="true">
<mml:mi>F</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mover accent="true">
<mml:mi>B</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>where <inline-formula id="inf31">
<mml:math id="m41">
<mml:mrow>
<mml:mover accent="true">
<mml:mi>B</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> indicates the adaptive positional vector, the adaptive fitness vector <inline-formula id="inf32">
<mml:math id="m42">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>F</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is calculated using the <xref ref-type="disp-formula" rid="e11">Equations 11</xref>, <xref ref-type="disp-formula" rid="e12">12</xref>.<disp-formula id="e11">
<mml:math id="m43">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>F</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>G</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>
<disp-formula id="e12">
<mml:math id="m44">
<mml:mrow>
<mml:mover accent="true">
<mml:mi>B</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(12)</label>
</disp-formula>where <inline-formula id="inf33">
<mml:math id="m45">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represents the worst solution, and <inline-formula id="inf34">
<mml:math id="m46">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> denotes the small positive number.</p>
<p>Phase 3: Equilibrium phase <inline-formula id="inf35">
<mml:math id="m47">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3b6;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
<p>In the equilibrium phase, there is a balance between exploration and exploitation, thus the solution effectively achieves equilibrium between these two phases also the physical diffusion process fastens the change in the equilibrium described in adaptive fitness vector is calculated in <xref ref-type="disp-formula" rid="e13">Equation 13</xref> as follows,.<disp-formula id="e13">
<mml:math id="m48">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
</mml:mrow>
<mml:mspace width="0.2em"/>
<mml:mrow>
<mml:mi mathvariant="italic">if</mml:mi>
</mml:mrow>
<mml:mspace width="0.2em"/>
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mfenced open="" close="{" separators="|">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
</mml:mrow>
<mml:mspace width="0.2em"/>
<mml:mrow>
<mml:mi>if</mml:mi>
</mml:mrow>
<mml:mspace width="0.2em"/>
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(13)</label>
</disp-formula>where the maximum diffusion speed is represented as <inline-formula id="inf36">
<mml:math id="m49">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf37">
<mml:math id="m50">
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> indicates the directional factor. Finally, when the algorithm reaches its termination condition the iteration will be stopped. For increased detection accuracy, the CHSTM classifier&#x2019;s hyperparameters are efficiently adjusted using the suggested CHO method. <xref ref-type="fig" rid="F2">Figure 2</xref> displays the CHO algorithm&#x2019;s flow diagram.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Flow diagram of the CHO algorithm.</p>
</caption>
<graphic xlink:href="fphys-16-1511716-g002.tif"/>
</fig>
</sec>
</sec>
</sec>
<sec id="s3-4">
<title>3.4 Nodule segmentation using fuzzy C-means clustering enabled Resnet &#x2212;101</title>
<p>Accurate segmentation of lung nodules from CT images is an essential task for image-driven lung nodule detection. Robust nodule segmentation is difficult, nonetheless, because lung nodules vary widely, and similar visual traits are common to lesions and their surroundings (<xref ref-type="bibr" rid="B47">Wang et al., 2017</xref>). Therefore, this research proposed an FC2R segmentation model which is the combination of a fuzzy C-means clustering algorithm and Resnet &#x2212;101 deep learning model. The process of grouping data into homogenous units by taking object relationships into account is known as clustering. Clustering techniques accomplish region segmentation by dividing the image into groups of pixels that have a high degree of similarity within the feature space. In fuzzy clustering, individual data components have a set of membership levels associated with them and can belong to many clusters. These display the degree to which a given data element is linked to a certain cluster (<xref ref-type="bibr" rid="B35">Nithila and Kumar, 2016</xref>). The process of assigning the membership levels to allocate data components to single or more clusters is known as fuzzy clustering. Let <inline-formula id="inf38">
<mml:math id="m51">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mi>N</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> be the ROI extracted image, the cluster centers <inline-formula id="inf39">
<mml:math id="m52">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>C</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> along with the partition matrix are denoted as <inline-formula id="inf40">
<mml:math id="m53">
<mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> . The degree to which an instance <inline-formula id="inf41">
<mml:math id="m54">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> belongs to the cluster <inline-formula id="inf42">
<mml:math id="m55">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is determined by each component <inline-formula id="inf43">
<mml:math id="m56">
<mml:mrow>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. The objective function for FCM is derived in <xref ref-type="disp-formula" rid="e14">Equation 14</xref> as follows (<xref ref-type="bibr" rid="B10">Farahani et al., 2018</xref>),<disp-formula id="e14">
<mml:math id="m57">
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>c</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mi>x</mml:mi>
</mml:msubsup>
<mml:msup>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(14)</label>
</disp-formula>where, each component and cluster are described in <xref ref-type="disp-formula" rid="e15">Equations 15</xref>, <xref ref-type="disp-formula" rid="e16">16</xref> as follows,<disp-formula id="e15">
<mml:math id="m58">
<mml:mrow>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>c</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mfrac>
<mml:mn>2</mml:mn>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfrac>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(15)</label>
</disp-formula>
<disp-formula id="e16">
<mml:math id="m59">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi>x</mml:mi>
</mml:msubsup>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi>x</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(16)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf44">
<mml:math id="m60">
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> signifies the fuzzier which indicates the cluster fuzziness level, The FCM cluster aims to lower the total weighted mean square error. Every feature vector is approved by the FCM to correspond with several groups with diverse membership values (<xref ref-type="bibr" rid="B13">Ganesan and Merline, 2017</xref>). The segmented image with the dimension of <inline-formula id="inf45">
<mml:math id="m61">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2a;</mml:mo>
<mml:mn>230</mml:mn>
<mml:mo>&#x2a;</mml:mo>
<mml:mn>230</mml:mn>
<mml:mo>&#x2a;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> is provided as input to the feature extraction process.</p>
</sec>
<sec id="s3-5">
<title>3.5 Feature extraction</title>
<p>Feature extraction is the process of distilling relevant information from the segmented image. It aims to extract a concise representation, often expressed as numerical descriptors or attributes. In the context of lung nodule detection, it helps to identify relevant patterns and characteristics. The following features are extracted from segmented lung nodule images.</p>
<sec id="s3-5-1">
<title>3.5.1 Resnet &#x2212;101 feature extraction</title>
<p>Resnet &#x2212;101 is a variation of the deep CNN model which comprises 101 layers along with the skip connections. The basic idea behind residual functions is that each layer of the network learns from them by referring to its input layer (<xref ref-type="bibr" rid="B2">Ali et al., 2021</xref>). The architecture is easily optimized in this way and achieves notable accuracy. The network&#x2019;s depth is based on the internal convolutional layers. The implementation of Resnet &#x2212;101 in this research improves both the model&#x2019;s detection accuracy and feature extraction capacity. The features obtained using Resnet &#x2212;101 with the size of <inline-formula id="inf46">
<mml:math id="m62">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2a;</mml:mo>
<mml:mn>1024</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> are denoted as <inline-formula id="inf47">
<mml:math id="m63">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s3-5-2">
<title>3.5.2 Statistical features</title>
<p>The numerical measurements used to depict the distributional characteristics of geometric properties within specific regions are evaluated using statistical features. These characteristics improve the model&#x2019;s performance by providing significant insights into the statistical characteristics of lung nodule images (<xref ref-type="bibr" rid="B31">Mutlag et al., 2020</xref>). In this research features including kurtosis <inline-formula id="inf48">
<mml:math id="m64">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>K</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>,standard deviation <inline-formula id="inf49">
<mml:math id="m65">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> mean <inline-formula id="inf50">
<mml:math id="m66">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, skewness <inline-formula id="inf51">
<mml:math id="m67">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, and variance <inline-formula id="inf52">
<mml:math id="m68">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3bd;</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> are extracted from the segmented image. The standard deviation is used to calculate the mean distance between the pixel values, while the mean measures the average of the pixel intensities. Kurtosis can be used to assess the distribution&#x2019;s stability, and skewness is a measure of the distribution&#x2019;s asymmetry. The extracted features with the size of <inline-formula id="inf53">
<mml:math id="m69">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2a;</mml:mo>
<mml:mn>5</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> are concatenated as <inline-formula id="inf54">
<mml:math id="m70">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msub>
<mml:mi>K</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3bd;</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s3-5-3">
<title>3.5.3 Texture features</title>
<p>Texture is a significant component in medical images, which is described as a surface-level representation of the human visual systems. The texture features are analysed using matrix representations. In this research, the texture features are analysed using the local Ternary pattern (LTP) and local optimal oriented pattern (LOOP). The LTP features address the issues related to illumination transformation, which is robust to noise and encodes the grey values of surrounding pixels. The LTP indicator ltp is described in <xref ref-type="disp-formula" rid="e17">Equation 17</xref> as follows, (<xref ref-type="bibr" rid="B50">Wu et al., 2015</xref>)<disp-formula id="e17">
<mml:math id="m72">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>p</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>.</mml:mo>
<mml:msup>
<mml:mn>3</mml:mn>
<mml:mi>n</mml:mi>
</mml:msup>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mtext> </mml:mtext>
<mml:mn>1</mml:mn>
<mml:mi>A</mml:mi>
<mml:mo>&#x2265;</mml:mo>
<mml:mi>&#x3c4;</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mtext> </mml:mtext>
<mml:mn>0</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3c4;</mml:mi>
<mml:mo>&#x3c;</mml:mo>
<mml:mi>A</mml:mi>
<mml:mo>&#x3c;</mml:mo>
<mml:mi>&#x3c4;</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mi>A</mml:mi>
<mml:mo>&#x3c;</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3c4;</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(17)</label>
</disp-formula>where <inline-formula id="inf56">
<mml:math id="m73">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> indicates the user-defined threshold, the central pixel&#x2019;s gray value is signified as <inline-formula id="inf57">
<mml:math id="m74">
<mml:mrow>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and neighbouring pixels&#x2019; gray value is indicated as <inline-formula id="inf58">
<mml:math id="m75">
<mml:mrow>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. LOOP is the non-linear fusion of binary and directional patterns, which offers several advantages in image processing tasks. Let <inline-formula id="inf59">
<mml:math id="m76">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> be the pixel values of a segmented image <inline-formula id="inf60">
<mml:math id="m77">
<mml:mrow>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, the pixel intensity is indicated as <inline-formula id="inf61">
<mml:math id="m78">
<mml:mrow>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>N</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>N</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mn>7</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, based on the rank of magnitude value of the exponential <inline-formula id="inf62">
<mml:math id="m79">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>N</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> is assigned to each pixel (<xref ref-type="bibr" rid="B4">Chakraborti et al., 2018</xref>). Further the LOOP descriptor is derived based on the <xref ref-type="disp-formula" rid="e18">Equation 18</xref> as follows,<disp-formula id="e18">
<mml:math id="m80">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>p</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mn>7</mml:mn>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>N</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
<mml:msup>
<mml:mn>2</mml:mn>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>N</mml:mi>
</mml:msub>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(18)</label>
</disp-formula>where the threshold function is explained in <xref ref-type="disp-formula" rid="e19">Equation 19</xref> as follows,<disp-formula id="e19">
<mml:math id="m81">
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mtext> </mml:mtext>
<mml:mn>1</mml:mn>
<mml:mspace width="0.4em"/>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mspace width="0.4em"/>
<mml:mi>A</mml:mi>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mtext> </mml:mtext>
<mml:mn>0</mml:mn>
<mml:mspace width="0.4em"/>
<mml:mi>o</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(19)</label>
</disp-formula>
</p>
<p>The LOOP descriptor effectively determines the rotation invariance, which also reverses the empirical assignment of the value. The extracted feature vectors using Resnet-101 features <inline-formula id="inf63">
<mml:math id="m82">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2a;</mml:mo>
<mml:mn>1024</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, statistical features <inline-formula id="inf64">
<mml:math id="m83">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2a;</mml:mo>
<mml:mn>5</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> and texture features <inline-formula id="inf65">
<mml:math id="m84">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2a;</mml:mo>
<mml:mn>32</mml:mn>
<mml:mo>&#x2a;</mml:mo>
<mml:mn>32</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> are concatenated as <inline-formula id="inf66">
<mml:math id="m85">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, with the size of <inline-formula id="inf67">
<mml:math id="m86">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2a;</mml:mo>
<mml:mn>1024</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> which is presented into the CHSTM model.</p>
</sec>
</sec>
<sec id="s3-6">
<title>3.6 Lung nodule detection using cnidaria herd optimization -enabled Bi-directional long short-term memory model</title>
<p>The research presented a novel CHSTM model for lung nodule detection; an input gate, a memory gate, and an output gate are the three gate control units that the proposed CHSTM model in this research uses to enhance memory capability and efficiently detect lung nodules. The architecture of the single BiLSTM block is visualized in <xref ref-type="fig" rid="F3">Figure 3</xref>. Neurons in the CHSTM are capable of selectively forgetting and recalling new information about the cell state through the forgetting and memory gates. They can also retain this important information and send it on to subsequent neurons. The input through the neuron&#x2019;s internal weight computation controls the forgetting, remembering, and output of the information. The weights of the gate control units are obtained from the previous moment. The detection accuracy of the model is improved by CHSTM&#x2019;s ability to fully account for both precedent and upcoming data more easily than LSTM (<xref ref-type="bibr" rid="B16">Hameed and Garcia-Zapirain, 2020</xref>). The equations of the CHSTM model is shown in <xref ref-type="disp-formula" rid="e20">Equations 20</xref>&#x2013;<xref ref-type="disp-formula" rid="e24">24</xref>.<disp-formula id="e20">
<mml:math id="m87">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>Q</mml:mi>
</mml:msub>
<mml:mo>.</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>Q</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(20)</label>
</disp-formula>
<disp-formula id="e21">
<mml:math id="m88">
<mml:mrow>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>I</mml:mi>
</mml:msub>
<mml:mo>.</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>I</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(21)</label>
</disp-formula>
<disp-formula id="e22">
<mml:math id="m89">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>P</mml:mi>
</mml:msub>
<mml:mo>.</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>P</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(22)</label>
</disp-formula>
<disp-formula id="e23">
<mml:math id="m90">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>&#x2d8;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi mathvariant="italic">tan</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>X</mml:mi>
</mml:msub>
<mml:mo>.</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>X</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(23)</label>
</disp-formula>
<disp-formula id="e24">
<mml:math id="m91">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2299;</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2299;</mml:mo>
<mml:msub>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>&#x2d8;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(24)</label>
</disp-formula>
<disp-formula id="e25">
<mml:math id="m92">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2299;</mml:mo>
<mml:mi mathvariant="italic">tan</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(25)</label>
</disp-formula>where the input is signified as <inline-formula id="inf68">
<mml:math id="m93">
<mml:mrow>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf69">
<mml:math id="m94">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf70">
<mml:math id="m95">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> indicates the input, output, and forget gate respectively. <inline-formula id="inf71">
<mml:math id="m96">
<mml:mrow>
<mml:mi>&#x3c3;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf72">
<mml:math id="m97">
<mml:mrow>
<mml:mi mathvariant="italic">tanh</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> denotes the activation functions, <inline-formula id="inf73">
<mml:math id="m98">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represents the cell state, and the weights and biases of the gates are denoted as <inline-formula id="inf74">
<mml:math id="m99">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>Q</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>I</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>P</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>X</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf75">
<mml:math id="m100">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>Q</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>I</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>P</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>X</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, which are optimized using the proposed CHA optimization. The element-wise multiplication is denoted as <inline-formula id="inf76">
<mml:math id="m101">
<mml:mrow>
<mml:mo>&#x2299;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf77">
<mml:math id="m102">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> signifies the hidden layer state. The output from the feature extraction is concatenated and fed as the input to the CHSTM model which helps to accurately detect the lung nodules. The CHO algorithm is applied to tune the model weights for optimal results.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>BiLSTM architecture.</p>
</caption>
<graphic xlink:href="fphys-16-1511716-g003.tif"/>
</fig>
<p>By reducing the vanishing gradient issue, multiplicative gates enable memory cells to store and retrieve data for extensive periods. The activation of the cell state is preserved using the input gate. Because of this feature, the network may store crucial information from previous sequences that enhances the detection performance (<xref ref-type="bibr" rid="B9">Elzayady et al., 2021</xref>). BiLSTM can learn more precise information by using the information&#x2019;s forward and backward sequences (<xref ref-type="bibr" rid="B13">Ganesan and Merline, 2017</xref>). Three forward <inline-formula id="inf78">
<mml:math id="m103">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>s</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> and backward LSTM <inline-formula id="inf79">
<mml:math id="m104">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>s</mml:mi>
<mml:mo>&#x20d6;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> layers create the CHSTM model, and the fully connected layer receives the output from these layers. The forward LSTM processes information from left to right and the backward LSTM processes information from right to left (<xref ref-type="bibr" rid="B3">Bhanumathi and Chandrashekara, 2021</xref>). The output of the CHSTM model is computed as <inline-formula id="inf80">
<mml:math id="m105">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>s</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mover accent="true">
<mml:mi>s</mml:mi>
<mml:mo>&#x20d6;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, where the output of forward gate and backward gate is expressed in <xref ref-type="disp-formula" rid="e26">Equations 26</xref>, <xref ref-type="disp-formula" rid="e27">27</xref> respectively as follows,<disp-formula id="e26">
<mml:math id="m106">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>m</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>&#x2192;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(26)</label>
</disp-formula>
<disp-formula id="e27">
<mml:math id="m107">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>s</mml:mi>
<mml:mo>&#x20d6;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>m</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>&#x2192;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(27)</label>
</disp-formula>
</p>
<p>The CHSTM model&#x2019;s final layer, the linear regression layer, completes regression tasks that help to detect lung nodules. The architecture of the CHSTM model is illustrated in <xref ref-type="fig" rid="F4">Figure 4</xref>.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Architecture of the CHSTM model.</p>
</caption>
<graphic xlink:href="fphys-16-1511716-g004.tif"/>
</fig>
</sec>
</sec>
<sec sec-type="results|discussion" id="s4">
<title>4 Results and discussion</title>
<p>The following explains the findings and analysis of the suggested model, along with a performance assessment and comparison analysis.</p>
<sec id="s4-1">
<title>4.1 Experimental setup</title>
<p>The present investigation utilized data acquired from the LUNA 16 dataset consisting of 888 CT scan samples. The performance of the model is evaluated with TP and K-fold by varying epochs. The dataset was partitioned into 80% of training data and 20% of testing data. The model is trained on the training set and the performance is evaluated on the testing set. The research lung nodule detection using FC2R &#x2b; CHSTM is executed in PYTHON software with Windows 11 operating system, 16 GB RAM, 1 TB ROM, AMD RYZEN 5000H Series, and including GPU. The hyperparameters of the model includes the learning rate of 0.001, epoch of 100, batch size of 64, and the ADAM as the default optimizer.</p>
</sec>
<sec id="s4-2">
<title>4.2 Dataset description</title>
<sec id="s4-2-1">
<title>4.2.1 LUNA 16 dataset (Kaggle datasets, 2024)</title>
<p>LUNA 16 is a publicly available LIDC/IDRI dataset and is a collaborative effort between the Lung Imaging Database Consortium (LIDC) and the Image Database Resource Institute (IDRI). Comprising 888 CT scans, this publicly accessible medical imaging dataset focuses on lung cancer research. It includes both malignant and benign nodules, enabling scientists to assess the performance of algorithms in distinguishing between these two types of nodules. Further, the radiologists annotated the lesions as non-nodule, nodules &#x3c;3 mm, and nodules &#x2265;3 mm.</p>
</sec>
<sec id="s4-2-2">
<title>4.2.2 LIDC/IDRI dataset</title>
<p>This research utilized the LIDC/IDRI data set [10], comprising 888 thoracic CT scans with a section thickness of 2.5 mm or lower. Further, the dataset shows the influence of the presence of contrast, section thickness, and reconstruction kernel for assessing the computer-aided detection (CAD) performance. Four radiologists independently scrutinized the false positive CAD marks of the best CAD system.</p>
</sec>
</sec>
<sec id="s4-3">
<title>4.3 Performance metrics</title>
<p>The performance evaluation of the proposed FC2R &#x2b; CHSTM model involves assessing key metrics, such as sensitivity accuracy, and specificity. Accuracy represents the ratio of correctly identified lung nodules to the total number of detected nodules using the FC2R &#x2b; CHSTM model. Sensitivity is defined as the fraction of lung nodule instances that are positive. Specificity gauges how well the model can distinguish non-tumor areas from the CT scan.</p>
</sec>
<sec id="s4-4">
<title>4.4 Experimental results</title>
<p>The experimental outcomes obtained from the FC2R &#x2b; CHSTM model are depicted in <xref ref-type="fig" rid="F5">Figure 5</xref>, which also illustrates the input CT image, the pre-processing technique such as ROI extraction output, and lobe segmentation outcomes. The final outcome of the Sample 1 denotes the lung nodules are benign and sample 2 denotes the lung nodules are malignant.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>The experimental results obtained from the FC2R&#x002B;CHSTM model.</p>
</caption>
<graphic xlink:href="fphys-16-1511716-g005.tif"/>
</fig>
</sec>
<sec id="s4-5">
<title>4.5 Performance analysis</title>
<sec id="s4-5-1">
<title>4.5.1 Analysis of performance with TP</title>
<p>The performance evaluation for the FC2R &#x2b; CHSTM model in terms of Training percentage (TP) analysis is shown in <xref ref-type="fig" rid="F6">Figure 6</xref>. At TP 80 and epoch 40 the FC2R &#x2b; CHSTM attains 96.00% accuracy as well as for epoch 100 the accuracy of the model is 97.71%. Similarly, for epoch 100 and TP 80, the FC2R &#x2b; CHSTM model attains 98.08% sensitivity. The specificity value attained by the proposed FC2R &#x2b; CHSTM model is 97.02% which demonstrates that the FC2R &#x2b; CHSTM model detects the lung nodules with improved performance. The results depict that the model&#x2019;s accuracy is improved by increasing the size of the epoch. The hybridization of the BiLSTM classifier with the CHA optimization increases the convergence of the model to get the finest results. Additionally, the FC2R segments the nodule regions with higher accuracy which minimizes the computational complexity.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Performance evaluation with TP showing <bold>(A)</bold> Accuracy, <bold>(B)</bold> Sensitivity and <bold>(C)</bold> Specificity.</p>
</caption>
<graphic xlink:href="fphys-16-1511716-g006.tif"/>
</fig>
</sec>
<sec id="s4-5-2">
<title>4.5.2 Analysis of performance with K-fold</title>
<p>
<xref ref-type="fig" rid="F7">Figure 7</xref> shows the performance analysis of the FC2R &#x2b; CHSTM model with k-fold analysis for various epochs. For epoch 100, the model&#x2019;s accuracy is 97.15%, while at k-fold 10 and epoch 40, the FC2R &#x2b; CHSTM achieves 96.07% accuracy. As the epoch size increases, the model&#x2019;s accuracy increases as well, according to the data. Similarly, the FC2R &#x2b; CHSTM model achieves 96.87% sensitivity for k-fold 10 and epoch 100. The proposed FC2R &#x2b; CHSTM model attains a specificity value of 98.53%, indicating that it performs better in detecting lung nodules. To achieve optimal results, the hybridization of the BiLSTM classifier with the CHA optimization improves the model&#x2019;s convergence. In addition, the FC2R segments the nodule regions with higher accuracy which minimizes the computational complexity.</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Performance evaluation with K-fold showing <bold>(A)</bold> Accuracy, <bold>(B)</bold> Sensitivity and <bold>(C)</bold> Specificity.</p>
</caption>
<graphic xlink:href="fphys-16-1511716-g007.tif"/>
</fig>
</sec>
</sec>
<sec id="s4-6">
<title>4.6 Comparative techniques</title>
<p>The performance of the FC2R &#x2b; CHSTM model is compared with other conventional models such as Salmon fish optimization (SFO Based Deep NN) (<xref ref-type="bibr" rid="B29">Mozaffari and Fathi, 2012</xref>), Support Vector Machine (SVM) (<xref ref-type="bibr" rid="B21">Khan et al., 2019</xref>), Convolutional Neural Network (CNN) (<xref ref-type="bibr" rid="B18">Huang et al., 2017</xref>), Deep Neural Network (Deep NN) (<xref ref-type="bibr" rid="B41">Shukla et al., 2021</xref>), Artificial Neural Network (ANN) (<xref ref-type="bibr" rid="B8">Dand&#x131;l et al., 2014</xref>), K-Nearest Neighbour (KNN) (<xref ref-type="bibr" rid="B22">Lennartz et al., 2021</xref>), BiLSTM (<xref ref-type="bibr" rid="B13">Ganesan and Merline, 2017</xref>), Krill herd optimization (KHO Based Deep NN) (<xref ref-type="bibr" rid="B52">Yu et al., 2022</xref>), Jellyfish optimization based BiLSTM (JFOSTM) (<xref ref-type="bibr" rid="B7">Chou and Molla, 2022</xref>), Krill herd optimization enabled BiLSTM (KHOSTM) (<xref ref-type="bibr" rid="B12">Gandomi and Alavi, 2012</xref>), SKO based Deep NN, LNDC-HDL (<xref ref-type="bibr" rid="B15">Gugulothu and Balaji, 2024</xref>), and CNN &#x2b; IMFO &#x2b; LBP (<xref ref-type="bibr" rid="B39">Sebastian and Dua, 2023</xref>), I3DR-Net (<xref ref-type="bibr" rid="B17">Harsono et al., 2022</xref>), Modified AlexNet-SVM (<xref ref-type="bibr" rid="B32">Naseer et al., 2023</xref>) to explicate the efficiency of the model in lung nodule detection.</p>
<sec id="s4-6-1">
<title>4.6.1 Comparative evaluation with TP utilizing LUNA 16 dataset</title>
<p>
<xref ref-type="fig" rid="F8">Figure 8</xref> presents a comparison of the FC2R &#x2b; CHSTM with the traditional approaches using TP for the Luna 16 dataset using TP analysis. The FC2R &#x2b; CHSTM model achieves 97.71%, outperforming the current CNN by 10.60%, BiLSTM by 7.03%, Modified AlexNet-SVM by 5.16%, and I3DR-Net by 4.38%. For sensitivity measure, the model attains 98.08% which shows improvement over the Modified AlexNet-SVM by 3.41%, I3DR-Net by 3.34%, and JFOSTM by 3.16%. For TP 80 the FC2R &#x2b; CHSTM obtained 97.02% specificity that demonstrates superior performance improvement than the conventional Modified AlexNet-SVM, I3DR-Net, and JFOSTM by 3.57%, 3.50%, and 2.93% respectively. Thus, the FC2R &#x2b; CHSTM model obtains enhanced results than the existing methods, and the integration of the CHO algorithm combines the induced movement strategy of krill with the time control mechanism of the cnidaria that increases the performance of theFC2R &#x2b; CHSTM model to attain better detection accuracy.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>Comparative evaluation with TP using LUNA 16 dataset. <bold>(A)</bold> Accuracy, <bold>(B)</bold> Sensitivity and <bold>(C)</bold> Specificity.</p>
</caption>
<graphic xlink:href="fphys-16-1511716-g008.tif"/>
</fig>
</sec>
<sec id="s4-6-2">
<title>4.6.2 Comparative evaluation with K-fold utilizing LUNA 16 dataset</title>
<p>
<xref ref-type="fig" rid="F9">Figure 9</xref> compares the FC2R &#x2b; CHSTM model performance to the existing methods using K-fold 10. The FC2R &#x2b; CHSTM model obtains 97.15%, outperforming the Modified AlexNet-SVM by 3.41%, I3DR-Net by 2.88%, and JFOSTM by 2.47%. For sensitivity measure, the model attains 96.87% which exceeded the existing technique Modified AlexNet-SVM by 4.18%, I3DR-Net by 2.22%, and JFOSTM by 1.90%. For K-fold 10 the FC2R &#x2b; CHSTM obtained 98.53% specificity that demonstrates superior performance improvement than the conventional Modified AlexNet-SVM, I3DR-Net, and JFOSTM by 4.24%, 4.18%, and 3.91% respectively. Thus, the FC2R &#x2b; CHSTM model obtains enhanced results than the implemented methods, and the integration of the CHO algorithm combines the induced movement strategy of krill with the time control mechanism of the cnidaria that advances the performance of the FC2R &#x2b; CHSTM model.</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption>
<p>Comparative evaluation with k-fold using LUNA 16 dataset. <bold>(A)</bold> Accuracy, <bold>(B)</bold> Sensitivity and <bold>(C)</bold> Specificity.</p>
</caption>
<graphic xlink:href="fphys-16-1511716-g009.tif"/>
</fig>
</sec>
<sec id="s4-6-3">
<title>4.6.3 Comparative evaluation with TP utilizing LIDC/IDRI dataset</title>
<p>The comparative evaluation of the FC2R &#x2b; CHSTM and the conventional methods utilizing TP for the LIDC/IDRI dataset is shown in <xref ref-type="fig" rid="F10">Figure 10</xref>. The FC2R &#x2b; CHSTM model outperforms the Modified AlexNet-SVM by 5.87%, I3DR-Net by 3.50% and JFOSTM by 2.43%, with a high accuracy of 96.60%. With a sensitivity measure of 97.30%, the proposed model outperforms the Modified AlexNet-SVM by 7.83%, I3DR-Net by 3.15%, and JFOSTM by 1.65%. In comparison to the traditional Modified AlexNet-SVM, I3DR-Net, and JFOSTM, the proposed approach attained a significant improvement of 3.88%, 3.85%, and 3.22% better, respectively, achieving a specificity of 95.90% for TP 80. More specifically, the FC2R &#x2b; CHSTM model outperforms the other existing techniques via the application of the CHO algorithm combines the cnidaria&#x2019;s time control mechanism with the krill&#x2019;s induced movement strategy, improving the FC2R &#x2b; CHSTM model&#x2019;s performance and achieving higher detection accuracy.</p>
<fig id="F10" position="float">
<label>FIGURE 10</label>
<caption>
<p>Comparative evaluation with TP using LIDC or IDRI dataset. <bold>(A)</bold> Accuracy, <bold>(B)</bold> Sensitivity and <bold>(C)</bold> Specificity.</p>
</caption>
<graphic xlink:href="fphys-16-1511716-g010.tif"/>
</fig>
</sec>
<sec id="s4-6-4">
<title>4.6.4 Comparative evaluation with K-fold utilizing LIDC/IDRI dataset</title>
<p>The performance of the FC2R &#x2b; CHSTM model is compared to the existing approaches in terms of K-fold 10 with the LIDC/IDRI dataset in <xref ref-type="fig" rid="F11">Figure 11</xref>. The FC2R &#x2b; CHSTM model achieves 97.59%, surpassing the Modified AlexNet-SVM by 1.77%, I3DR-Net by 1.45% and JFOSTM by 1.04%. With a sensitivity measure of 96.77%, the FC2R &#x2b; CHSTM model outperforms the Modified AlexNet-SVM by 1.61%, I3DR-Net by 1.14%, and JFOSTM by 0.45%. Subsequently, the FC2R &#x2b; CHSTM achieves 98.30% specificity for K-fold 10 and obtained a substantial improvement of 1.92% over AlexNet-SVM,1.76% over I3DR-Net, and 1.62% over JFOSTM. The CHO algorithm integrates the induced movement strategy of krill with the time control mechanism of cnidaria, improving the performance of the FC2R &#x2b; CHSTM model. As a result, the model achieves better outcomes than the other existing approaches.</p>
<fig id="F11" position="float">
<label>FIGURE 11</label>
<caption>
<p>Comparative evaluation with k-fold using LIDC or IDRI dataset. <bold>(A)</bold> Accuracy, <bold>(B)</bold> Sensitivity and <bold>(C)</bold> Specificity.</p>
</caption>
<graphic xlink:href="fphys-16-1511716-g011.tif"/>
</fig>
</sec>
</sec>
<sec id="s4-7">
<title>4.7 Comparative discussion</title>
<p>The implemented methods employed for lung nodule detection pose several limitations related to generalizability, interpretability challenges, and data requirements. In addition to that the conventional SVM model creates data imbalance issues which affect the reliability of the detection model. While the modified attention-based techniques mentioned in the literature minimized the computational cost, it has a higher rate of missed detections because of interference from numerous potential false positives outside of the lung area. The LNDC-HDL technique faces challenges in computational complexity. The CNN &#x2b; IMFO &#x2b; LBP model suffers from computational time. To overcome this issue this research proposed the FC2R &#x2b; CHSTM model which detects the lung nodules with better accuracy and minimum run time. The CHSTM &#x2b; FC2R model increases the system reliability minimizes the overfitting issues caused by data imbalance problems and increases the computational efficiency of the lung nodule detection tasks. The comparative discussion of the FC2R &#x2b; CHSTM model concerning TP and K-fold analysis is shown in <xref ref-type="table" rid="T1">Table 1</xref>.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Comparative analysis with the proposed model using the LUNA 16 dataset.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Methods</th>
<th colspan="3" align="center">TP (80)</th>
<th colspan="3" align="center">K-fold (10)</th>
</tr>
<tr>
<th align="center">Accuracy (%)</th>
<th align="center">Sensitivity (%)</th>
<th align="center">Specificity (%)</th>
<th align="center">Accuracy (%)</th>
<th align="center">Sensitivity (%)</th>
<th align="center">Specificity (%)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">SVM</td>
<td align="center">50.67</td>
<td align="center">50.94</td>
<td align="center">50.41</td>
<td align="center">89.29</td>
<td align="center">88.69</td>
<td align="center">89.90</td>
</tr>
<tr>
<td align="center">KNN</td>
<td align="center">71.18</td>
<td align="center">71.56</td>
<td align="center">70.81</td>
<td align="center">90.03</td>
<td align="center">89.19</td>
<td align="center">90.87</td>
</tr>
<tr>
<td align="center">ANN</td>
<td align="center">81.69</td>
<td align="center">82.12</td>
<td align="center">81.27</td>
<td align="center">90.58</td>
<td align="center">89.31</td>
<td align="center">91.85</td>
</tr>
<tr>
<td align="center">CNN</td>
<td align="center">87.36</td>
<td align="center">87.81</td>
<td align="center">86.90</td>
<td align="center">91.54</td>
<td align="center">90.56</td>
<td align="center">92.52</td>
</tr>
<tr>
<td align="center">DeepNN</td>
<td align="center">90.39</td>
<td align="center">90.86</td>
<td align="center">89.92</td>
<td align="center">92.01</td>
<td align="center">91.18</td>
<td align="center">92.84</td>
</tr>
<tr>
<td align="center">BiLSTM</td>
<td align="center">90.85</td>
<td align="center">91.76</td>
<td align="center">90.12</td>
<td align="center">92.21</td>
<td align="center">91.55</td>
<td align="center">92.85</td>
</tr>
<tr>
<td align="center">SFO Based DeepNN</td>
<td align="center">91.91</td>
<td align="center">92.39</td>
<td align="center">91.43</td>
<td align="center">92.33</td>
<td align="center">91.80</td>
<td align="center">92.86</td>
</tr>
<tr>
<td align="center">KHO Based DeepNN</td>
<td align="center">92.67</td>
<td align="center">93.15</td>
<td align="center">92.18</td>
<td align="center">93.28</td>
<td align="center">92.43</td>
<td align="center">94.13</td>
</tr>
<tr>
<td align="center">Modified AlexNet-SVM</td>
<td align="center">92.67</td>
<td align="center">94.74</td>
<td align="center">93.56</td>
<td align="center">93.85</td>
<td align="center">92.82</td>
<td align="center">94.35</td>
</tr>
<tr>
<td align="center">I3DR-Net</td>
<td align="center">93.43</td>
<td align="center">94.81</td>
<td align="center">93.63</td>
<td align="center">94.36</td>
<td align="center">94.72</td>
<td align="center">94.42</td>
</tr>
<tr>
<td align="center">JFOSTM</td>
<td align="center">94.49</td>
<td align="center">94.99</td>
<td align="center">94.18</td>
<td align="center">94.76</td>
<td align="center">95.03</td>
<td align="center">94.68</td>
</tr>
<tr>
<td align="center">KHOSTM</td>
<td align="center">94.84</td>
<td align="center">95.57</td>
<td align="center">94.20</td>
<td align="center">95.47</td>
<td align="center">93.10</td>
<td align="center">96.15</td>
</tr>
<tr>
<td align="center">SKO based DeepNN</td>
<td align="center">95.50</td>
<td align="center">96.00</td>
<td align="center">95.00</td>
<td align="center">96.11</td>
<td align="center">95.54</td>
<td align="center">96.69</td>
</tr>
<tr>
<td align="center">FC2R &#x2b; CHSTM</td>
<td align="center">97.71</td>
<td align="center">98.09</td>
<td align="center">97.03</td>
<td align="center">97.16</td>
<td align="center">96.87</td>
<td align="center">98.53</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4-8">
<title>4.8 Statistical analysis</title>
<p>Statistical Analysis is carried out on different datasets including the LUNA 16 dataset and LIDC/IDRI dataset to evaluate the robustness of the results. In addition, the statistical measures such as best, mean and variance are applied for evaluating the metrics accuracy, sensitivity, and specificity, and the results are described in this section. <xref ref-type="table" rid="T2">Tables 2</xref>, <xref ref-type="table" rid="T3">3</xref> reveal the results of the statistical analysis for the LUNA 16 dataset and LIDC/IDRI dataset respectively. Moreover, the statistical analysis portrayed in <xref ref-type="table" rid="T2">Tables 2</xref>, <xref ref-type="table" rid="T3">3</xref>, ensures that the proposed research obtained robust results in terms of performance metrics facilitating the improved interpretation of results.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Statistical analysis using the LUNA 16 dataset.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Methods</th>
<th colspan="3" align="center">Accuracy</th>
<th colspan="3" align="center">Sensitivity</th>
<th colspan="3" align="center">Specificity</th>
</tr>
<tr>
<th align="left">Best</th>
<th align="left">Mean</th>
<th align="left">Variance</th>
<th align="left">Best</th>
<th align="left">Mean</th>
<th align="left">Variance</th>
<th align="left">Best</th>
<th align="left">Mean</th>
<th align="left">Variance</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">SVM</td>
<td align="center">74.05</td>
<td align="center">60.17</td>
<td align="center">106.36</td>
<td align="center">77.41</td>
<td align="center">60.49</td>
<td align="center">126.09</td>
<td align="center">70.70</td>
<td align="center">59.84</td>
<td align="center">91.88</td>
</tr>
<tr>
<td align="center">KNN</td>
<td align="center">81.70</td>
<td align="center">63.99</td>
<td align="center">147.32</td>
<td align="center">78.20</td>
<td align="center">62.07</td>
<td align="center">130.98</td>
<td align="center">85.20</td>
<td align="center">65.92</td>
<td align="center">165.76</td>
</tr>
<tr>
<td align="center">ANN</td>
<td align="center">82.75</td>
<td align="center">64.80</td>
<td align="center">142.00</td>
<td align="center">79.23</td>
<td align="center">63.29</td>
<td align="center">117.02</td>
<td align="center">86.27</td>
<td align="center">66.32</td>
<td align="center">170.36</td>
</tr>
<tr>
<td align="center">CNN</td>
<td align="center">84.38</td>
<td align="center">66.67</td>
<td align="center">150.73</td>
<td align="center">82.33</td>
<td align="center">65.74</td>
<td align="center">143.80</td>
<td align="center">86.42</td>
<td align="center">67.60</td>
<td align="center">161.69</td>
</tr>
<tr>
<td align="center">DeepNN</td>
<td align="center">86.22</td>
<td align="center">69.01</td>
<td align="center">144.26</td>
<td align="center">84.54</td>
<td align="center">68.49</td>
<td align="center">149.74</td>
<td align="center">87.90</td>
<td align="center">69.54</td>
<td align="center">145.06</td>
</tr>
<tr>
<td align="center">BiLSTM</td>
<td align="center">87.33</td>
<td align="center">70.99</td>
<td align="center">152.87</td>
<td align="center">85.47</td>
<td align="center">70.43</td>
<td align="center">154.35</td>
<td align="center">89.18</td>
<td align="center">71.55</td>
<td align="center">158.65</td>
</tr>
<tr>
<td align="center">SFO Based DeepNN</td>
<td align="center">88.35</td>
<td align="center">71.93</td>
<td align="center">154.76</td>
<td align="center">86.44</td>
<td align="center">71.41</td>
<td align="center">160.90</td>
<td align="center">90.27</td>
<td align="center">72.44</td>
<td align="center">154.93</td>
</tr>
<tr>
<td align="center">KHO Based DeepNN</td>
<td align="center">89.15</td>
<td align="center">73.00</td>
<td align="center">160.51</td>
<td align="center">86.94</td>
<td align="center">72.06</td>
<td align="center">157.52</td>
<td align="center">91.36</td>
<td align="center">73.93</td>
<td align="center">171.61</td>
</tr>
<tr>
<td align="center">Modified AlexNet-SVM</td>
<td align="center">90.94</td>
<td align="center">74.31</td>
<td align="center">177.04</td>
<td align="center">89.69</td>
<td align="center">73.50</td>
<td align="center">182.06</td>
<td align="center">92.19</td>
<td align="center">75.12</td>
<td align="center">179.72</td>
</tr>
<tr>
<td align="center">I3DR-Net</td>
<td align="center">93.23</td>
<td align="center">76.94</td>
<td align="center">159.13</td>
<td align="center">94.25</td>
<td align="center">76.41</td>
<td align="center">174.45</td>
<td align="center">92.21</td>
<td align="center">77.48</td>
<td align="center">150.02</td>
</tr>
<tr>
<td align="center">JFOSTM</td>
<td align="center">94.26</td>
<td align="center">78.96</td>
<td align="center">144.58</td>
<td align="center">95.70</td>
<td align="center">78.76</td>
<td align="center">171.71</td>
<td align="center">92.82</td>
<td align="center">79.17</td>
<td align="center">123.68</td>
</tr>
<tr>
<td align="center">KHOSTM</td>
<td align="center">95.25</td>
<td align="center">81.85</td>
<td align="center">127.82</td>
<td align="center">97.05</td>
<td align="center">81.93</td>
<td align="center">144.93</td>
<td align="center">93.45</td>
<td align="center">81.78</td>
<td align="center">117.03</td>
</tr>
<tr>
<td align="center">SKO-DeepNN</td>
<td align="center">95.59</td>
<td align="center">84.51</td>
<td align="center">82.56</td>
<td align="center">97.13</td>
<td align="center">84.79</td>
<td align="center">95.07</td>
<td align="center">94.05</td>
<td align="center">84.22</td>
<td align="center">74.02</td>
</tr>
<tr>
<td align="center">FC2R &#x2b; CHSTM</td>
<td align="center">96.61</td>
<td align="center">86.51</td>
<td align="center">57.92</td>
<td align="center">97.31</td>
<td align="center">85.41</td>
<td align="center">96.83</td>
<td align="center">95.91</td>
<td align="center">87.61</td>
<td align="center">32.09</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Statistical analysis using the LIDC/IDRI dataset.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Methods</th>
<th colspan="3" align="center">Accuracy</th>
<th colspan="3" align="center">Sensitivity</th>
<th colspan="3" align="center">Specificity</th>
</tr>
<tr>
<th align="left">Best</th>
<th align="left">Mean</th>
<th align="left">Variance</th>
<th align="left">Best</th>
<th align="left">Mean</th>
<th align="left">Variance</th>
<th align="left">Best</th>
<th align="left">Mean</th>
<th align="left">Variance</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">SVM</td>
<td align="center">74.05</td>
<td align="center">60.17</td>
<td align="center">106.36</td>
<td align="center">77.41</td>
<td align="center">60.49</td>
<td align="center">126.09</td>
<td align="center">70.70</td>
<td align="center">59.84</td>
<td align="center">91.88</td>
</tr>
<tr>
<td align="center">KNN</td>
<td align="center">81.70</td>
<td align="center">63.99</td>
<td align="center">147.32</td>
<td align="center">78.20</td>
<td align="center">62.07</td>
<td align="center">130.98</td>
<td align="center">85.20</td>
<td align="center">65.92</td>
<td align="center">165.76</td>
</tr>
<tr>
<td align="center">ANN</td>
<td align="center">82.75</td>
<td align="center">64.80</td>
<td align="center">142.00</td>
<td align="center">79.23</td>
<td align="center">63.29</td>
<td align="center">117.02</td>
<td align="center">86.27</td>
<td align="center">66.32</td>
<td align="center">170.36</td>
</tr>
<tr>
<td align="center">CNN</td>
<td align="center">84.38</td>
<td align="center">66.67</td>
<td align="center">150.73</td>
<td align="center">82.33</td>
<td align="center">65.74</td>
<td align="center">143.80</td>
<td align="center">86.42</td>
<td align="center">67.60</td>
<td align="center">161.69</td>
</tr>
<tr>
<td align="center">DeepNN</td>
<td align="center">86.22</td>
<td align="center">69.01</td>
<td align="center">144.26</td>
<td align="center">84.54</td>
<td align="center">68.49</td>
<td align="center">149.74</td>
<td align="center">87.90</td>
<td align="center">69.54</td>
<td align="center">145.06</td>
</tr>
<tr>
<td align="center">BiLSTM</td>
<td align="center">87.33</td>
<td align="center">70.99</td>
<td align="center">152.87</td>
<td align="center">85.47</td>
<td align="center">70.43</td>
<td align="center">154.35</td>
<td align="center">89.18</td>
<td align="center">71.55</td>
<td align="center">158.65</td>
</tr>
<tr>
<td align="center">SFO Based DeepNN</td>
<td align="center">88.35</td>
<td align="center">71.93</td>
<td align="center">154.76</td>
<td align="center">86.44</td>
<td align="center">71.41</td>
<td align="center">160.90</td>
<td align="center">90.27</td>
<td align="center">72.44</td>
<td align="center">154.93</td>
</tr>
<tr>
<td align="center">KHO Based DeepNN</td>
<td align="center">89.15</td>
<td align="center">73.00</td>
<td align="center">160.51</td>
<td align="center">86.94</td>
<td align="center">72.06</td>
<td align="center">157.52</td>
<td align="center">91.36</td>
<td align="center">73.93</td>
<td align="center">171.61</td>
</tr>
<tr>
<td align="center">Modified AlexNet-SVM</td>
<td align="center">90.94</td>
<td align="center">74.31</td>
<td align="center">177.04</td>
<td align="center">89.69</td>
<td align="center">73.50</td>
<td align="center">182.06</td>
<td align="center">92.19</td>
<td align="center">75.12</td>
<td align="center">179.72</td>
</tr>
<tr>
<td align="center">I3DR-Net</td>
<td align="center">93.23</td>
<td align="center">76.94</td>
<td align="center">159.13</td>
<td align="center">94.25</td>
<td align="center">76.41</td>
<td align="center">174.45</td>
<td align="center">92.21</td>
<td align="center">77.48</td>
<td align="center">150.02</td>
</tr>
<tr>
<td align="center">JFOSTM</td>
<td align="center">94.26</td>
<td align="center">78.96</td>
<td align="center">144.58</td>
<td align="center">95.70</td>
<td align="center">78.76</td>
<td align="center">171.71</td>
<td align="center">92.82</td>
<td align="center">79.17</td>
<td align="center">123.68</td>
</tr>
<tr>
<td align="center">KHOSTM</td>
<td align="center">95.25</td>
<td align="center">81.85</td>
<td align="center">127.82</td>
<td align="center">97.05</td>
<td align="center">81.93</td>
<td align="center">144.93</td>
<td align="center">93.45</td>
<td align="center">81.78</td>
<td align="center">117.03</td>
</tr>
<tr>
<td align="center">SKO-DeepNN</td>
<td align="center">95.59</td>
<td align="center">84.51</td>
<td align="center">82.56</td>
<td align="center">97.13</td>
<td align="center">84.79</td>
<td align="center">95.07</td>
<td align="center">94.05</td>
<td align="center">84.22</td>
<td align="center">74.02</td>
</tr>
<tr>
<td align="center">FC2R &#x2b; CHSTM</td>
<td align="center">96.61</td>
<td align="center">86.51</td>
<td align="center">57.92</td>
<td align="center">97.31</td>
<td align="center">85.41</td>
<td align="center">96.83</td>
<td align="center">95.91</td>
<td align="center">87.61</td>
<td align="center">32.09</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4-9">
<title>4.9 Computation time analysis</title>
<p>Computation analysis is carried out between the proposed approach and the other existing techniques to analyze the computation efficiency. <xref ref-type="fig" rid="F12">Figure 12</xref> illustrates the results of the computation time analysis evaluated in terms of computation time with respect to the varying iterations. For iteration 100, the computation time attained by the proposed strategy is 20.33s, which is low compared to the other existing approaches. In the proposed approach, the CHO algorithm finetunes the hyperparameters of the CHSTM model and solves various high-dimensional challenging problems. Consequently, the CHO algorithm offers a fast convergence speed towards the optimal solution, enhances the training process, and reduces the computation time.</p>
<fig id="F12" position="float">
<label>FIGURE 12</label>
<caption>
<p>Computation time analysis.</p>
</caption>
<graphic xlink:href="fphys-16-1511716-g012.tif"/>
</fig>
</sec>
</sec>
<sec sec-type="conclusion" id="s5">
<title>5 Conclusion</title>
<p>In conclusion, this research developed an innovative approach for lung nodule detection, combining deep learning and bio-inspired optimization techniques. The CHSTM model, powered by the CHO algorithm effectively detects lung nodules from CT images. The FC2R segmentation model combines the Resnet &#x2212;101 deep learning model and the FCM technique that effectively improves the performance of the model. CHO is inspired by the food-searching and herding characteristics of cindaria and krill fish respectively. By adjusting model hyperparameters using the CHO algorithm, the accuracy of the model is improved. The statistical and texture features extract the pertinent features that improve nodule detection accuracy. The combination of the induced movement strategy of krill with the time control mechanism of the cnidaria improves the CHSTM model&#x2019;s performance by attaining better detection accuracy and detecting lung nodules as malignant or benign. According to the findings of a performance comparison between the FC2R &#x2b; CHSTM model and the existing approaches, the suggested model achieves 97.71% accuracy, 98.09% sensitivity, and 97.03% specificity for TP 80 using the LUNA-16 dataset. Further, the proposed approach obtained the accuracy, sensitivity, and specificity of 97.59%,96.77%, and 98.41% with k-fold validation utilizing the LIDC/IDRI dataset. Subsequent research endeavours to enhance the precision of the suggested approach by focusing network training on intricate instances.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s6">
<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 author.</p>
</sec>
<sec sec-type="author-contributions" id="s7">
<title>Author contributions</title>
<p>RP: Data curation, Formal Analysis, Investigation, Methodology, Software, Writing&#x2013;original draft, Writing&#x2013;review and editing, Conceptualization. AG: Supervision, Validation, Visualization, Writing&#x2013;review and editing.</p>
</sec>
<sec sec-type="funding-information" id="s8">
<title>Funding</title>
<p>The author(s) declare that no financial support was received for the research, authorship, and/or publication of this article.</p>
</sec>
<sec sec-type="COI-statement" id="s9">
<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 sec-type="ai-statement" id="s10">
<title>Generative AI statement</title>
<p>The author(s) declare that no Generative AI was used in the creation of this manuscript.</p>
</sec>
<sec sec-type="disclaimer" id="s11">
<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">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Akram</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Javed</surname>
<given-names>M. Y.</given-names>
</name>
<name>
<surname>Akram</surname>
<given-names>M. U.</given-names>
</name>
<name>
<surname>Qamar</surname>
<given-names>U.</given-names>
</name>
<name>
<surname>Hassan</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Pulmonary nodules detection and classification using hybrid features from computerized tomographic images</article-title>. <source>J. Med. Imaging Health Inf.</source> <volume>6</volume> (<issue>1</issue>), <fpage>252</fpage>&#x2013;<lpage>259</lpage>. <pub-id pub-id-type="doi">10.1166/jmihi.2016.1600</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ali</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Muzammil</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Haq</surname>
<given-names>I. U.</given-names>
</name>
<name>
<surname>Amir</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Abdullah</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Deep feature selection and decision level fusion for lungs nodule classification</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>18962</fpage>&#x2013;<lpage>18973</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2021.3054735</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bhanumathi</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Chandrashekara</surname>
<given-names>S. N.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Deep earning based bilstm architecture for lung cancer classification</article-title>. <source>Int. J. Adv. Res. Eng. Technol. (IJARET)</source> <volume>12</volume> (<issue>1</issue>), <fpage>492</fpage>&#x2013;<lpage>503</lpage>. <pub-id pub-id-type="doi">10.34218/IJARET.12.1.2020.045</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chakraborti</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>McCane</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Mills</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Pal</surname>
<given-names>U.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>LOOP descriptor: local optimal-oriented pattern</article-title>. <source>IEEE Signal Process. Lett.</source> <volume>25</volume> (<issue>5</issue>), <fpage>635</fpage>&#x2013;<lpage>639</lpage>. <pub-id pub-id-type="doi">10.1109/LSP.2018.2817176</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Feng</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Zheng</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>LDNNET: towards robust classification of lung nodule and cancer using lung dense neural network</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>50301</fpage>&#x2013;<lpage>50320</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2021.3068896</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A lung dense deep convolution neural network for robust lung parenchyma segmentation</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>93527</fpage>&#x2013;<lpage>93547</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2021.3068896</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chou</surname>
<given-names>J. S.</given-names>
</name>
<name>
<surname>Molla</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Recent advances in use of bio-inspired jellyfish search algorithm for solving optimization problems</article-title>. <source>Sci. Rep.</source> <volume>12</volume> (<issue>1</issue>), <fpage>19157</fpage>. <pub-id pub-id-type="doi">10.1038/s41598-022-23121-z</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Dand&#x131;l</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>&#xc7;akiro&#x11f;lu</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ek&#x15f;i</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>&#xd6;zkan</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Kurt</surname>
<given-names>&#xd6;. K.</given-names>
</name>
<name>
<surname>Canan</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2014</year>). &#x201c;<article-title>Artificial neural network-based classification system for lung nodules on computed tomography scans</article-title>,&#x201d; in <source>2014 6th International conference of soft computing and pattern recognition (SoCPaR)</source> (<publisher-loc>Piscataway, NJ</publisher-loc>:<publisher-name>IEEE</publisher-name>), <fpage>382</fpage>&#x2013;<lpage>386</lpage>. <pub-id pub-id-type="doi">10.1109/SOCPAR.2014.7008037</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Elzayady</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Sobhy</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Badran</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Integrated bidirectional LSTM&#x2013;CNN model for customers reviews classification</article-title>. <source>J. Eng. Sci. Mil. Technol.</source> <volume>5</volume> (<issue>1</issue>). <pub-id pub-id-type="doi">10.21608/JMTC.2021.66626.1172</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Farahani</surname>
<given-names>F. V.</given-names>
</name>
<name>
<surname>Ahmadi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Zarandi</surname>
<given-names>M. H. F.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Hybrid intelligent approach for diagnosis of the lung nodule from CT images using spatial kernelized fuzzy c-means and ensemble learning</article-title>. <source>Math. Comput. Simul.</source> <volume>149</volume>, <fpage>48</fpage>&#x2013;<lpage>68</lpage>. <pub-id pub-id-type="doi">10.1016/j.matcom.2018.02.001</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Ferreira</surname>
<given-names>F. T.</given-names>
</name>
<name>
<surname>Sousa</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Galdran</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Sousa</surname>
<given-names>M. R.</given-names>
</name>
<name>
<surname>Campilho</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2018)</year>). &#x201c;<article-title>End-to-end supervised lung lobe segmentation</article-title>,&#x201d; in <source>2018 international joint conference on neural networks (IJCNN)</source> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.1109/IJCNN.2018.8489677</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gandomi</surname>
<given-names>A. H.</given-names>
</name>
<name>
<surname>Alavi</surname>
<given-names>A. H.</given-names>
</name>
</person-group> (<year>2012</year>). <article-title>Krill herd: a new bio-inspired optimization algorithm</article-title>. <source>Commun. nonlinear Sci. Numer. Simul.</source> <volume>17</volume> (<issue>12</issue>), <fpage>4831</fpage>&#x2013;<lpage>4845</lpage>. <pub-id pub-id-type="doi">10.1016/j.cnsns.2012.05.010</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ganesan</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Merline</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Fuzzy-C-means clustering based segmentation and CNN-classification for accurate segmentation of lung nodules</article-title>. <source>Asian Pac. J. Cancer Prev. APJCP</source> <volume>18</volume> (<issue>7</issue>), <fpage>1869</fpage>&#x2013;<lpage>1874</lpage>. <pub-id pub-id-type="doi">10.22034/APJCP.2017.18.7.1869</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Gerard</surname>
<given-names>S. E.</given-names>
</name>
<name>
<surname>Reinhardt</surname>
<given-names>J. M.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>Pulmonary lobe segmentation using a sequence of convolutional neural networks for marginal learning</article-title>,&#x201d; in <source>2019 IEEE 16th international symposium on biomedical imaging (ISBI 2019)</source> (<publisher-name>IEEE</publisher-name>), <fpage>1207</fpage>&#x2013;<lpage>1211</lpage>. <pub-id pub-id-type="doi">10.1109/ISBI.2019.8759212</pub-id>
</citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gugulothu</surname>
<given-names>V. K.</given-names>
</name>
<name>
<surname>Balaji</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Retraction Note: an early prediction and classification of lung nodule diagnosis on CT images based on hybrid deep learning techniques</article-title>. <source>Multimed. Tools Appl.</source> <volume>83</volume>, <fpage>88555</fpage>. <pub-id pub-id-type="doi">10.1007/s11042-024-20019-y</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hameed</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Garcia-Zapirain</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Sentiment classification using a single-layered BiLSTM model</article-title>. <source>Ieee Access</source> <volume>8</volume>, <fpage>73992</fpage>&#x2013;<lpage>74001</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.2988550</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Harsono</surname>
<given-names>I. W.</given-names>
</name>
<name>
<surname>Liawatimena</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Cenggoro</surname>
<given-names>T. W.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Lung nodule detection and classification from Thorax CT-scan using RetinaNet with transfer learning</article-title>. <source>J. King Saud University-Computer Inf. Sci.</source> <volume>34</volume> (<issue>3</issue>), <fpage>567</fpage>&#x2013;<lpage>577</lpage>. <pub-id pub-id-type="doi">10.1016/j.jksuci.2020.03.013</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Huang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Shan</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Vaidya</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Lung nodule detection in CT using 3D convolutional neural networks</article-title>,&#x201d; in <source>2017 IEEE 14th international symposium on biomedical imaging (ISBI 2017)</source> (<publisher-name>IEEE</publisher-name>), <fpage>379</fpage>&#x2013;<lpage>383</lpage>. <pub-id pub-id-type="doi">10.1109/ISBI.2017.7950542</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jacobs</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Van Rikxoort</surname>
<given-names>E. M.</given-names>
</name>
<name>
<surname>Twellmann</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Scholten</surname>
<given-names>E. T.</given-names>
</name>
<name>
<surname>De Jong</surname>
<given-names>P. A.</given-names>
</name>
<name>
<surname>Kuhnigk</surname>
<given-names>J. M.</given-names>
</name>
<etal/>
</person-group> (<year>2014</year>). <article-title>Automatic detection of subsolid pulmonary nodules in thoracic computed tomography images</article-title>. <source>Med. image Anal.</source> <volume>18</volume> (<issue>2</issue>), <fpage>374</fpage>&#x2013;<lpage>384</lpage>. <pub-id pub-id-type="doi">10.1016/j.media.2013.12.001</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ji</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zeng</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>An</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Z.</given-names>
</name>
<etal/>
</person-group> (<year>2023</year>). <article-title>Lung nodule detection in medical images based on improved YOLOv5s</article-title>. <source>IEEE Access</source> <volume>11</volume>, <fpage>76371</fpage>&#x2013;<lpage>76387</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2023.3296530</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Khan</surname>
<given-names>S. A.</given-names>
</name>
<name>
<surname>Nazir</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Khan</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Saba</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Javed</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Rehman</surname>
<given-names>A.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>Lung&#x2019;s nodule detection framework from computed tomography images using support vector machine</article-title>. <source>Microsc. Res. Tech.</source> <volume>82</volume> (<issue>8</issue>), <fpage>1256</fpage>&#x2013;<lpage>1266</lpage>. <pub-id pub-id-type="doi">10.1002/jemt.23275</pub-id>
</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lennartz</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Mager</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Grosse Hokamp</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Sch&#xe4;fer</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zopfs</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Maintz</surname>
<given-names>D.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Texture analysis of iodine maps and conventional images for k-nearest neighbor classification of benign and metastatic lung nodules</article-title>. <source>Cancer Imaging</source> <volume>21</volume>, <fpage>17</fpage>&#x2013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.1186/s40644-020-00374-3</pub-id>
</citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Tan</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Teng</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>H.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>Deep learning methods for lung cancer segmentation in whole-slide histopathology images&#x2014;the acdc@ lunghp challenge 2019</article-title>. <source>IEEE J. Biomed. Health Inf.</source> <volume>25</volume> (<issue>2</issue>), <fpage>429</fpage>&#x2013;<lpage>440</lpage>. <pub-id pub-id-type="doi">10.1109/JBHI.2020.3039741</pub-id>
</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Qin</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Feng</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>RSEA-Net: residual squeeze and excitation attention network for medical image segmentation</article-title>. <pub-id pub-id-type="doi">10.21203/rs.3.rs-1419097/v1</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Lin</surname>
<given-names>T. Y.</given-names>
</name>
<name>
<surname>Doll&#xe1;r</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Girshick</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Hariharan</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Belongie</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Feature pyramid networks for object detection</article-title>,&#x201d; in <source>Proceedings of the IEEE conference on computer vision and pattern recognition</source>, <fpage>2117</fpage>&#x2013;<lpage>2125</lpage>.</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2021b</year>). <article-title>Integrating lung parenchyma segmentation and nodule detection with deep multi-task learning</article-title>. <source>IEEE J. Biomed. Health Inf.</source> <volume>25</volume> (<issue>8</issue>), <fpage>3073</fpage>&#x2013;<lpage>3081</lpage>. <pub-id pub-id-type="doi">10.1109/JBHI.2021.3053023</pub-id>
</citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>K. W.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Geng</surname>
<given-names>L. S.</given-names>
</name>
</person-group> (<year>2021a</year>). <article-title>Review of deep learning based automatic segmentation for lung cancer radiotherapy</article-title>. <source>Front. Oncol.</source> <volume>11</volume>, <fpage>717039</fpage>. <pub-id pub-id-type="doi">10.3389/fonc.2021.717039</pub-id>
</citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mahum</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>AlSalman</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Lung-RetinaNet: lung cancer detection using a RetinaNet with multi-scale feature fusion and context module</article-title>. <source>IEEE Access</source> <volume>11</volume>, <fpage>53850</fpage>&#x2013;<lpage>53861</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2023.3281259</pub-id>
</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mozaffari</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Fathi</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2012</year>). <article-title>Identifying the behaviour of laser solid freeform fabrication system using aggregated neural network and the great salmon run optimisation algorithm</article-title>. <source>Int. J. Bio-Inspired Comput.</source> <volume>4</volume> (<issue>5</issue>), <fpage>330</fpage>&#x2013;<lpage>343</lpage>. <pub-id pub-id-type="doi">10.1504/IJBIC.2012.049901</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Murphy</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>van Ginneken</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Schilham</surname>
<given-names>A. M.</given-names>
</name>
<name>
<surname>De Hoop</surname>
<given-names>B. J.</given-names>
</name>
<name>
<surname>Gietema</surname>
<given-names>H. A.</given-names>
</name>
<name>
<surname>Prokop</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>A large-scale evaluation of automatic pulmonary nodule detection in chest CT using local image features and k-nearest-neighbour classification</article-title>. <source>Med. image Anal.</source> <volume>13</volume> (<issue>5</issue>), <fpage>757</fpage>&#x2013;<lpage>770</lpage>. <pub-id pub-id-type="doi">10.1016/j.media.2009.07.001</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mutlag</surname>
<given-names>W. K.</given-names>
</name>
<name>
<surname>Ali</surname>
<given-names>S. K.</given-names>
</name>
<name>
<surname>Aydam</surname>
<given-names>Z. M.</given-names>
</name>
<name>
<surname>Taher</surname>
<given-names>B. H.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Feature extraction methods: a review</article-title>,&#x201d;, <volume>1591</volume>. <source>J. Phys. Conf. Ser.</source> <pub-id pub-id-type="doi">10.1088/1742-6596/1591/1/012028</pub-id>
</citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Naseer</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Akram</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Masood</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Rashid</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Jaffar</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Lung cancer classification using modified U-Net based lobe segmentation and nodule detection</article-title>. <source>IEEE Access</source> <volume>11</volume>, <fpage>60279</fpage>&#x2013;<lpage>60291</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2023.3285821</pub-id>
</citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Nasrullah</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Sang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Alam</surname>
<given-names>M. S.</given-names>
</name>
<name>
<surname>Mateen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Cai</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Automated lung nodule detection and classification using deep learning combined with multiple strategies</article-title>. <source>Sensors</source> <volume>19</volume> (<issue>17</issue>), <fpage>3722</fpage>. <pub-id pub-id-type="doi">10.3390/s19173722</pub-id>
</citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Nguyen</surname>
<given-names>C. C.</given-names>
</name>
<name>
<surname>Tran</surname>
<given-names>G. S.</given-names>
</name>
<name>
<surname>Burie</surname>
<given-names>J. C.</given-names>
</name>
<name>
<surname>Nghiem</surname>
<given-names>T. P.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Pulmonary nodule detection based on faster R-CNN with adaptive anchor box</article-title>. <source>Ieee Access</source> <volume>9</volume>, <fpage>154740</fpage>&#x2013;<lpage>154751</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2021.3128942</pub-id>
</citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Nithila</surname>
<given-names>E. E.</given-names>
</name>
<name>
<surname>Kumar</surname>
<given-names>S. S.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Segmentation of lung nodule in CT data using active contour model and Fuzzy C-mean clustering</article-title>. <source>Alexandria Eng. J.</source> <volume>55</volume> (<issue>3</issue>), <fpage>2583</fpage>&#x2013;<lpage>2588</lpage>. <pub-id pub-id-type="doi">10.1016/j.aej.2016.06.002</pub-id>
</citation>
</ref>
<ref id="B36">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ozekes</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Osman</surname>
<given-names>O.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>Computerized lung nodule detection using 3D feature extraction and learning based algorithms</article-title>. <source>J. Med. Syst.</source> <volume>34</volume>, <fpage>185</fpage>&#x2013;<lpage>194</lpage>. <pub-id pub-id-type="doi">10.1007/s10916-008-9230-0</pub-id>
</citation>
</ref>
<ref id="B37">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Saihood</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Karshenas</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Naghsh-Nilchi</surname>
<given-names>A. R.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Multi-orientation local texture features for guided attention-based fusion in lung nodule classification</article-title>. <source>IEEE Access</source> <volume>11</volume>, <fpage>17555</fpage>&#x2013;<lpage>17568</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2023.3243104</pub-id>
</citation>
</ref>
<ref id="B38">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Schabath</surname>
<given-names>M. B.</given-names>
</name>
<name>
<surname>Cote</surname>
<given-names>M. L.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Cancer progress and priorities: lung cancer</article-title>. <source>Cancer Epidemiol. biomarkers and Prev.</source> <volume>28</volume> (<issue>10</issue>), <fpage>1563</fpage>&#x2013;<lpage>1579</lpage>. <pub-id pub-id-type="doi">10.1158/1055-9965.EPI-19-0221</pub-id>
</citation>
</ref>
<ref id="B39">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sebastian</surname>
<given-names>A. E.</given-names>
</name>
<name>
<surname>Dua</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Lung nodule detection via optimized convolutional neural network: impact of improved moth flame algorithm</article-title>. <source>Sens. Imaging</source> <volume>24</volume> (<issue>1</issue>), <fpage>11</fpage>. <pub-id pub-id-type="doi">10.1007/s11220-022-00406-1</pub-id>
</citation>
</ref>
<ref id="B40">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sharma</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Mehta</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Dhanjal</surname>
<given-names>D. S.</given-names>
</name>
<name>
<surname>Kaur</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Gupta</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Singh</surname>
<given-names>H.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>Emerging trends in the novel drug delivery approaches for the treatment of lung cancer</article-title>. <source>Chemico-biological Interact.</source> <volume>309</volume>, <fpage>108720</fpage>. <pub-id pub-id-type="doi">10.1016/j.cbi.2019.06.033</pub-id>
</citation>
</ref>
<ref id="B41">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Shukla</surname>
<given-names>V. V. K.</given-names>
</name>
<name>
<surname>Tanmisha</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Aluru</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Nagisetti</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Tumuluru</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>Lung nodule detection through ct scan images and dnn models</article-title>,&#x201d; in <source>2021 6th international conference on inventive computation technologies (ICICT)</source> (<publisher-name>IEEE</publisher-name>), <fpage>962</fpage>&#x2013;<lpage>967</lpage>. <pub-id pub-id-type="doi">10.1109/ICICT50816.2021.9358545</pub-id>
</citation>
</ref>
<ref id="B42">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Sreekumar</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Nair</surname>
<given-names>K. R.</given-names>
</name>
<name>
<surname>Sudheer</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Nayar</surname>
<given-names>H. G.</given-names>
</name>
<name>
<surname>Nair</surname>
<given-names>J. J.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Malignant lung nodule detection using deep learning</article-title>,&#x201d; in <source>2020 International conference on communication and signal processing (ICCSP)</source> (<publisher-name>IEEE</publisher-name>), <fpage>0209</fpage>&#x2013;<lpage>0212</lpage>. <pub-id pub-id-type="doi">10.1109/ICCSP48568.2020.9182258</pub-id>
</citation>
</ref>
<ref id="B43">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sui</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Computer&#x2010;aided lung nodule recognition by SVM classifier based on combination of random under sampling and SMOTE</article-title>. <source>Comput. Math. methods Med.</source> <volume>2015</volume> (<issue>1</issue>), <fpage>368674</fpage>. <pub-id pub-id-type="doi">10.1155/2015/368674</pub-id>
</citation>
</ref>
<ref id="B44">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Thallam</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Peruboyina</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Raju</surname>
<given-names>S. S. T.</given-names>
</name>
<name>
<surname>Sampath</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Early-stage lung cancer prediction using various machine learning techniques</article-title>,&#x201d; in <source>2020 4th international conference on electronics, communication and aerospace technology (ICECA)</source> (<publisher-name>IEEE</publisher-name>), <fpage>1285</fpage>&#x2013;<lpage>1292</lpage>. <pub-id pub-id-type="doi">10.1109/ICECA49313.2020.9297576</pub-id>
</citation>
</ref>
<ref id="B45">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tong</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Liang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Sangaiah</surname>
<given-names>A. K.</given-names>
</name>
<name>
<surname>Zheng</surname>
<given-names>Z.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>Pulmonary nodule detection based on ISODATA-improved faster RCNN and 3D-CNN with focal loss</article-title>. <source>Commun. Appl. (TOMM)</source> <volume>16</volume> (<issue>1s</issue>), <fpage>1</fpage>&#x2013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.1145/3365445</pub-id>
</citation>
</ref>
<ref id="B46">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>UrRehman</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Qiang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Shi</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Khattak</surname>
<given-names>S. U.</given-names>
</name>
<etal/>
</person-group> (<year>2024</year>). <article-title>Effective lung nodule detection using deep CNN with dual attention mechanisms</article-title>. <source>Sci. Rep.</source> <volume>14</volume> (<issue>1</issue>), <fpage>3934</fpage>. <pub-id pub-id-type="doi">10.1038/s41598-024-51833-x</pub-id>
</citation>
</ref>
<ref id="B47">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Gu</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Zang</surname>
<given-names>Y.</given-names>
</name>
<etal/>
</person-group> (<year>2017</year>). <article-title>Central focused convolutional neural networks: developing a data-driven model for lung nodule segmentation</article-title>. <source>Med. image Anal.</source> <volume>40</volume>, <fpage>172</fpage>&#x2013;<lpage>183</lpage>. <pub-id pub-id-type="doi">10.1016/j.media.2017.06.014</pub-id>
</citation>
</ref>
<ref id="B48">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Gan</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Dou</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Tsougenis</surname>
<given-names>E.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>Weakly supervised deep learning for whole slide lung cancer image analysis</article-title>. <source>IEEE Trans. Cybern.</source> <volume>50</volume> (<issue>9</issue>), <fpage>3950</fpage>&#x2013;<lpage>3962</lpage>. <pub-id pub-id-type="doi">10.1109/TCYB.2019.2935141</pub-id>
</citation>
</ref>
<ref id="B49">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wankhade</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Vigneshwari</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>A novel hybrid deep learning method for early detection of lung cancer using neural networks</article-title>. <source>Healthc. Anal.</source> <volume>3</volume>, <fpage>100195</fpage>. <pub-id pub-id-type="doi">10.1016/j.health.2023.100195</pub-id>
</citation>
</ref>
<ref id="B50">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Improved local ternary patterns for automatic target recognition in infrared imagery</article-title>. <source>Sensors</source> <volume>15</volume> (<issue>3</issue>), <fpage>6399</fpage>&#x2013;<lpage>6418</lpage>. <pub-id pub-id-type="doi">10.3390/s150306399</pub-id>
</citation>
</ref>
<ref id="B51">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xing</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Cai</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Ouyang</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Optimized fuzzy K-nearest neighbor approach for accurate lung cancer prediction based on radial endobronchial ultrasonography</article-title>. <source>Comput. Biol. Med.</source> <volume>171</volume>, <fpage>108038</fpage>. <pub-id pub-id-type="doi">10.1016/j.compbiomed.2024.108038</pub-id>
</citation>
</ref>
<ref id="B52">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Xie</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Optimization of BP neural network model by chaotic krill herd algorithm</article-title>. <source>Alexandria Eng. J.</source> <volume>61</volume> (<issue>12</issue>), <fpage>9769</fpage>&#x2013;<lpage>9777</lpage>. <pub-id pub-id-type="doi">10.1016/j.aej.2022.02.033</pub-id>
</citation>
</ref>
<ref id="B53">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Yao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Shen</surname>
<given-names>Q.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Attention-guided feature extraction and multiscale feature fusion 3d resnet for automated pulmonary nodule detection</article-title>. <source>IEEE Access</source> <volume>10</volume>, <fpage>61530</fpage>&#x2013;<lpage>61543</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2022.3182104</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>