# Lung Cancer Diagnosis Based on an ANN Optimized by Improved TEO Algorithm

Authors: Rong Shan; Tahereh Rezaei
Journal: Computational Intelligence and Neuroscience
 (2021)

---

## Abstract

A quarter of all cancer deaths are due to lung cancer. Studies show that early diagnosis and treatment of this disease are the most effective way to increase patient life expectancy. In this paper, automatic and optimized computer-aided detection is proposed for lung cancer. The method first applies a preprocessing step for normalizing and denoising the input images. Afterward, Kapur entropy maximization is performed along with mathematical morphology to lung area segmentation. Afterward, 19 GLCM features are extracted from the segmented images for the final evaluations. The higher priority images are then selected for decreasing the system complexity. The feature selection is based on a new optimization design, called Improved Thermal Exchange Optimization (ITEO), which is designed to improve the accuracy and convergence abilities. The images are finally classified into healthy or cancerous cases based on an optimized artificial neural network by ITEO. Simulation is compared with some well-known approaches and the results showed the superiority of the suggested method. The results showed that the proposed method with 92.27% accuracy provides the highest value among the compared methods.


---

## Body

## 1. Introduction

The proliferation of lung diseases in today’s industrialized societies doubles the need for modern methods of accurate and early diagnosis. Among lung diseases, lung cancer is still recognized as one of the most dangerous cancers. Cancer means the abnormal growth, and sometimes proliferation of cells in the body. All cancers have an uncontrolled growth pattern and a tendency to detach from the source and metastasize [1]. A normal lung cell may become a lung cancer cell for no apparent reason, but in most cases, the transformation is the result of repeated exposure to carcinogens such as alcohol and tobacco. The appearance and function of cancer cells are different from normal cells. A mutation or change in the DNA or genetic material of a cell occurs [2]. DNA is responsible for controlling the appearance and function of cells. When a cell’s DNA changes, that cell differentiates from the healthy cells next to it and no longer does the body’s normal cells. This altered cell separates from its neighboring cells and does not know when it should stop growing and die [3]. In other words, the altered cell does not follow the internal commands and signals that other cells are in control of and acts arbitrarily instead of coordinating with other cells [4]. One-third of all cancer deaths are due to lung cancer. About 80% of patients have five years left in their best condition after being diagnosed with this type of cancer [5]. Based on a survey by the American Cancer Society (ACS), lung cancer in both men and women is the second most prevalent cancer in the United States [6]. Approximately 228,820 new cases and approximately 135,720 lung cancer deaths, based on ACS figures, will occur [5]. Figure 1 shows the statistical information for the lead cancers and their death number in 2019 based on the American Cancer Society of lung cancer screening [7].Figure 1
The heat transfer groups and the environment and cooling objects pairs.Air pollution due to the industrialization of cities, tobacco use, and genetic factors are the main causes of these diseases [8]. Early diagnosis of lung disease will have a major impact on the possibility of definitive treatment of the disease. Major diagnostic methods for lung cancer include radiographic imaging and computed tomography, biopsy, bronchoscopy, and examination of cells in the sputum. Meanwhile, the CT scan imaging method is widely used as a superior diagnostic method. In this diagnostic method, the doctor examines possible nodules on the images. A pulmonary nodule is a small, round, opaque mass that forms inside the lung tissue [9, 10]. In other words, nodules are spherical radiographic opacities of less than three centimeters in diameter.Formerly, lung diseases were diagnosed based on the help of experts’ eye ability with no use for computer science. However, recently based on the different imaging techniques based on computer science and artificial intelligence, the diagnosis can be more precise. In most of these methods, after capturing the images from the patient, different image processing methods have been performed for tumor diagnosis [11].


## 2. Image Preprocessing

The analyzed images for validation in this study are collected from theLung CT-Diagnosis database which has been provided by the Cancer Imaging Archive [12]. This database contains a collection of publicly available medical images for different cancers [13] with contrast-enhanced CT scan images stored in the Dicom format. This database is collected from 61 patients such that 4682 different images have been acquired from them.After image acquisition, the min-max normalization method is established for them to scale the acquired images between 0 and 1. This study uses 250 × 250 scale normalization for this purpose. By considering a grayscale image withn dimension which has the following limitation: In=X⊆Rn⟶a,…,b, the normalized image, I∗, can be achieved by the following formulation:(1)I∗=anew+bnew−anewb−a×I−a,where I∗=X⊆Rn⟶anew,…,bnew, a and b describe the intensity values in the grayscale image, and anew and bnew describe the intensity values for the normalized image [14].Also, since the reason that all CT scan images have a kind of visual noise, they need a denoising filter to resolve the problem. A CT scan image faces different factors and includes different types, such as Gaussian noise, Shot Noise, Poisson Noise, Speckle Noise, and Salt and Pepper Noise [15]. Noise hides slight details of the CT scan image. This shows that we need a tool for noise removal before starting the CT scan images.One of the popular noise reduction techniques for CT scan images is mean filtering. The definition of the mean (average) filter works on averaging any aspect of the picture to the neighbors [16]. The average filter calculates and divides the sum of all the pixels in the filter window by the total number of pixels [4]. It then replaces the value of the center pixel with the calculated average. The result value for each indexed pixel i,j is determined as follows:(2)Ri,j=Ii−1,j−1+Ii−1,j+Ii−1,j+1+Ii,j−1+Ii,j+Ii,j+1+Ii+1,j−1+Ii+1,j+Ii+1,j+19.


## 3. Image Segmentation

One of the most important issues in image processing is the identification and separation of the image into its main components. Image segmentation determines the success or eventual failure of image analysis methods. And yet, due to its wide application, it has suitable research fields. The accuracy of this study in fields such as medicine is very important to preserve and protect human life. Thresholding is one of the most convenient methods for image segmentation [17]. By applying a thresholding method to a grayscale image, a binary image is obtained that delineates the boundaries of the objects in the image with appropriate accuracy.The lower the threshold is, the more errors are detected and the more sensitive the results are to noise and unrelated image features [18]. On the other hand, a high threshold may miss weak errors or parts of errors. Since the main purpose of the fabric fault detection system is to find all possible faults, the threshold must be chosen to achieve this goal [19]. There are several methods for this practice in image processing science, and some separation methods are used for specific images [20]. One way to select the appropriate threshold is to use the trial-and-error method, in which different values of the threshold are selected and the image resulting from the application of this threshold is judged by the viewer. The simplest type of separation is called general separation, which is based on the image histogram. The input of this function is a gray image or a color image [21]. Its output is also a black and white image (binary). In this method, the threshold value at any point in the image is defined based on the local properties of the image in the neighborhood of that pixel. In this paper, Kapur thresholding has been used. Assume that the gray levels in an image with N pixels and L gray levels are in the range 0,1,…,L−1. Kapur method obtains the thresholds based on Kapur entropy maximization and based on the information obtained from the histogram of gray surfaces, which is defined as follows in the case of two-level segmentation (thresholding):(3)Maximizef1t=H0,t+Ht,L,such that(4)H0,t=−∑i=0t−1piwolnpiwo,wo=∑i=0t−1pi,Ht,L=−∑i=0t−1piwilnpiwi,wi=∑i=0t−1pi.The value of the optimal threshold point is the amount of gray areat that maximizes the function. For correct diagnosis of the tumors, the cancerous region should be detected with high precision. As mentioned before, image thresholding has been used for identifying the cancerous region. However, mathematical morphology is needed to better filter the detected areas based on image thresholding [22]. Mathematical morphology algorithm is a new technique for processing and analyzing signals and images. The basic idea of this technique is based on the analysis of geometric information by exploring an image with a small geometric pattern called a structuring element. This study uses three popular techniques including opening, closing, and filling holes. The first operator in the region filling is based on complementation, intersections, and dilation operators and is achieved by the following equation:(5)Xk=Xk−1⊕B∩Ac,k=1,2,3,…,where A indicates a group of boundaries and B defines the organizing element. This operator will end if Xk=Xk−1.The mathematical opening is the second utilized operator. The opening of elementA with element B has been obtained with A erosion by structure element B, followed by a dilation of the resulted image by structure element B, that is,(6)A∘B=A⊖B⊕B.The key goal of the mathematical opening is to remove the minor blemishes in the area that can be missed during the diagnosis of lung cancer.Finally, the mathematical closing operator is used to smooth the counters, fuses narrow breaks, eliminates small holes, and fills gaps in the contour and long thin gulfs. This operation is formulated as follows:(7)A·B=A⊕B⊖B.


## 4. Features Extraction

The purpose of feature extraction is to make raw data more usable for future statistical processing. Feature extraction is a very common process in different types of data processing such as image processing and audio processing. Feature extraction means selecting a feature that can describe the image with little information. These features must have properties so that a set of these features is described uniquely in each image. If a set of these attributes are the same for two samples, then you will not be able to distinguish two samples with any classifier in the classification section.The main reasons for extracting features from images are image simplification, reduced processing time and memory, and increased accuracy and efficiency. So, feature extraction is a process in which data is mapped in a high-dimension space to a lower dimension space. This mapping can be linear (such as principal component analysis) or nonlinear. How to select these features requires data properties to be examined, and to extract it, preprocessing operations and various filters must be applied to the image to turn the image into the desired information. In this study, GLCM features have been used for extracting the lung cancer images information.The GLCM method is one of the most efficient techniques for extracting tissue from medical images. This matrix is a square matrix with dimensionsN×N where N is the number of degrees of gray in the image. Each element of this matrix represents the number of pairs of pixels that have degrees of gray on the surface of the image and are spaced in a certain direction from each other and to a certain pixel distance. After calculating the matrix, different parameters of the image texture can be extracted from it. In this study, the mentioned technique was used to extract tissue in lung tumor images. In the following, the utilized features have been explained.


### 4.1. Contrast

The contrast regulates the intensity value of the pixel and its neighbor in the image. This feature is achieved by the following equation:(8)Contrast=∑i=0m−1∑j=0n−1i−j2fi,j.


### 4.2. Correlation

The correlation feature describes the dependency on spatial features among the pixels. This feature can be mathematically given as follows:(9)Cor=∑i=0m−1∑j=0n−1i,jfi,j−μiμjσiσj.


### 4.3. Homogeneity

Homogeneity is a local uniformity feature that makes single/multiple intervals govern the textured and nontextured characteristics. This feature is achieved by the following:(10)H=∑i=0m−1∑j=0n−111+i−j2fi,j.


### 4.4. Energy

The energy feature regulates the number of repetitive pixel pairs. This feature is mathematically obtained by the following equation:(11)Energy=∑i=0m−1∑j=0n−1f2i,j.


### 4.5. Entropy

The entropy is a feature that indicates the image selected interference based on the following equation:(12)Ent=−∑i=0m−1∑j=0n−1log2fi,j.


## 4.1. Contrast

The contrast regulates the intensity value of the pixel and its neighbor in the image. This feature is achieved by the following equation:(8)Contrast=∑i=0m−1∑j=0n−1i−j2fi,j.


## 4.2. Correlation

The correlation feature describes the dependency on spatial features among the pixels. This feature can be mathematically given as follows:(9)Cor=∑i=0m−1∑j=0n−1i,jfi,j−μiμjσiσj.


## 4.3. Homogeneity

Homogeneity is a local uniformity feature that makes single/multiple intervals govern the textured and nontextured characteristics. This feature is achieved by the following:(10)H=∑i=0m−1∑j=0n−111+i−j2fi,j.


## 4.4. Energy

The energy feature regulates the number of repetitive pixel pairs. This feature is mathematically obtained by the following equation:(11)Energy=∑i=0m−1∑j=0n−1f2i,j.


## 4.5. Entropy

The entropy is a feature that indicates the image selected interference based on the following equation:(12)Ent=−∑i=0m−1∑j=0n−1log2fi,j.


## 5. Features Selection

Some of the different extraction characteristics in the images are so important and crucial for classification. In the meantime, those features that contain information which is not notable can have high potential when combined with other features. Any of these attributes could also have no useful data at all. This shortcoming can be resolved by different works. In this paper, an optimization-based methodology has been proposed for this purpose. The optimization method for the features selection can be achieved by the following equation:(13)FF=TP×TN−FP×FNTN+FP×TP+FP×TP+FN×TN+FN1/2,where TP signifies the true positive, TN describes the true negative, FN represents the false negative, and FP defines the false positive.


## 6. Improved Thermal Exchange Optimization Algorithm

In Thermal Exchange Optimization (TEO), the temperature of the objects indicates the individual position and with objects grouping, it is started to be exchanged. Therefore, new temperatures indicate their updated positions [23].


### 6.1. Newton’s Law of Cooling

In the seventeenth century, the English scientist Isaac Newton studied the cooling of objects. The experiments showed that the cooling rate was approximately proportional to the temperature difference between the heated object and the environment. This fact is written as a differential relation:(14)dQdt=α×A×Ts−Tb,where Q describes the heat, A signifies the area of the body surface that transmits heat, Tb defines the body temperature, Ts represents the ambient temperature, and α determines the heat transfer coefficient which is dependent on the geometry of the object, surface state, heat transfer mode, and other factors.The heat loss in timedt is α×A×Ts−Tdt which defines the alteration in stored heat as the temperature falls dT, i.e.,(15)V×ρ×c×dT=−α×A×T−Tbdt,where V defines the volume (m3), ρ describes the density (kg/m3), and c signifies the specific heat (J/kg/K).Therefore,(16)T−TbTM−Tb=exp−α×A×tV×ρ×c,where TM is the starting high temperature.The above equation is valid whenα×A×t/V×ρ×c is not a function of T, i.e.,(17)γ=α×AV×ρ×c,where γ is constant. Therefore,(18)T−TbTM−Tb=exp−γt.And finally, the equation can be rewritten as follows:(19)T=TM−Tb×exp−γt+Tb.


### 6.2. Inspiration

During the TEO algorithm, some individuals have been considered as the cooling objects and the residual individuals have been considered as the environment; then it has been in reverse. The method of simulation of the TEO algorithm is given in the following.The first step is initialization. The initial temperature for all of the objects has been defined in an m-dimensional solution space as follows:(20)Ti0=Tmin+randTmax−Tmin,where Ti0 signifies the initial solution vector of the object number i, rand describes a random vector with components in the range 0,1, Tmin and Tmax describe the minimum and the maximum limitations for the decision variables.After initializing the objects, the value of the objective function for all of the individuals is evaluated. During the process, some historically bestT vectors have been stored in a memory called Thermal Memory (TM) to use their position to develop the algorithm efficiency with no extra computational cost. After selecting some best values in TM, they have been added to the population and for the same numbers of them, worst individuals have been eliminated. Individuals have been divided into two equal groups. Figure 1 shows this division. For example, T1 defines an environment object for Tn/2+1 cooling object and contrariwise.During the process, if an object has lowerγ, the temperature exchanging has been established slowly. Therefore, the value of γ for the objects has been established based on the following equation:(21)γ=CosobjectCosworst object.Time is another parameter that is important in this algorithm. This parameter is related to the iteration number. This parameter can be formulated by the following equation:(22)t=iterationMax⋅iteration.Generally, an important ability of the metaheuristics is to escape from the local optimum. During this process, the environmental temperature has been altered by the following equation:(23)Tie=1−c1+c2×1−t×rand×Ti′e,where c1 and c2 represent the control variables. Ti′e describes the object earlier temperature that has been modified to Tie.Based on the previous models, the new temperatures of the objects have been updated by the following equation:(24)Ti+=Tie+Tiold−Tieexp−γt.Another parameter in the algorithm isPr with (0, 1) that stated whether a component in the cooling objects should be changed or not.All of thePr agents have been compared with Rii=1,2,…,n which is a randomly distributed value in the range [0, 1]. If Ri<Pr, one dimension of the agent number i has been randomly chosen and the value is redeveloped by the following:(25)Ti,j=Tjmin+rndTjmax−Tjminexp−γt,where Ti,j signifies the jth variable of the ith agent and Tjmin and Tjmax represent the lower and the upper bounds of the jth variable, respectively. To keep the structures of the agents unchanged, just one dimension has been altered.Finally, the stopping criteria are checked to terminate the algorithm in the considered criteria.


### 6.3. Improved Thermal Exchange Optimization (ITEO)

The basic Thermal Exchange Optimization algorithm suffers some disadvantages like stability and premature convergence problems. This case leads us to design a modified version of the TEO algorithm to refine these drawbacks as possible.The first modification is to use Lévy flight (LF) as a proper mechanism. This mechanism has been commonly employed in metaheuristic algorithms to solve premature convergence shortcomings [24]. During this mechanism, a random walk policy has been utilized for proper adjusting of the local search that is mathematically represented as follows:(26)Lex≈1x1+τ,x=AB1/τ,σ2=Γ1+ττΓ1+τ/2×sinπτ/221+τ/22/τ,where A∼N0,σ2, B∼N0,σ2, τ signifies the Lévy index which is located in the range [0, 2] (here, τ=1.5 [25]), Γ⋅ represents Gamma function, and w defines the step size.By assuming the above equations, the updating formulation for the TEO algorithm is as follows:(27)Ti,jnew=Tjmin+LeTjmax−Tjminexp−γt.The second modification is to use the chaos mechanism for improving the system convergence speed. Here, we used Singer function for chaos modification [26, 27]. By considering this mechanism, rnd can be updated as follows:(28)rndi+1=1.077.9×rndi−23.3×rndi2+28.7×rndi3−13.3×rndi4,where rnd0∈0,1.


### 6.4. Algorithm Authentication

The simulations are applied to a Core (TM) i7-4720HQ 1.60 GHz with 8 GB RAM under and simulations are applied to the MATLAB 2017b environment. To prove the effectiveness of the suggested ITEO algorithm, it is performed on some different benchmark functions, i.e., Ackley, Rastrigin, Sphere, and Rosenbrock, and the results have been compared with some well-known and new optimization techniques, i.e. Locust Swarm Optimization Algorithm (LSO) [28], Crow Search Algorithm (CSA) [29], Multi-Verse Optimizer (MVO) [30], search and rescue (SAR) algorithm [31], and the basic Thermal Exchange Optimization (TEO) [10]. Table 1 tabulates the parameter settings of the studied algorithms.Table 1
The parameter settings of the studied algorithms.
AlgorithmParameterValueAlgorithmParameterValueSAR [31]SE0.5LSO [28]F0.6MU20L1TEO [10]c10g20c21MVO [30]Traveling distance rate[0.6, 1]pro0.3Wormhole existence prob.[0.2, 1]TM28.5CSA [29]fl2To clarify the studied benchmark functions, the equations and the boundaries have been given in Table2. During the simulation, all of the algorithms run 40 times independently for all of the benchmark functions and the maximum iteration for all of the algorithms is considered 500.Table 2
The equations and the boundaries of the studied benchmarks in the analysis.
FunctionEquationConstraintRastriginf1x=10D+∑i=1Dxi2−10cos2πxi30,50DRosenbrockf2x=∑i=1D−1100xi2−xi+1+xi−12−2.045,2.045DAckleyf3x=−20exp−0.21/D∑i=1Dxi2−exp1/D∑i=1Dcos2πxi+20+e−10,10DSpheref4x=∑i=1Dxi2−512,512DTable3 tabulates the results of the analysis of the algorithms on the benchmark functions based on four measurement indicators including minimum, maximum, mean, and standard deviation (std).Table 3
The performance analysis of the studied algorithm.
Algorithmf1f2f3f4LSO [28]Min11.4280.0350.0221.327Max4.284e36.534e20.679e56.192Mean2.168e31.295e22.195e43.084Std5.153e221.9313.645e44.339CSA [29]Min8.31610.0287.65e − 11.446Max492.572.1934.15e − 111.28Mean120.751.1375.17e − 18.294Std69.2530.0661.01e − 14.495MVO [30]Min9.1924.168e − 38.195e − 50.957Max1.15e24.279e − 27.086e − 41.492Mean22.499.153e − 31.517e − 41.137Std38.761.097e − 33.349e − 50.846SAR [31]Min0.7164.82e − 168.16e − 71.651Max11.055.61e − 142.94e − 63.287Mean4.135.29e − 151.19e − 60.201Std3.622.46e − 144.36e − 70.146TEO [32]Min0.3569.208e − 214.192e − 93.062e − 9Max15.34911.193e − 195.930e − 89.836e − 8Mean9.346234.255e − 193.591e − 83.491e − 8Std2.8963.673e − 195.086e − 92.038e − 9ITEOMin0.008.376e − 226.956e − 106.763e − 13Max4.2073.205e − 213.907e − 96.358e − 12Mean3.1641.343e − 211.2084e − 91.928e − 12Std1.2372.934e − 213.666e − 101.117e − 13As can be observed from the results, the results of all four indicators based on the suggested ITEO have the minimum value. This indicates that the suggested algorithm has the minimum error ratio for all of the metrics. The minimum value of the indicator “minimum” shows that the proposed ITEO algorithm has the highest precision among the others. Plus, the minimum value of the “std” for the ITEO algorithm shows its higher consistency toward the other methods.


## 6.1. Newton’s Law of Cooling

In the seventeenth century, the English scientist Isaac Newton studied the cooling of objects. The experiments showed that the cooling rate was approximately proportional to the temperature difference between the heated object and the environment. This fact is written as a differential relation:(14)dQdt=α×A×Ts−Tb,where Q describes the heat, A signifies the area of the body surface that transmits heat, Tb defines the body temperature, Ts represents the ambient temperature, and α determines the heat transfer coefficient which is dependent on the geometry of the object, surface state, heat transfer mode, and other factors.The heat loss in timedt is α×A×Ts−Tdt which defines the alteration in stored heat as the temperature falls dT, i.e.,(15)V×ρ×c×dT=−α×A×T−Tbdt,where V defines the volume (m3), ρ describes the density (kg/m3), and c signifies the specific heat (J/kg/K).Therefore,(16)T−TbTM−Tb=exp−α×A×tV×ρ×c,where TM is the starting high temperature.The above equation is valid whenα×A×t/V×ρ×c is not a function of T, i.e.,(17)γ=α×AV×ρ×c,where γ is constant. Therefore,(18)T−TbTM−Tb=exp−γt.And finally, the equation can be rewritten as follows:(19)T=TM−Tb×exp−γt+Tb.


## 6.2. Inspiration

During the TEO algorithm, some individuals have been considered as the cooling objects and the residual individuals have been considered as the environment; then it has been in reverse. The method of simulation of the TEO algorithm is given in the following.The first step is initialization. The initial temperature for all of the objects has been defined in an m-dimensional solution space as follows:(20)Ti0=Tmin+randTmax−Tmin,where Ti0 signifies the initial solution vector of the object number i, rand describes a random vector with components in the range 0,1, Tmin and Tmax describe the minimum and the maximum limitations for the decision variables.After initializing the objects, the value of the objective function for all of the individuals is evaluated. During the process, some historically bestT vectors have been stored in a memory called Thermal Memory (TM) to use their position to develop the algorithm efficiency with no extra computational cost. After selecting some best values in TM, they have been added to the population and for the same numbers of them, worst individuals have been eliminated. Individuals have been divided into two equal groups. Figure 1 shows this division. For example, T1 defines an environment object for Tn/2+1 cooling object and contrariwise.During the process, if an object has lowerγ, the temperature exchanging has been established slowly. Therefore, the value of γ for the objects has been established based on the following equation:(21)γ=CosobjectCosworst object.Time is another parameter that is important in this algorithm. This parameter is related to the iteration number. This parameter can be formulated by the following equation:(22)t=iterationMax⋅iteration.Generally, an important ability of the metaheuristics is to escape from the local optimum. During this process, the environmental temperature has been altered by the following equation:(23)Tie=1−c1+c2×1−t×rand×Ti′e,where c1 and c2 represent the control variables. Ti′e describes the object earlier temperature that has been modified to Tie.Based on the previous models, the new temperatures of the objects have been updated by the following equation:(24)Ti+=Tie+Tiold−Tieexp−γt.Another parameter in the algorithm isPr with (0, 1) that stated whether a component in the cooling objects should be changed or not.All of thePr agents have been compared with Rii=1,2,…,n which is a randomly distributed value in the range [0, 1]. If Ri<Pr, one dimension of the agent number i has been randomly chosen and the value is redeveloped by the following:(25)Ti,j=Tjmin+rndTjmax−Tjminexp−γt,where Ti,j signifies the jth variable of the ith agent and Tjmin and Tjmax represent the lower and the upper bounds of the jth variable, respectively. To keep the structures of the agents unchanged, just one dimension has been altered.Finally, the stopping criteria are checked to terminate the algorithm in the considered criteria.


## 6.3. Improved Thermal Exchange Optimization (ITEO)

The basic Thermal Exchange Optimization algorithm suffers some disadvantages like stability and premature convergence problems. This case leads us to design a modified version of the TEO algorithm to refine these drawbacks as possible.The first modification is to use Lévy flight (LF) as a proper mechanism. This mechanism has been commonly employed in metaheuristic algorithms to solve premature convergence shortcomings [24]. During this mechanism, a random walk policy has been utilized for proper adjusting of the local search that is mathematically represented as follows:(26)Lex≈1x1+τ,x=AB1/τ,σ2=Γ1+ττΓ1+τ/2×sinπτ/221+τ/22/τ,where A∼N0,σ2, B∼N0,σ2, τ signifies the Lévy index which is located in the range [0, 2] (here, τ=1.5 [25]), Γ⋅ represents Gamma function, and w defines the step size.By assuming the above equations, the updating formulation for the TEO algorithm is as follows:(27)Ti,jnew=Tjmin+LeTjmax−Tjminexp−γt.The second modification is to use the chaos mechanism for improving the system convergence speed. Here, we used Singer function for chaos modification [26, 27]. By considering this mechanism, rnd can be updated as follows:(28)rndi+1=1.077.9×rndi−23.3×rndi2+28.7×rndi3−13.3×rndi4,where rnd0∈0,1.


## 6.4. Algorithm Authentication

The simulations are applied to a Core (TM) i7-4720HQ 1.60 GHz with 8 GB RAM under and simulations are applied to the MATLAB 2017b environment. To prove the effectiveness of the suggested ITEO algorithm, it is performed on some different benchmark functions, i.e., Ackley, Rastrigin, Sphere, and Rosenbrock, and the results have been compared with some well-known and new optimization techniques, i.e. Locust Swarm Optimization Algorithm (LSO) [28], Crow Search Algorithm (CSA) [29], Multi-Verse Optimizer (MVO) [30], search and rescue (SAR) algorithm [31], and the basic Thermal Exchange Optimization (TEO) [10]. Table 1 tabulates the parameter settings of the studied algorithms.Table 1
The parameter settings of the studied algorithms.
AlgorithmParameterValueAlgorithmParameterValueSAR [31]SE0.5LSO [28]F0.6MU20L1TEO [10]c10g20c21MVO [30]Traveling distance rate[0.6, 1]pro0.3Wormhole existence prob.[0.2, 1]TM28.5CSA [29]fl2To clarify the studied benchmark functions, the equations and the boundaries have been given in Table2. During the simulation, all of the algorithms run 40 times independently for all of the benchmark functions and the maximum iteration for all of the algorithms is considered 500.Table 2
The equations and the boundaries of the studied benchmarks in the analysis.
FunctionEquationConstraintRastriginf1x=10D+∑i=1Dxi2−10cos2πxi30,50DRosenbrockf2x=∑i=1D−1100xi2−xi+1+xi−12−2.045,2.045DAckleyf3x=−20exp−0.21/D∑i=1Dxi2−exp1/D∑i=1Dcos2πxi+20+e−10,10DSpheref4x=∑i=1Dxi2−512,512DTable3 tabulates the results of the analysis of the algorithms on the benchmark functions based on four measurement indicators including minimum, maximum, mean, and standard deviation (std).Table 3
The performance analysis of the studied algorithm.
Algorithmf1f2f3f4LSO [28]Min11.4280.0350.0221.327Max4.284e36.534e20.679e56.192Mean2.168e31.295e22.195e43.084Std5.153e221.9313.645e44.339CSA [29]Min8.31610.0287.65e − 11.446Max492.572.1934.15e − 111.28Mean120.751.1375.17e − 18.294Std69.2530.0661.01e − 14.495MVO [30]Min9.1924.168e − 38.195e − 50.957Max1.15e24.279e − 27.086e − 41.492Mean22.499.153e − 31.517e − 41.137Std38.761.097e − 33.349e − 50.846SAR [31]Min0.7164.82e − 168.16e − 71.651Max11.055.61e − 142.94e − 63.287Mean4.135.29e − 151.19e − 60.201Std3.622.46e − 144.36e − 70.146TEO [32]Min0.3569.208e − 214.192e − 93.062e − 9Max15.34911.193e − 195.930e − 89.836e − 8Mean9.346234.255e − 193.591e − 83.491e − 8Std2.8963.673e − 195.086e − 92.038e − 9ITEOMin0.008.376e − 226.956e − 106.763e − 13Max4.2073.205e − 213.907e − 96.358e − 12Mean3.1641.343e − 211.2084e − 91.928e − 12Std1.2372.934e − 213.666e − 101.117e − 13As can be observed from the results, the results of all four indicators based on the suggested ITEO have the minimum value. This indicates that the suggested algorithm has the minimum error ratio for all of the metrics. The minimum value of the indicator “minimum” shows that the proposed ITEO algorithm has the highest precision among the others. Plus, the minimum value of the “std” for the ITEO algorithm shows its higher consistency toward the other methods.


## 7. Classification

For the final diagnosis of the features, a classifier is needed. In this study, a new optimized version of Artificial Neural Network (ANN) has been used [33]. The ANN is an almost new methodology with high efficiency for different classification applications. The ANN makes a proper relationship between input and output data. The sensitivity of the ANN is so low toward errors [34]. This method can be used for the accurate classification of medical images by correct training with no mathematical modeling [35, 36]. A popular and simple technique among different types of ANN is the multilayer perceptron (MLP) neural network. An MLP is a mathematical model of a natural brain [34]. An MLP is a model with several numbers of weights and biases that are connected for brain performance modeling. The popular method for error minimization in MLPs is backpropagation (BP). In BP, the values of the weights and biases have been adjusted for minimizing the error between the output value and the desired value [37]. This method uses Gradient Descent (GD) algorithm for minimization. One significant problem of the GD algorithm is that they have been easily trapped into the local minimum.The output of each layer in the network is as follows:(29)zi=∑j=1nwijαi+bj,where αi indicates the ith input variable, bj signifies the jth bias for the neuron, and wij describes the relation weight between αi and the jth invisible neuron.After that, the activation function has been performed to trigger the output of the neurons. This research employs sigmoid function for this purpose:(30)fjx=11+e−zj.And the output layer gives(31)yi=∑j=1mwkjαi+βk.The ANN calculates mean square error (MSE) between the desired and the observed output, i.e.,(32)MSE=1n∑i=1nyi−di,where n describes the number of the steps in the training data collection and yi and di represent the observed value and the desired value, respectively.As mentioned earlier, GD algorithm for minimizing the MSE has some problems. Therefore, here for minimizing the MSE and optimizing the classifier, the suggested Improved Thermal Exchange Optimization has been used. Figure2 shows the method of this idea.Figure 2
The flowchart of classification based on optimized ANN/ITEO.


## 8. Results and Discussion

As mentioned before, the main idea of this study is to propose a pipeline methodology for lung cancer diagnosis. The method starts with a preprocessing method for enhancing the quality of the original image. After image preprocessing, a simple image thresholding has been done based on Kapur for lung areas. Afterward, optimal features have been selected from GLCM features based on an improved version of the Thermal Exchange Optimization algorithm. Finally, an optimized MLP system was based on the introduced Improved Thermal Exchange Optimization algorithm. The method has been validated based on the Lung CT-Diagnosis dataset collected by the Cancer Imaging Archive [12]. Figure 3 shows an example of the image segmentation.Figure 3
An example of the image segmentation: (a) Original image, (b) histogram of the image, (c) image segmentation based on Kapur technique, and (d) image (c) after mathematical morphology.
(a)(b)(c)(d)


### 8.1. Dataset Description

In this study, the Lung CT-Diagnosis database has been utilized. This database contains several images in Dicom format, employed from capturing 61 patients. The number of the total images is 4682. The method has been simulated based on MATLAB 2017b environment and performed to the database based on the following configuration: Corei7 laptop with 16 GB RAM and CPU@2.6 GHz processor.


### 8.2. Simulation Results

Table4 indicates the GLCM data results of 20 first images from the Lung CT-Diagnosis database. As can be observed from Table 4, nineteen numbers of GLCM features are employed for the feature extraction (Table 5).Table 4
The GLCM data results of 20 first images from the lung CT-diagnosis database.
Image #HomogeneityIMC 1IMC 2Inverse differenceHighest probabilitySum averageSum entropySum of square varianceSum variance1−0.916−0.9140.6540.9970.7172.3720.4070.5530.6622−0.900−0.8790.2120.9920.5312.3570.5520.5060.7113−0.884−0.880.6250.9910.8912.680.690.1470.3744−0.891−0.9290.4760.9920.5292.4720.6010.1470.215−0.911−0.9030.4760.9920.6922.5170.5580.2110.0916−0.895−0.9150.2740.9930.8652.5320.230.1230.0757−0.915−0.8750.7130.9930.6742.3080.3840.3970.438−0.882−0.9140.4050.9910.7712.410.4950.6590.5549−0.881−0.8590.3550.9950.8612.4340.4230.5170.07810−0.888−0.8660.4160.9920.8912.1940.1980.4530.48311−0.917−0.9050.4370.9920.9112.4370.2960.680.38212−0.913−0.8950.5440.9950.5842.5170.6290.1740.1413−0.925−0.8770.5540.9970.6142.3560.1790.7090.67714−0.893−0.8650.4490.9980.8962.6020.6450.1810.43315−0.887−0.8850.4510.9950.7622.5390.2130.4510.32816−0.885−0.8880.5250.9980.7222.3160.5380.2040.67917−0.907−0.9110.6140.9950.772.3730.4450.4790.47918−0.904−0.8990.7990.9950.8612.3320.290.1130.33619−0.931−0.8760.6550.9930.7352.5650.4840.6160.06820−0.886−0.860.4520.9940.5892.5410.2370.670.393Table 5
The GLCM data results of 20 first images from the lung CT-diagnosis database.
Image #AutocorrelationCluster prominenceCluster shadeContrastCorrelationDifference entropyDifference varianceDissimilarityEnergyEntropy11.52920.92810.24840.00310.9510.01010.0010.0010.89110.230821.77321.44250.56140.00490.96170.0170.0030.00290.7490.42431.53320.94710.25840.00240.96370.00230.00050.00040.89030.227442.03521.54740.63740.00860.9570.03570.00630.00660.64210.576451.42020.50690.02040.00310.92470.00450.0010.0020.95950.10161.38620.34930.16460.00150.95150.01330.00140.00140.9840.044470.74280.74350.37160.00350.94130.0290.00330.00350.92260.179280.75280.84090.42560.00240.9750.03520.00460.00440.90640.213790.76680.83650.42160.00070.9940.02570.0030.00290.91050.2015101.47820.74230.37160.00290.96030.03810.00510.0050.9210.1889111.53020.92880.47460.00240.98260.03530.00450.00460.8910.2391121.54320.95970.26740.00390.96660.04660.0060.0050.8810.2612131.77021.42660.55240.00570.98910.05220.00770.00580.75850.4381141.70720.87250.50240.00710.98580.03150.0050.0040.7840.3995151.03480.95310.78060.00720.99160.02940.00520.00510.7560.4349160.88280.69690.61660.00380.95940.01090.00180.00170.84050.3082170.89480.70770.62560.00910.92830.03830.0090.00690.82640.3453182.05781.22240.18260.02040.940.1050.01990.020.48030.7899190.69880.57150.27960.0020.9550.01840.0020.00190.95410.1186201.74481.33540.57060.01410.95080.08110.01410.0140.51920.7325After feature selection based on the Improved Thermal Exchange Optimization, the optimum features based on the suggested ITEO methodology are evaluated and shown in Table6.Table 6
The optimum features using the proposed ITEO applied to GLCM.
Image #AutocorrelationCorrelationEnergyHomogeneityInverse differenceHighest probabilitySum averageClass11.1630.970.89110.99720.99710.94172.1095Yes21.4070.98070.7490.99660.99650.85942.2728Yes31.1670.98270.89030.99790.99780.94112.1119Yes41.6690.9760.64210.99480.99470.7692.4488Yes51.0540.94370.95950.9970.9970.9692.036Yes61.020.97050.9860.99850.99840.99312.0131Yes71.1110.96030.92460.99930.99720.96112.0748Yes81.1210.9540.90640.99880.99870.95122.0955Yes91.1350.9750.91050.99960.99950.95342.0928Yes101.1120.94130.9210.99850.99840.9592.0782Yes111.1640.96360.8910.9970.9980.942.1127Yes121.1770.94760.8790.9960.9970.93512.121Yes131.4040.97010.75650.99710.9950.8592.2727Yes141.3410.96480.7840.99520.99510.87742.2339No151.4030.97060.7560.99540.99530.85852.2723No161.2510.97840.84050.99710.9970.91422.1682No171.2630.94730.82840.99450.99440.90622.1787No182.4260.9610.48230.99070.99070.51142.9592No191.0670.9760.95411.000110.97672.0473No202.1130.97180.51920.9940.99390.61992.7485NoThe optimum threshold achieved by ITEO has been used to select the features. For the cost function, the best optimal value earned is 0.75. To test the final efficacy of the suggested technique, three measurement indicators including sensitivity, precision, and accuracy have been analyzed. The mathematical formulations of the indicators are given below:(33)Accuracy%=TP+TNTP+FP+FN+TN,Specificity%=TNFP+TN,Sensitivity%=TPTP+FN,where TN is truly negative, TP is truly positive, FN is false negative, and FP is false positive.To verify the higher efficiency of the proposed method, a comparison analysis of the method has been applied toward some state-of-the-art algorithms, including Kavitha’s [38], Kumar’s [39], and Lin’s [40], applied to the Lung CT-Diagnosis database. The comparison results are illustrated in a bar chart in Figure 4.Figure 4
The efficiency validation of the suggested method compared with some well-known methods based on three mentioned indicators.As can be observed from Figure4, the proposed method has the best precision for the Lung CT-Diagnosis database and Lin’s, Kumar’s, and Kavitha’s are placed in the next ranks. The results show also the proposed method.


## 8.1. Dataset Description

In this study, the Lung CT-Diagnosis database has been utilized. This database contains several images in Dicom format, employed from capturing 61 patients. The number of the total images is 4682. The method has been simulated based on MATLAB 2017b environment and performed to the database based on the following configuration: Corei7 laptop with 16 GB RAM and CPU@2.6 GHz processor.


## 8.2. Simulation Results

Table4 indicates the GLCM data results of 20 first images from the Lung CT-Diagnosis database. As can be observed from Table 4, nineteen numbers of GLCM features are employed for the feature extraction (Table 5).Table 4
The GLCM data results of 20 first images from the lung CT-diagnosis database.
Image #HomogeneityIMC 1IMC 2Inverse differenceHighest probabilitySum averageSum entropySum of square varianceSum variance1−0.916−0.9140.6540.9970.7172.3720.4070.5530.6622−0.900−0.8790.2120.9920.5312.3570.5520.5060.7113−0.884−0.880.6250.9910.8912.680.690.1470.3744−0.891−0.9290.4760.9920.5292.4720.6010.1470.215−0.911−0.9030.4760.9920.6922.5170.5580.2110.0916−0.895−0.9150.2740.9930.8652.5320.230.1230.0757−0.915−0.8750.7130.9930.6742.3080.3840.3970.438−0.882−0.9140.4050.9910.7712.410.4950.6590.5549−0.881−0.8590.3550.9950.8612.4340.4230.5170.07810−0.888−0.8660.4160.9920.8912.1940.1980.4530.48311−0.917−0.9050.4370.9920.9112.4370.2960.680.38212−0.913−0.8950.5440.9950.5842.5170.6290.1740.1413−0.925−0.8770.5540.9970.6142.3560.1790.7090.67714−0.893−0.8650.4490.9980.8962.6020.6450.1810.43315−0.887−0.8850.4510.9950.7622.5390.2130.4510.32816−0.885−0.8880.5250.9980.7222.3160.5380.2040.67917−0.907−0.9110.6140.9950.772.3730.4450.4790.47918−0.904−0.8990.7990.9950.8612.3320.290.1130.33619−0.931−0.8760.6550.9930.7352.5650.4840.6160.06820−0.886−0.860.4520.9940.5892.5410.2370.670.393Table 5
The GLCM data results of 20 first images from the lung CT-diagnosis database.
Image #AutocorrelationCluster prominenceCluster shadeContrastCorrelationDifference entropyDifference varianceDissimilarityEnergyEntropy11.52920.92810.24840.00310.9510.01010.0010.0010.89110.230821.77321.44250.56140.00490.96170.0170.0030.00290.7490.42431.53320.94710.25840.00240.96370.00230.00050.00040.89030.227442.03521.54740.63740.00860.9570.03570.00630.00660.64210.576451.42020.50690.02040.00310.92470.00450.0010.0020.95950.10161.38620.34930.16460.00150.95150.01330.00140.00140.9840.044470.74280.74350.37160.00350.94130.0290.00330.00350.92260.179280.75280.84090.42560.00240.9750.03520.00460.00440.90640.213790.76680.83650.42160.00070.9940.02570.0030.00290.91050.2015101.47820.74230.37160.00290.96030.03810.00510.0050.9210.1889111.53020.92880.47460.00240.98260.03530.00450.00460.8910.2391121.54320.95970.26740.00390.96660.04660.0060.0050.8810.2612131.77021.42660.55240.00570.98910.05220.00770.00580.75850.4381141.70720.87250.50240.00710.98580.03150.0050.0040.7840.3995151.03480.95310.78060.00720.99160.02940.00520.00510.7560.4349160.88280.69690.61660.00380.95940.01090.00180.00170.84050.3082170.89480.70770.62560.00910.92830.03830.0090.00690.82640.3453182.05781.22240.18260.02040.940.1050.01990.020.48030.7899190.69880.57150.27960.0020.9550.01840.0020.00190.95410.1186201.74481.33540.57060.01410.95080.08110.01410.0140.51920.7325After feature selection based on the Improved Thermal Exchange Optimization, the optimum features based on the suggested ITEO methodology are evaluated and shown in Table6.Table 6
The optimum features using the proposed ITEO applied to GLCM.
Image #AutocorrelationCorrelationEnergyHomogeneityInverse differenceHighest probabilitySum averageClass11.1630.970.89110.99720.99710.94172.1095Yes21.4070.98070.7490.99660.99650.85942.2728Yes31.1670.98270.89030.99790.99780.94112.1119Yes41.6690.9760.64210.99480.99470.7692.4488Yes51.0540.94370.95950.9970.9970.9692.036Yes61.020.97050.9860.99850.99840.99312.0131Yes71.1110.96030.92460.99930.99720.96112.0748Yes81.1210.9540.90640.99880.99870.95122.0955Yes91.1350.9750.91050.99960.99950.95342.0928Yes101.1120.94130.9210.99850.99840.9592.0782Yes111.1640.96360.8910.9970.9980.942.1127Yes121.1770.94760.8790.9960.9970.93512.121Yes131.4040.97010.75650.99710.9950.8592.2727Yes141.3410.96480.7840.99520.99510.87742.2339No151.4030.97060.7560.99540.99530.85852.2723No161.2510.97840.84050.99710.9970.91422.1682No171.2630.94730.82840.99450.99440.90622.1787No182.4260.9610.48230.99070.99070.51142.9592No191.0670.9760.95411.000110.97672.0473No202.1130.97180.51920.9940.99390.61992.7485NoThe optimum threshold achieved by ITEO has been used to select the features. For the cost function, the best optimal value earned is 0.75. To test the final efficacy of the suggested technique, three measurement indicators including sensitivity, precision, and accuracy have been analyzed. The mathematical formulations of the indicators are given below:(33)Accuracy%=TP+TNTP+FP+FN+TN,Specificity%=TNFP+TN,Sensitivity%=TPTP+FN,where TN is truly negative, TP is truly positive, FN is false negative, and FP is false positive.To verify the higher efficiency of the proposed method, a comparison analysis of the method has been applied toward some state-of-the-art algorithms, including Kavitha’s [38], Kumar’s [39], and Lin’s [40], applied to the Lung CT-Diagnosis database. The comparison results are illustrated in a bar chart in Figure 4.Figure 4
The efficiency validation of the suggested method compared with some well-known methods based on three mentioned indicators.As can be observed from Figure4, the proposed method has the best precision for the Lung CT-Diagnosis database and Lin’s, Kumar’s, and Kavitha’s are placed in the next ranks. The results show also the proposed method.


## 9. Conclusions

The main purpose of this study is to propose an optimal pipeline for precise lung cancer diagnosis based on different approaches. The method started with applying a preprocessing process based on a min-max normalization for the input data and an average filter for denoising the input image. Afterward, Kapur entropy maximization along with mathematical morphology was used for segmentation of the lung area. Then, 19 numbers of the GLCM features have been extracted from the segmented images and the features with higher priority were selected based on a new optimization design. The new design, called Improved Thermal Exchange Optimization (ITEO) algorithm, was designed and employed to optimize the feature selection step by considering more accuracy and convergence ability as was shown in the validation stage. Finally, the images were classified into healthy or cancerous cases by using an artificial neural network optimized by ITEO. The simulation was compared with some different state-of-the-art methods including Lin’s, Kumar’s, and Kavitha’s, and the results showed that the proposed method with 92.27% accuracy, 96.4% sensitivity, and 97.61% specificity has the highest efficiency toward the other state-of-the-art methods. In future work, we will work on using convolutional features of the lung cancer images to provide a method with higher accuracy in the system.



---

*Source: 6078524-2021-07-16.xml*