# Automated Detection of Nonmelanoma Skin Cancer Based on Deep Convolutional Neural Network

Authors: Muhammad Arif; Felix M. Philip; F. Ajesh; Diana Izdrui; Maria Daniela Craciun; Oana Geman
Journal: Journal of Healthcare Engineering
 (2022)

---

## Abstract

One of the deadliest diseases is skin cancer, especially melanoma. The high resemblance between different skin lesions such as melanoma and nevus in the skin colour images increases the complexity of identification and diagnosis. An efficient automated early detection system for skin cancer detection is essential in order to save human lives, time, and effort. In this article, an automatic skin lesion classification system using a pretrained deep learning network and transfer learning was proposed. Here, diagnosing melanoma in premature stages, a detection system has been designed which contains the following digital image processing techniques. First, dermoscopy images of skin were taken and this is subjected to a preprocessing step for noise removal and postprocessing step for image enhancement. Then the processed image undergoes image segmentation using k-means and modified k-means clustering. Second, using feature extraction technology, Gray Level Co-occurrence Matrix, and first order statistics, characteristics are extracted. Features are selected on the basis of Harris Hawks optimization (HHO). Finally, various classifiers are used for predicting the stages and efficiency of the proposed work. Measures of well-known quantities, sensitivity, precision, accuracy, and specificity are used in assessing the efficiency of the suggested method, where higher values were obtained. Compared to the current methods, it is found that the classification rate exceeded the output of the current approaches in the performance of the proposed approach.


---

## Body

## 1. Introduction

One of the deadliest diseases that currently afflict humankind is cancer. Skin cancer is one of the most common and the deadliest among all types of cancer. Among these, melanoma is the most aggressive and deadly form [1] of cancer. Skin cancer are of two major sorts, namely nonmelanoma and melanoma (Merkel cell carcinomas, squamous cell, basal cell, and so on) [2] as shown in Figure 1. Melanoma is the dangerous skin cancer, however, if it is detected in the early stages, it can be curable, but progressive melanoma is deadly. Therefore, it is well known that the early treatment and detection of skin cancer can minimize the morbidity.Figure 1
Diagnosis trees structure for skin lesion.Additionally, the rate of unwanted biopsies is very high. The skin cancer image processing system used in diagnostics or diagnosis is the procedure of recognizing a skin texture or tissue by symptoms, signs, and the various kinds of diagnosis process results. Skin cancer is a malignant tumour located in the cells of the skin that is responsible for more than 50% of all cancers. Fortunately, skin cancer (squamous cell and basal cell, melanoma and malignant) is rare in children. When melanomas occur, they normally arise from pigmented nevi (moles) which are (diameter <6 mm) asymmetric, with irregular coloration and borders. A mass, itching, bleeding under the skin are other signs of cancerous change. The skin cancer detection system is the basic process to recognize and identify skin cancer diagnosis and symptoms in the early stages. The skin cancer detection system will be used to diagnose the skin cancer in the accurate stage [3, 4].


## 2. Related Work

Numerous studies in dermoscopic images have been conducted to identify skin lesions, but availability of classification using general images is very little. Esteva et al. [5] discussed the field of skin lesions classification into several groups. They grouped them into 23 separate categories of lesions. To conduct this classification, they used convolutional neural network (CNN) and used the 16-layer model VGG-16 and 19 layer model VGG-19 [6] generated by the Visual Geometry Group. Esteva et al. used VGG model that is pretrained and, with the assistance of transfer learning, enhanced its efficiency. The accuracy rate of 90% is obtained during classification of lesions.Masood et al. [8] proposed an artificial neural network (ANN) system and classified cancerous and noncancerous lesions from 135 images. Using FCM Algorithm for Level Set Initialization, they divided images. They obtained the characteristics of images using histogram feature extraction method and statistical features by using the Gray Level Co-occurrence Matrix (GLCM). The three training algorithms used are Levenberg-Marquardt, Scaled-Conjugate Gradient, and Resilient Back Propagation, and a two-layer feed forward neural network is being trained. Using the Scaled Conjugate Gradient training algorithm, they achieved an accuracy of 91.9%. Zhang et al. [8] have examined the diagnosis of skin lesions. CNN for automatic recognition of skin cancer was considered in the study, contrasting this with other research methods. With a sensitivity of 95.00 % and specificity of 91.00 %, the proposed method attained a precision of 91.00 %.The cutting-edge methods stated in the literature were reviewed by Pathan et al. [9], summarising these techniques. The steps involved are preprocessing of dermoscopic images, segmentation of these images, and extraction and collection of important characteristics and skin lesion disposition. Further, the analysis also assessed the implications of the methodologies mentioned in the literature. The Otsu threshold with active contour using a sparse-field level-set approach was the best result from the methods and algorithms mentioned, with a 97.50 % accuracy capacity for melanoma detection.Using fine-tuned neural networks, Lee et al. [10] suggested the skin disease classification approach. In the validation set, an accuracy of 89.90% was obtained and in the evaluation set, the model obtained an accuracy of 78.50%. Harangi [11] attained the classification results in three groups of injuries making use of the technique of incorporating robust CNNs into a structure. The testing findings showed that in the process of categorising the 3 classes, the average area under receiver operating characteristic curve (AUC) was 89.10%.Li and Shen [12] suggested two deep learning strategies for addressing 3 key tasks emerging in the field of image processing of skin lesions, i.e., segmentation of lesions (task 1), extraction of dermoscopic lesions (task 2), and classification of lesions (task 3). On the ISIC 2017 dataset, the proposed deep learning frameworks have been analysed. Experimental findings indicate that these constructs are promisingly accurate, i.e., 75.30% for task 1, 84.79% for the second task, and 91.20% for the third task. Ansari [13] suggested early detection of skin cancer using SVM. The dermoscopy images were collected and sent to various preprocessing techniques using filtering images. The unique highlights were picked using GLCM method and these were then used to define the classifier on the image and the accuracy obtained is about 95.00%.Alcon et al. have developed a decision support system which takes image processing techniques for skin lesion assessment [14]. This also utilizes some patient history data before the diagnosis is made. An automatic classification system consisting of preprocessing, segmentation, and feature extraction steps was proposed by Cavalcanti et al. A two-stage classifier was proposed to recheck lesions labelled as benign [11] for reducing the missing rate of melanoma cases. Works [10, 11] seek to approximate the four ABCD rule requirements by obtaining a range of low-level characteristics. A collection of high-level characters that instinctively explain the ABCD rules [12] was suggested by Amelard. To enhance the quality of the image, a computer-aided system for preprocessing [13] was proposed by Giotis et al. Then, some of the lesions colour and texture properties are eliminated automatically. Afterwards, final decision is made by combining the physician decision based on physical examination and the output result developed by the CAD system [14, 15].Deep learning techniques have also shown impressive outcomes in some areas like speech recognition, natural language processing [16, 17], computer vision areas such as object detection [18], object tracking [19, 20], and classification of images [20–24]. Without the need to collect handcrafted features, deep learning mechanisms achieve high precision for image classification. There seems to be a development in medical imaging activities, in particular, to take advantage of the greater potential of deep learning techniques [25–27]. CNN is a type of deep learning system where the raw image data are applied with trainable filters and pooling operations, automatically extracting a collection of complex high-level features [17–41].


### 2.1. Problem Statement

In order to prevent these debilitating treatments and obtain effective treatment, melanoma treatment includes chemotherapy and radiotherapy. Early diagnosis is among the most efficient solutions. For the identification of pigment skin lesions, several CAD systems are currently available, such as Dell’Eva-Burroni Melanoma Image Processing Software, which gives low performance in real implementations. However, general conclusions about the performance of these systems are hard to define. In organised research, the multiple image acquisition techniques such as dermoscopic, clinical, and normal camera images further complicate the classification task in one global methodology. Therefore, the new CAD programmes are also far from ideal and require further advances to enhance melanoma detection and diagnosis. In addition, two major problems are posed in the classification of skin pigment lesions into malignant and benign cancer.(i)
First, accurate segmentation is the difficult task to enhance the identification of abnormal lesions and the classification of these lesions into benign and malignant(ii)
Second is the extraction of the most discriminatory set of characteristics that define the related features differentiating the pigment lesions into benign and malignant skin cancerWe plan to use deep learning techniques in this paper to form an automated diagnostic method for the detection of melanoma. The input images, normally exposed to lighting effects and the noise, are preprocessed for this purpose. As a result, this preprocessing lets CNN remove racist characteristics from the images. Then, to identify the input as melanoma or benign, the preprocessed images are given to the CNN architecture. Some methods, such as augmentation of dataset images, and the number of samples are increased to overcome the constraints of the training sample and the smaller number of images. Experimental analysis gives us a clear picture about the novelty of the proposed system with the existing methods.


## 2.1. Problem Statement

In order to prevent these debilitating treatments and obtain effective treatment, melanoma treatment includes chemotherapy and radiotherapy. Early diagnosis is among the most efficient solutions. For the identification of pigment skin lesions, several CAD systems are currently available, such as Dell’Eva-Burroni Melanoma Image Processing Software, which gives low performance in real implementations. However, general conclusions about the performance of these systems are hard to define. In organised research, the multiple image acquisition techniques such as dermoscopic, clinical, and normal camera images further complicate the classification task in one global methodology. Therefore, the new CAD programmes are also far from ideal and require further advances to enhance melanoma detection and diagnosis. In addition, two major problems are posed in the classification of skin pigment lesions into malignant and benign cancer.(i)
First, accurate segmentation is the difficult task to enhance the identification of abnormal lesions and the classification of these lesions into benign and malignant(ii)
Second is the extraction of the most discriminatory set of characteristics that define the related features differentiating the pigment lesions into benign and malignant skin cancerWe plan to use deep learning techniques in this paper to form an automated diagnostic method for the detection of melanoma. The input images, normally exposed to lighting effects and the noise, are preprocessed for this purpose. As a result, this preprocessing lets CNN remove racist characteristics from the images. Then, to identify the input as melanoma or benign, the preprocessed images are given to the CNN architecture. Some methods, such as augmentation of dataset images, and the number of samples are increased to overcome the constraints of the training sample and the smaller number of images. Experimental analysis gives us a clear picture about the novelty of the proposed system with the existing methods.


## 3. Methodology

As for a proper diagnosis, the CAD systems provide a computer output to support analysis of radiologists to increase diagnostic accuracy and decrease the time to read the image. For early detection and diagnosis, the CAD method is also being explored. A CAD method is used for various images of tumours, such as dermoscopy, MRI, mammograms, and radiography. Five key stages from image acquisition to classification and diagnosis are used in the CAD system used in medical imaging such as data acquisition, preprocessing, segmentation, extraction of features and selection of features and, ultimately, classification. Each module is explained in detail in the later section of this proposal.


### 3.1. Dermoscopic Imaging and Skin Cancer

Dermoscopy, also named as Epi Luminescence Microscopy (ELM), is one of the most used noninvasive methods for the analysis of melanocytic and skin lesions that are pigmented. A portable, illuminated microscope called a dermatoscope is used to conduct this operation and is placed to the surface of the skin. This optical device consists of a 10-fold magnified, high-quality lens, a light source that is nonpolarized, a translucent plate, and a liquid medium between both the instrument and the skin. It enables skin lesions to be examined, unhindered by skin surface reflection, and is used for the histological and clinical correlation of lesions as shown in Figure2. Dermoscopy significantly improves the diagnostic accuracy of melanoma, allows in vivo evaluation of colours, and enables the visualization of submacroscopical structures. It evaluates features such as pigment distribution and vascularization patterns and helps develop regression structures invisible to the naked eye.Figure 2
Sample dermoscopic image from ISIC dataset.
(a)(b)(c)(d)(e)(f)


#### 3.1.1. Datasets

In this work, mainly two different datasets are used: the dataset associated with the interactive Atlas of dermoscopy (EDRA) [28] and the recently proposed dataset from the International Skin Imaging Collaboration (ISIC), 2017 [8]. The dataset used in this work has around 2000 images for training, of which less than 400 are labelled as melanoma. It also includes 150 images and a set of 600 images as validation set that serve as test set. ISIC also provides segmentation masks for every image in the dataset, which classifies each pixel as belonging to the lesion or healthy skin. The EDRA dataset is smaller in comparison to ISIC; a subset of around 800 images will be used, of which around 240 correspond to melanomas. The exact numbers of images and their division between melanoma and nonmelanoma are presented in Tables 1 and 2.Table 1
ISIC-image distribution.
SubsetMelanomaNonmelanomaTotalTrain254654908Validation25112137Test129385514Table 2
EDRA-image distribution
MelanomaNonmelanomaTotal231359590


### 3.2. Data Augmentation and Pre- and Postprocessing Operation

It is much difficult for an image to be processed and before getting processed, it needs to ensure that unnecessary items are removed from that image and then it successfully processed. In 2018, put forwarded enhancement methods for astrocytoma which brings various techniques such as histogram equalization for better preprocessing technique that can be used in MRI images of skin tumour. In 2013, Sudipta Roy brings out various preprocessing techniques in order to preprocess medical images of skin tumour such as median filter, low pass filter, and high pass filter. So, here for that CLAHE is put forwarded for discussion. After that, postprocessing is done, to remove the noise, thin hair, thick hair, and bubbles in the image. Here top-hat transformation and ADF-USM are used. ADF-USM filter performs pre- and postprocessing operation.


#### 3.2.1. Preprocessing by CLAHE

CLAHE is mainly used to evade noise amplification; here the algorithm is spited into small pre- and postimage forms called tiles. Until the required histogram is achieved, every single tile is been enhanced in separate manner [29]. Either Rayleigh or exponential are the parameters of histogram. The part where it is amplified in order to restrict contrast is done to avoid the amplification of noise. Another parameter called Clip-limit is used to restrict amplification by clipping histogram and thereby this method gives out better performance on before and after images [30, 31]. The algorithm of CLAHE is as follows:(i)
Input images, pre- and postmedical images of meningioma, are divided into subimages(ii)
Apply the following steps on each subimage:(1)
should obtain the highest value and histogram of subimage(2)
Repeat steps (a) and (b) to obtain histogram of subimage(a)
If the value of the required clip is lower than the bin value of histogram, then using that clip value clips that histogram(b)
For the value of bin going beyond the clip value given, there is a need to calculate the number of pixels(iii)
For each histogram bins, uniformly distribute the pixel that we calculated in order to obtain normalized histogram(iv)
Then get CDF values and, for every pixel in the image given, we need to find neighbouring pixels(v)
With the help of intensity of pixel values, based on the CDF values, gained mapping of neighbouring pixels has taken place(vi)
Within the range of [0-L-1], the pixels which are obtained are mapped under the new intensity values


#### 3.2.2. Adaptive Diffusion Filter Unsharp Masking

Anisotropic diffusion filter (ADF) is a nonlinear, space-variant transformation of the actual image. It is a very effective machine learning platform for image enhancement without supervision. Not only does it smooth the picture, but some important features such as the edges and textures are also preserved.The filter unsharp mask (USM) is a simple method used by several researchers to increase the acuteness of images that are presumed to have low sharpness. With the support of a scaling parameter, it enhances the edges by subtracting an unsharp image from its original equivalent [32]. In several areas related to photography, this filter is used to improve the apparent resolution of fuzzy images. Inside the USM filter, the output of the amended anisotropic diffusion filter is used(1)Ui,j=ai,j+λai,j−Gi,j,where ai,j represents the input image; λ represents a sharpening parameter which must satisfy (λ > 0), where a higher value provides a sharper result; Gi,jrepresents imageai,jfilter by a low−pass Gaussian filter.To enhance the shape and edges of images, postprocessing is done.


#### 3.2.3. Top-Hat Transform

Top-hat transformation is a power full tool for doing the mathematical morphology to extract small information and elements from present images. It is possible to break the top-hat transformation into two forms. There are two transformations that are making white top-hat and black top-hat. Some structuring components define the white top-hat transformation as relation between the input image and the input image opening. The relationship between the closing operation by SE and the input picture is the black top-hat transformation. In order to separate the thick hair from image, black top-hat transform is used. The black top-hat transformation uses the structuring element as disk and the radius of disk will be taken as 8. The top-hat transformation method is used for correcting the effect of nonuniform illumination of light object having a dark background. The images containing the elements and objects are transformed using black top-hat based on their structural elements and their surrounding appearance.


### 3.3. Segmentation

The most significant step and the critical stage for classification and diagnosis is the correct identification of the skin lesion border. In this study k-means and modified k-means clustering, algorithms were developed and applied.


#### 3.3.1. K-Means Clustering

Clustering is widely used analysis method in emergency areas. Objects having similar character are grouped and they will be different from other set of groups. According to this algorithm, defining the number of clusters is done initially (k) and along with that randomly choosing the k-cluster center [33]. For each cluster, center distance is calculated and Euclidean function can be used for distance calculation (Figure 7).K-means is a generally utilized unsupervised technique which divides the image intok segments dependent on the mean of each segment. To begin with, information is partitioned into k groups and after that the mean for each cluster will be determined as shown in Figure 3. Each datum is put in the bunch which has the nearest division to the mean of group using the Euclidean partition. The info data are a vector and the yield is a k vector. In order to apply k-means on CT pictures which are two dimensional, pixels should be set in one vector [33].Figure 3
Flowchart of k-means clustering.Algorithm 1.
Initially input (k, data)(1)
Preferk arbitrary located in the input space(2)
Allocate the group focusμj to those positions(3)
For eachxi∈ data(a)
Calculate the distance Distxi,μj for each μj(b)
Allocatexi to the group with the lowest space(4)
For eachμj shift the location of mj to the average points in that group:(2)μj=1Nj∑I=1NjxI,where k is the bunch quantity, Nj is the amount of available information in a cluster j, and mj is the average of bunch j and various square errors which resolve the situation of the repeat circle as(3)SSE=∑j=1K∑i=1ndistxi,cj2.
The main flaw of this method is the amount of clusters. Thek value is selected and is used to divide the image. Another inconvenience is affectability to anomalies, commotions, and starting qualities. From the information vector, the underlying qualities are chosen arbitrarily. To improve the issue, a few refinements have been done on this calculation and an upgraded calculation has been introduced.


#### 3.3.2. Modified K-Means Clustering (MKC)

K-means brings out simple and efficient algorithm for detecting tumour, but it has a demerit which is unable of detection of tumour even in precise manner and especially in the case of malignancy. So MKC comes into play, it works in small datasets as well as large ones, and also it reduces noise thereby bringing more accuracy to cluster [34].Algorithm of MKC(i)
With the help ofimread function in MATLAB environment images are been read(ii)
With the help of making form and applying form images are converted toL∗a∗b colour space(iii)
For each step evaluate mean(iv)
Using k-means clustering label, classify the colours(v)
With the help of cluster, segmented images are done by colour


### 3.4. Feature Extraction

Feature extraction by histogram method gives only local features, so in order to consider spatial features, we use co-occurrence matrix-based feature extraction. GLCM matrix shows the frequency value of the grey level in a specified spatiality with the grey level value of the region of interest. The number of rows and columns within GLCM matrix shows the grey level or pixel colour of the image surface value [14–16, 18, 19].Texture feature computations utilize the GLCM to calculate the intensity variation of the pixel of interest. Their computation mainly depends on 2 parameters such as relative distance between the pixel paired and their relative orientation. GLCM contains fourteen features, of them the most commonly valued features are entropy, contrast, energy, inverse difference moment, correlation, sum, and information measures of correlation.Energy. this statistic is also referred to as uniformity or second moment of angular moments and is defined as the sum of squared GLCM elements. This test the uniformity of textures, which is pixel pair duplication. In textures, it identifies abnormalities. A maximum value of one is reached by energy. Energy has a normalised range. The GLCM includes a large number of small entries with a less homogeneous image. A function that measures the total likelihood of having unique patterns of grey scale in the picture is described as(4)energy=∑i=0Np−1∑j=0Np−1p2i,j.Contrast. using gray-level co-occurrence matrix, it measures local variations. This statistic calculates an image’s spatial occurrence and is the GLCM moment of difference. It measures the amount of local variance that is occurring in the picture. It is defined as(5)contrast=∑i=0Np−1∑j=0Np−1i−j2pi,j.Correlation. this measures the occurrence in the GLCM matrix of a joint likelihood of the defined pairs of pixels. Correlation shows how a pixel is correlated to its neighbour across an image, identified as an image(6)correlation=∑i=0Np−1∑j=0Np−1i−µj−µpi.jσiσj.Homogeneity. this is the estimation of a closeness of GLCM distribution elements to GLCM diagonal elements. The Inverse Difference Moment is often the technique. It measures image homogeneity, to small grey value variations; it expects higher values in some components. If all elements of the image are all the same, it has the maximum value. It is defined as(7)homogeneity=∑i=0Np−1∑j=0Np−1pi,j1+i−j.


### 3.5. Histogram-Based (Statistical) Features

Colour features are mean, standard deviation, kurtosis, skewness, and entropy. Entropy provides the amount of image information that is needed for compression of image. These characteristics are extracted using the descriptor for colour moment (CM). Equations for statistical characteristics are given as(8)mean:μi=1N∑j−1Nfij,SD:σi=1N∑j−1Nfij−μi21/2,skewness:γi=1N∑N1fij−μi31/3,kurtosis:δi1N∑N1fij−μi41/4,entropy:εi=−∑j−1Nfij∗logfij.


## 3.1. Dermoscopic Imaging and Skin Cancer

Dermoscopy, also named as Epi Luminescence Microscopy (ELM), is one of the most used noninvasive methods for the analysis of melanocytic and skin lesions that are pigmented. A portable, illuminated microscope called a dermatoscope is used to conduct this operation and is placed to the surface of the skin. This optical device consists of a 10-fold magnified, high-quality lens, a light source that is nonpolarized, a translucent plate, and a liquid medium between both the instrument and the skin. It enables skin lesions to be examined, unhindered by skin surface reflection, and is used for the histological and clinical correlation of lesions as shown in Figure2. Dermoscopy significantly improves the diagnostic accuracy of melanoma, allows in vivo evaluation of colours, and enables the visualization of submacroscopical structures. It evaluates features such as pigment distribution and vascularization patterns and helps develop regression structures invisible to the naked eye.Figure 2
Sample dermoscopic image from ISIC dataset.
(a)(b)(c)(d)(e)(f)


### 3.1.1. Datasets

In this work, mainly two different datasets are used: the dataset associated with the interactive Atlas of dermoscopy (EDRA) [28] and the recently proposed dataset from the International Skin Imaging Collaboration (ISIC), 2017 [8]. The dataset used in this work has around 2000 images for training, of which less than 400 are labelled as melanoma. It also includes 150 images and a set of 600 images as validation set that serve as test set. ISIC also provides segmentation masks for every image in the dataset, which classifies each pixel as belonging to the lesion or healthy skin. The EDRA dataset is smaller in comparison to ISIC; a subset of around 800 images will be used, of which around 240 correspond to melanomas. The exact numbers of images and their division between melanoma and nonmelanoma are presented in Tables 1 and 2.Table 1
ISIC-image distribution.
SubsetMelanomaNonmelanomaTotalTrain254654908Validation25112137Test129385514Table 2
EDRA-image distribution
MelanomaNonmelanomaTotal231359590


## 3.1.1. Datasets

In this work, mainly two different datasets are used: the dataset associated with the interactive Atlas of dermoscopy (EDRA) [28] and the recently proposed dataset from the International Skin Imaging Collaboration (ISIC), 2017 [8]. The dataset used in this work has around 2000 images for training, of which less than 400 are labelled as melanoma. It also includes 150 images and a set of 600 images as validation set that serve as test set. ISIC also provides segmentation masks for every image in the dataset, which classifies each pixel as belonging to the lesion or healthy skin. The EDRA dataset is smaller in comparison to ISIC; a subset of around 800 images will be used, of which around 240 correspond to melanomas. The exact numbers of images and their division between melanoma and nonmelanoma are presented in Tables 1 and 2.Table 1
ISIC-image distribution.
SubsetMelanomaNonmelanomaTotalTrain254654908Validation25112137Test129385514Table 2
EDRA-image distribution
MelanomaNonmelanomaTotal231359590


## 3.2. Data Augmentation and Pre- and Postprocessing Operation

It is much difficult for an image to be processed and before getting processed, it needs to ensure that unnecessary items are removed from that image and then it successfully processed. In 2018, put forwarded enhancement methods for astrocytoma which brings various techniques such as histogram equalization for better preprocessing technique that can be used in MRI images of skin tumour. In 2013, Sudipta Roy brings out various preprocessing techniques in order to preprocess medical images of skin tumour such as median filter, low pass filter, and high pass filter. So, here for that CLAHE is put forwarded for discussion. After that, postprocessing is done, to remove the noise, thin hair, thick hair, and bubbles in the image. Here top-hat transformation and ADF-USM are used. ADF-USM filter performs pre- and postprocessing operation.


### 3.2.1. Preprocessing by CLAHE

CLAHE is mainly used to evade noise amplification; here the algorithm is spited into small pre- and postimage forms called tiles. Until the required histogram is achieved, every single tile is been enhanced in separate manner [29]. Either Rayleigh or exponential are the parameters of histogram. The part where it is amplified in order to restrict contrast is done to avoid the amplification of noise. Another parameter called Clip-limit is used to restrict amplification by clipping histogram and thereby this method gives out better performance on before and after images [30, 31]. The algorithm of CLAHE is as follows:(i)
Input images, pre- and postmedical images of meningioma, are divided into subimages(ii)
Apply the following steps on each subimage:(1)
should obtain the highest value and histogram of subimage(2)
Repeat steps (a) and (b) to obtain histogram of subimage(a)
If the value of the required clip is lower than the bin value of histogram, then using that clip value clips that histogram(b)
For the value of bin going beyond the clip value given, there is a need to calculate the number of pixels(iii)
For each histogram bins, uniformly distribute the pixel that we calculated in order to obtain normalized histogram(iv)
Then get CDF values and, for every pixel in the image given, we need to find neighbouring pixels(v)
With the help of intensity of pixel values, based on the CDF values, gained mapping of neighbouring pixels has taken place(vi)
Within the range of [0-L-1], the pixels which are obtained are mapped under the new intensity values


### 3.2.2. Adaptive Diffusion Filter Unsharp Masking

Anisotropic diffusion filter (ADF) is a nonlinear, space-variant transformation of the actual image. It is a very effective machine learning platform for image enhancement without supervision. Not only does it smooth the picture, but some important features such as the edges and textures are also preserved.The filter unsharp mask (USM) is a simple method used by several researchers to increase the acuteness of images that are presumed to have low sharpness. With the support of a scaling parameter, it enhances the edges by subtracting an unsharp image from its original equivalent [32]. In several areas related to photography, this filter is used to improve the apparent resolution of fuzzy images. Inside the USM filter, the output of the amended anisotropic diffusion filter is used(1)Ui,j=ai,j+λai,j−Gi,j,where ai,j represents the input image; λ represents a sharpening parameter which must satisfy (λ > 0), where a higher value provides a sharper result; Gi,jrepresents imageai,jfilter by a low−pass Gaussian filter.To enhance the shape and edges of images, postprocessing is done.


### 3.2.3. Top-Hat Transform

Top-hat transformation is a power full tool for doing the mathematical morphology to extract small information and elements from present images. It is possible to break the top-hat transformation into two forms. There are two transformations that are making white top-hat and black top-hat. Some structuring components define the white top-hat transformation as relation between the input image and the input image opening. The relationship between the closing operation by SE and the input picture is the black top-hat transformation. In order to separate the thick hair from image, black top-hat transform is used. The black top-hat transformation uses the structuring element as disk and the radius of disk will be taken as 8. The top-hat transformation method is used for correcting the effect of nonuniform illumination of light object having a dark background. The images containing the elements and objects are transformed using black top-hat based on their structural elements and their surrounding appearance.


## 3.2.1. Preprocessing by CLAHE

CLAHE is mainly used to evade noise amplification; here the algorithm is spited into small pre- and postimage forms called tiles. Until the required histogram is achieved, every single tile is been enhanced in separate manner [29]. Either Rayleigh or exponential are the parameters of histogram. The part where it is amplified in order to restrict contrast is done to avoid the amplification of noise. Another parameter called Clip-limit is used to restrict amplification by clipping histogram and thereby this method gives out better performance on before and after images [30, 31]. The algorithm of CLAHE is as follows:(i)
Input images, pre- and postmedical images of meningioma, are divided into subimages(ii)
Apply the following steps on each subimage:(1)
should obtain the highest value and histogram of subimage(2)
Repeat steps (a) and (b) to obtain histogram of subimage(a)
If the value of the required clip is lower than the bin value of histogram, then using that clip value clips that histogram(b)
For the value of bin going beyond the clip value given, there is a need to calculate the number of pixels(iii)
For each histogram bins, uniformly distribute the pixel that we calculated in order to obtain normalized histogram(iv)
Then get CDF values and, for every pixel in the image given, we need to find neighbouring pixels(v)
With the help of intensity of pixel values, based on the CDF values, gained mapping of neighbouring pixels has taken place(vi)
Within the range of [0-L-1], the pixels which are obtained are mapped under the new intensity values


## 3.2.2. Adaptive Diffusion Filter Unsharp Masking

Anisotropic diffusion filter (ADF) is a nonlinear, space-variant transformation of the actual image. It is a very effective machine learning platform for image enhancement without supervision. Not only does it smooth the picture, but some important features such as the edges and textures are also preserved.The filter unsharp mask (USM) is a simple method used by several researchers to increase the acuteness of images that are presumed to have low sharpness. With the support of a scaling parameter, it enhances the edges by subtracting an unsharp image from its original equivalent [32]. In several areas related to photography, this filter is used to improve the apparent resolution of fuzzy images. Inside the USM filter, the output of the amended anisotropic diffusion filter is used(1)Ui,j=ai,j+λai,j−Gi,j,where ai,j represents the input image; λ represents a sharpening parameter which must satisfy (λ > 0), where a higher value provides a sharper result; Gi,jrepresents imageai,jfilter by a low−pass Gaussian filter.To enhance the shape and edges of images, postprocessing is done.


## 3.2.3. Top-Hat Transform

Top-hat transformation is a power full tool for doing the mathematical morphology to extract small information and elements from present images. It is possible to break the top-hat transformation into two forms. There are two transformations that are making white top-hat and black top-hat. Some structuring components define the white top-hat transformation as relation between the input image and the input image opening. The relationship between the closing operation by SE and the input picture is the black top-hat transformation. In order to separate the thick hair from image, black top-hat transform is used. The black top-hat transformation uses the structuring element as disk and the radius of disk will be taken as 8. The top-hat transformation method is used for correcting the effect of nonuniform illumination of light object having a dark background. The images containing the elements and objects are transformed using black top-hat based on their structural elements and their surrounding appearance.


## 3.3. Segmentation

The most significant step and the critical stage for classification and diagnosis is the correct identification of the skin lesion border. In this study k-means and modified k-means clustering, algorithms were developed and applied.


### 3.3.1. K-Means Clustering

Clustering is widely used analysis method in emergency areas. Objects having similar character are grouped and they will be different from other set of groups. According to this algorithm, defining the number of clusters is done initially (k) and along with that randomly choosing the k-cluster center [33]. For each cluster, center distance is calculated and Euclidean function can be used for distance calculation (Figure 7).K-means is a generally utilized unsupervised technique which divides the image intok segments dependent on the mean of each segment. To begin with, information is partitioned into k groups and after that the mean for each cluster will be determined as shown in Figure 3. Each datum is put in the bunch which has the nearest division to the mean of group using the Euclidean partition. The info data are a vector and the yield is a k vector. In order to apply k-means on CT pictures which are two dimensional, pixels should be set in one vector [33].Figure 3
Flowchart of k-means clustering.Algorithm 1.
Initially input (k, data)(1)
Preferk arbitrary located in the input space(2)
Allocate the group focusμj to those positions(3)
For eachxi∈ data(a)
Calculate the distance Distxi,μj for each μj(b)
Allocatexi to the group with the lowest space(4)
For eachμj shift the location of mj to the average points in that group:(2)μj=1Nj∑I=1NjxI,where k is the bunch quantity, Nj is the amount of available information in a cluster j, and mj is the average of bunch j and various square errors which resolve the situation of the repeat circle as(3)SSE=∑j=1K∑i=1ndistxi,cj2.
The main flaw of this method is the amount of clusters. Thek value is selected and is used to divide the image. Another inconvenience is affectability to anomalies, commotions, and starting qualities. From the information vector, the underlying qualities are chosen arbitrarily. To improve the issue, a few refinements have been done on this calculation and an upgraded calculation has been introduced.


### 3.3.2. Modified K-Means Clustering (MKC)

K-means brings out simple and efficient algorithm for detecting tumour, but it has a demerit which is unable of detection of tumour even in precise manner and especially in the case of malignancy. So MKC comes into play, it works in small datasets as well as large ones, and also it reduces noise thereby bringing more accuracy to cluster [34].Algorithm of MKC(i)
With the help ofimread function in MATLAB environment images are been read(ii)
With the help of making form and applying form images are converted toL∗a∗b colour space(iii)
For each step evaluate mean(iv)
Using k-means clustering label, classify the colours(v)
With the help of cluster, segmented images are done by colour


## 3.3.1. K-Means Clustering

Clustering is widely used analysis method in emergency areas. Objects having similar character are grouped and they will be different from other set of groups. According to this algorithm, defining the number of clusters is done initially (k) and along with that randomly choosing the k-cluster center [33]. For each cluster, center distance is calculated and Euclidean function can be used for distance calculation (Figure 7).K-means is a generally utilized unsupervised technique which divides the image intok segments dependent on the mean of each segment. To begin with, information is partitioned into k groups and after that the mean for each cluster will be determined as shown in Figure 3. Each datum is put in the bunch which has the nearest division to the mean of group using the Euclidean partition. The info data are a vector and the yield is a k vector. In order to apply k-means on CT pictures which are two dimensional, pixels should be set in one vector [33].Figure 3
Flowchart of k-means clustering.Algorithm 1.
Initially input (k, data)(1)
Preferk arbitrary located in the input space(2)
Allocate the group focusμj to those positions(3)
For eachxi∈ data(a)
Calculate the distance Distxi,μj for each μj(b)
Allocatexi to the group with the lowest space(4)
For eachμj shift the location of mj to the average points in that group:(2)μj=1Nj∑I=1NjxI,where k is the bunch quantity, Nj is the amount of available information in a cluster j, and mj is the average of bunch j and various square errors which resolve the situation of the repeat circle as(3)SSE=∑j=1K∑i=1ndistxi,cj2.
The main flaw of this method is the amount of clusters. Thek value is selected and is used to divide the image. Another inconvenience is affectability to anomalies, commotions, and starting qualities. From the information vector, the underlying qualities are chosen arbitrarily. To improve the issue, a few refinements have been done on this calculation and an upgraded calculation has been introduced.


## 3.3.2. Modified K-Means Clustering (MKC)

K-means brings out simple and efficient algorithm for detecting tumour, but it has a demerit which is unable of detection of tumour even in precise manner and especially in the case of malignancy. So MKC comes into play, it works in small datasets as well as large ones, and also it reduces noise thereby bringing more accuracy to cluster [34].Algorithm of MKC(i)
With the help ofimread function in MATLAB environment images are been read(ii)
With the help of making form and applying form images are converted toL∗a∗b colour space(iii)
For each step evaluate mean(iv)
Using k-means clustering label, classify the colours(v)
With the help of cluster, segmented images are done by colour


## 3.4. Feature Extraction

Feature extraction by histogram method gives only local features, so in order to consider spatial features, we use co-occurrence matrix-based feature extraction. GLCM matrix shows the frequency value of the grey level in a specified spatiality with the grey level value of the region of interest. The number of rows and columns within GLCM matrix shows the grey level or pixel colour of the image surface value [14–16, 18, 19].Texture feature computations utilize the GLCM to calculate the intensity variation of the pixel of interest. Their computation mainly depends on 2 parameters such as relative distance between the pixel paired and their relative orientation. GLCM contains fourteen features, of them the most commonly valued features are entropy, contrast, energy, inverse difference moment, correlation, sum, and information measures of correlation.Energy. this statistic is also referred to as uniformity or second moment of angular moments and is defined as the sum of squared GLCM elements. This test the uniformity of textures, which is pixel pair duplication. In textures, it identifies abnormalities. A maximum value of one is reached by energy. Energy has a normalised range. The GLCM includes a large number of small entries with a less homogeneous image. A function that measures the total likelihood of having unique patterns of grey scale in the picture is described as(4)energy=∑i=0Np−1∑j=0Np−1p2i,j.Contrast. using gray-level co-occurrence matrix, it measures local variations. This statistic calculates an image’s spatial occurrence and is the GLCM moment of difference. It measures the amount of local variance that is occurring in the picture. It is defined as(5)contrast=∑i=0Np−1∑j=0Np−1i−j2pi,j.Correlation. this measures the occurrence in the GLCM matrix of a joint likelihood of the defined pairs of pixels. Correlation shows how a pixel is correlated to its neighbour across an image, identified as an image(6)correlation=∑i=0Np−1∑j=0Np−1i−µj−µpi.jσiσj.Homogeneity. this is the estimation of a closeness of GLCM distribution elements to GLCM diagonal elements. The Inverse Difference Moment is often the technique. It measures image homogeneity, to small grey value variations; it expects higher values in some components. If all elements of the image are all the same, it has the maximum value. It is defined as(7)homogeneity=∑i=0Np−1∑j=0Np−1pi,j1+i−j.


## 3.5. Histogram-Based (Statistical) Features

Colour features are mean, standard deviation, kurtosis, skewness, and entropy. Entropy provides the amount of image information that is needed for compression of image. These characteristics are extracted using the descriptor for colour moment (CM). Equations for statistical characteristics are given as(8)mean:μi=1N∑j−1Nfij,SD:σi=1N∑j−1Nfij−μi21/2,skewness:γi=1N∑N1fij−μi31/3,kurtosis:δi1N∑N1fij−μi41/4,entropy:εi=−∑j−1Nfij∗logfij.


## 4. Feature Selection

Not all the features make a payment to the classification process. Feature selection is carried out with the aim of identifying the most suitable feature set. Proposed system makes use of Improved HHO for selection [35].The following are the steps in HHO algorithm:(1)
By using a random function, the populationX is initialized, where N is the size.(2)
Best fittest solution N is calculated by applying the EOBL technique.(3)
Use the HHO algorithm to adjust the location of each position in the population according to the best fitness value, using HHO algorithm and the Rabbit.(4)
Use a mutation strategy for a good rabbit location. If the current location has a greater fitness value than the previous, then new location is considered to be future rabbit location, which has to be implemented using MNS strategy, which in turn can be used for further boosting of the location.(5)
An iteration process is carried out and continues until the current rabbit position is matched to the potential rabbit location. If the current position of a rabbit is good than future location of the rabbit, then rollback strategy is introduced; otherwise, the position of the rabbit is changed to the future location of the rabbit.(6)
The process is repeated till the termination criteria are reached.


### 4.1. Classification

In 2020, Hassan Ali Khan put forward his CNN model that gives greater accuracy and performance when compared to other neural networks in order to classify these skin tutor images. Milica brings out another version of CNN model which can be used for classifying these skin tumour images into three categories and gives 96.5% accuracy higher than other models. In this paper different neural networks such as Hybrid CNN-IHHO with ResNet, VGG, and DenseNet are discussed in order for the classification of melanoma images to reach the presence of normal and abnormal melanoma tumour, in which Hybrid CNN gives much improved performance in terms of accuracy than other methods.


#### 4.1.1. CNN Classifier

It is a difficult process to derive an efficient and discriminatory feature set that specifically differentiates between different classification groups. There is a pitfall that we can feed some inconsistent features to the network by using a wide collection of features. On the other hand, there is a probability that certain correct descriptors are lacking by using a limited collection of features. Therefore, without the need to specify handcrafted feature extraction procedures, automated feature extraction systems may be used to attain a discriminatory feature set on the basis of a branded training set. As a deep learning platform, CNN is used in this paper for automated melanoma detection. A series of efficient convolve-filters is used by CNNs. In input images, they are able to analyse different structures. Therefore, the image itself is the input when using CNN and the network itself collects suitable elements of the image. CNNs usually involve several layers of convolve and pooling, and a completely linked layer is made of the last layer. The convolve layer filters the input image with a kernel package where each convolution layer is normally followed by a pooling layer. The pooling layer lowers the dimension of the feature map in each given window by selecting the mean or maximum values. It is accomplished for the purpose of identifying the images with certain general patterns that are perceptible. In this article, CNNs consist of two converting layers with a 5 × 5 kernel. In the first convolution layer, there are twenty feature maps and in the second there are fifty feature maps [26–34, 36–38].The convolutional layer contains a series of convolutional kernels in which each neuron behaves as a kernel. Here, the convolution operation changes to a correlation operation if the kernel is symmetric. By splitting the picture into small slices, generally known as receptive fields [32], the convolutional kernel works. The operation can be written as follows:(9)f1kp,q=∑c∑x,yicx,y.e1ku,v,where icx,y is an element of Ic,whereIc is the input image tensor, that is multiplied by e1ku,v index of the kth convolutional kernel k1 of the lth layer. The output feature-map of the kth convolutional operation can be defined as (10)F1k=f1k1,1,…f1kp,q,…f1kP,Q.It combines similar data in the receptive field neighbourhood and generates the dominant outcome within this local area.(11)Zlk=gpFlk.Equation (11) gives the pooling operation where Zlk denotes the pooled feature-map of lth layer for kth input feature-map Flk, whereas gp (.) gives the pooling operation type. The use of pooling operation helps in extracting the features that are invariant to small distortions and translational shifts. The activation function is expressed in (12)Tlk=gaFlk.Here,Flk is the output that is given to the activation function ga (.) and adds nonlinearity thus giving an output Tlk for lth layer.Following each convolution sheet, there is one pooling layer. The outputs are such that the 4 layers are transferred to a completely linked 2-layer stage with 100 and 2 neurons, respectively. With a linear transfer feature, this 2-layer network forms the final diagnostic results.Batch normalization for a transformed feature-mapFlk is shown in (13)Nlk=Flk−μBσB2+ε.In (13), Nlk represents normalised depict mean and μB and σB2 feature-map, Flk is the input feature-map, and B represents the variance of a feature-map for a small batch.The CNN architecture of the proposed method is shown in Figure4. The images of the sample are provided to the proposed CNN after removal of noise and illumination errors.Figure 4
CNN architecture.There should be a sufficient number of samples to adequately train every CNN. But, due to the problems in obtaining and marking images, there are generally small numbers of images present in datasets. We can, therefore, cope with the restricted training package. There are several automated techniques extending the training data for this reason. Taking an example case by cropping the image 5% from the top and 5% from the left side, it is cut from its top-left corner. The new picture would then be scaled down to the original size. This form of cropping can be performed from three other corners as well. This can be also done with 10% cropping. Besides the original image, this results in 8 pictures. The resultant 9 images were rotated by 0, 90, 180, and 270 degrees afterward. Furthermore, within each input images 36 synthetized images are extracted and the size of the training dataset will be multiplied by 36. The 188 × 188 pixels are resized for all input images. 36 versions of images were generated by cropping and rotation for testing data. By considering the results of its 36 synthesised versions, the final diagnosis is done.


#### 4.1.2. R-CNN

As an inspiration from VGG-19, the development of ResNet model occurred and it is one of the deepest architectures proposed. Size of the convolutional layers in this ResNet model is of 33 filters, and also the layers here all have the same filters as for output feature map and if the feature map is spited to half due to doubling of number of filters, that will be better for maintaining the time complexity of every layer [28, 38]. With the stride value of two, it executes the down sample. The termination of ResNet happens with SoftMax activated fully connected layer and global average pooling layer.Figure5 implies the residual learning interpretation as subtraction of input features which are learned from that layer. For that ResNet uses connections which are shortcut for each pair of 33 filters and inputs of Kth layer to K+xth layer are connected. To avoid these vanishing gradients, issued layers are bypassed and activation layers are reutilized from the preceding layer to layer that is situated next to that which learned its weights. It was way simple and easier for training these networks than deep CNN because it resolves accuracy degradation. The ResNet used here is ResNet-101 and it contains 101-layer residual network and is the modified version of the 50 layered ResNet.Figure 5
A regular block (left) and a residual block (right).


#### 4.1.3. VGG-CNN

So, here pretrain VGG-16 neural network and freeze some layers so that it is fine tuned in order to avoid overfitting issue due to small dataset [28]. VGG-16 is a 16-layer convolutional neural network and our image size is of 512 × 512, which basically includes 16 conv. layer of 3 × 3 filter and 5 Max pooling layers of size 2 × 2. On the top, there will be 2 fully connected layers along with a SoftMax output layer. Since this network is large and contains literally 138 million parameters, conv. layers are stacked in order to build deep CNN for improving in learning hidden features, Figure 6.Figure 6
VGG-16 networks.


#### 4.1.4. D-CNN

One of the special cases of convolutional neural network is DenseNet, where the current layer is connected with the entire layer that is previously existed. The structure of this network brings some merits better than other networks such as in the case of vanishing gradients, feature propagation strengthening, reusing of features, and mostly reducing the number of parameters. Between each consecutive dense block, there is convolutional and pooling layers connected sequentially.The preprocessed image is fed to feed forward network which literally connects each layer to every other layer; hence, it is a dense net. The preprocessed image is fed to convolution layer of 24-filter, each dense block contains dense connection of 6 layers, and this layer performs function like batch normalization, activation, and convolution. Activation function ReLU is used and with a 3 × 3 × 3 kernel 12 filters of convolutional layer are made. The transition block (conv. and pool layer) forms 1 × 1 × 1 convolution with no repetition. Thereby at final stage a SoftMax function is used for classifying meningioma tumour images.In Figure7 it shows the performance evaluation of different classification techniques such as VGG, ResNet, and DenseNet along with the methods that this paper put forwarded like Hybrid CNN classifier and thereby it is clear that CNN gives the highest accuracy out of all, i.e., 98% and the rest of the methods VGG with 95%, ResNet with 93.5%, and finally DenseNet with 86.7%.Figure 7
DenseNet.


#### 4.1.5. Improved HHO-Based CNN

Using feature vector, skin tumour is detected and segmented using HHO and the extracted features are sent to CNN for classification [39–41]. HHO is inspired from the obliging behaviour and style of chasing of Harris Hawks and this method was so efficient in giving solutions. It poses to tackle complex of search space while considering issues like deceptive optima, local optima, and multimodality. Performance of HHO yields better when WOA is incorporated and thereby control the convergence rate [13].Harris Hawks optimization (HHO) is one of the most recent and mostly used gradient-free, optimization algorithms that mimic the Harris Hawks’ birds’ chasing style. Recently, Haidari et al. introduced HHO in 2019 [33]. This algorithm takes up the Harris Hawks attacking practices, such as predation, preaching, and surprise pounce tactics, on the prey in nature. HHO has got 2 main stages, like other metaheuristic algorithms: exploration and exploitation, but HHO has again got 2 phases for exploration and 4 phases for exploitation, which are defined as follows.In certain conditions, the detection of target according to Harris Hawks depends on the following:(14)xt+1=Xrandt−r1Xrandt−2r2XtQ≥0.5,Xrabbitt−Xmt−r3LB+r4UB−LBQ≤0.5.Here,xt+1 is the Hawks position in the coming iteration t, Xrabbitt is the rabbit position, xt represent the Hawk’s current position, andXmt gives the average position based on Hawk’s population. r1, r2, r3, r4, and q (wait) are the variables that were randomly chosen numbers within the interval [0, 1], and the upper and lower bounds were represented by LB and UB. HHO mainly concentrates on the direct method to calculate the average position of Hawks Xmt by (15)Xmt=1N∑i=1NXit,where the position is represented by Xit in the iteration t and the Hawks total count is represented by N.In HHO, the transition in between the exploration and exploitation phase, as well as between various exploitations phases, depends on theE, the prey escaping energy. HHO believes that the rabbit’s energy decreases when escaping from the hawks, which can be measured as (16)E=E01−tT.HereE represents the escaping energy, E0 is the initial energy state that updates its value randomly over the interval (−1, 1), and T represents the maximum number of iterations. HHO redirects the hawks to explore various regions search for the rabbit when the escaping energy of the rabbit is E≥1. But when the energy is reduced E<1, during the exploitation process, the hawks check the neighbourhood for the solution.HHO is built on the basis of four potential attack technique strategies. Ther and E are the two variables that indicate which plan will be carried out. Although E is the rabbit’s escape energy, r refers to the likelihood of escape, where r < 0 : 5 implies a greater chance of successful escape for the rabbit, and the failure to escape is referred by r≥0:5.The search ability of HHO is improved using EOBL technique. The opposition point is described as given: eachXi=xi;1;xi;2;…;xi;D in the present population Xe=xe;1;xe;2;…;xe;D; then, the elite opposite point Xˇi=xˇi;1;xˇi;2;…;xˇi;D can be mathematically expressed as(17)xˇi;j=s×daj+dbj−xi,j,where s∈ai,bi,S∈U0,1S is a generalized factor. dlj and dmj are known to be dynamic boundaries, that is expressed as(18)dlj=minxi;j,dmj=maxxi;j.The corresponding opposite, however, will surpass the [li,mi] search boundary. A random value within [ai,bi] is allocated to the transformed individual to solve this matter as follows:(19)xˇi;j=randlj,mj,ifxˇi;j<lj||xˇi;j>mj.HHO value mainly depends on rabbit energyE to switch from phase to discovery to phase of exploitation and to select the new exploitation process. It also utilizes rabbit resources to stop the hawks from dropping into local optima.Algorithm of IHHO-CNN(i)
First layer is applied with convolution filter(ii)
Smoothening of convolutional filter is done for reducing the sensitivity of the filter and that is called subsampling(iii)
Activation layer will control the transferring of signals between layers(iv)
With the help of ReLU, training time is fastened(v)
Preceding layer neuron is connected to neurons in subsequent layer(vi)
Loss layer is added as a feedback for neural network during training period(vii)
Initializing parameters: related parameters are initialized(a)A=A1,…,Af(viii)
Error evaluation: on the basis of the fitness function, better solutions are obtained and that solution yields less MSE and MSE is calculated as follows:MSerr=1/gΣe=1gFg−Fg′2(ix)
Weight update(x)
Error recomputation: errors are recalculated with the help of formula in fully connected layer and those generating less error are given to CNN training(xi)
Optimum weights are determined: for each solution, errors are calculated and those having less errors are given to training process(xii)
Termination


## 4.1. Classification

In 2020, Hassan Ali Khan put forward his CNN model that gives greater accuracy and performance when compared to other neural networks in order to classify these skin tutor images. Milica brings out another version of CNN model which can be used for classifying these skin tumour images into three categories and gives 96.5% accuracy higher than other models. In this paper different neural networks such as Hybrid CNN-IHHO with ResNet, VGG, and DenseNet are discussed in order for the classification of melanoma images to reach the presence of normal and abnormal melanoma tumour, in which Hybrid CNN gives much improved performance in terms of accuracy than other methods.


### 4.1.1. CNN Classifier

It is a difficult process to derive an efficient and discriminatory feature set that specifically differentiates between different classification groups. There is a pitfall that we can feed some inconsistent features to the network by using a wide collection of features. On the other hand, there is a probability that certain correct descriptors are lacking by using a limited collection of features. Therefore, without the need to specify handcrafted feature extraction procedures, automated feature extraction systems may be used to attain a discriminatory feature set on the basis of a branded training set. As a deep learning platform, CNN is used in this paper for automated melanoma detection. A series of efficient convolve-filters is used by CNNs. In input images, they are able to analyse different structures. Therefore, the image itself is the input when using CNN and the network itself collects suitable elements of the image. CNNs usually involve several layers of convolve and pooling, and a completely linked layer is made of the last layer. The convolve layer filters the input image with a kernel package where each convolution layer is normally followed by a pooling layer. The pooling layer lowers the dimension of the feature map in each given window by selecting the mean or maximum values. It is accomplished for the purpose of identifying the images with certain general patterns that are perceptible. In this article, CNNs consist of two converting layers with a 5 × 5 kernel. In the first convolution layer, there are twenty feature maps and in the second there are fifty feature maps [26–34, 36–38].The convolutional layer contains a series of convolutional kernels in which each neuron behaves as a kernel. Here, the convolution operation changes to a correlation operation if the kernel is symmetric. By splitting the picture into small slices, generally known as receptive fields [32], the convolutional kernel works. The operation can be written as follows:(9)f1kp,q=∑c∑x,yicx,y.e1ku,v,where icx,y is an element of Ic,whereIc is the input image tensor, that is multiplied by e1ku,v index of the kth convolutional kernel k1 of the lth layer. The output feature-map of the kth convolutional operation can be defined as (10)F1k=f1k1,1,…f1kp,q,…f1kP,Q.It combines similar data in the receptive field neighbourhood and generates the dominant outcome within this local area.(11)Zlk=gpFlk.Equation (11) gives the pooling operation where Zlk denotes the pooled feature-map of lth layer for kth input feature-map Flk, whereas gp (.) gives the pooling operation type. The use of pooling operation helps in extracting the features that are invariant to small distortions and translational shifts. The activation function is expressed in (12)Tlk=gaFlk.Here,Flk is the output that is given to the activation function ga (.) and adds nonlinearity thus giving an output Tlk for lth layer.Following each convolution sheet, there is one pooling layer. The outputs are such that the 4 layers are transferred to a completely linked 2-layer stage with 100 and 2 neurons, respectively. With a linear transfer feature, this 2-layer network forms the final diagnostic results.Batch normalization for a transformed feature-mapFlk is shown in (13)Nlk=Flk−μBσB2+ε.In (13), Nlk represents normalised depict mean and μB and σB2 feature-map, Flk is the input feature-map, and B represents the variance of a feature-map for a small batch.The CNN architecture of the proposed method is shown in Figure4. The images of the sample are provided to the proposed CNN after removal of noise and illumination errors.Figure 4
CNN architecture.There should be a sufficient number of samples to adequately train every CNN. But, due to the problems in obtaining and marking images, there are generally small numbers of images present in datasets. We can, therefore, cope with the restricted training package. There are several automated techniques extending the training data for this reason. Taking an example case by cropping the image 5% from the top and 5% from the left side, it is cut from its top-left corner. The new picture would then be scaled down to the original size. This form of cropping can be performed from three other corners as well. This can be also done with 10% cropping. Besides the original image, this results in 8 pictures. The resultant 9 images were rotated by 0, 90, 180, and 270 degrees afterward. Furthermore, within each input images 36 synthetized images are extracted and the size of the training dataset will be multiplied by 36. The 188 × 188 pixels are resized for all input images. 36 versions of images were generated by cropping and rotation for testing data. By considering the results of its 36 synthesised versions, the final diagnosis is done.


### 4.1.2. R-CNN

As an inspiration from VGG-19, the development of ResNet model occurred and it is one of the deepest architectures proposed. Size of the convolutional layers in this ResNet model is of 33 filters, and also the layers here all have the same filters as for output feature map and if the feature map is spited to half due to doubling of number of filters, that will be better for maintaining the time complexity of every layer [28, 38]. With the stride value of two, it executes the down sample. The termination of ResNet happens with SoftMax activated fully connected layer and global average pooling layer.Figure5 implies the residual learning interpretation as subtraction of input features which are learned from that layer. For that ResNet uses connections which are shortcut for each pair of 33 filters and inputs of Kth layer to K+xth layer are connected. To avoid these vanishing gradients, issued layers are bypassed and activation layers are reutilized from the preceding layer to layer that is situated next to that which learned its weights. It was way simple and easier for training these networks than deep CNN because it resolves accuracy degradation. The ResNet used here is ResNet-101 and it contains 101-layer residual network and is the modified version of the 50 layered ResNet.Figure 5
A regular block (left) and a residual block (right).


### 4.1.3. VGG-CNN

So, here pretrain VGG-16 neural network and freeze some layers so that it is fine tuned in order to avoid overfitting issue due to small dataset [28]. VGG-16 is a 16-layer convolutional neural network and our image size is of 512 × 512, which basically includes 16 conv. layer of 3 × 3 filter and 5 Max pooling layers of size 2 × 2. On the top, there will be 2 fully connected layers along with a SoftMax output layer. Since this network is large and contains literally 138 million parameters, conv. layers are stacked in order to build deep CNN for improving in learning hidden features, Figure 6.Figure 6
VGG-16 networks.


### 4.1.4. D-CNN

One of the special cases of convolutional neural network is DenseNet, where the current layer is connected with the entire layer that is previously existed. The structure of this network brings some merits better than other networks such as in the case of vanishing gradients, feature propagation strengthening, reusing of features, and mostly reducing the number of parameters. Between each consecutive dense block, there is convolutional and pooling layers connected sequentially.The preprocessed image is fed to feed forward network which literally connects each layer to every other layer; hence, it is a dense net. The preprocessed image is fed to convolution layer of 24-filter, each dense block contains dense connection of 6 layers, and this layer performs function like batch normalization, activation, and convolution. Activation function ReLU is used and with a 3 × 3 × 3 kernel 12 filters of convolutional layer are made. The transition block (conv. and pool layer) forms 1 × 1 × 1 convolution with no repetition. Thereby at final stage a SoftMax function is used for classifying meningioma tumour images.In Figure7 it shows the performance evaluation of different classification techniques such as VGG, ResNet, and DenseNet along with the methods that this paper put forwarded like Hybrid CNN classifier and thereby it is clear that CNN gives the highest accuracy out of all, i.e., 98% and the rest of the methods VGG with 95%, ResNet with 93.5%, and finally DenseNet with 86.7%.Figure 7
DenseNet.


### 4.1.5. Improved HHO-Based CNN

Using feature vector, skin tumour is detected and segmented using HHO and the extracted features are sent to CNN for classification [39–41]. HHO is inspired from the obliging behaviour and style of chasing of Harris Hawks and this method was so efficient in giving solutions. It poses to tackle complex of search space while considering issues like deceptive optima, local optima, and multimodality. Performance of HHO yields better when WOA is incorporated and thereby control the convergence rate [13].Harris Hawks optimization (HHO) is one of the most recent and mostly used gradient-free, optimization algorithms that mimic the Harris Hawks’ birds’ chasing style. Recently, Haidari et al. introduced HHO in 2019 [33]. This algorithm takes up the Harris Hawks attacking practices, such as predation, preaching, and surprise pounce tactics, on the prey in nature. HHO has got 2 main stages, like other metaheuristic algorithms: exploration and exploitation, but HHO has again got 2 phases for exploration and 4 phases for exploitation, which are defined as follows.In certain conditions, the detection of target according to Harris Hawks depends on the following:(14)xt+1=Xrandt−r1Xrandt−2r2XtQ≥0.5,Xrabbitt−Xmt−r3LB+r4UB−LBQ≤0.5.Here,xt+1 is the Hawks position in the coming iteration t, Xrabbitt is the rabbit position, xt represent the Hawk’s current position, andXmt gives the average position based on Hawk’s population. r1, r2, r3, r4, and q (wait) are the variables that were randomly chosen numbers within the interval [0, 1], and the upper and lower bounds were represented by LB and UB. HHO mainly concentrates on the direct method to calculate the average position of Hawks Xmt by (15)Xmt=1N∑i=1NXit,where the position is represented by Xit in the iteration t and the Hawks total count is represented by N.In HHO, the transition in between the exploration and exploitation phase, as well as between various exploitations phases, depends on theE, the prey escaping energy. HHO believes that the rabbit’s energy decreases when escaping from the hawks, which can be measured as (16)E=E01−tT.HereE represents the escaping energy, E0 is the initial energy state that updates its value randomly over the interval (−1, 1), and T represents the maximum number of iterations. HHO redirects the hawks to explore various regions search for the rabbit when the escaping energy of the rabbit is E≥1. But when the energy is reduced E<1, during the exploitation process, the hawks check the neighbourhood for the solution.HHO is built on the basis of four potential attack technique strategies. Ther and E are the two variables that indicate which plan will be carried out. Although E is the rabbit’s escape energy, r refers to the likelihood of escape, where r < 0 : 5 implies a greater chance of successful escape for the rabbit, and the failure to escape is referred by r≥0:5.The search ability of HHO is improved using EOBL technique. The opposition point is described as given: eachXi=xi;1;xi;2;…;xi;D in the present population Xe=xe;1;xe;2;…;xe;D; then, the elite opposite point Xˇi=xˇi;1;xˇi;2;…;xˇi;D can be mathematically expressed as(17)xˇi;j=s×daj+dbj−xi,j,where s∈ai,bi,S∈U0,1S is a generalized factor. dlj and dmj are known to be dynamic boundaries, that is expressed as(18)dlj=minxi;j,dmj=maxxi;j.The corresponding opposite, however, will surpass the [li,mi] search boundary. A random value within [ai,bi] is allocated to the transformed individual to solve this matter as follows:(19)xˇi;j=randlj,mj,ifxˇi;j<lj||xˇi;j>mj.HHO value mainly depends on rabbit energyE to switch from phase to discovery to phase of exploitation and to select the new exploitation process. It also utilizes rabbit resources to stop the hawks from dropping into local optima.Algorithm of IHHO-CNN(i)
First layer is applied with convolution filter(ii)
Smoothening of convolutional filter is done for reducing the sensitivity of the filter and that is called subsampling(iii)
Activation layer will control the transferring of signals between layers(iv)
With the help of ReLU, training time is fastened(v)
Preceding layer neuron is connected to neurons in subsequent layer(vi)
Loss layer is added as a feedback for neural network during training period(vii)
Initializing parameters: related parameters are initialized(a)A=A1,…,Af(viii)
Error evaluation: on the basis of the fitness function, better solutions are obtained and that solution yields less MSE and MSE is calculated as follows:MSerr=1/gΣe=1gFg−Fg′2(ix)
Weight update(x)
Error recomputation: errors are recalculated with the help of formula in fully connected layer and those generating less error are given to CNN training(xi)
Optimum weights are determined: for each solution, errors are calculated and those having less errors are given to training process(xii)
Termination


## 4.1.1. CNN Classifier

It is a difficult process to derive an efficient and discriminatory feature set that specifically differentiates between different classification groups. There is a pitfall that we can feed some inconsistent features to the network by using a wide collection of features. On the other hand, there is a probability that certain correct descriptors are lacking by using a limited collection of features. Therefore, without the need to specify handcrafted feature extraction procedures, automated feature extraction systems may be used to attain a discriminatory feature set on the basis of a branded training set. As a deep learning platform, CNN is used in this paper for automated melanoma detection. A series of efficient convolve-filters is used by CNNs. In input images, they are able to analyse different structures. Therefore, the image itself is the input when using CNN and the network itself collects suitable elements of the image. CNNs usually involve several layers of convolve and pooling, and a completely linked layer is made of the last layer. The convolve layer filters the input image with a kernel package where each convolution layer is normally followed by a pooling layer. The pooling layer lowers the dimension of the feature map in each given window by selecting the mean or maximum values. It is accomplished for the purpose of identifying the images with certain general patterns that are perceptible. In this article, CNNs consist of two converting layers with a 5 × 5 kernel. In the first convolution layer, there are twenty feature maps and in the second there are fifty feature maps [26–34, 36–38].The convolutional layer contains a series of convolutional kernels in which each neuron behaves as a kernel. Here, the convolution operation changes to a correlation operation if the kernel is symmetric. By splitting the picture into small slices, generally known as receptive fields [32], the convolutional kernel works. The operation can be written as follows:(9)f1kp,q=∑c∑x,yicx,y.e1ku,v,where icx,y is an element of Ic,whereIc is the input image tensor, that is multiplied by e1ku,v index of the kth convolutional kernel k1 of the lth layer. The output feature-map of the kth convolutional operation can be defined as (10)F1k=f1k1,1,…f1kp,q,…f1kP,Q.It combines similar data in the receptive field neighbourhood and generates the dominant outcome within this local area.(11)Zlk=gpFlk.Equation (11) gives the pooling operation where Zlk denotes the pooled feature-map of lth layer for kth input feature-map Flk, whereas gp (.) gives the pooling operation type. The use of pooling operation helps in extracting the features that are invariant to small distortions and translational shifts. The activation function is expressed in (12)Tlk=gaFlk.Here,Flk is the output that is given to the activation function ga (.) and adds nonlinearity thus giving an output Tlk for lth layer.Following each convolution sheet, there is one pooling layer. The outputs are such that the 4 layers are transferred to a completely linked 2-layer stage with 100 and 2 neurons, respectively. With a linear transfer feature, this 2-layer network forms the final diagnostic results.Batch normalization for a transformed feature-mapFlk is shown in (13)Nlk=Flk−μBσB2+ε.In (13), Nlk represents normalised depict mean and μB and σB2 feature-map, Flk is the input feature-map, and B represents the variance of a feature-map for a small batch.The CNN architecture of the proposed method is shown in Figure4. The images of the sample are provided to the proposed CNN after removal of noise and illumination errors.Figure 4
CNN architecture.There should be a sufficient number of samples to adequately train every CNN. But, due to the problems in obtaining and marking images, there are generally small numbers of images present in datasets. We can, therefore, cope with the restricted training package. There are several automated techniques extending the training data for this reason. Taking an example case by cropping the image 5% from the top and 5% from the left side, it is cut from its top-left corner. The new picture would then be scaled down to the original size. This form of cropping can be performed from three other corners as well. This can be also done with 10% cropping. Besides the original image, this results in 8 pictures. The resultant 9 images were rotated by 0, 90, 180, and 270 degrees afterward. Furthermore, within each input images 36 synthetized images are extracted and the size of the training dataset will be multiplied by 36. The 188 × 188 pixels are resized for all input images. 36 versions of images were generated by cropping and rotation for testing data. By considering the results of its 36 synthesised versions, the final diagnosis is done.


## 4.1.2. R-CNN

As an inspiration from VGG-19, the development of ResNet model occurred and it is one of the deepest architectures proposed. Size of the convolutional layers in this ResNet model is of 33 filters, and also the layers here all have the same filters as for output feature map and if the feature map is spited to half due to doubling of number of filters, that will be better for maintaining the time complexity of every layer [28, 38]. With the stride value of two, it executes the down sample. The termination of ResNet happens with SoftMax activated fully connected layer and global average pooling layer.Figure5 implies the residual learning interpretation as subtraction of input features which are learned from that layer. For that ResNet uses connections which are shortcut for each pair of 33 filters and inputs of Kth layer to K+xth layer are connected. To avoid these vanishing gradients, issued layers are bypassed and activation layers are reutilized from the preceding layer to layer that is situated next to that which learned its weights. It was way simple and easier for training these networks than deep CNN because it resolves accuracy degradation. The ResNet used here is ResNet-101 and it contains 101-layer residual network and is the modified version of the 50 layered ResNet.Figure 5
A regular block (left) and a residual block (right).


## 4.1.3. VGG-CNN

So, here pretrain VGG-16 neural network and freeze some layers so that it is fine tuned in order to avoid overfitting issue due to small dataset [28]. VGG-16 is a 16-layer convolutional neural network and our image size is of 512 × 512, which basically includes 16 conv. layer of 3 × 3 filter and 5 Max pooling layers of size 2 × 2. On the top, there will be 2 fully connected layers along with a SoftMax output layer. Since this network is large and contains literally 138 million parameters, conv. layers are stacked in order to build deep CNN for improving in learning hidden features, Figure 6.Figure 6
VGG-16 networks.


## 4.1.4. D-CNN

One of the special cases of convolutional neural network is DenseNet, where the current layer is connected with the entire layer that is previously existed. The structure of this network brings some merits better than other networks such as in the case of vanishing gradients, feature propagation strengthening, reusing of features, and mostly reducing the number of parameters. Between each consecutive dense block, there is convolutional and pooling layers connected sequentially.The preprocessed image is fed to feed forward network which literally connects each layer to every other layer; hence, it is a dense net. The preprocessed image is fed to convolution layer of 24-filter, each dense block contains dense connection of 6 layers, and this layer performs function like batch normalization, activation, and convolution. Activation function ReLU is used and with a 3 × 3 × 3 kernel 12 filters of convolutional layer are made. The transition block (conv. and pool layer) forms 1 × 1 × 1 convolution with no repetition. Thereby at final stage a SoftMax function is used for classifying meningioma tumour images.In Figure7 it shows the performance evaluation of different classification techniques such as VGG, ResNet, and DenseNet along with the methods that this paper put forwarded like Hybrid CNN classifier and thereby it is clear that CNN gives the highest accuracy out of all, i.e., 98% and the rest of the methods VGG with 95%, ResNet with 93.5%, and finally DenseNet with 86.7%.Figure 7
DenseNet.


## 4.1.5. Improved HHO-Based CNN

Using feature vector, skin tumour is detected and segmented using HHO and the extracted features are sent to CNN for classification [39–41]. HHO is inspired from the obliging behaviour and style of chasing of Harris Hawks and this method was so efficient in giving solutions. It poses to tackle complex of search space while considering issues like deceptive optima, local optima, and multimodality. Performance of HHO yields better when WOA is incorporated and thereby control the convergence rate [13].Harris Hawks optimization (HHO) is one of the most recent and mostly used gradient-free, optimization algorithms that mimic the Harris Hawks’ birds’ chasing style. Recently, Haidari et al. introduced HHO in 2019 [33]. This algorithm takes up the Harris Hawks attacking practices, such as predation, preaching, and surprise pounce tactics, on the prey in nature. HHO has got 2 main stages, like other metaheuristic algorithms: exploration and exploitation, but HHO has again got 2 phases for exploration and 4 phases for exploitation, which are defined as follows.In certain conditions, the detection of target according to Harris Hawks depends on the following:(14)xt+1=Xrandt−r1Xrandt−2r2XtQ≥0.5,Xrabbitt−Xmt−r3LB+r4UB−LBQ≤0.5.Here,xt+1 is the Hawks position in the coming iteration t, Xrabbitt is the rabbit position, xt represent the Hawk’s current position, andXmt gives the average position based on Hawk’s population. r1, r2, r3, r4, and q (wait) are the variables that were randomly chosen numbers within the interval [0, 1], and the upper and lower bounds were represented by LB and UB. HHO mainly concentrates on the direct method to calculate the average position of Hawks Xmt by (15)Xmt=1N∑i=1NXit,where the position is represented by Xit in the iteration t and the Hawks total count is represented by N.In HHO, the transition in between the exploration and exploitation phase, as well as between various exploitations phases, depends on theE, the prey escaping energy. HHO believes that the rabbit’s energy decreases when escaping from the hawks, which can be measured as (16)E=E01−tT.HereE represents the escaping energy, E0 is the initial energy state that updates its value randomly over the interval (−1, 1), and T represents the maximum number of iterations. HHO redirects the hawks to explore various regions search for the rabbit when the escaping energy of the rabbit is E≥1. But when the energy is reduced E<1, during the exploitation process, the hawks check the neighbourhood for the solution.HHO is built on the basis of four potential attack technique strategies. Ther and E are the two variables that indicate which plan will be carried out. Although E is the rabbit’s escape energy, r refers to the likelihood of escape, where r < 0 : 5 implies a greater chance of successful escape for the rabbit, and the failure to escape is referred by r≥0:5.The search ability of HHO is improved using EOBL technique. The opposition point is described as given: eachXi=xi;1;xi;2;…;xi;D in the present population Xe=xe;1;xe;2;…;xe;D; then, the elite opposite point Xˇi=xˇi;1;xˇi;2;…;xˇi;D can be mathematically expressed as(17)xˇi;j=s×daj+dbj−xi,j,where s∈ai,bi,S∈U0,1S is a generalized factor. dlj and dmj are known to be dynamic boundaries, that is expressed as(18)dlj=minxi;j,dmj=maxxi;j.The corresponding opposite, however, will surpass the [li,mi] search boundary. A random value within [ai,bi] is allocated to the transformed individual to solve this matter as follows:(19)xˇi;j=randlj,mj,ifxˇi;j<lj||xˇi;j>mj.HHO value mainly depends on rabbit energyE to switch from phase to discovery to phase of exploitation and to select the new exploitation process. It also utilizes rabbit resources to stop the hawks from dropping into local optima.Algorithm of IHHO-CNN(i)
First layer is applied with convolution filter(ii)
Smoothening of convolutional filter is done for reducing the sensitivity of the filter and that is called subsampling(iii)
Activation layer will control the transferring of signals between layers(iv)
With the help of ReLU, training time is fastened(v)
Preceding layer neuron is connected to neurons in subsequent layer(vi)
Loss layer is added as a feedback for neural network during training period(vii)
Initializing parameters: related parameters are initialized(a)A=A1,…,Af(viii)
Error evaluation: on the basis of the fitness function, better solutions are obtained and that solution yields less MSE and MSE is calculated as follows:MSerr=1/gΣe=1gFg−Fg′2(ix)
Weight update(x)
Error recomputation: errors are recalculated with the help of formula in fully connected layer and those generating less error are given to CNN training(xi)
Optimum weights are determined: for each solution, errors are calculated and those having less errors are given to training process(xii)
Termination


## 5. Experimental Results and Analysis

### 5.1. Performance Evaluation

The following equation gives the percentage of the actual lesion that is truly detected by the automated method. The performance metrics result of the proposed method is shown in (20).Segmentation(20)Jaccard index=Jc,d=Sc∩dSc∪d,dice overlap indexDOI=Dc,d=2Xc∩dc+d,similarity indexSI=2X true positive2X true positive+false positive+false negative,absolute volume measurement errorAVME=VautomaticVmanual−1,figure of meritε=1−ε=1−Vmanual−VautomaticVmanual.Classification(21)sensitivity=TrPTrP+FlN×100%,specificity=TrNTrN+FlP×100%,accuracy=TrP+TrNTrP+FlP+FlN+TrN×100%,precision=TrPTrP+FlP×100%,F−measure=2∗precision∗recallprecision+recall.


### 5.2. Simulation Environment

For the processing of medical image in image processing, MATLAB toolboxes have become a great resource for getting the accurate diagnostic result. The images can be processed and its selected features are analysed using the toolbox. If the classification algorithm mainly concentrates on neural network application, then this neural network toolbox can be used to build and train a neural network feed forward model used to classify these images into malignant groups and benign groups.


### 5.3. Experimental Results

For this classification techniques which are put forwarded and discussed, the following parameters such as accuracy, sensitivity, specificity, precision, and F1-score are evaluated. True positive (TP) offers the number of correctly identified cases, false positive (FP) provides wrongly identified cases, true negative (TN) provides safe cases, and eventually false negative (FN) results in good cases falsely identified. The resting parameters of the notes are defined as follows. 1. True positive: it gives the properly expected number of malignant lesions. 2. Positive: number of malignant lesions. 3. Real negative: the number of benign lesions that are accurately estimated. 4. Negative: the number of benign lesions shown. In Figures8–10 the same operations will be followed. The input image is preprocessed (b & c) and then the colour image is converted to Gray scale image. For proper identification of skin texture, hairs in the skin are to be extracted, and for that top-hat transform is used. The image after hair removal is given into the ADF-USM to remove the noise. The image after noise removal is given to the unsharp masking to sharpen the image. Noise-and-hair-removed image is subjected to the k-means and modified k-means method to segment the image further decision taken on the basis of features extracted from the segmented image. Finally, display whether the image is benign, suspicious, or malignant.Figure 8
Benign sample: (a) input image, (b) contrast limited histogram equalization output, (c) ADF-USM, (d) Gray scale conversion, (e) contrast adjusted, (f) hair removal, (g) sharpening of image, (h) K-means clustering, and (i) modified K-means clustering.
(a)(b)(c)(d)(e)(f)(g)(h)(i)Figure 9
Suspicious sample: (a) input image, (b) contrast limited histogram equalization output, (c) ADF-USM, (d) grey scale conversion, (e) contrast adjusted, (f) hair removal, (g) sharpening of image, (h) k-means clustering, and (i) modified k-means clustering.
(a)(b)(c)(d)(e)(f)(g)(h)(i)Figure 10
Malignant sample: (a) input image, (b) contrast limited histogram equalization output, (c) ADF-USM, (d) grey scale conversion, (e) contrast adjusted, (f) hair removal, (g) sharpening of image, (h) k-means clustering, and (i) modified k-means clustering.
(a)(b)(c)(d)(e)(f)(g)(h)(i)The evaluation matrices are Dice coefficient, Jaccard index, accuracy, and MCC to find out the segmentation efficiency. The volume measurement of segmented ROI’s and its ground truth values are shown in Table3. The obtained result of Dice coefficient is an average of 0.80 and Jaccard index is 0.96. Each value shows betterment in the efficiency than modified k-means approach. Table 3 shows that modified k-means obtained good result than modified k-means method.Table 3
Segmentation results.
MethodsK-meansModified k-meansImage 1Dice Coefficient (DC)0.98180.9863Jaccard coefficient (JC)0.96420.9729MCC0.98140.9859Accuracy0.99910.9992Image 2Dice coefficient0.78460.9133Jaccard coefficient0.64560.8405MCC0.76470.9163Accuracy0.99890.9991Statistical parameters are calculated by GLCM and FOS. The features values are shown in Table4.Table 4
GLCM and FOS features.
Image no.GLCM featureFOS featureContrastCorrelationEnergyHomogeneityMeanStandard deviationSkewnessKurtosisEntropy10.0085660.977400.61230.9957170.0060.010802.017786.760212.385020.0055870.9686340.81630.9972070.0130.0189641.3844423.377082.9833930.0053380.9782970.74870.9973310.0090.0127671.6556324.730592.7723440.0052140.9763120.77460.9973930.0110.0132361.2441313.338052.9128750.0066420.9733690.74390.9966790.0110.0191052.2741777.107852.6871560.0057420.9835220.64630.9971290.0060.0103011.6051764.282442.0535770.0087520.9566930.78920.9956240.0080.0107161.5780034.138672.5775980.0045930.9692240.84610.9977030.0100.012030.8265782.477752.7748390.0096210.9768710.57440.9951890.0110.014290.9457572.655922.23901100.007480.9827280.55980.996260.0100.0081430.4199442.283652.81441110.00720.9805580.62240.99640.0140.019452.49594612.00503.11189120.008070.9775490.63250.9959650.0120.013881.1592883.162433.16398130.009870.9741960.60770.9950650.0140.021242.2167299.247622.65219140.0135320.9692360.54670.9932340.0080.0109711.3086864.271852.4252150.0139040.9716960.49500.9930480.0090.0137782.75811411.67412.7070160.0154560.93120.76010.9922720.0090.0102960.9142992.527962.76609170.0090630.9729610.65730.9954690.0060.014453.51067215.68592.07587180.0113280.9771560.49300.9943360.0110.0194453.89561219.34942.66697190.0094040.9764130.59280.9952980.0080.0217713.88828417.36822.10227200.0034760.9622760.90430.9982620.0160.0233431.3210973.095972.91838For each classifier that is given in Table5, the accuracy is calculated in this work. The CNN + IHHO r yields the best results from the table relative to other classifiers. The contrast shows that the classifiers used in the present study clearly lead to better outcomes than other classifiers. Performance analysis of learning-based classifier is proposed for the diagnosis of melanoma cancer. It indicates that this is the best diagnostic technique for skin cancer.Table 5
Performance metrics.
ClassifierSensitivitySpecificityAccuracyPrecisionBorder errorCNN + IHHO96.198.697.3962.7DCNN98.590.6694.691.355.4VGG-CNN9292.494.789.35.3RCNN92.7969096.47.3CNN86.6849093.310ANN80.5677471.626SVM8571.5787522


## 5.1. Performance Evaluation

The following equation gives the percentage of the actual lesion that is truly detected by the automated method. The performance metrics result of the proposed method is shown in (20).Segmentation(20)Jaccard index=Jc,d=Sc∩dSc∪d,dice overlap indexDOI=Dc,d=2Xc∩dc+d,similarity indexSI=2X true positive2X true positive+false positive+false negative,absolute volume measurement errorAVME=VautomaticVmanual−1,figure of meritε=1−ε=1−Vmanual−VautomaticVmanual.Classification(21)sensitivity=TrPTrP+FlN×100%,specificity=TrNTrN+FlP×100%,accuracy=TrP+TrNTrP+FlP+FlN+TrN×100%,precision=TrPTrP+FlP×100%,F−measure=2∗precision∗recallprecision+recall.


## 5.2. Simulation Environment

For the processing of medical image in image processing, MATLAB toolboxes have become a great resource for getting the accurate diagnostic result. The images can be processed and its selected features are analysed using the toolbox. If the classification algorithm mainly concentrates on neural network application, then this neural network toolbox can be used to build and train a neural network feed forward model used to classify these images into malignant groups and benign groups.


## 5.3. Experimental Results

For this classification techniques which are put forwarded and discussed, the following parameters such as accuracy, sensitivity, specificity, precision, and F1-score are evaluated. True positive (TP) offers the number of correctly identified cases, false positive (FP) provides wrongly identified cases, true negative (TN) provides safe cases, and eventually false negative (FN) results in good cases falsely identified. The resting parameters of the notes are defined as follows. 1. True positive: it gives the properly expected number of malignant lesions. 2. Positive: number of malignant lesions. 3. Real negative: the number of benign lesions that are accurately estimated. 4. Negative: the number of benign lesions shown. In Figures8–10 the same operations will be followed. The input image is preprocessed (b & c) and then the colour image is converted to Gray scale image. For proper identification of skin texture, hairs in the skin are to be extracted, and for that top-hat transform is used. The image after hair removal is given into the ADF-USM to remove the noise. The image after noise removal is given to the unsharp masking to sharpen the image. Noise-and-hair-removed image is subjected to the k-means and modified k-means method to segment the image further decision taken on the basis of features extracted from the segmented image. Finally, display whether the image is benign, suspicious, or malignant.Figure 8
Benign sample: (a) input image, (b) contrast limited histogram equalization output, (c) ADF-USM, (d) Gray scale conversion, (e) contrast adjusted, (f) hair removal, (g) sharpening of image, (h) K-means clustering, and (i) modified K-means clustering.
(a)(b)(c)(d)(e)(f)(g)(h)(i)Figure 9
Suspicious sample: (a) input image, (b) contrast limited histogram equalization output, (c) ADF-USM, (d) grey scale conversion, (e) contrast adjusted, (f) hair removal, (g) sharpening of image, (h) k-means clustering, and (i) modified k-means clustering.
(a)(b)(c)(d)(e)(f)(g)(h)(i)Figure 10
Malignant sample: (a) input image, (b) contrast limited histogram equalization output, (c) ADF-USM, (d) grey scale conversion, (e) contrast adjusted, (f) hair removal, (g) sharpening of image, (h) k-means clustering, and (i) modified k-means clustering.
(a)(b)(c)(d)(e)(f)(g)(h)(i)The evaluation matrices are Dice coefficient, Jaccard index, accuracy, and MCC to find out the segmentation efficiency. The volume measurement of segmented ROI’s and its ground truth values are shown in Table3. The obtained result of Dice coefficient is an average of 0.80 and Jaccard index is 0.96. Each value shows betterment in the efficiency than modified k-means approach. Table 3 shows that modified k-means obtained good result than modified k-means method.Table 3
Segmentation results.
MethodsK-meansModified k-meansImage 1Dice Coefficient (DC)0.98180.9863Jaccard coefficient (JC)0.96420.9729MCC0.98140.9859Accuracy0.99910.9992Image 2Dice coefficient0.78460.9133Jaccard coefficient0.64560.8405MCC0.76470.9163Accuracy0.99890.9991Statistical parameters are calculated by GLCM and FOS. The features values are shown in Table4.Table 4
GLCM and FOS features.
Image no.GLCM featureFOS featureContrastCorrelationEnergyHomogeneityMeanStandard deviationSkewnessKurtosisEntropy10.0085660.977400.61230.9957170.0060.010802.017786.760212.385020.0055870.9686340.81630.9972070.0130.0189641.3844423.377082.9833930.0053380.9782970.74870.9973310.0090.0127671.6556324.730592.7723440.0052140.9763120.77460.9973930.0110.0132361.2441313.338052.9128750.0066420.9733690.74390.9966790.0110.0191052.2741777.107852.6871560.0057420.9835220.64630.9971290.0060.0103011.6051764.282442.0535770.0087520.9566930.78920.9956240.0080.0107161.5780034.138672.5775980.0045930.9692240.84610.9977030.0100.012030.8265782.477752.7748390.0096210.9768710.57440.9951890.0110.014290.9457572.655922.23901100.007480.9827280.55980.996260.0100.0081430.4199442.283652.81441110.00720.9805580.62240.99640.0140.019452.49594612.00503.11189120.008070.9775490.63250.9959650.0120.013881.1592883.162433.16398130.009870.9741960.60770.9950650.0140.021242.2167299.247622.65219140.0135320.9692360.54670.9932340.0080.0109711.3086864.271852.4252150.0139040.9716960.49500.9930480.0090.0137782.75811411.67412.7070160.0154560.93120.76010.9922720.0090.0102960.9142992.527962.76609170.0090630.9729610.65730.9954690.0060.014453.51067215.68592.07587180.0113280.9771560.49300.9943360.0110.0194453.89561219.34942.66697190.0094040.9764130.59280.9952980.0080.0217713.88828417.36822.10227200.0034760.9622760.90430.9982620.0160.0233431.3210973.095972.91838For each classifier that is given in Table5, the accuracy is calculated in this work. The CNN + IHHO r yields the best results from the table relative to other classifiers. The contrast shows that the classifiers used in the present study clearly lead to better outcomes than other classifiers. Performance analysis of learning-based classifier is proposed for the diagnosis of melanoma cancer. It indicates that this is the best diagnostic technique for skin cancer.Table 5
Performance metrics.
ClassifierSensitivitySpecificityAccuracyPrecisionBorder errorCNN + IHHO96.198.697.3962.7DCNN98.590.6694.691.355.4VGG-CNN9292.494.789.35.3RCNN92.7969096.47.3CNN86.6849093.310ANN80.5677471.626SVM8571.5787522


## 6. Conclusion

So, this paper brings out a clear identification and classification of pre- and postcontrast melanoma skin tumour images and thereby shows the presence of benign and malignant meningiomas. The flow of steps contains preprocessing, segmentation, and classification in which each step results in different techniques analysed and discussed and also brings better evaluation. In the case of preprocessing, enhancement of images happen much in the case of CLAHE rather than in anisotropic diffusion filter. The modifiedK-means clustring provides better reuslts in group image segmentation as compared to other methods. These grouped images are given to classification part where these images are classified to produce result of malignant and benign melanoma tumours. For that various neural networks are discussed in which Hybrid CNN (CNN + IHHO) classifier gives much better accuracy than other methods like ResNet, VGG, and DenseNet. Finally, with the help of the above improved and evaluated methods we can easily identify and classify and most importantly diagnose them at early stages.



---

*Source: 6952304-2022-02-10.xml*