# Hybrid Rider Optimization with Deep Learning Driven Biomedical Liver Cancer Detection and Classification

Authors: Mesfer Al Duhayyim; Hanan Abdullah Mengash; Radwa Marzouk; Mohamed K Nour; Hany Mahgoub; Fahd Althukair; Abdullah Mohamed
Journal: Computational Intelligence and Neuroscience
 (2022)

---

## Abstract

Biomedical engineering is the application of the principles and problem-solving methods of engineering to biology along with medicine. Computation intelligence is the study of design of intelligent agents which are systems acting perceptively. The computation intelligence paradigm offers more advantages to the enhancement and maintenance of the field of biomedical engineering. Liver cancer is the major reason of mortality worldwide. Earlier-stage diagnosis and treatment might increase the survival rate of liver cancer patients. Manual recognition of the cancer tissue is a time-consuming and difficult task. Hence, a computer-aided diagnosis (CAD) is employed in decision making procedures for accurate diagnosis and effective treatment. In contrast to classical image-dependent “semantic” feature evaluation from human expertise, deep learning techniques could learn feature representation automatically from sample images using convolutional neural network (CNN). This study introduces a Hybrid Rider Optimization with Deep Learning Driven Biomedical Liver Cancer Detection and Classification (HRO-DLBLCC) model. The proposed HRO-DLBLCC model majorly focuses on the identification of liver cancer in the medical images. To do so, the proposed HRO-DLBLCC model employs preprocessing in two stages, namely, Gabor filtering (GF) based noise removal and watershed transform based segmentation. In addition, the proposed HRO-DLBLCC model involves NAdam optimizer with DenseNet-201 based feature extractor to generate an optimal set of feature vectors. Finally, the HRO algorithm with recurrent neural network–long short-term memory (RNN-LSTM) model is applied for liver cancer classification, in which the hyperparameters of the RNN-LSTM model are tuned by the use of HRO algorithm. The HRO-DLBLCC model is experimentally validated and compared with existing models. The experimental results assured the promising performance of the HRO-DLBLCC model over recent approaches.


---

## Body

## 1. Introduction

Liver disease is one of the severe medical states which may threaten human health and life. Liver tumors are considered the second main cause of mortality rates in males and the sixth main reason of mortality rates in women. In 2008, 7,50,000 individuals were found to have liver malevolence and 9,60,000 individuals deceased because of this disease [1]. CT scan is considered a famous method for surgical scheduling and prognosis of body parts in the abdomen region [2]. Thus, CT scan is frequently utilized for diagnosing liver cancer. Liver division is a crucial stage in computer-aided therapeutic interpolation by utilizing CT images like radiation, surgery of liver transplantation, and volume estimation. Physical allotment of every slice is an ordinary medical trial for the liver description. So, manual segmentation is time-consuming, ineffective, and autonomous. In this way, for designing a fully mechanical system with monitoring, expediting, and diagnosing ability, therapeutic planning is crucial. Several methods to segment the liver in CT scans were explained, and an overview of such methods is given in [3]. Usually, such methodologies are categorized into 3 groups: automatic, interactive, and semiautomatic [4].Semiautomatic and interactive methodologies rely on little or huge user communication whereas automatic methodologies do not rely on any kind of user communication [5]. Semiautomatic methods have a capability to diminish the efficiency of a doctor. For effective classification of liver cancer, artificial intelligence (AI) and image processing methods have an ability in research applications [6]. Various approaches to identifying liver tumor are announced, involving region oriented methodologies, machine learning (ML), and watershed transform method. Deep learning (DL) is generally an easier route for normalizing the picture element of an image to the equal level [7]. The images, which are thus extracted, may imitate the characteristics of the images for preprocessed images; the state of the derived characteristics denotes the correctness of the role importantly [8]. At last, a conclusion that the object group in the picture is the core component of DL has been made, and this becomes a matter of major current works. ML method has attained superior radiological efficacy and might solve this break in the radiological categorization of distinct syndromes [9]. FCNNs (fully convolutional neural networks) do not require explanation of some radiological characteristics for recognizing images, and, in contrast to other ML methods, they might also find some characteristics which are not available in today’s radiological practices [10].This study introduces a Hybrid Rider Optimization with Deep Learning Driven Biomedical Liver Cancer Detection and Classification (HRO-DLBLCC) model. The proposed HRO-DLBLCC model employs preprocessing in 2 stages, namely, Gabor filtering (GF) related noise removal and watershed transform based segmentation. In addition, the proposed HRO-DLBLCC model involves NAdam optimizer with DenseNet-201 based feature extractor to generate an optimal set of feature vectors. Finally, the HRO algorithm with recurrent neural network–long short-term memory (RNN-LSTM) methodology is applied for liver cancer classification. The HRO-DLBLCC model is experimentally validated and compared with existing models.


## 2. Related Works

This section offers a detailed review of liver cancer detection and classification models. In [11], an innovative approach which focuses on eliminating the essential data to the least feasible set of circulating miRNAs is suggested. The dimensional diminution reached imitates a highly significant stage in clinically actionable, potential, circulating miRNA related accuracy medicine pipelines. Heterogeneous ensembles could reimburse intrinsic prejudices of classifiers by utilizing distinct classifier methods. Sadeque et al. [12] introduce an automatic methodology of identifying liver cancer in abdominal CT images and categorizing them with the help of the histogram of an oriented gradient-support vector machine (HOG-SVM). The image segmentation and liver region abstraction are carried out in the subsequent step compiling contouring and thresholding. We compiled ROI related histogram oriented gradient (HOG) feature extraction for training the classifier that urges the classifier to be quicker than the traditional methodologies.Randhawa et al. [13] suggested a hybrid method that blends the regularization operation with the recent loss function for the support vector machine (SVM) categorization. The gray level cooccurrence matrix (GLCM) has been executed to derive the characteristics from the image. The derived characteristics which nourished to SVM classifier are extracted by utilizing selected feature vectors for categorizing the influenced area and ignoring the unnecessary regions. In [14], the researchers suggest an analysis of an original 3D-CNN devised for tissue categorization in medicinal imaging and applied for differentiating metastatic liver and primary tumors from distribution weight MRI (DW-MRI) information. The suggested network is made up of 4 sequential stridden 3D convolution layers with 3 × 3 × 3 kernel size and ReLU as activation operation, succeeded by whole connected layers with 2,048 neurons and softmax layers for a dual classifier.In [15], an automated CAD structure is provided in 3 levels. The first level is automated liver separation, and lesion identification of lesion is performed. The second level is extracting characteristics. Finally, liver lesion categorization into benign and malignant is made with the help of the original contrast related feature difference methodology. The features which are extracted from the lesion region having its surrounding normal liver tissue depend on texture and intensity. The lesion descriptor is attained by assuming the distinction between the characteristics of normal tissue and those of lesion region of liver. At last, for classifying the liver lesions into benign or malignant, a new SVM related machine learning (ML) classifier is trained on the new descriptors. Moorthi and Agita [16] suggested a fresh technique termed Level Set-related Back Propagation Neural Network (LS-BPNN) for the mechanical classification and recognition of liver cancer. In [17–20], the researchers enhanced a DL oriented assistant for helping diagnosticians distinguish between 2 sub-kinds of fundamental liver cancer, cholangiocarcinoma and hepatocellular carcinoma, on eosin and hematoxylin stained whole slide images (WSI) and assessed its impact on the diagnostic outcomes of eleven diagnosticians with changing stages of skills.Several CAD models exist in the literature to classify the presence of liver cancer using medical images. Though several ML and DL models for liver cancer classification are available in the literature, enhancement of the classification performance is still needed. Owing to continual deepening of the DL model, the number of its parameters also increases quickly, which results in model overfitting. At the same time, different hyperparameters have a significant impact on the efficiency of the CNN model. Particularly, hyperparameters such as epoch count, batch size, and learning rate selection are essential to attain effectual outcome. Since the trial and error method for hyperparameter tuning is a tedious and erroneous process, metaheuristic algorithms can be applied. Therefore, in this work, we employ HRO algorithm for the parameter selection of the RNN-LSTM model.


## 3. The Proposed Model

In this study, a new HRO-DLBLCC method was enhanced for the effectual identification of liver cancer in the medical images. The proposed HRO-DLBLCC model employed preprocessing in two stages, namely, GF based noise removal and watershed transform based segmentation. NAdam optimizer with DenseNet-201-based feature extractor, RNN-LSTM-based liver cancer classifier, and HRO-related hyperparameter tuning. Figure1 illustrates the block diagram of HRO-DLBLCC approach.Figure 1
Block diagram of HRO-DLBLCC technique.


### 3.1. Image Preprocessing

At the primary stage, the suggested HRO-DLBLCC method employed preprocessing in 2 stages, namely, GF related noise removal and watershed transform based segmentation. The GF technique has two mechanisms known as sinusoidal and Gaussian. This component can link the optimum representation of the orientation direction and the spatial domain [21]. The GF of the image is mathematically expressed in the following equation, where the cosine wave frequency can be represented as fr, u, and v axes; σu and σv refer to the fixed distance from the Gaussian property; and θ indicates the orientation direction. Furthermore, uθ and vθ representations are shown in (2) and (3), respectively:(1)GFu,v;θ,fr=exp−12uθ′2σu2+vθ2σv2cos2Πfruθ,(2)uθ=ucosθ−vsinθ,(3)vθ=usinθ+vcosθ.Then, the watershed transform model is employed for image segmentation. This region related segmentation model works on the principle of geography. Here, the grayscale image is considered a topographic relief and has a local minimum called a catchment basin. Once the water is submerged, it constructs a barrier and constitutes a watershed. This methodology produces overall division of an image. The morphological process is utilized for attaining structure of an image. In general, this process suppresses noise of the system and other artefacts from the greyscale images. Then, the presented model is applied to the gradient images for smooth structure of the boundary.


### 3.2. Feature Extraction

Next to image preprocessing, the DenseNet-201 based feature extractor generates an optimal set of feature vectors. The DenseNet-201 exploits condensed network which provides efficiency and simple training as a result of the potential feature applied for different layers, which increases the variance in the following layer, thereby improving the performance of the system. This architecture showcases typical functions under various datasets such as CIFAR-100 and ImageNet. The improved connectivity in a DenseNet-201 system and the direct communication between a layer and the following layers are deployed as demonstrated in Figure2.(4)zl=Hlz0,z1,……,zl−1.Figure 2
Layered structure in DenseNet-201.In (4), Hl means a nonlinear transform that is defined by a composite function using BN, ReLU, and a Conv of 3×3. z0,z1,……,zl−1 showcases a feature map combination of layers from the resultant layer 0 to l−1 that is incorporated into a tensor for easier execution. For the downsampling model, dense block is improved for isolation, and transition layers have BN with 2×2 average pooling layer and 1×1 Conv layer. The progressive rate in DenseNet-201 describes how dense architecture achieves new intention to hyperparameter k. It calculates the progression rate where the feature map is regarded as the global state. Therefore, a consecutive layer is comprised of feature map with the preceding layer. k feature map is added to the global state by all the layers whereby total input feature maps at lth layers FMl are shown as follows:(5)FMl=k0+kl−1.In (5), channel in an input layer is denoted by k0. To increase the processing effectiveness, a 1×1 Conv layer was deployed for each 3×3 Conv layer that mitigates the total volume of input feature maps, namely, greater than that of k output feature map. Therefore, the 1×1 Conv layer is known as the bottleneck layer, and it generates 4k feature maps.For classification purposes [22], 2 dense layers with neurons are enclosed. The feature extraction with sigmoid activation function and DenseNet-201 is used for calculating dual classifications, with softmax activation function used as conventional DenseNet-201 architecture. A neuron existing in the FC dense layer is interconnected to all neurons in the prior layer. It is numerically determined as FC layer 1 in which input 2D feature map is expanded for 1D feature vector:(6)tl−1=Bernoullip,x¨l−1=tl−1∗cl−1,x¨l=fwkx¨l−1+ol.The Bernoulli function generates a vectortl−1 arbitrarily by probability of concerning 0-1 distribution. cl−1 characterizes the vector dimension. In 2 layers of the FC, layer employs a dropout principle for blocking certain neurons on the basis of the desired probability that prevents overfitting problems. wl and ol define the weight along with offset variable of the FC layer. A sigmoid activation function is used for altering non-normalized outcomes into binary output as one or zero.The proposed HRO-DLBLCC model involves NAdam optimizer for hyperparameter tuning of the DenseNet-201 model. The NAdam optimizer attempted to incorporate Nesterov’s accelerated adaptive moment estimation within Adam. A substantial benefit of this integration method is that adaptive moment estimation assists in executing different phases in a gradient fashion by upgrading variables with momentum stage before the gradient calculation. The upgrade rule of NAdam is illustrated as follows:(7)wt=wt−1−α×m¯tv^t+ε,But(8)m¯t=1−β1,tg^t+β1,t+1m^t,m^t=mt1−∏i=1t+1β1i,g^t=gt1−∏i=1t+1β1i.


### 3.3. RNN-LSTM Based Image Classification

Once the features are generated, the RNN-LSTM model is utilized for the detection and classification of liver cancer. The recurrent NN is comprised of long-term memory through weights. It can be different in training duration and encode the comprehensive knowledge regarding the dataset. Furthermore, short-term memory in terms of ephemeral function is passed from individual to following nodes [23]. In this model, LSTM method indicates an intermediate type of memory cell. The unit of LSTM cell is described and enumerated. For instance, s denotes a vector with measure of sc at every memory cell c. Once c subscript is employed, it helps in an individual memory cell. Generally, the input node is named g. Now, gates are called yin and yout; however, the conflict of y shows an improved outcome in the ML method. Furthermore, it employs u,f, and o to determine outcome, input, and forget gates.The peephole relationships handed from inner state to output and input gates of the similar node lack most important rules to be employed in output gate. Assume a system that evaluates objects and produces essential outcomes whilen objects are regarded. In addition, the scheme recognizes dissimilar amounts of activation to the inner state. This activation has appeared in the inner state sc with constant error container and improved. Once nth object is deliberated, the system needs to discover the inner state. It can be achieved through output gates oc to acquire the substantial formula of inner state sc. Hence, sc must be input to oc. The approximation of LSTM depends on memory cells properly. The successive procedure is executed for each iteration. The expression employed for current LSTM using forget gate is represented as follows:(9)gz=φWgllz+Wghhz−1+bg,uz=σWullt+Wuhhz−1+bu,fz=σWfllt+Wfhhz−1+bf,oz=σWollt+Wohhz−1+bo,sz=gz⊙uu+sz−1⊙ft,hz=ϕsz⊙ot.The measures of hidden state of LSTM at timez are portrayed as vector hz, as hz−1 describes the amount of memory cells in hidden state at prior time. Consider the forget gate, the peephole connection is not present. The process becomes simpler for LSTM without forget gate and is achieved by fz=1 to all z. At the same time, using a forward pass, LSTM is induced for inner state. It is assumed that input gate has achieved value of 0, and no activation function can be obtained. Then, LSTM has executed maximal capability for understanding longer range dependency as applicable for simple RNN.


### 3.4. Hyperparameter Optimization

In the final stage, the hyperparameter optimization of the RNN-LSTM model is performed by the use of HRO algorithm. The HRO algorithm is derived by the fusion of rider optimization algorithm (ROA) and sunflower optimization (SFO). There are four dissimilar kinds of riders, namely, attacker, bypass rider, overtaker, and follower. ROA works by the behavior of dissimilar kinds of rider to the termination [24]. The SFO works by the revolution of sun. Sunflower often imitates the revolution that is naturally inspired by optimization. This mechanism could define a better location for effective outcome. Simultaneously, it makes use of higher computational difficulty as a result of higher computational steps. To attain an optimal global solution with fast performance and better computational steps, we employ hybrid ROA approach with the SFO. At the first level, parameter initialization process is carried out. For updating location, we employ bypass rider to increase the accomplishment rate. Bypass riders frequently follow and track a route without rider information. The formula for updating location according to the bypass rider is represented as follows:(10)Bt+1r,p=∂Btt,p∗mp+Btμ,p∗1−mp.Here, the variables∂,t,m, and μ specify the arbitrary amounts within [0,1] and k denotes the iteration number, which is determined by the user. Assume that μ=r; the formula can be expressed as follows:(11)Bt+1r,p=∂Btt,p∗mp+Btr,p∗1−mp.The SFO updates the location or solution space through the revolution of sun. Sunflower often imitates the revolution of sun. Therefore, the location updating of SFO is represented as follows:(12)Br,p=Btr,p+yr×gr.In (12), Brr,p represents the existing location at t time, Br+1r,p indicates the upgraded location at t +1 time,Bt+1r,p signifies the steps of sunflower, and gr stands for the sunflower direction.(13)Btr,p=Bt+1r,pyr×gr.For updating location, replace (14) which is the updating location of SFO in (12) which is the updating location of ROA.(14)Bt+1r,p=∂Btt,p∗mp+Bt+1r,pyr×gr∗1−mp,(15)Bt+1r,p=∂Btt,p∗mp+Bt+1r,p1−mp−yr×gr∗1−mp.Later, rearranging (16) and (17), we acquire(16)Bt+1r,p=∂Btt,p∗mp+Bt+1r,p−Bt+1r,pmpyrgr+yrgrmp,Bt+1r,pBt+1r,p∂+∂Br+1r,pmp=∂Btt,p∗mpyrtr+yrtrmp,Bt+1r,p1−∂+∂mp=∂Btt,p∗mpyrtr+yrtrmp.Next, the last formula can be expressed as follows:(17)Bt+1r,p=11−∂1−mp∂Btt,p∗mpyrtr1−mp.At present, the highest fitness values are regarded as an optimal solution, and ROA variables are updated for the optimal solution. The abovementioned steps are iterated until the iteration amount is attained. The HRO approach extracts a fitness function for obtaining enhanced classifier performances. It fixes a positive integer to indicate the superior execution of the applicant solutions. In this article, the reduction of the classifier fault rate is regarded as the fitness function, as provided in (18). The optimum resolution contains a minimum fault rate, and the poor solution gets an inclined error rate.(18)fitnessxi=ClassifierErrorRatexi=number of misclassified samplesTotal number of samples∗100.


## 3.1. Image Preprocessing

At the primary stage, the suggested HRO-DLBLCC method employed preprocessing in 2 stages, namely, GF related noise removal and watershed transform based segmentation. The GF technique has two mechanisms known as sinusoidal and Gaussian. This component can link the optimum representation of the orientation direction and the spatial domain [21]. The GF of the image is mathematically expressed in the following equation, where the cosine wave frequency can be represented as fr, u, and v axes; σu and σv refer to the fixed distance from the Gaussian property; and θ indicates the orientation direction. Furthermore, uθ and vθ representations are shown in (2) and (3), respectively:(1)GFu,v;θ,fr=exp−12uθ′2σu2+vθ2σv2cos2Πfruθ,(2)uθ=ucosθ−vsinθ,(3)vθ=usinθ+vcosθ.Then, the watershed transform model is employed for image segmentation. This region related segmentation model works on the principle of geography. Here, the grayscale image is considered a topographic relief and has a local minimum called a catchment basin. Once the water is submerged, it constructs a barrier and constitutes a watershed. This methodology produces overall division of an image. The morphological process is utilized for attaining structure of an image. In general, this process suppresses noise of the system and other artefacts from the greyscale images. Then, the presented model is applied to the gradient images for smooth structure of the boundary.


## 3.2. Feature Extraction

Next to image preprocessing, the DenseNet-201 based feature extractor generates an optimal set of feature vectors. The DenseNet-201 exploits condensed network which provides efficiency and simple training as a result of the potential feature applied for different layers, which increases the variance in the following layer, thereby improving the performance of the system. This architecture showcases typical functions under various datasets such as CIFAR-100 and ImageNet. The improved connectivity in a DenseNet-201 system and the direct communication between a layer and the following layers are deployed as demonstrated in Figure2.(4)zl=Hlz0,z1,……,zl−1.Figure 2
Layered structure in DenseNet-201.In (4), Hl means a nonlinear transform that is defined by a composite function using BN, ReLU, and a Conv of 3×3. z0,z1,……,zl−1 showcases a feature map combination of layers from the resultant layer 0 to l−1 that is incorporated into a tensor for easier execution. For the downsampling model, dense block is improved for isolation, and transition layers have BN with 2×2 average pooling layer and 1×1 Conv layer. The progressive rate in DenseNet-201 describes how dense architecture achieves new intention to hyperparameter k. It calculates the progression rate where the feature map is regarded as the global state. Therefore, a consecutive layer is comprised of feature map with the preceding layer. k feature map is added to the global state by all the layers whereby total input feature maps at lth layers FMl are shown as follows:(5)FMl=k0+kl−1.In (5), channel in an input layer is denoted by k0. To increase the processing effectiveness, a 1×1 Conv layer was deployed for each 3×3 Conv layer that mitigates the total volume of input feature maps, namely, greater than that of k output feature map. Therefore, the 1×1 Conv layer is known as the bottleneck layer, and it generates 4k feature maps.For classification purposes [22], 2 dense layers with neurons are enclosed. The feature extraction with sigmoid activation function and DenseNet-201 is used for calculating dual classifications, with softmax activation function used as conventional DenseNet-201 architecture. A neuron existing in the FC dense layer is interconnected to all neurons in the prior layer. It is numerically determined as FC layer 1 in which input 2D feature map is expanded for 1D feature vector:(6)tl−1=Bernoullip,x¨l−1=tl−1∗cl−1,x¨l=fwkx¨l−1+ol.The Bernoulli function generates a vectortl−1 arbitrarily by probability of concerning 0-1 distribution. cl−1 characterizes the vector dimension. In 2 layers of the FC, layer employs a dropout principle for blocking certain neurons on the basis of the desired probability that prevents overfitting problems. wl and ol define the weight along with offset variable of the FC layer. A sigmoid activation function is used for altering non-normalized outcomes into binary output as one or zero.The proposed HRO-DLBLCC model involves NAdam optimizer for hyperparameter tuning of the DenseNet-201 model. The NAdam optimizer attempted to incorporate Nesterov’s accelerated adaptive moment estimation within Adam. A substantial benefit of this integration method is that adaptive moment estimation assists in executing different phases in a gradient fashion by upgrading variables with momentum stage before the gradient calculation. The upgrade rule of NAdam is illustrated as follows:(7)wt=wt−1−α×m¯tv^t+ε,But(8)m¯t=1−β1,tg^t+β1,t+1m^t,m^t=mt1−∏i=1t+1β1i,g^t=gt1−∏i=1t+1β1i.


## 3.3. RNN-LSTM Based Image Classification

Once the features are generated, the RNN-LSTM model is utilized for the detection and classification of liver cancer. The recurrent NN is comprised of long-term memory through weights. It can be different in training duration and encode the comprehensive knowledge regarding the dataset. Furthermore, short-term memory in terms of ephemeral function is passed from individual to following nodes [23]. In this model, LSTM method indicates an intermediate type of memory cell. The unit of LSTM cell is described and enumerated. For instance, s denotes a vector with measure of sc at every memory cell c. Once c subscript is employed, it helps in an individual memory cell. Generally, the input node is named g. Now, gates are called yin and yout; however, the conflict of y shows an improved outcome in the ML method. Furthermore, it employs u,f, and o to determine outcome, input, and forget gates.The peephole relationships handed from inner state to output and input gates of the similar node lack most important rules to be employed in output gate. Assume a system that evaluates objects and produces essential outcomes whilen objects are regarded. In addition, the scheme recognizes dissimilar amounts of activation to the inner state. This activation has appeared in the inner state sc with constant error container and improved. Once nth object is deliberated, the system needs to discover the inner state. It can be achieved through output gates oc to acquire the substantial formula of inner state sc. Hence, sc must be input to oc. The approximation of LSTM depends on memory cells properly. The successive procedure is executed for each iteration. The expression employed for current LSTM using forget gate is represented as follows:(9)gz=φWgllz+Wghhz−1+bg,uz=σWullt+Wuhhz−1+bu,fz=σWfllt+Wfhhz−1+bf,oz=σWollt+Wohhz−1+bo,sz=gz⊙uu+sz−1⊙ft,hz=ϕsz⊙ot.The measures of hidden state of LSTM at timez are portrayed as vector hz, as hz−1 describes the amount of memory cells in hidden state at prior time. Consider the forget gate, the peephole connection is not present. The process becomes simpler for LSTM without forget gate and is achieved by fz=1 to all z. At the same time, using a forward pass, LSTM is induced for inner state. It is assumed that input gate has achieved value of 0, and no activation function can be obtained. Then, LSTM has executed maximal capability for understanding longer range dependency as applicable for simple RNN.


## 3.4. Hyperparameter Optimization

In the final stage, the hyperparameter optimization of the RNN-LSTM model is performed by the use of HRO algorithm. The HRO algorithm is derived by the fusion of rider optimization algorithm (ROA) and sunflower optimization (SFO). There are four dissimilar kinds of riders, namely, attacker, bypass rider, overtaker, and follower. ROA works by the behavior of dissimilar kinds of rider to the termination [24]. The SFO works by the revolution of sun. Sunflower often imitates the revolution that is naturally inspired by optimization. This mechanism could define a better location for effective outcome. Simultaneously, it makes use of higher computational difficulty as a result of higher computational steps. To attain an optimal global solution with fast performance and better computational steps, we employ hybrid ROA approach with the SFO. At the first level, parameter initialization process is carried out. For updating location, we employ bypass rider to increase the accomplishment rate. Bypass riders frequently follow and track a route without rider information. The formula for updating location according to the bypass rider is represented as follows:(10)Bt+1r,p=∂Btt,p∗mp+Btμ,p∗1−mp.Here, the variables∂,t,m, and μ specify the arbitrary amounts within [0,1] and k denotes the iteration number, which is determined by the user. Assume that μ=r; the formula can be expressed as follows:(11)Bt+1r,p=∂Btt,p∗mp+Btr,p∗1−mp.The SFO updates the location or solution space through the revolution of sun. Sunflower often imitates the revolution of sun. Therefore, the location updating of SFO is represented as follows:(12)Br,p=Btr,p+yr×gr.In (12), Brr,p represents the existing location at t time, Br+1r,p indicates the upgraded location at t +1 time,Bt+1r,p signifies the steps of sunflower, and gr stands for the sunflower direction.(13)Btr,p=Bt+1r,pyr×gr.For updating location, replace (14) which is the updating location of SFO in (12) which is the updating location of ROA.(14)Bt+1r,p=∂Btt,p∗mp+Bt+1r,pyr×gr∗1−mp,(15)Bt+1r,p=∂Btt,p∗mp+Bt+1r,p1−mp−yr×gr∗1−mp.Later, rearranging (16) and (17), we acquire(16)Bt+1r,p=∂Btt,p∗mp+Bt+1r,p−Bt+1r,pmpyrgr+yrgrmp,Bt+1r,pBt+1r,p∂+∂Br+1r,pmp=∂Btt,p∗mpyrtr+yrtrmp,Bt+1r,p1−∂+∂mp=∂Btt,p∗mpyrtr+yrtrmp.Next, the last formula can be expressed as follows:(17)Bt+1r,p=11−∂1−mp∂Btt,p∗mpyrtr1−mp.At present, the highest fitness values are regarded as an optimal solution, and ROA variables are updated for the optimal solution. The abovementioned steps are iterated until the iteration amount is attained. The HRO approach extracts a fitness function for obtaining enhanced classifier performances. It fixes a positive integer to indicate the superior execution of the applicant solutions. In this article, the reduction of the classifier fault rate is regarded as the fitness function, as provided in (18). The optimum resolution contains a minimum fault rate, and the poor solution gets an inclined error rate.(18)fitnessxi=ClassifierErrorRatexi=number of misclassified samplesTotal number of samples∗100.


## 4. Experimental Validation

This section examines the liver cancer classification results of the HRO-DLBLCC model using a set of medical images. The proposed model is simulated using Python 3.6.5 tool. The dataset holds a total of 1500 images with three classes, namely, hemangioma (HEM), hepatocellular carcinoma (HCC), and metastatic carcinoma (MET). The details related to the dataset are given in Table1. A few sample images are shown in Figure 3.Table 1
Dataset details.
LabelClass namesNo. of imagesHEMHemangioma500HCCHepatocellular carcinoma500METMetastatic carcinoma500Total no. of images1500Figure 3
Sample images.Figure4 highlights the confusion matrices created by the HRO-DLBLCC model on the test data. With entire dataset, the HRO-DLBLCC model has categorized 497 samples as HEM class, 497 samples as HCC class, and 483 samples as MET class. Moreover, with 70% of TR data, the HRO-DLBLCC method has categorized 357 samples as HEM class, 344 samples as HCC class, and 322 samples as MET class. Besides, with 30% of TS data, the HRO-DLBLCC technique has categorized 140 samples as HEM class, 153 samples as HCC class, and 151 samples as MET class.Figure 4
Confusion matrices of HRO-DLBLCC technique: (a) entire dataset, (b) 70% of TR data, and (c) 30% of TS data.
(a)(b)(c)Table2offers a comprehensive liver cancer classification result of the HRO-DLBLCC model. Figure 5 exhibits a brief classifier result of the HRO-DLBLCC model on the entire dataset. The results indicated that the HRO-DLBLCC model has recognized all the classes effectively on the entire dataset. For instance, the HRO-DLBLCC model has recognized samples under HEM class with accuy, precn, recal, Fscore, and MCC of 99%, 97.64%, 99.40%, 98.51%, and 97.77%, respectively.Table 2
Result analysis of HRO-DLBLCC technique with various measures.
LabelAccuracyPrecisionRecallF-scoreMCCEntire datasetHEM99.0097.6499.4098.5197.77HCC99.3398.6199.4099.0098.50MET98.6099.1896.6097.8796.85Average98.9898.4898.4798.4697.71Training phase (70%)HEM99.0597.8199.4498.6297.90HCC99.1498.0199.4298.7198.07MET98.5799.4096.2397.7996.76Average98.9298.4198.3798.3797.58Testing phase (30%)HEM98.8997.2299.2998.2597.44HCC99.78100.0099.3599.6799.51MET98.6798.6997.4298.0597.04Average99.1198.6498.6998.6698.00Figure 5
Result analysis of HRO-DLBLCC algorithm under entire dataset.Additionally, the HRO-DLBLCC methodology has recognized samples under HCC class withaccuy, precn, recal, Fscore, and MCC of 99.33%, 98.61%, 99.40%, 99%, and 98.50%, respectively. Besides, the HRO-DLBLCC algorithm has recognized samples under MET class with accuy, precn, recal, Fscore, and MCC of 98.60%, 99.18%, 96.60%, 97.87%, and 96.85%, respectively.Figure6 displays a brief classifier outcome of the HRO-DLBLCC algorithm on the 70% of TR dataset. The results specified that the HRO-DLBLCC technique has recognized all the classes effectively on the entire dataset. For example, the HRO-DLBLCC model has recognized samples under HEM class with accuy, precn, recal, Fscore, and MCC of 99.05%, 97.81%, 99.44%, 98.62%, and 97.90%, respectively. In addition, the HRO-DLBLCC approach has recognized samples under HCC class with accuy, precn, recal, Fscore, and MCC of 99.14%, 98.01%, 99.42%, 98.71%, and 98.07%, respectively. Besides, the HRO-DLBLCC model has recognized samples under MET class with accuy, precn, recal, Fscore, and MCC of 98.57%, 99.40%, 96.23%, 97.79%, and 96.76%, respectively.Figure 6
Result analysis of HRO-DLBLCC algorithm under 70% of TR data.Figure7 shows a brief classifier outcome of the HRO-DLBLCC methodology on 30% of the TS data. The results specified that the HRO-DLBLCC model has recognized all the classes effectively on the entire dataset. For example, the HRO-DLBLCC algorithm has recognized samples under HEM class with accuy, precn, recal, Fscore, and MCC of 98.89%, 97.22%, 99.29%, 98.25%, and 97.44%, respectively. Moreover, the HRO-DLBLCC technique has recognized samples under HCC class with accuy, precn, recal, Fscore, and MCC of 99.78%, 100%, 99.35%, 99.67%, and 99.51%, respectively. Furthermore, the HRO-DLBLCC techniques have recognized samples under MET class with accuy, precn, recal, Fscore, and MCC of 98.67%, 98.69%, 97.42%, 98.05%, and 97.04%, respectively.Figure 7
Result analysis of HRO-DLBLCC algorithm under 30% of TS data.The training accuracy (TA) and validation accuracy (VA) attained by the HRO-DLBLCC system on the test dataset are demonstrated in Figure8. The experimental outcome implied that the HRO-DLBLCC approach has gained maximum values of TA and VA. Specifically, the VA seemed to be superior to TA.Figure 8
TA and VA analysis of HRO-DLBLCC algorithm.The training loss (TL) and validation loss (VL) achieved by the HRO-DLBLCC algorithm on the test dataset are established in Figure9. The experimental outcome inferred that the HRO-DLBLCC methodology has accomplished least values of TL and VL. Specifically, the VL seemed lower than TL.Figure 9
TL and VL analysis of HRO-DLBLCC algorithm.A brief precision-recall examination of the HRO-DLBLCC model on the test dataset is shown in Figure10. By observing the figure, it can be noticed that the HRO-DLBLCC method has accomplished maximal precision-recall performance under all classes.Figure 10
Precision-recall curve analysis of HRO-DLBLCC algorithm.A detailed ROC investigation of the HRO-DLBLCC approach on the test dataset is represented in Figure11. The results indicated that the HRO-DLBLCC model has exhibited its ability to categorize three different classes, namely, HEM, HCC, and MET, on the test dataset.Figure 11
ROC curve analysis of HRO-DLBLCC algorithm.In order to report the enhanced performance of the HRO-DLBLCC model, a wide-ranging comparative study is made in Table3 [25, 26]. Figure 12 illustrates a comparative accuy examination of the HRO-DLBLCC model with recent models. The figure indicates that the AdaBoost, NB, and MLP models have shown lower accuy values of 90.96%, 91.41%, and 91.93%, respectively. At the same time, the KNN model has exhibited slightly improved accuy of 93.79%. It is followed by the SVM, J48, and RF models which have demonstrated closer accuy values of 95.77%, 96.43%, and 95.24%, respectively. However, the HRO-DLBLCC model has surpassed all other models with maximum accuy of 99.11%.Table 3
Comparative analysis of HRO-DLBLCC technique with existing algorithms.
MethodsAccuracyPrecisionRecallF-scoreNaïve Bayes91.4193.3289.4989.50MLP algorithm91.9392.7689.6391.17SVM algorithm95.7795.1293.7191.17KNN algorithm93.7995.6592.4989.68AdaBoost90.9692.0887.9989.72J48 algorithm96.4397.0495.3094.09Random forest95.2494.9794.4795.57HRO-DLBLCC99.1198.6498.6998.66Figure 12
Accuy analysis of HRO-DLBLCC algorithms with existing methodologies.Figure13 demonstrates a comparative precn inspection of the HRO-DLBLCC method with recent models. The figure specifies that the AdaBoost, NB, and MLP techniques have shown lower precn values of 92.08%, 93.32%, and 92.76%, respectively. Meanwhile, the KNN approach has shown slightly enhanced precn of 95.65%. Next, the SVM, J48, and RF models have established closer precn values of 95.12%, 97.04%, and 94.97%, respectively. However, the HRO-DLBLCC method has surpassed all other models with maximal precn of 98.64%.Figure 13
precn analysis of HRO-DLBLCC algorithms with existing methodologies.Figure14 demonstrates a comparative recal inspection of the HRO-DLBLCC methodology with recent models. The figure indicates that the AdaBoost, NB, and MLP methodologies have shown reduced recal values of 87.99%, 89.49%, and 89.63%, respectively. Meanwhile, the KNN model has displayed slightly improved recal of 92.49%. It is followed by the SVM, J48, and RF techniques which have demonstrated closer recal values of 93.71%, 95.30%, and 94.47%, respectively. But the HRO-DLBLCC approach has surpassed all other techniques with maximal recal of 98.69%.Figure 14
Recal analysis of HRO-DLBLCC algorithms with existing methodologies.Figure15 depicts a comparative Fscore analysis of the HRO-DLBLCC technique with recent algorithms. The figure indicates that the AdaBoost, NB, and MLP models have shown lower Fscore values of 89.72%, 89.50%, and 91.17%, respectively. Besides, the KNN model has exhibited slightly improved Fscore of 89.68%, followed by the SVM, J48, and RF approaches which have demonstrated closer Fscore values of 91.17%, 94.09%, and 95.57%, respectively. At last, the HRO-DLBLCC technique has surpassed all other techniques with maximal Fscore of 98.66%.Figure 15
Fscore analysis of HRO-DLBLCC algorithms with existing methodologies.From the detailed results and discussion, it is ensured that the HRO-DLBLCC model has accomplished maximum liver cancer classification outcomes.


## 5. Conclusion

In this study, a new HRO-DLBLCC method was enhanced for the effectual identification of liver cancer in medical images. The proposed HRO-DLBLCC model follows different stages, such as GF based noise removal, watershed segmentation, NAdam optimizer with DenseNet-201 based feature extractor, RNN-LSTM classification, and HRO based parameter tuning. The HRO-DLBLCC model is experimentally validated and compared with existing models. The experimental outcome ensured the promising performance of the HRO-DLBLCC model over recent approaches with maximum accuracy of 99.11%. In the future, the classification performance of the HRO-DLBLCC model can be improved by the use of deep instance segmentation approaches. In addition, the proposed model can be extended to the design of multimodal fusion based DL models to attain improved classification results.



---

*Source: 6162445-2022-06-30.xml*