# Artificial Intelligence-Enabled Medical Analysis for Intracranial Cerebral Hemorrhage Detection and Classification

Authors: Fanhua Meng; Jianhui Wang; Hongtao Zhang; Wei Li
Journal: Journal of Healthcare Engineering
 (2022)

---

## Abstract

Intracranial hemorrhage (ICH) becomes a crucial healthcare emergency, which requires earlier detection and accurate assessment. Owing to the increased death rate (around 40%), the earlier recognition and classification of disease using computed tomography (CT) images are necessary to ensure a favourable prediction and restrain the existence of neurologic deficits. Since the manual diagnosis approach is time-consuming, automated ICH detection and classification models using artificial intelligence (AI) models are required. With this motivation, this study introduces an AI-enabled medical analysis tool for ICH detection and classification (AIMA-ICHDC) using CT images. The proposed AIMA-ICHDC technique aims at identifying the presence of ICH and identifying the different grades. In addition, the AIMA-ICHDC technique involves the design of glowworm swarm optimization with fuzzy entropy clustering (GSO-FEC) technique for the segmentation process. Besides, the VGG-19 model was executed for generating a collection of feature vectors and the optimal mixed-kernel-based extreme learning machine (OMKELM) model is utilized as a classifier. To optimally select the weight parameter of the MKELM technique, the coyote optimization algorithm (COA) was utilized. A wide range of simulation analyses are carried out under varying aspects. As part of the AIMA-ICHDC method, ICH can be detected and graded using a single sample. For segmentation, the AIMA-ICHDC technique uses the GSO-FEC method, which is the design of glowworm swarm optimization (GSO). The comparative outcomes highlighted the betterment of the AIMA-ICHDC technique compared to the recent state-of-the-art ICH classification approaches in terms of several measures.


---

## Body

## 1. Introduction

This research topic is a serious case with a higher rate of morbidity and mortality [1]. Without intensive and rapid medication, it might cause an increase in intracranial pressure, resulting in brain herniation or permanent brain tissue damage [2]. Intracerebral brain hemorrhage (ICH) is brain bleeding caused by a ruptured blood artery in the head. As blood volume grows, pressure build-up can result in brain injury, unconsciousness, or even death. It occurs when a blood vessel in the skull rupture. It can be caused by a catastrophic brain injury or nontraumatic causes such an aneurysm rupture. These factors increase the chance of an intracranial hemorrhage. A CT (computed tomography) scan is the only method that can be used to accurately diagnose an intracranial hemorrhage and is therefore the gold standard for diagnosis. It is necessary to cite. 3T-MRI scanning can also be used in problematic instances. More specifically, extra-axial hemorrhage consists of three subclasses: subarachnoid hemorrhage resulting from ruptures or trauma of arteriovenous or aneurysms malformation, epidural hemorrhage resulting from trauma, and subdural hemorrhage caused by tearing of the connecting veins in the subdural space. Intra-axial hemorrhage consists of two subclasses: intraventricular (inside brain’s ventricles) and intraparenchymal (inside the brain tissue). Effective medical interference needs an accurate and urgent diagnosis for these serious conditions [3].Computed tomography (CT) imaging of the brain is generally conducted in the emergency department, in the early diagnosis test for severe ICH. In CT images, the pattern of bleeding and the anatomic location indicate the possible causes of the ICH. Precise interpretation is essential as misdiagnoses (missed or ICH incorrect classification) might contain medical consequences [4]. Additionally, investigating CT images for specific locations and types of ICH by radiotherapists could be time-consuming and complicated. Delays in diagnoses have a direct impact from onset to treatment for patients with ICH that might affect health consequences [5]. An automated diagnosis method to help accurate and just-in-time diagnosis of ICH as well as classification of its subtypes is crucial to quicken the process of decision-making in medical intervention to enhance consequences. The earlier diagnosis of ICH is essential for adequate scheduling of scanning and better treatment. Hence, several studies are designing computer-assisted CAD for ICH segmentation.The CAD system for the segmentation of ICH is depending on (i) manual segmentation where there is a requirement of experts for providing accurate input for segmentation or (ii) automated segmentation where hemorrhage is diagnosed without any medical intervention [6]. It is noteworthy that several research studies were carried out in manual segmentation and some studies were performed automated segmentation for ICH. Advancements in computer vision methods, like deep learning (DL), have proved enormous possibilities to extract significant data from healthcare images. Current developments are shown in technique as a great accomplishment in various segmentation with classification processes [7]. The CNN model, specially trained for segmentation or detection processes using prelabelled, large datasets, has progressed into promising methods for fully automated image assessments [8]. Recently, there has been some publication on the neural network that is capable of detecting and partially even classifying subtypes of ICH [9], along with estimating further pathologies, namely, midline shifts and skull fractures.This study introduces an AI-enabled medical analysis tool for ICH detection and classification (AIMA-ICHDC) using CT images. The proposed AIMA-ICHDC technique initially eradicates the noise using the median filtering (MF) technique. After that, image segmentation using glowworm swarm optimization with fuzzy entropy clustering (GSO-FEC) technique is applied. Moreover, VGG-19-based feature extraction with an optimal mixed-kernel-based extreme learning machine (OMKELM)-based classifier was used. Furthermore, the coyote optimization algorithm (COA) is employed for the parameter tuning process. In order to report the betterment of the AIMA-ICHDC technique, a comprehensive set of simulations are implemented using the benchmark ICH dataset.


## 2. Related Works

Joo et al. [10] proposed a DL method for automatic localization and detection of accuracy. Afterward automatic ground truth segmentation of aneurysm, a DL method-related three-dimensional ResNet frameworks are determined by the trained set. Its specificity, sensitivity, and positive predictive values are estimated in the external and internal test set. Kim et al. [11] proposed a CAD scheme for smaller-sized aneurysm ruptures with the help of CNN-based image of 3D digital subtraction angiography. A retrospective dataset that includes 368 persons has been utilized as trained cohorts for CNN with the TensorFlow framework. An aneurysm image in six directions is attained in all the patients, and the ROI in all the images has been extracted.Jnawali et al. [12] developed a fully automatic DL architecture that learns to identify brain hemorrhage-based cross-sectional CT images. First, the presented method extracts features by utilizing three-dimensional CNN and detecting brain hemorrhage with the help of logistic function as the final layers of the network. Lastly, developed an ensemble of three distinct three-dimensional CNN frameworks for improving the classification performances. Shi et al. [13] presented a DL-based method has better understanding of the quality of image and is verified with distinct manufacturers. The experiments are carried out in external and internal cohorts consecutively, where it attains an enhanced lesion- and patient-level sensitivity. Chen et al. [14] proposed an AI algorithm to enhance the performance of magnetic induction tomography (MIT) inverse problem. The DL systems, involving DAE, RBM, DBN, and SAE, are utilized for solving the nonlinear recreation problems of MIT and compared the recreation outcomes of DL networks.Solorio-Ramírez et al. [15] proposed a pattern classification technique, based on Minimalist Machine Learning (MML) implementation and a highly relevant feature selection method, so-called dMeans. Phan et al. [16] developed a method-based DL and Hounsfield unit systems. It describes the duration and level of hemorrhage as well as classifies the brain hemorrhagic region on the MRI image. From the experiment, we evaluated and compared three NN systems for selecting the relevant method for classification.


## 3. The Proposed Model

In this study, an effective AIMA-ICHDC technique has been developed for the classification and recognition of ICH using CT images. The AIMA-ICHDC technique encompasses several subprocesses such as preprocessing, segmentation, feature extraction, MKELM-based classification, and COA-based parameter optimization. The design of the GSO algorithm for improving the efficiency of the FEC technique and COA to tune the parameters of the MKELM technique helps for accomplishing enhanced ICH classification performance. Figure1 illustrates the process of the proposed AIMA-ICHDC technique.Figure 1
Overall working process of the AIMA-ICHDC approach.


### 3.1. MF-Based Preprocessing

Firstly, the CT images are preprocessed using MF technique to get rid of the noise that exists in them. MF according to their specificity is one of the applications from clinical image noise extraction [17]. An important idea behind MF is for presenting m×n neighborhood for assembling every neighborhood from the increasing order. This approach was demonstrated by the subsequent formula:(1)ym,n=medianxi,j,i,j∈C,where C indicates the centered neighborhood nearby place m,n of an image. During this case, an MF was implemented to digital noise extraction from the CT image.


### 3.2. Image Segmentation Using GSO-FEC Technique

During the image segmentation process, the GSO-FEC technique has been derived to identify the abnormal regions in the image. The FEC technique presented by Tran and Wagner [18] is a different generalized hard c‐means (HCM) clustering technique that gets benefits of fuzzy entropy. Assuming that X=x1,x2,…,xN are pictures with N pixels, and that xj denotes the feature of thejthpixel, this technique allows for the separation of an image with the main purpose minimised in terms of a distinct matrix U=uijC×N and aC cluster prototype C=ciC with 1<C<N.The typical FEC main purpose is provided as(2)JFECX,C,U=∑i=1C∑j=1Nuijd2xj,ci+n∑i=1C∑j=1Nuijloguij.It must fulfil the subsequent states:(3)U∈uij∈0,1|∑i=1Cuij=1,∀jand0∑j=1Nuij,∀i,where xj refers the feature of the jth pixel from the image, that is, the intensity value or gray values; d2xj,ci represents the feature xj and the cluster center ci. The Picard iteration was executed for solving this issue. The FEC main purpose, JFEC, is iteratively minimizing by utilizing the subsequent upgrade formulas:(4)uij=∑r=1Ced2xj,ci−d2xj,cr1/n−1,ci=∑j=1Nuijxj∑j=1Nuij.Once the technique is converged, a defuzzification procedure occurs for converting the partitioning matrixU to crisp separation. Generally, the maximal membership process technique that allocates the pixel j to cluster Ci with maximum membership was implemented as(5)Ci=argmaxuij,withi=1,2,…,C.Asuming the primary goal,JFEC(2), once it can be assumed cluster as fuzzy set. Therefore, minimized JFEC denotes the concurrently minimized dispersion from the cluster and maximized amount of membership of the member. But, this main function does not obtain as to account for some spatial data with bias alteration. This metric considers that all features of data points were similarly vital and independent of each other, and based on clusters with spherical shapes. This statement could not be continuously fulfilled in real applications, particularly from the image clustering segmentation.In order to avoid the local optima problem of the FEC technique, the GSO algorithm has been utilized. GSO is an advanced swarm intelligence approach presented by Pham and Kavitha [19, 20]. GSO was initially utilized to optimize multimodal functions with uneven or equivalent plan function values. In GSO, S glowworm swarm comprises m glowworm, which is dispersed in the objective function search space. All the glowworms gjj=1,…,m is allocated an arbitrary location pj within the provided function search space. Glowworm gj carries its own luciferin level Lj as well as has the vision range named as local decision range rdj. The luciferin level is based on the glowworm position and main function values. The glowworm with an optimum location is brighter than others, and then, it has high luciferin level values and is closer to the best possible solution. Each glowworm seeks the neighborhood set with the limited decision range and moves to the brighter one inside the neighborhood set. In the beginning, each glowworm carries an equivalent luciferin level L0. The rd and radial sensor range rs are initiated with the same values r0. Next, the iteration method comprises various luciferin upgrades and glowworm movement is implemented to detect the best possible solution. All over the luciferin level updates, the objective function is estimated at the present glowworm location pj and the luciferin levels for each glowworm are utilized for the new objective function value. The Lj luciferin levels are upgraded by(6)Ljt=1−ρLjt−1+γFpjt,where Ljt−1 represent the preceding luciferin level for glowworm j; γ indicates the luciferin enhancement fraction; p indicates the luciferin constant ρ∈0,1, and Fpjt signifies the glowworm j at present location pj; and t denotes the present iterations. Next, all the j glowworms explore their own neighborhood regions for extracting the neighbor that has the maximum luciferin levels by using the subsequent rules [21]:(7)z∈Njt,iffdjz<rdjtandLZt>Ljt,where d indicates the distance and Z represents the nearer glowworm to glowworm j,Njt implies the neighborhood set, djz indicates the Euclidean distance among glowworms j and z,rdjt signifies the local decision range for j glowworm, and LZt & Ljt indicate the luciferin level for glowworm z and j, respectively. Next, to choose the optimal neighbors from the neighborhood setting, the probability for each neighbor is estimated by(8)probjz=LZt−Ljt∑k∈NjtLkt−Ljt.Letz be the neighborhood set Njt of glowworm j. Later, all the glowworms select the direction of motion by the roulette wheel methodology where the glowworm with the high chance has a high possibility to be elected from the neighborhood set. Figure 2 depicts the flowchart of GSO technique.Figure 2
Flowchart of GSO.Later, the glowworm locationpj is altered according to the elected neighbor location pz as follows:(9)pjt=pjt−1+spzt−pjtDistancejz.--In the above equation (9)djz represent the Euclidean distance among glowworms j and z. Finally, local decision range rdj is altered using(10)rdjt=minrs,max0,rdjt−1+βnt−Njt−1,where rdjt−1 denotes the preceding rdj,rs indicates the radial sensor range constant, β represents a constant, nt signifies a constant variable utilized for restricting the neighborhood set size, and Njt implies the real neighborhood set size. In this presented model, the local decision range updating step can be relaxed and the values of rdj are set to be the same as rs constant. But, the nt and β parameters are also relaxed.OnceXi is decoded for attaining centers C, calculate fuzzy partition U Matrix, and the fitness function of the ith glowworm can be determined as follows:(11)fi=JGSO−FEC.The minimization offi is identical to the minimization of the objective function JGSO−FEC that resulted in optimum partition of the CT images.


### 3.3. VGG-19-Based Feature Extraction

At the time of feature extraction process, the VGG-19 model receives the segmented image as input and produces feature vectors. The VGG19 network was analogous to VGG16; however, this network would have nineteen layers rather than sixteen that consist of three FC dense layers and sixteen convolution layers. The 1st and 2nd layers have sixty-four filter of 3 × 3 kernel and pooling layers. The 2nd and 3rd convolution layers have 128 filters of 3 × 3 kernel and max pooling layers [22]. Consecutively, it has 4 convolution layers with 256 filters of 3 × 3 kernel and pooling layers. More than two sets of four convolution layers with 512 filters of 3 × 3 kernel and layers are sequentially organized. Then, this output is fed into FC layers. There are 3 FC dense layers with 1000, 4096, and 4096 neurons, respectively. The activation function was ReLu for each layer except the final dense layer in which softmax activation function was utilized.


### 3.4. Image Classification Using OMKELM Technique

At the final stage, the OMKELM model is applied for the classification process. The typical KELM is a kernel-based technique. As distinct functions provide various measures to the instance points, efficiency of various functions can be obtained significantly on the similar dataset. The ECG signals have the features of a huge volume, irregular distribution of instances produced by maximum dimension feature spaces, and imbalanced class. Utilizing a single kernel for processing ECG signals could not resolve the problem well. The kernel function was considered local or global kernel functions based on whether it is translation or rotation invariances [23]. The local kernel process was better at removing the features of instances. During the multikernel learning, an optimum kernel was assumed, that is, linear combination of the group of margins. The RBF and polynomial kernels are local and global kernel functions with optimum efficiency, respectively. The ECG signals exhibit several features, including (i) a high amount of data, (ii) an uneven distribution of instances created by maximum dimension feature spaces, and (iii) a class that is unequally distributed across the dataset. When it came to the processing of ECG signals, using a single kernel did not provide a sufficient solution to the problem. For balancing combination of the generalized capability and classifier efficiency, an MKELM was formed by linear combination of the RBF as well as polynomial kernels. The varied kernel functions are determined as(12)Kmix=λkrbfu,ui+1−λkpolyu,uj,where λ0<λ<1 refers the weight coefficients of linear and its combination.(13)krbfu,uj=exp−u−ui22σ2,kpolyu,ui=u⋅ui+1d,where d refers the fixed to two, as the dimension of polynomial space is nd; once the instance size was equivalent to 1000 and the index was equivalent to three, the dimension is attained 1 billion. When the dimension reaches one billion, the inner product computation generates a dimension disaster [24].At last, the resultant purpose of MKELM was determined as(14)fx=Kmixu,u1,…,Kmixu,uN1C+M−1T.To optimally tune the weight parameter of the MKELM model, the COA is applied to it. The population in the COA was separated to equivalent amount of coyotes per pack. All the coyote’s place was regarded as feasible solutions, and their social state (group of decision variables) signifies the main purpose. Primarily, this technique begins with arbitrarily allocated coyote places utilizing the subsequent formula.(15)Xi=lbi+ri×ubi−lb,where ubi and lbi signify the upper and lower bounds, respectively, ri refers the arbitrary number among zero and one, and Xi stands for the place of coyote of the ith dimension. In COA, the amount of coyotes per pack was restricted to 14. It can ensure the search ability of technique. An optimum coyote was determined as the optimum one modified to the environment. During the COA, the coyotes were ordered to contribute to packing maintenance and for sharing the social condition [25]. The social tendencies of pack were calculated utilizing the subsequent formula:(16)Yip,t=CNc+1/2p,t,Ncisodd,CNc+1/2,ip,t2,otherwise,where Nc refers the amount of coyotes, Yip,t represents the social tendencies of pth pack from the tth time, and C signifies the coyote-ranked social states. According to the birth and death (two important biological events of life), the birth of novel coyote was calculated dependent upon the subsequent formula:(17)Bip,t=Xr1,ip,t,rj≥Prs+Pra,ori=i1,Xr2,ip,t,ri<Prs,ori=i2,Ri,otherwise,where i1 and i2 stands for 2 arbitrary dimensions, r1 and r2 imply the 2 coyotes arbitrarily chosen in the pth pack, ri refers to the arbitrary number created from the range zero and one ,Pra denotes the connection probability, and Prs indicates the scatter probabilities. Pra and Prs is given as(18)Prs=1D,Pra=1−Prs2.During all iterations, all thecth coyotes from the pth pack upgrade their social state utilizing the succeeding formula:(19)Xcp,t+1=Xcp,t+r1×σ1+r2×σ2,Fcp,t+1<Fcp,t,Xcp,t,otherwise,where σ1 and σ2 signify the alpha and pack influences, respectively. It can be determined as(20)σ1=alphap,t−Xr1p,t,σ2=Yp,t−Xr2p,t,where alphap,t refers the alpha coyote and Fcp,t implies the social state cost (main function). It can be computed as(21)Fcp,t+1=fXcp,t.At last, optimum coyotes are chosen dependent upon the social conditions cost as optimum solutions attained of the problems.The COA approach develops an FF for attaining enhanced classifier efficiency. It defines a positive integer for representing the optimum efficiency of candidate solution. The error rate of the classifier was assumed to be FF (fitness function). An optimum solution has a lesser error rate and the worst solutions obtain an improved error rate:(22)fitnessxi=classifier error ratexi=number of misclassified instancestotal number of instances∗100.


## 3.1. MF-Based Preprocessing

Firstly, the CT images are preprocessed using MF technique to get rid of the noise that exists in them. MF according to their specificity is one of the applications from clinical image noise extraction [17]. An important idea behind MF is for presenting m×n neighborhood for assembling every neighborhood from the increasing order. This approach was demonstrated by the subsequent formula:(1)ym,n=medianxi,j,i,j∈C,where C indicates the centered neighborhood nearby place m,n of an image. During this case, an MF was implemented to digital noise extraction from the CT image.


## 3.2. Image Segmentation Using GSO-FEC Technique

During the image segmentation process, the GSO-FEC technique has been derived to identify the abnormal regions in the image. The FEC technique presented by Tran and Wagner [18] is a different generalized hard c‐means (HCM) clustering technique that gets benefits of fuzzy entropy. Assuming that X=x1,x2,…,xN are pictures with N pixels, and that xj denotes the feature of thejthpixel, this technique allows for the separation of an image with the main purpose minimised in terms of a distinct matrix U=uijC×N and aC cluster prototype C=ciC with 1<C<N.The typical FEC main purpose is provided as(2)JFECX,C,U=∑i=1C∑j=1Nuijd2xj,ci+n∑i=1C∑j=1Nuijloguij.It must fulfil the subsequent states:(3)U∈uij∈0,1|∑i=1Cuij=1,∀jand0∑j=1Nuij,∀i,where xj refers the feature of the jth pixel from the image, that is, the intensity value or gray values; d2xj,ci represents the feature xj and the cluster center ci. The Picard iteration was executed for solving this issue. The FEC main purpose, JFEC, is iteratively minimizing by utilizing the subsequent upgrade formulas:(4)uij=∑r=1Ced2xj,ci−d2xj,cr1/n−1,ci=∑j=1Nuijxj∑j=1Nuij.Once the technique is converged, a defuzzification procedure occurs for converting the partitioning matrixU to crisp separation. Generally, the maximal membership process technique that allocates the pixel j to cluster Ci with maximum membership was implemented as(5)Ci=argmaxuij,withi=1,2,…,C.Asuming the primary goal,JFEC(2), once it can be assumed cluster as fuzzy set. Therefore, minimized JFEC denotes the concurrently minimized dispersion from the cluster and maximized amount of membership of the member. But, this main function does not obtain as to account for some spatial data with bias alteration. This metric considers that all features of data points were similarly vital and independent of each other, and based on clusters with spherical shapes. This statement could not be continuously fulfilled in real applications, particularly from the image clustering segmentation.In order to avoid the local optima problem of the FEC technique, the GSO algorithm has been utilized. GSO is an advanced swarm intelligence approach presented by Pham and Kavitha [19, 20]. GSO was initially utilized to optimize multimodal functions with uneven or equivalent plan function values. In GSO, S glowworm swarm comprises m glowworm, which is dispersed in the objective function search space. All the glowworms gjj=1,…,m is allocated an arbitrary location pj within the provided function search space. Glowworm gj carries its own luciferin level Lj as well as has the vision range named as local decision range rdj. The luciferin level is based on the glowworm position and main function values. The glowworm with an optimum location is brighter than others, and then, it has high luciferin level values and is closer to the best possible solution. Each glowworm seeks the neighborhood set with the limited decision range and moves to the brighter one inside the neighborhood set. In the beginning, each glowworm carries an equivalent luciferin level L0. The rd and radial sensor range rs are initiated with the same values r0. Next, the iteration method comprises various luciferin upgrades and glowworm movement is implemented to detect the best possible solution. All over the luciferin level updates, the objective function is estimated at the present glowworm location pj and the luciferin levels for each glowworm are utilized for the new objective function value. The Lj luciferin levels are upgraded by(6)Ljt=1−ρLjt−1+γFpjt,where Ljt−1 represent the preceding luciferin level for glowworm j; γ indicates the luciferin enhancement fraction; p indicates the luciferin constant ρ∈0,1, and Fpjt signifies the glowworm j at present location pj; and t denotes the present iterations. Next, all the j glowworms explore their own neighborhood regions for extracting the neighbor that has the maximum luciferin levels by using the subsequent rules [21]:(7)z∈Njt,iffdjz<rdjtandLZt>Ljt,where d indicates the distance and Z represents the nearer glowworm to glowworm j,Njt implies the neighborhood set, djz indicates the Euclidean distance among glowworms j and z,rdjt signifies the local decision range for j glowworm, and LZt & Ljt indicate the luciferin level for glowworm z and j, respectively. Next, to choose the optimal neighbors from the neighborhood setting, the probability for each neighbor is estimated by(8)probjz=LZt−Ljt∑k∈NjtLkt−Ljt.Letz be the neighborhood set Njt of glowworm j. Later, all the glowworms select the direction of motion by the roulette wheel methodology where the glowworm with the high chance has a high possibility to be elected from the neighborhood set. Figure 2 depicts the flowchart of GSO technique.Figure 2
Flowchart of GSO.Later, the glowworm locationpj is altered according to the elected neighbor location pz as follows:(9)pjt=pjt−1+spzt−pjtDistancejz.--In the above equation (9)djz represent the Euclidean distance among glowworms j and z. Finally, local decision range rdj is altered using(10)rdjt=minrs,max0,rdjt−1+βnt−Njt−1,where rdjt−1 denotes the preceding rdj,rs indicates the radial sensor range constant, β represents a constant, nt signifies a constant variable utilized for restricting the neighborhood set size, and Njt implies the real neighborhood set size. In this presented model, the local decision range updating step can be relaxed and the values of rdj are set to be the same as rs constant. But, the nt and β parameters are also relaxed.OnceXi is decoded for attaining centers C, calculate fuzzy partition U Matrix, and the fitness function of the ith glowworm can be determined as follows:(11)fi=JGSO−FEC.The minimization offi is identical to the minimization of the objective function JGSO−FEC that resulted in optimum partition of the CT images.


## 3.3. VGG-19-Based Feature Extraction

At the time of feature extraction process, the VGG-19 model receives the segmented image as input and produces feature vectors. The VGG19 network was analogous to VGG16; however, this network would have nineteen layers rather than sixteen that consist of three FC dense layers and sixteen convolution layers. The 1st and 2nd layers have sixty-four filter of 3 × 3 kernel and pooling layers. The 2nd and 3rd convolution layers have 128 filters of 3 × 3 kernel and max pooling layers [22]. Consecutively, it has 4 convolution layers with 256 filters of 3 × 3 kernel and pooling layers. More than two sets of four convolution layers with 512 filters of 3 × 3 kernel and layers are sequentially organized. Then, this output is fed into FC layers. There are 3 FC dense layers with 1000, 4096, and 4096 neurons, respectively. The activation function was ReLu for each layer except the final dense layer in which softmax activation function was utilized.


## 3.4. Image Classification Using OMKELM Technique

At the final stage, the OMKELM model is applied for the classification process. The typical KELM is a kernel-based technique. As distinct functions provide various measures to the instance points, efficiency of various functions can be obtained significantly on the similar dataset. The ECG signals have the features of a huge volume, irregular distribution of instances produced by maximum dimension feature spaces, and imbalanced class. Utilizing a single kernel for processing ECG signals could not resolve the problem well. The kernel function was considered local or global kernel functions based on whether it is translation or rotation invariances [23]. The local kernel process was better at removing the features of instances. During the multikernel learning, an optimum kernel was assumed, that is, linear combination of the group of margins. The RBF and polynomial kernels are local and global kernel functions with optimum efficiency, respectively. The ECG signals exhibit several features, including (i) a high amount of data, (ii) an uneven distribution of instances created by maximum dimension feature spaces, and (iii) a class that is unequally distributed across the dataset. When it came to the processing of ECG signals, using a single kernel did not provide a sufficient solution to the problem. For balancing combination of the generalized capability and classifier efficiency, an MKELM was formed by linear combination of the RBF as well as polynomial kernels. The varied kernel functions are determined as(12)Kmix=λkrbfu,ui+1−λkpolyu,uj,where λ0<λ<1 refers the weight coefficients of linear and its combination.(13)krbfu,uj=exp−u−ui22σ2,kpolyu,ui=u⋅ui+1d,where d refers the fixed to two, as the dimension of polynomial space is nd; once the instance size was equivalent to 1000 and the index was equivalent to three, the dimension is attained 1 billion. When the dimension reaches one billion, the inner product computation generates a dimension disaster [24].At last, the resultant purpose of MKELM was determined as(14)fx=Kmixu,u1,…,Kmixu,uN1C+M−1T.To optimally tune the weight parameter of the MKELM model, the COA is applied to it. The population in the COA was separated to equivalent amount of coyotes per pack. All the coyote’s place was regarded as feasible solutions, and their social state (group of decision variables) signifies the main purpose. Primarily, this technique begins with arbitrarily allocated coyote places utilizing the subsequent formula.(15)Xi=lbi+ri×ubi−lb,where ubi and lbi signify the upper and lower bounds, respectively, ri refers the arbitrary number among zero and one, and Xi stands for the place of coyote of the ith dimension. In COA, the amount of coyotes per pack was restricted to 14. It can ensure the search ability of technique. An optimum coyote was determined as the optimum one modified to the environment. During the COA, the coyotes were ordered to contribute to packing maintenance and for sharing the social condition [25]. The social tendencies of pack were calculated utilizing the subsequent formula:(16)Yip,t=CNc+1/2p,t,Ncisodd,CNc+1/2,ip,t2,otherwise,where Nc refers the amount of coyotes, Yip,t represents the social tendencies of pth pack from the tth time, and C signifies the coyote-ranked social states. According to the birth and death (two important biological events of life), the birth of novel coyote was calculated dependent upon the subsequent formula:(17)Bip,t=Xr1,ip,t,rj≥Prs+Pra,ori=i1,Xr2,ip,t,ri<Prs,ori=i2,Ri,otherwise,where i1 and i2 stands for 2 arbitrary dimensions, r1 and r2 imply the 2 coyotes arbitrarily chosen in the pth pack, ri refers to the arbitrary number created from the range zero and one ,Pra denotes the connection probability, and Prs indicates the scatter probabilities. Pra and Prs is given as(18)Prs=1D,Pra=1−Prs2.During all iterations, all thecth coyotes from the pth pack upgrade their social state utilizing the succeeding formula:(19)Xcp,t+1=Xcp,t+r1×σ1+r2×σ2,Fcp,t+1<Fcp,t,Xcp,t,otherwise,where σ1 and σ2 signify the alpha and pack influences, respectively. It can be determined as(20)σ1=alphap,t−Xr1p,t,σ2=Yp,t−Xr2p,t,where alphap,t refers the alpha coyote and Fcp,t implies the social state cost (main function). It can be computed as(21)Fcp,t+1=fXcp,t.At last, optimum coyotes are chosen dependent upon the social conditions cost as optimum solutions attained of the problems.The COA approach develops an FF for attaining enhanced classifier efficiency. It defines a positive integer for representing the optimum efficiency of candidate solution. The error rate of the classifier was assumed to be FF (fitness function). An optimum solution has a lesser error rate and the worst solutions obtain an improved error rate:(22)fitnessxi=classifier error ratexi=number of misclassified instancestotal number of instances∗100.


## 4. Performance Validation

The experimental result analysis of the AIMA-ICHDC technique uses a benchmark ICH dataset [26] from the PhysioNet repository. The dataset includes a total of 341 ICH images, including epidural class of 171 images, 24 images in intraventricular, 72 images in intraparenchymal, 56 images in subdural, and 18 images in subarachnoid. The size of images is 512∗512 pixels. A few sample images are illustrated in Figure 3.Figure 3
Sample images.A brief ICH classification result analysis of the AIMA-ICHDC technique under distinct batch size (BS) is revealed in Table1. Figure 4 demonstrates the result analysis of the AIMA-ICHDC technique on the ICH images under BS of 32 and varying epochs. The experimental values indicated that the AIMA-ICHDC technique has attained effective ICH detection results. For instance, with 100 epochs, the AIMA-ICHDC technique has offered sensy, specf,precn, and accuy of 93.58%, 97.94%, 95.45%, and 95.68%, respectively. Along with that, with 500 epochs, the AIMA-ICHDC technique has attained sensy, specf,precn, and accuy of 94.63%, 97.02%, 96.36%, and 96.06%, respectively.Table 1
Result analysis of AIMA-ICHDC technique under varying batch size.
No. of epochsSensitivitySpecificityPrecisionAccuracyBatch size = 3210093.5897.9495.4595.6820093.3898.0995.4395.9330094.3298.0295.4495.6940094.5398.1196.4396.2750094.6397.0296.3696.06Average94.0997.8495.8295.93Batch size = 6410093.8998.6796.1496.7520093.8998.5595.9596.3130094.3498.2096.0896.4140095.9098.7096.1596.6550094.4098.3896.4396.23Average94.4898.5096.1596.47Batch size = 12810095.8499.1196.3096.0820095.7099.1996.9396.3130093.9099.1796.7396.8640095.3098.7196.0096.7250095.4997.9796.5596.58Average95.2598.8396.5096.51Figure 4
Result analysis of AIMA-ICHDC technique under BS of 32.Figure5 depicts the result analysis of the AIMA-ICHDC approach on the ICH images under BS of 64 and varying epochs. The experimental values show that the AIMA-ICHDC algorithm has gained effectual ICH detection outcomes. For instance, with 100 epochs, the AIMA-ICHDC system has obtained sensy, specf,precn, and accuy of 93.89%, 98.67%, 96.14%, and 96.75%, respectively. Also, with 500 epochs, the AIMA-ICHDC approach has obtained sensy, specf,precn, and accuy of 94.40%, 98.38%, 96.43%, and 96.23%, respectively.Figure 5
Result analysis of AIMA-ICHDC technique under BS of 64.Figure6 portrays the result analysis of the AIMA-ICHDC approach on the ICH images under BS of 128 and varying epochs. The experimental values represent that the AIMA-ICHDC methodology has effectively achieved ICH detection outcomes. For instance, with 100 epochs, the AIMA-ICHDC algorithm has obtainable sensy, specf,precn, and accuy of 95.84%, 99.11%, 96.30%, and 96.08%, respectively. At last, with 500 epochs, the AIMA-ICHDC method has reached sensy, specf,precn, and accuy of 95.49%, 97.97%, 96.55%, and 96.58%, respectively.Figure 6
Result analysis of AIMA-ICHDC technique under BS of 128.An average ICH result analysis of the AIMA-ICHDC technique taking place under varying BS is shown in Figure7. On the applied BS of 32, the AIMA-ICHDC technique has depicted increased average sensy, specf,precn, and accuy of 94.09%, 97.84%, 95.82%, and 95.93%, respectively. Likewise, on the applied BS of 64, the AIMA-ICHDC system has portrayed higher average sensy, specf,precn, and accuy of 94.48%, 98.50%, 96.15%, and 96.47%, respectively. Similarly, on the applied BS of 128, the AIMA-ICHDC method has outperformed maximum average sensy, specf,precn, and accuy of 95.25%, 98.83%, 96.50%, and 96.51%, respectively.Figure 7
Average analysis of AIMA-ICHDC technique under distinct BS.
(a)(b)(c)Figure8 shows the accuracy analysis of the AIMA-ICHDC approach on the test dataset. The outcomes outperformed that the AIMA-ICHDC method has accomplished enhanced performance with the higher training and validation accuracy. It can be revealed that the AIMA-ICHDC technique has achieved increased validation accuracy on the training accuracy.Figure 8
Accuracy graph analysis of AIMA-ICHDC technique.Figure9 demonstrates the loss analysis of the AIMA-ICHDC system on the test dataset. The results define that the AIMA-ICHDC technique has resulted in a proficient outcome with decreased training and validation loss. It can be stated that the AIMA-ICHDC methodology has presented lower validation loss on the training loss.Figure 9
Loss graph analysis of AIMA-ICHDC technique.Table2 provides an overall ICH detection performance analysis of the AIMA-ICHDC approach with existing techniques.Table 2
Comparative analysis of AIMA-ICHDC technique with existing approaches.
MethodsSensitivitySpecificityPrecisionAccuracyAIMA-ICHDC95.2598.8396.5096.51DL-ICH94.2297.6095.5795.58AMG-LSN92.0793.5793.7792.95Random forest90.6889.6389.3089.99WEM-DCNN83.6197.8390.5188.38Deep CNN87.8888.5188.6988.25SVM model76.4479.6378.3877.58Figure10 inspects the comparative analysis of the AIMA-ICHDC technique in terms of sensy and specy. The results reported that the SVM model has obtained lower values of sensy and specy. Besides, the WEM-DCNN and deep CNN techniques have attained slightly increased values of sensy and specy. Along with that, the RF model has resulted in moderate values of sensy and specy. Although the DL-ICH and AMG-LSTN techniques have reached reasonable values of sensy and specy, the proposed AIMA-ICHDC technique has shown outperforming results with the sensy and specy of 95.25% and 98.83%, respectively.Figure 10
Sensy and Specy analysis of AIMA-ICHDC technique with existing approaches.Figure11 examines the comparative analysis of the AIMA-ICHDC algorithm with respect to precn and accy. The outcomes stated that the SVM method has attained lesser values of precn and accy. In addition, the WEM-DCNN and deep CNN approaches have reached somewhat superior values of sensy and specy. Likewise, the RF technique has resulted in moderate values of precn and accy. Besides, the DL-ICH and AMG-LSTN methodologies have achieved reasonable values of precn and accy, and the projected AIMA-ICHDC technique has demonstrated outcomes with the precn and accy of 96.50% and 96.51%, respectively.Figure 11
Precn and Accy analysis of AIMA-ICHDC technique with existing approaches.Finally, a computation time (CT) analysis of the AIMA-ICHDC technique with other ICH detection models is shown in Table3 and Figure 12 [27–31]. From the figure, it can be observed that the SVM, deep CNN, and WEM-DCNN techniques have required higher CTs of 1.483 min, 1.284 min, and 1.268 min, respectively. Besides, the DL-ICH, AMG-LSN, and RF models have needed moderate CT of 0.498 min, 0.541 min, and 0.584 min, respectively. However, the AIMA-ICHDC technique has resulted in effective performance with the least CT of 0.354 min. From the results and discussion, it is ensured that the AIMA-ICHDC technique has attained maximum ICH detection and classification performance compared to existing techniques.Table 3
CT analysis of AIMA-ICHDC technique with other ICH detection models.
MethodsComputation time (min)AIMA-ICHDC0.354DL-ICH0.498AMG-LSN0.541Random forest0.584WEM-DCNN1.268Deep CNN1.284SVM model1.483Figure 12
CT analysis of AIMA-ICHDC algorithm with other ICH detection methods.


## 5. Conclusion

In this study, an effective AIMA-ICHDC technique has been developed with the classification and recognition of ICH using CT images. The AIMA-ICHDC technique encompasses several subprocesses such as preprocessing, GSO-FEC segmentation, feature extraction, MKELM-based classification, and COA-based parameter optimization. The design of the GSO algorithm for improving the efficiency of the FEC technique and COA to tune the parameters of the MKELM technique helps for accomplishing enhanced ICH classification performance. A lot of simulations are performed on the benchmark ICH dataset, and the results are looked at from a lot of different angles. Comparing the results, it was found that the AIMA-ICHDC strategy outperformed previous state-of-the-art ICH classification systems on a number of different factors. Using the AIMA-ICHDC approach, 0.354 minutes of CT time was saved. It is clear from the results and discussion that the AIMA-ICHDC technique has done the best job of finding and classifying ICHs than any other technique. For reporting the improvement of the AIMA-ICHDC approach, a comprehensive set of simulations are implemented utilizing the benchmark ICH dataset. Specifically, the AIMA-ICHDC technique combines glowworm swarm optimization with fuzzy entropy clustering (GSO-FEC) for the segmentation process. Additionally, the VGG-19 model was used to generate a set of feature vectors, and the optimal mixed-kernel-based extreme learning machine (OMKELM) model was used as a classifier. The coyote optimization algorithm (COA) was used to determine the ideal weight parameter for the MKELM method. Numerous simulation analyses are performed under a variety of different conditions. The AIMA-ICHDC technique’s classification performance can be improved by using DL-based image segmentation algorithms in the upcoming. The extensive result analysis portrayed the supremacy of the AIMA-ICHDC technique with other techniques in terms of different measures. In future, the classification performance of the AIMA-ICHDC technique was improved with the utilization of DL-based image segmentation approaches.



---

*Source: 2017223-2022-03-21.xml*