# Atom Search Optimization with the Deep Transfer Learning-Driven Esophageal Cancer Classification Model

Authors: Nawaf R. Alharbe; Raafat M. Munshi; Manal M. Khayyat; Mashael M. Khayyat; Saadia Hassan Abdalaha Hamza; Abeer A. Aljohani
Journal: Computational Intelligence and Neuroscience
 (2022)

---

## Abstract

Esophageal cancer (EC) is a commonly occurring malignant tumor that significantly affects human health. Earlier recognition and classification of EC or premalignant lesions can result in highly effective targeted intervention. Accurate detection and classification of distinct stages of EC provide effective precision therapy planning and improve the 5-year survival rate. Automated recognition of EC can aid physicians in improving diagnostic performance and accuracy. However, the classification of EC is challenging due to identical endoscopic features, like mucosal erosion, hyperemia, and roughness. The recent developments of deep learning (DL) and computer-aided diagnosis (CAD) models have been useful for designing accurate EC classification models. In this aspect, this study develops an atom search optimization with a deep transfer learning-driven EC classification (ASODTL-ECC) model. The presented ASODTL-ECC model mainly examines the medical images for the existence of EC in a timely and accurate manner. To do so, the presented ASODTL-ECC model employs Gaussian filtering (GF) as a preprocessing stage to enhance image quality. In addition, the deep convolution neural network- (DCNN-) based residual network (ResNet) model is applied as a feature extraction approach. Besides, ASO with an extreme learning machine (ELM) model is utilized for identifying the presence of EC, showing the novelty of the work. The performance of the ASODTL-ECC model is assessed and compared with existing models under several medical images. The experimental results pointed out the improved performance of the ASODTL-ECC model over recent approaches.


---

## Body

## 1. Introduction

Esophageal cancer (EC) affects 3000 women and 13,480 men yearly in the US. Amongst males, it is considered the 7th leading cause of death globally. The occurrence rate was slowly increasing in males in Japan. Even though progressions were made in surgery and perioperative management policies, long-term diagnosis of esophageal cancer, specifically in advanced levels, will be lower; the five-year endurance rate of patients with phase IV EC is nearly 20% in Japan [1]. In several cases, the indication of common digestive signs associated with EC, like difficulty in swallowing and heartburn, happens in developed phases. Moreover, esophagectomy, the common medication for phase II or III EC, is a very aggressive process accompanying higher rates of postoperative complexities like anastomotic leakage, pneumonia, and recurrent nerve palsy [2]. Postoperative complexities are linked with perioperative death, along with a rise in medical expenses, longer hospitalization, and delay of postoperative therapy [3]. At the same time, tumors identified in prior levels could be diagnosed with fewer aggressive processes like an endoscopic resection. Also, prior identification is linked with enhanced patient’s diagnosis [4]. Thus, the initial identification of EC is vital.Precise staging, medication planning, and prognostication in EC patients are very important. Recently, researchers have looked at original applications like radionics by employing noninvasive imaging methodologies for improvising the patient’s path [5]. Formerly concealed data could be discovered amongst distinct imaging modalities that can imitate the pathogenesis of EC. Positron emission tomography (PET), computed tomography (CT), generally blended with CT (PET-CT), ultrasonography endoscopic (EUS), and magnetic resonance imaging (MRI) are generally utilized for follow-up and staging [6]. CT and PET are the two modalities majorly utilized for EC patients. However, its capabilities to discover minor-sized lesions were confined, which disturbs the specificity and sensitivity of disease recognition [7]. Currently, AI is especially deep learning (DL) and has resulted in the expansion of image analysis, a method used for several intentions involving the categorization of skin cancer and identification of diabetic retinopathy in fundus images, pulmonary lesions in CT images, and upper gastrointestinal cancer in the endoscopic image [8–10]. A convolutional neural network (CNN) permits computational copies made up of numerous processing layers for learning illustrations of image data and has manifold stages of abstraction [11, 12]. It may also find new kinds of paradigm over subtle common radiographic characteristics that may aid us in preventing misunderstandings in recognition of cancerous lesions and helps in reducing the workload on radiotherapists.This study develops an atom search optimization with a deep transfer learning-driven EC classification (ASODTL-ECC) model. The presented ASODTL-ECC model employs Gaussian filtering (GF) as a preprocessing stage to enhance image quality. In addition, the deep convolution neural network- (DCNN-) based residual network (ResNet) technique was executed as a feature extraction approach. Besides, ASO with an extreme learning machine (ELM) model is utilized to identify the presence of EC. The performance of the ASODTL-ECC model is assessed and compared with existing models under several medical images.The rest of the article is organized as follows: Section2 reviews the recently developed EC classification models. Section 3 offers a brief discussion of the proposed model and Section 4 provides experimental validation. At last, Section 5 concludes the study.


## 2. Prior EC Detection and Classification Models

Guo et al. [13] proposed a computer-assisted diagnosis (CAD) system for real-time automatic diagnoses of precancerous lesions and earlier esophageal squamous cell carcinomas (ESCCs) for assisting the diagnoses of esophageal lesions. The yellow color specifies a higher chance of cancerous tumor, and the blue color indicates a noncancerous lesion on the probability heatmap. Mubarak [14] conducted research on the classification of Barrett's esophagus (BE) and esophagitis with deep CNN (DCNN). CNNs with powerful feature extractors allow the optimum prognosis of Barrett's esophagus, esophagitis, and precancerous phase. The transfer learning technique using CNN extracts feature for the automatic classification of esophagitis and Barrett's esophagus.Wang et al. [15] developed various paradigms based on the Kohonen network clustering technique and the kernel extreme learning machine (KELM), which aims at classifying the tested population into five categories and offer improved performance by using machine learning technique. The Taylor formula was utilized for expanding the concept to analyze the effect of activation function on the KELM modeling effect. RBF was carefully chosen as the different activation functions of the KELM. Lastly, the adoptive mutation sparrow search approach (AMSSA) was utilized to optimize the model parameter. Chen et al. [16] presented an EC diagnosis with the DL method for improving the detection accuracy and reducing the work intensity of doctors. In this article, the Fast-RCNN EC diagnosis presents the online hard example mining (OHEM) method.Yeh et al. [17] aim to predict the existence of LVI and PNI in esophageal squamous cell carcinoma with a PET imaging dataset by training a 3DCNN. Initially, we constructed a 3DCNN dependent upon ResNet for classifying the scan into esophageal or lung cancers. Next, we gathered the PET scan of 278 patients enduring esophagectomy to predict and classify the existence of PNI or LVI. Cho et al. [18] used a CNN method, a DL technique, to categorize EC automatically and differentiate them from premalignant lesions. The presented CNN architecture comprises two subnetworks (O-stream and P-stream). The novel image was utilized as the input of the O-stream for extracting the global and color features, and the preprocessed esophageal image was utilized as the input of the P-stream for extracting the detail and texture features. Different studies have been conducted in the literature that focused on detecting EC. At the same time, the existing models do not focus on the hyperparameter selection process, which mainly influences the classification model's performance. Particularly, hyperparameters such as epoch count, batch size, and learning rate selection are essential to attain an effectual outcome. Since the trial and error method for parameter tuning is a tedious and erroneous process, metaheuristic algorithms can be applied. Therefore, in this work, we employ the ASO algorithm for the parameter selection of the ELM model.


## 3. Materials and Methods

In this study, a novel ASODTL-ECC model was established to investigate the medical images for the existence of EC in a timely and accurate manner. The presented ASODTL-ECC model encompasses various subprocesses, namely, GF-based noise elimination, ResNet101-based feature extraction, ELM classification, and ASO-based parameter tuning. The use of the ASO algorithm assists in improving the identification of the presence of EC. Figure1 depicts the block diagram of the ASODTL-ECC approach. Initially, the medical images are preprocessed to remove the noise present in it. Then, they are fed into the ResNet101 model to generate feature vectors. Finally, the ASO with ELM model is utilized for the EC classification process.Figure 1
Block diagram of the ASODTL-ECC technique.


### 3.1. Image Preprocessing

At the primary level, the presented ASODTL-ECC model exploited the GF technique as a preprocessing stage to enhance the image quality. GF approach minimizes pixels’ variations through weight average for image smoothing from several applications. But, this low pass filter does not conserve particulars of the image, i.e., textures and edges. The linear translation variant functionsf and next explains the aforementioned filter procedure as follows [19]:(1)fp=∑qKp,qQPq,where Kp,q indicates every pixel q centered at pixel p from the filtering kernel K, and Q and P are input and guidance images, correspondingly. For instance, the kernel of the bilateral filter (BF) defined by (1) was expressed:(2)Kp,qQ=1nexp−p−q2σs2exp−Pp−Qq2σr2,where n refers the normalized factor and σs and σr denote the window size of neighborhood expansions and the alteration of edge amplitude intensities, respectively. The exponential distribution function was usually utilized in (2) for calculating the effect of distinct spatial distances by exp−p−q2/σr2 and exp−Pp−Qq2/σr2 defining the contribution of pixel intensity ranges. If Q and P are equal, (2) is shortened as a single image smoothing procedure.


### 3.2. Deep Transfer Learning Model

Once the medical image is preprocessed, the next phase is developing a useful feature vector set utilizing ResNet 101. A CNN [20] is generally comprised of alternative max‐pooling and convolutional layers (represented as P and C layers) for hierarchically extracting features from the original input, followed by a fully connected (FC) layer to perform classification. Considering a CNN with L layers, we represented the output state of l-th layer as Hl, whereas l∈1,…,L, with H0 representing the input dataset. There are two parts of the training parameter in all the layers that are weight matrix Wl which connect the l-th layers and the preceding layers using Hl−1, and the bias vector refers to bl. The input dataset is generally interconnected with C layer. For C layer, a 2D convolutional function is implemented initially with convolution kernel Wl. Next, the bias bl is included in the resulting feature map where a pointwise nonlinear activation function g∙ is widely implemented. At last, a max‐pooling layer is generally followed to choose the dominant feature over the nonoverlapping square window for all the feature maps.(3)Hl=poolgHl−1∗Wl+bl.In (3), the convolution operation is denoted by the symbol ∗ and pool indicates the max‐pooling function. C and P layers are stacked one after another to form the feature extraction hierarchically. Next, the resulting feature is integrated with a 1D feature vector with the FC layer. Initially, the FC layer processes the input using nonlinear conversion using weight Wl and bias bl as follows:(4)Hl=gHl−1∗Wl+bl.Many nonlinear activation functions were introduced. Now, we selected the sigmoid activation for its higher efficiency and capability:(5)gx=1+exp−x−1.The final classification layer is generally a SoftMax layer, with neuron count equalizing the class count to be categorized. Then, utilize an LR layer with a single neuron to perform dual classification, i.e., analogous to the FC layer. The weightW1,⋯,WL and the bias b1,⋯,bL compose the model parameter that is jointly and iteratively augmented by maximizing the classification performance over the training set. Figure 2 illustrates the structure of residual learning.Figure 2
Structure of residual learning.ResNet101 is a CNN that comprises fifty layers; it can be deeper than VGG-16. Because a global average pool was utilized rather than an FC layer, the model size was significantly smaller and decreases the ResNet101 size by 102 MB [21]. The ResNet is a distinctive part of residual block learning which implies that all the layers must feed into the following layer around 2-3 hops away. The substructure is comprised of the following:(i)
The convolutional layer has KS (KS) of 7 × 7 and 64 filters. It is followed by a max pooling layer with a stride size of 2.(ii)
Next, a convolution layer has KS of 1∗1 and 64 filters; after that, the next convolution layers have a KS of 3∗3 and 64 filters. Later, we have other convolution layers with a KS of 1∗1 and 256 filters. These three layers are replicated 3 times and 9 layers are attained during this phase.(iii)
Then, three convolution layers are as follows: the initial one with a KS of 1∗1 and 128 filters, the next one with a KS of 3∗3and 128 filters, and the last one with a KS of 1∗1 and 512 filters. This layer is replicated 4 times to provide 12 layers during this phase.(iv)
Later, we have a convolution layer with KSs of 1∗1 and 256 filters, with KSs of 3∗3 and 2 56 filters, with a KS of 1 ∗ 1 and 1024 filters. It can be replicated 6 times to provide a total of 18 layers.(v)
After that, we have a convolution layer with KS of 1∗1 and512 filters, with a KS of 1 ∗ 1 and 512 filters, with a kernel of 3 ∗ 3 and 2048 filters. It can be replicated 3 times to provide a total of 9 layers.(vi)
Lastly, an average pooling can be used and FC layer is used to complete them (1000 nodes) and a SoftMax function to provide 1 layer as the last phase.


### 3.3. EC Classification Model

In this study, the feature vectors are passed into the ELM model to identify EC [22]. ELM is an alternate name for one or more hidden layer feedforward neural networks (FFNN). ELM is utilized for solving feature engineering, classification, clustering, and regression problems. This learning approach includes the output layer, input layer, and one or multiple hidden layers. In the conventional neural network, the task of fine-tuning the hidden and input layers is time‐consuming and computationally expensive since it needs numerous rounds to converge. The performance of ELM is similar to SVM or other ML classifier models. ELM has a greater capacity for better performing in very sophisticated datasets. N input instance zi,yi are presented, in which zi=xi1,xi2,⋯⋯,xinT indicates the i-th samples with n discrete features and yi=yi1,yi2,⋯⋯,yimT defines the original label of xi with conventional SLFN using K hidden neurons that are determined:(6)∑m=1Kβihwm.xi+cm=αi,i=1,⋯⋯⋯,N.In (6), βi=βi1,βi2,⋯⋯,βimT illustrates the weight vector with the connection of i-th hidden layers and the output node, wm=wm1,wm2,⋯⋯,wmnT refers to the selected weight vector and represents i-th hidden layers with the input node, and cm denotes the threshold of i-th hidden layers. αk=αk1,αk2,⋯⋯,αkmT refers to the k-th output neurons. h stands for the activation function and SLFN is applied to M hidden neuron and activation function approaches N trainable instance with zero errors. Many other technologies were used to classify and detect intrusions of wireless and wired environments. Figure 3 depicts the framework of ELM.Figure 3
Framework of the ELM method.


### 3.4. Parameter Optimization

The ASO algorithm has been utilized to improve the EC classification performance of the ASODTL-ECC model [23]. The presented ASO algorithm is based on molecular dynamics. In the searching space, the position of each atom defines its calculation and the clarification based on mass and provides a better solution. ASO continues the streamlining procedure by making a considerable amount of arrangements randomly. For each loop, the particle changes its locations and speeds, along with the location of the best atom. Moreover, particle acceleration can be classified into two segments. The initial one is the collaboration force that can be determined as an L‐j potential is generally the fascination from various particles and vector sum of aversion. It is confronted with the potential of particle and bond length in addition to the finest particle is weighted position difference because of the required energy. The computation satisfies the broken model, and it is logically implemented. The best atom fitness and location are reverted, and the global optimal is predictable. The fitness function is utilized for determining the maximum benefit parameter as per the objective function. The fitness function can be described in the following expression:(7)MaT=e−FitaT−FitaTFitworstaT.In order to evaluate the simple level of the fitness function, the mass of an atom is calculated by(8)maT=MaTΣn=1NMbT.In (8), FitbestaT stands for the minimal fitness values and FitworstaT is defined by the maximal fitness value in t-th iterations. FitaT is referred to as the fitness function of t-th iteration of i-th atoms. The C neighbor is evaluated according to the following expression, in which a,b terms are represented as atoms.(9)CT=N−N−2×Tt.In the detection method of the ASA approach, all the atoms need a considerable amount of atoms with the fitness parameter of thek neighbor. Atom was predictable to relate through as specific atom with fitness parameter since C neighbor boosts exploitation in the last phase of iterations. Equation (9) is utilized for calculating the C neighbors: T stands for maximal iterations, N for size of population, and t for dimension in time. The property of acceleration and atomic contact force is computed, and various mechanisms of weight employed to the i-th atoms from the atom of force are formulated:(10)FaDT=∑bebestnrandombfabDT.In (10), random refers to a random integer within 0,1; f represents fitness function. The acceleration is computed by the following expression:(11)GaDT=αTXbestDT−XaDT.The Lagrangian multiplier is determined by(12)αT=βe−20T/t.In (12), β is determined by the multiplier weight. In the updating procedure, the velocity and position of i-th atom at the condition of t+1th iterations are represented as follows:(13)VaDt+1=randaDVaDT+AaDtXaDt+1=XaDt+VaDt+1.The best approach for minimizing power quality problems and accomplishing the exercise function is carefully chosen after the upgrading procedure. The last condition needs to be verified beforehand by utilizing the optimum solution, where the maximal iteration is attained and constraint is calculated. The pseudocode of ASO is provided in Algorithm 1.Algorithm 1: Pseudocode of ASO algorithm.
BeginInitialize population in searching areaWhile termination condition is unsatisfied doDetermine fitness of every atom;Determine atom mass;Compute Kbest neighbor;Determine interaction and constrain forcesCompute acceleration;Upgrade velocity;Upgrade position.End whileEndThe ASO system extracts a fitness function for achieving enhanced classification act. It fixes a positive integer for representing the superior outcomes of the candidate solutions. In this article, the reduction of the classification fault rate is assumed as the fitness function, as provided in the following equation:(14)fitnessxi=ClassifierErrorRatexinumberofmisclassifiedsamplesTotalnumberofsamples∗100.


## 3.1. Image Preprocessing

At the primary level, the presented ASODTL-ECC model exploited the GF technique as a preprocessing stage to enhance the image quality. GF approach minimizes pixels’ variations through weight average for image smoothing from several applications. But, this low pass filter does not conserve particulars of the image, i.e., textures and edges. The linear translation variant functionsf and next explains the aforementioned filter procedure as follows [19]:(1)fp=∑qKp,qQPq,where Kp,q indicates every pixel q centered at pixel p from the filtering kernel K, and Q and P are input and guidance images, correspondingly. For instance, the kernel of the bilateral filter (BF) defined by (1) was expressed:(2)Kp,qQ=1nexp−p−q2σs2exp−Pp−Qq2σr2,where n refers the normalized factor and σs and σr denote the window size of neighborhood expansions and the alteration of edge amplitude intensities, respectively. The exponential distribution function was usually utilized in (2) for calculating the effect of distinct spatial distances by exp−p−q2/σr2 and exp−Pp−Qq2/σr2 defining the contribution of pixel intensity ranges. If Q and P are equal, (2) is shortened as a single image smoothing procedure.


## 3.2. Deep Transfer Learning Model

Once the medical image is preprocessed, the next phase is developing a useful feature vector set utilizing ResNet 101. A CNN [20] is generally comprised of alternative max‐pooling and convolutional layers (represented as P and C layers) for hierarchically extracting features from the original input, followed by a fully connected (FC) layer to perform classification. Considering a CNN with L layers, we represented the output state of l-th layer as Hl, whereas l∈1,…,L, with H0 representing the input dataset. There are two parts of the training parameter in all the layers that are weight matrix Wl which connect the l-th layers and the preceding layers using Hl−1, and the bias vector refers to bl. The input dataset is generally interconnected with C layer. For C layer, a 2D convolutional function is implemented initially with convolution kernel Wl. Next, the bias bl is included in the resulting feature map where a pointwise nonlinear activation function g∙ is widely implemented. At last, a max‐pooling layer is generally followed to choose the dominant feature over the nonoverlapping square window for all the feature maps.(3)Hl=poolgHl−1∗Wl+bl.In (3), the convolution operation is denoted by the symbol ∗ and pool indicates the max‐pooling function. C and P layers are stacked one after another to form the feature extraction hierarchically. Next, the resulting feature is integrated with a 1D feature vector with the FC layer. Initially, the FC layer processes the input using nonlinear conversion using weight Wl and bias bl as follows:(4)Hl=gHl−1∗Wl+bl.Many nonlinear activation functions were introduced. Now, we selected the sigmoid activation for its higher efficiency and capability:(5)gx=1+exp−x−1.The final classification layer is generally a SoftMax layer, with neuron count equalizing the class count to be categorized. Then, utilize an LR layer with a single neuron to perform dual classification, i.e., analogous to the FC layer. The weightW1,⋯,WL and the bias b1,⋯,bL compose the model parameter that is jointly and iteratively augmented by maximizing the classification performance over the training set. Figure 2 illustrates the structure of residual learning.Figure 2
Structure of residual learning.ResNet101 is a CNN that comprises fifty layers; it can be deeper than VGG-16. Because a global average pool was utilized rather than an FC layer, the model size was significantly smaller and decreases the ResNet101 size by 102 MB [21]. The ResNet is a distinctive part of residual block learning which implies that all the layers must feed into the following layer around 2-3 hops away. The substructure is comprised of the following:(i)
The convolutional layer has KS (KS) of 7 × 7 and 64 filters. It is followed by a max pooling layer with a stride size of 2.(ii)
Next, a convolution layer has KS of 1∗1 and 64 filters; after that, the next convolution layers have a KS of 3∗3 and 64 filters. Later, we have other convolution layers with a KS of 1∗1 and 256 filters. These three layers are replicated 3 times and 9 layers are attained during this phase.(iii)
Then, three convolution layers are as follows: the initial one with a KS of 1∗1 and 128 filters, the next one with a KS of 3∗3and 128 filters, and the last one with a KS of 1∗1 and 512 filters. This layer is replicated 4 times to provide 12 layers during this phase.(iv)
Later, we have a convolution layer with KSs of 1∗1 and 256 filters, with KSs of 3∗3 and 2 56 filters, with a KS of 1 ∗ 1 and 1024 filters. It can be replicated 6 times to provide a total of 18 layers.(v)
After that, we have a convolution layer with KS of 1∗1 and512 filters, with a KS of 1 ∗ 1 and 512 filters, with a kernel of 3 ∗ 3 and 2048 filters. It can be replicated 3 times to provide a total of 9 layers.(vi)
Lastly, an average pooling can be used and FC layer is used to complete them (1000 nodes) and a SoftMax function to provide 1 layer as the last phase.


## 3.3. EC Classification Model

In this study, the feature vectors are passed into the ELM model to identify EC [22]. ELM is an alternate name for one or more hidden layer feedforward neural networks (FFNN). ELM is utilized for solving feature engineering, classification, clustering, and regression problems. This learning approach includes the output layer, input layer, and one or multiple hidden layers. In the conventional neural network, the task of fine-tuning the hidden and input layers is time‐consuming and computationally expensive since it needs numerous rounds to converge. The performance of ELM is similar to SVM or other ML classifier models. ELM has a greater capacity for better performing in very sophisticated datasets. N input instance zi,yi are presented, in which zi=xi1,xi2,⋯⋯,xinT indicates the i-th samples with n discrete features and yi=yi1,yi2,⋯⋯,yimT defines the original label of xi with conventional SLFN using K hidden neurons that are determined:(6)∑m=1Kβihwm.xi+cm=αi,i=1,⋯⋯⋯,N.In (6), βi=βi1,βi2,⋯⋯,βimT illustrates the weight vector with the connection of i-th hidden layers and the output node, wm=wm1,wm2,⋯⋯,wmnT refers to the selected weight vector and represents i-th hidden layers with the input node, and cm denotes the threshold of i-th hidden layers. αk=αk1,αk2,⋯⋯,αkmT refers to the k-th output neurons. h stands for the activation function and SLFN is applied to M hidden neuron and activation function approaches N trainable instance with zero errors. Many other technologies were used to classify and detect intrusions of wireless and wired environments. Figure 3 depicts the framework of ELM.Figure 3
Framework of the ELM method.


## 3.4. Parameter Optimization

The ASO algorithm has been utilized to improve the EC classification performance of the ASODTL-ECC model [23]. The presented ASO algorithm is based on molecular dynamics. In the searching space, the position of each atom defines its calculation and the clarification based on mass and provides a better solution. ASO continues the streamlining procedure by making a considerable amount of arrangements randomly. For each loop, the particle changes its locations and speeds, along with the location of the best atom. Moreover, particle acceleration can be classified into two segments. The initial one is the collaboration force that can be determined as an L‐j potential is generally the fascination from various particles and vector sum of aversion. It is confronted with the potential of particle and bond length in addition to the finest particle is weighted position difference because of the required energy. The computation satisfies the broken model, and it is logically implemented. The best atom fitness and location are reverted, and the global optimal is predictable. The fitness function is utilized for determining the maximum benefit parameter as per the objective function. The fitness function can be described in the following expression:(7)MaT=e−FitaT−FitaTFitworstaT.In order to evaluate the simple level of the fitness function, the mass of an atom is calculated by(8)maT=MaTΣn=1NMbT.In (8), FitbestaT stands for the minimal fitness values and FitworstaT is defined by the maximal fitness value in t-th iterations. FitaT is referred to as the fitness function of t-th iteration of i-th atoms. The C neighbor is evaluated according to the following expression, in which a,b terms are represented as atoms.(9)CT=N−N−2×Tt.In the detection method of the ASA approach, all the atoms need a considerable amount of atoms with the fitness parameter of thek neighbor. Atom was predictable to relate through as specific atom with fitness parameter since C neighbor boosts exploitation in the last phase of iterations. Equation (9) is utilized for calculating the C neighbors: T stands for maximal iterations, N for size of population, and t for dimension in time. The property of acceleration and atomic contact force is computed, and various mechanisms of weight employed to the i-th atoms from the atom of force are formulated:(10)FaDT=∑bebestnrandombfabDT.In (10), random refers to a random integer within 0,1; f represents fitness function. The acceleration is computed by the following expression:(11)GaDT=αTXbestDT−XaDT.The Lagrangian multiplier is determined by(12)αT=βe−20T/t.In (12), β is determined by the multiplier weight. In the updating procedure, the velocity and position of i-th atom at the condition of t+1th iterations are represented as follows:(13)VaDt+1=randaDVaDT+AaDtXaDt+1=XaDt+VaDt+1.The best approach for minimizing power quality problems and accomplishing the exercise function is carefully chosen after the upgrading procedure. The last condition needs to be verified beforehand by utilizing the optimum solution, where the maximal iteration is attained and constraint is calculated. The pseudocode of ASO is provided in Algorithm 1.Algorithm 1: Pseudocode of ASO algorithm.
BeginInitialize population in searching areaWhile termination condition is unsatisfied doDetermine fitness of every atom;Determine atom mass;Compute Kbest neighbor;Determine interaction and constrain forcesCompute acceleration;Upgrade velocity;Upgrade position.End whileEndThe ASO system extracts a fitness function for achieving enhanced classification act. It fixes a positive integer for representing the superior outcomes of the candidate solutions. In this article, the reduction of the classification fault rate is assumed as the fitness function, as provided in the following equation:(14)fitnessxi=ClassifierErrorRatexinumberofmisclassifiedsamplesTotalnumberofsamples∗100.


## 4. Results and Discussion

The experimental validation of the ASODTL-ECC model is tested using a set of images, as given in Table1. The results are inspected under three subdatasets, namely, entire dataset, 70% of training (TR) data, and 30% of testing (TS) data. Figure 4 showcases the sample images.Table 1
Dataset details.
LabelClass nameNo. of imagesClass 0Normal250Class 1Esophagitis250Class 2Esophagus cancer250Total number of images750Figure 4
Sample images.Figure5 displays the confusion matrices created by the ASODTL-ECC model on the applied dataset. With the entire dataset, the ASODTL-ECC model has identified 249, 238, and 248 samples under classes 0, 1, and 2, respectively. Meanwhile, with 70% of the TR dataset, the ASODTL-ECC approach has identified 163, 174, and 174 samples under classes 0, 1, and 2, respectively. Eventually, with 30% of the TS dataset, the ASODTL-ECC algorithm has identified 86, 64, and 74 samples under classes 0, 1, and 2, respectively.Figure 5
Confusion matrices of the ASODTL-ECC technique: (a) entire dataset, (b) 70% of TD data, and (c) 30% of TS data.
(a)(b)(c)Table2 illustrates a detailed EC classification result of the ASODTL-ECC model on distinct sizes of data. Figure 6 portrays a comprehensive EC classification performance of the ASODTL-ECC model on the entire data. The figure indicated that the ASODTL-ECC model has recognized all class labels. For instance, the ASODTL-ECC model has recognized class 0 samples with accuy, sensy, specy, Fscore, MCC, and Jindex of 99.93%, 99.60%, 99.20%, 99.01%, 98.51%, and 98.03% respectively. Along with that, the ASODTL-ECC system has recognized class 1 samples with accuy, sensy, specy, Fscore, MCC, and Jindex of 98.27%, 95.20%, 99.80%, 97.34%, 96.11%, and 94.82%, respectively. Therefore, the ASODTL-ECC algorithm has recognized class 2 samples with accuy, sensy, specy, Fscore, MCC, and Jindex of 98.40%, 99.20%, 98%, 97.64%, 96.46%, and 95.38%, respectively.Table 2
Result analysis of the ASODTL-ECC technique with various measures.
LabelAccuracySensitivitySpecificityF-scoreMCCJaccard indexEntire datasetClass 099.3399.6099.2099.0198.5198.03Class 198.2795.2099.8097.3496.1194.82Class 298.4099.2098.0097.6496.4695.38Average98.6798.0099.0098.0097.0296.08Training phase (70%)Class 099.0599.3998.8998.4997.8097.02Class 197.7194.0599.7196.6795.0193.55Class 297.9098.8697.4296.9495.3994.05Average98.2297.4498.6797.3696.0794.88Testing phase (30%)Class 0100.00100.00100.00100.00100.00100.00Class 199.5698.46100.0099.2298.9298.46Class 299.56100.0099.3499.3399.0098.67Average99.7099.4999.7899.5299.3199.04Figure 6
Result analysis of the ASODTL-ECC technique under entire dataset.Figure7 demonstrates a comprehensive EC classification performance of the ASODTL-ECC technique on 70% of TR data. The figure exposed that the ASODTL-ECC approach has recognized all class labels. For instance, the ASODTL-ECC technique has recognized class 0 samples with accuy, sensy, specy, Fscore, MCC, and Jindex of 99.05%, 99.39%, 98.89%, 98.49%, 97.80%, and 97.02%, respectively. Besides, the ASODTL-ECC model has recognized class 1 samples with accuy, sensy, specy, Fscore, MCC, and Jindex of 97.71%, 94.05%, 99.71%, 96.67%, 95.01%, and 93.55%, respectively. Likewise, the ASODTL-ECC approach has recognized class 2 samples with accuy, sensy, specy, Fscore, MCC, and Jindex of 97.90%, 98.86%, 97.42%, 96.94%, 94.39%, and 94.05%, respectively.Figure 7
Result analysis of the ASODTL-ECC technique under 70% of TR data.Figure8 illustrates a comprehensive EC classification performance of the ASODTL-ECC approach on 30% of TS data. The figure represented that the ASODTL-ECC technique has recognized all class labels. For instance, the ASODTL-ECC model has recognized class 0 samples with accuy, sensy, specy, Fscore, MCC, and Jindex of 100%, 100%, 100%, 100%, 100%, and 100%, respectively. Then, the ASODTL-ECC algorithm has recognized class 1 samples with accuy, sensy, specy, Fscore, MCC, and Jindex of 99.56%, 98.46%, 100%, 99.22%, 98.92%, and 98.46%, respectively. Eventually, the ASODTL-ECC methodology has recognized class 2 samples with accuy, sensy, specy, Fscore, MCC, and Jindex of 99.56%, 100%, 99.34%, 99.33%, 99%, and 98.67%, respectively.Figure 8
Result analysis of the ASODTL-ECC technique under 30% of TS dataset.The training accuracy (TA) and validation accuracy (VA) attained by the ICSOA-DLPEC methodology on the test dataset are demonstrated in Figure9. The experimental outcome implied that the ICSOA-DLPEC technique has gained maximal values of TA and VA. Specifically, the VA seemed to be higher than TA.Figure 9
TA and VA analysis of the ASODTL-ECC technique.The training loss (TL) and validation loss (VL) achieved by the ICSOA-DLPEC system on the test dataset are established in Figure10. The experimental outcome inferred that the ICSOA-DLPEC approach had achieved the least values of TL and VL. Specifically, the VL seemed to be lower than TL.Figure 10
TL and VL analysis of the ASODTL-ECC technique.A brief precision-recall examination of the ASODTL-ECC approach on the test dataset is represented in Figure11. By observing the figure, it can be noticed that the ASODTL-ECC model has accomplished maximal precision-recall performance under all classes.Figure 11
Precision-recall curve analysis of the ASODTL-ECC technique.A detailed ROC investigation of the ASODTL-ECC methodology on the test dataset is depicted in Figure12. The outcomes indicated that the ASODTL-ECC model has displayed its ability to categorize three different classes 0–2 on the test dataset.Figure 12
ROC curve analysis of the ASODTL-ECC technique.The comparative investigation of the results offered by the ASODTL-ECC model is provided in Table3 [24, 25]. Figure 13 offers a clear comparison analysis of the ASODTL-ECC model with recent techniques with respect to sensy, specy, and Fscore. The figure outperformed that the EfficientNet-B0, RegNetY-400 MF, DenseNet201, and GoogLeNet algorithms have exhibited lesser values of sensy, specy, and Fscore. Besides, VGG-16 and ResNet18 algorithms have displayed moderately closer values of sensy, specy, and Fscore. Eventually, the ResNet50 model has accomplished reasonably sensy, specy, and Fscore of 97.06% 93.62%, and 94.77%, respectively, the ASODTL-ECC methodology has obtained maximal sensy, specy, and Fscore of 99.49%, 99.78%, and 99.52%, respectively.Table 3
Comparative analysis of the ASODTL-ECC technique with existing algorithms.
MethodsSensitivitySpecificityAccuracyF-scoreVGG-1696.4098.0694.4290.35ResNet1896.3195.7892.7391.03ResNet5097.0693.6294.7796.20EfficientNet-B092.1497.7595.5896.39RegNetY-400 MF92.1590.9192.8395.49DenseNet20192.6892.4392.9796.18GoogLeNet92.0991.7791.8993.88ASODTL-ECC99.4999.7899.799.52Figure 13
Comparative analysis of the ASODTL-ECC technique with recent algorithms.Figure14 provides a clear comparison study of the ASODTL-ECC model with recent models in terms of accuy. The figure indicated that the EfficientNet-B0, RegNetY-400 MF, DenseNet201, and GoogLeNet models have shown lower values of accuy. At the same time, VGG-16 and ResNet18 models have demonstrated moderately closer values of accuy. Though the ResNet50 model has accomplished reasonable accuy of 97.06%, the ASODTL-ECC model has obtained a maximum accuy of 99.49%.Figure 14
Accuy analysis of the ASODTL-ECC technique with recent algorithms.From the detailed results and discussion, it is apparent that the ASODTL-ECC model has accomplished effectual outcomes on EC classification.


## 5. Conclusion

In this study, a novel ASODTL-ECC model has been developed to investigate the medical images for the existence of EC in a timely and accurate manner. The presented ASODTL-ECC model encompasses various subprocesses, namely, GF-based noise elimination, ResNet-based feature extraction, ELM classification, and ASO-based parameter tuning. The use of the ASO algorithm assists in improving the identification of the presence of EC. The performance of the ASODTL-ECC model is assessed and compared with existing models under several medical images. The experimental results pointed out the improved performance of the ASODTL-ECC model over recent approaches. Thus, the ASODTL-ECC model can be exploited for effectual EC detection and classification process. In the future, an ensemble of DTL models can be applied to improve the detection efficiency of the ASODTL-ECC model. In addition, the computational complexity of the proposed model can be studied in our future work.



---

*Source: 4629178-2022-09-16.xml*