# An Ensemble of Deep Learning Enabled Brain Stroke Classification Model in Magnetic Resonance Images

Authors: Ala’ A. Eshmawi; Mashael Khayyat; Abeer D. Algarni; Inès Hilali-Jaghdam
Journal: Journal of Healthcare Engineering
 (2022)

---

## Abstract

Brain stroke is a major cause of global death and it necessitates earlier identification process to reduce the mortality rate. Magnetic resonance imaging (MRI) techniques is a commonly available imaging modality used to diagnose brain stroke. Presently, machine learning (ML) and deep learning (DL) models can be extremely utilized for disease detection and classification processes. Amongst the available approaches, the convolutional neural network (CNN) models have been widely used for computer vision and image processing issues such as ImageNet, facial detection, and digit classification. In this article, a novel computer aided diagnosis (CAD) based brain stroke detection and classification (CAD-BSDC) model has been developed for MRI images. The proposed CAD-BSDC technique aims in classifying the provided MR brain image as normal or abnormal. The CAD-BSDC technique involves different subprocesses such as preprocessing, feature extraction, and classification. Firstly, the input image undergoes preprocessing using adaptive thresholding (AT) technique for improving the image quality. Followed by, an ensemble of feature extractors such as MobileNet, CapsuleNet, and EfficientNet models are used. Besides, the hyperparameter tuning of the deep learning models takes place using the improved dragonfly optimization (IDFO) algorithm. Moreover, satin bowerbird optimization (SBO) based stacked autoencoder (SAE) is used for the classification of brain stroke. The design of optimal SAE using the SBO algorithm shows the novelty of the work. The performance of the presented technique was validated utilizing benchmark dataset which includes T2-weighted MR brain image collected from the axial axis with size of 256 × 256. The simulation outcomes indicated the promising efficiency of the proposed CAD-BSDC technique over the latest state of art approaches in terms of various performance measures.


---

## Body

## 1. Introduction

Strokes are the 3rd most common cause of death around the world as per the report of the world health organization (WHO). With around 87% the more common type are ischemic strokes, caused by disturbance in the brain blood supply. Measuring volume and lesion location could assist diagnoses and guide treatment decisions [1]. Moreover, lesion classification plays a significant role in cognitive neuroscience research. This frequently includes an anatomical analysis, where brain area is associated with the neurological deficit that requires manual examinations of massive stroke image databases. Hence, an automated methodology for segmenting ischemic lesions in brain images is extremely needed [2, 3]. Ischemic stroke lesions undergo several developmental stages. The moment of partial or total loss of blood supply to the infected brain areas is called the onset of the stroke and marks the beginning of the hyperacute stage. At onset, the infection areas are separated into a core of infarcted tissue and a surrounding penumbra of under perfused, however possibly salvageable tissue i.e., partially provided by collateral blood flow [4]. The stroke developmental phase is related to amount of cell death and reconstructing mechanism which affects visibility of the stroke area in magnetic resonance imaging (MRI), mostly by the migration of water molecules [5].Brain imaging methodologies, namely, computed tomography (CT) and MRI are very supportive for a physician for starting the early screening of the patients [6]. Also, there are several imaging modalities for analyzing brain that might involve diffuse optical imaging, X-ray imaging, positron emission tomography, magnetoencephalography, and functional MRI [7]. But this imaging technique requires well-trained operators and higher operating costs, thus many of these imaging methods may not be presented in every hospital and clinic. Image classification is broadly utilized in medical imaging systems [8]. But the classification method outcomes must be closer to the manual diagnoses.This study introduces a novel computer aided diagnosis (CAD) based brain stroke detection and classification (CAD-BSDC) model on MRI images. The proposed CAD-BSDC technique involves preprocessing using adaptive thresholding (AT) technique to improve the image quality. In addition, an ensemble of feature extractors such as MobileNet, CapsuleNet, and EfficientNet models are used. Besides, the hyperparameter tuning of the deep learning models takes place using the improved dragonfly optimization (IDFO) algorithm. Furthermore, satin bowerbird optimization (SBO) based stacked autoencoder (SAE) is used to classify the MR brain image as normal or abnormal. The experimental result analysis of the CAD-BSDC technique takes place utilizing benchmark dataset which comprises T2-weighted MR brain images.


## 2. Literature Review

Currently, deep learning (DL) method was widely utilized as a classification system since it calculates features automatically within the convolution layer of the deep system [9]. The major benefit of utilizing DL method is that it outperforms other traditional methodologies for the classification of images. Several DL methodologies have existed like deep belief nets (DBN), RNNs, LSTM, and so on. Amongst this method, convolutional neural network (CNN) was widely employed in medical image processing and computer vision challenges such as house numbers digit classification, ImageNet, patch classification from medical images, face recognition, and so on [10].Nishio et al. [11] evaluated and developed an automated acute ischemic stroke (AIS) detection method including 2-phase DL models. Next, the 2-phase method implemented the AIS recognition system in the testing set. To evaluate the detection outcomes, a board-certified radiologist assessed the testing set head CT image with and without help of detection system [12]. Hilbert et al. [13] examined DL methods to build model to directly forecast better reperfusion afterward endovascular treatment (EVT) and better functional outcomes using CT images. This model does not need image annotation and is faster to calculate. The study compared DL to ML methods using conventional radiological image biomarkers. Pan et al. [14] investigated a new method based mainly on DL-ResNet for detecting infarct cores on non-contrast CT images and enhancing the performance of acute ischemic stroke diagnoses. They endlessly enrolled magnetic resonance diffusion weighted image (MR-DWI) confirmed first-episode ischemic stroke patients. Next, utilize decision curve analysis (DCA) model for analyzing the values of this technique in medical settings.Zhang et al. [15] introduced a DL method that leverages MRI diffusion series for classifying TSS based medically validated threshold. Also, the study presented an intradomain task-adoptive transfer learning technique that includes model training on simple medical tasks (stroke recognition) and refined the method with distinct binary thresholds of TSS. Wang et al. [16] evaluated and developed a DL based method to assist the selection of appropriate patients with acute ischemic stroke for endovascular treatment-based 3D pseudo-continuous arterial spin labeling (pCASL). The DL and six ML methods have been trained by using 10-fold CV.


## 3. The Proposed Model

In this study, a new CAD-BSDC model has been developed for MRI images for classifying them into normal or abnormal. The CAD-BSDC technique involves different subprocesses such as AT based preprocessing, ensemble of feature extraction, IDFO-based hyperparameter tuning, SAE-based classification, and SBO-based parameter tuning. Figure1 illustrates the overall process of CAD-BSDC technique.Figure 1
Overall process of CAD-BSDC technique.


### 3.1. Image Preprocessing Using at Technique

At the primary level, the AT technique is applied on MRI images to remove the noise and enhance the quality. It is an effective method to determine the infected regions by the use of thresholding concept. In the AT technique, the investigation of the MRI images takes place for the distributed pixel intensities and the threshold value is chosen. In this case, the input MRI image can be denoted asgx,y, I implies the threshold value, and the final image can be defined as fx,y. It can be mathematically defined as follows [17]:(1)fx,y=1,gx,y≥I,0,otherwise.


### 3.2. Ensemble of Feature Extraction Approaches

During the feature extraction process, the ensemble of feature extractors namely MobileNet, CapsuleNet, and EfficientNet models are used. The DL is a type of CNN and has extremely utilized for images [18]. In recent times, DL was extremely utilized in the analysis of several medicinal diseases. Also, several researchers are developed by analysis of skin disease utilizing DL. The DL has several linked layers using distinct weight as well as activation functions. A fundamental DL technique involves convolution, pooling, and connected layers. Many activation functions were utilized for adjusting the weight. During this case, EfficientNetB3 was utilized for glaucoma detection. The EfficientNetB3 is current, cost-efficient, and robust technique established by scaling 3 parameters namely depth, width, and resolution [19]. An EfficientNetB3 method with noisy-student weight was utilized from scenarios I and III to the transfer learning (TL) procedure, but “isicall_eff3_weights” weight is utilized as pretrained to scenarios II and IV. The GlobalAveragePooling2D layers were added to all scenarios for generalizing the optimum model. The amount of parameters is decreased. Also, the rectified linear unit (ReLU) activation function was utilized with 3 dense and 2 dropout layers. The resultant layer has several outcome units to multiclass classification utilizing the softmax activation functions. Figure 2 demonstrates the structure of CapsNet.Figure 2
Structure of CapsNet.The MobileNet [20] has lesser framework, minimum computation, and superior precision that is utilized to mobile terminal and embedding devices. According to depthwise separable convolutional, MobileNets utilize 2 global hyperparameters for keeping a balance amongst efficacy and accuracy. The basic concept of MobileNet is decomposition of convolutional kernel. With utilizing depthwise separable convolutional, the typical convolutional was decomposed as to depthwise convolutional and pointwise convolutional with convolutional kernels. The depthwise convolutional filter execute convolutional for all channels, and convolutional was utilized for combining the outcomes of depthwise convolutional layer. During this technique, N typical convolutional kernel. The typical convolution filters integrate an input as to a novel group of outputs, but the depthwise separable convolutional separates the inputs as to 2 layers, one to filter and another to merge. The MobileNetV2 establishes novel components with inverted remaining framework.In order to compensate for shortcomings of CNN, the network framework named the CapsNet was presented [21]. The CapsNet is a deep network technique involving capsules. The capsule was comprised of a set of neurons. The activation neuron signifies the features of modules from the objects. All the capsules are responsible to determine a single module from the object, and every capsule jointly defines the entire framework of objects. Conversely, for any DNNs (for instance, DBN), this framework preserves object modules and spatial data. Related to CNN, the CapsNet was comprised of multi-layer networks.


### 3.3. Hyperparameter Tuning Using IDFO Algorithm

For optimally adjusting the hyperparameters of the DL models, the IDFO algorithm is applied. The DFO method was coined by Mirjalili at Griffith University in 2016 [22]. This method is a meta-heuristic approach-based SI is stimulated by dynamic as well as static behaviors of dragonflies in nature. There are 2 primary phases of optimization: exploitation and exploration. These two stages are modelled by dragonflies, either statically or dynamically searching for food or avoiding the enemy. The 2 further behaviors are added to these three fundamental behavior in DA: move to the food and avoid the enemy. Thus, once each individual moves to food source (equation (5)), they need to avoid the enemy simultaneously (equation (6)).(2)Si=−∑j=1NX−Xj,Ai=∑j=1NVjN,Ci=∑j=1NXjN−X,Fi=X+−X,Ei=X−+X,where, X indicates the immediate location of the individual, in which Xj indicates the immediate location of jth individual. N characterizes the amount of neighboring individuals, in which yj shows the speed of jth neighboring individual. X+ and X− denotes the position of the food and enemy source, correspondingly [23]. The overall steps of the DFO algorithm are given in 1.Algorithm 1: Pseudocode of DFO Algorithm.
Parameter InitializationAssume maximum number of hyperspheresRepresent the archive sizeWhile the termination criteria is not fulfilledDetermine the objective value of every dragonflyCompute nondominated solutionUpgrade the archives based on the attained nondominated solutionIf the archive is occupiedExecute the archive maintenance scheme to discard the present archive memberAppend the newly attained solutions to the archiveEnd ifIf any of the newly appended solutions to the archive is situated external the hyper sphereUpgrade and reposition the hypersphere for covering the newly obtained solutionsEnd ifElect a food source from archiveElect an enemy from archiveUpgrade step vector by the use ofTΔx=Δx/Δx2+1Upgrade position vector byXt+1=−Xtr<TΔxt+1Xtr≥TΔxt+1Ensure and adjust the newly obtained position depending upon the boundary variableEnd whileTo upgrade the place of artificial dragonflies in the searching space and simulate the motion, two vectors are taken into consideration: position (X) and step (X). The step vector considers as speed, shows the direction of dragonfly motion (equation (7)). Then estimating the step vectors, the position vector is upgraded (equation (8)):(3)∇Xt+1=sSi+aAi+cCi+fFi+eEi+w∇Xt,Xt+1=Xt+∇Xt+1.In which, andf,e,w, and t represents the food factor, enemy factor, inertia coefficient, iteration number, correspondingly and the, a, and c indicates separation, alignment, and cohesion coefficient, correspondingly. This coefficient and the abovementioned factor enable to implementation of exploitative and exploratory behaviors. In the IDFO algorithm, the traditional DFO algorithm is integrated into the flower authorization algorithm, we set the value ranges Smin,Smax. To efficiently evade the situation where the dragonfly collectively gathers in the first phase, the uniform distribution is utilized for implementing random initialization process on all the dimensions [24],(4)xid0=Smin+Smax−Smin.Afterward preprocessing, the 2 procedures are further merged for guiding the dragonfly to fly to an optimal location.


### 3.4. Image Classification Using SBO-SAE Model

Finally, the SBO-SAE model can be employed for the classification of MRI images. The SAE is developed based on the concept of auto encoder (AE). In SAE model, the encoding part of the AE is stacked together, i.e., the input of initial layer of an AE model is actual data and the input of lower layer is hidden layer data. Lastly, a classification model is appended to the network [25]. The training process of the SAE model involves the pretraining and the inverse fine-tuning procedure. It makes use of a huge quantity of unlabeled data for unsupervised learning, independently extracted the features, and utilizes the labelled data for inverse fine tuning of the network. For boosting the performance of the SAE technique, the weight and bias values are optimally chosen by the SBO algorithm.SBO technique begins generating a primary uniform arbitrary population that contains a group of places to bower [26]. All positions (pop(i).Pos) are determined to the parameter which is supposed that optimize as written in equation (6). It could be noticeable the value of primary population lie among the existing minimal as well as maximal limit of optimizing parameters.(5)popi⋅Pos=rand1,nvar⋅VarMax−VarMin+VarMin,∀i∈nPop.Comparatively, same as ABC, the probability of fascinating of male/femaleProbi to bower was calculated as follows.(6)Probi=costi∑k=1nPopcosti,∀i∈nPop,costi=11+fxi,fxi≥0,1+fxi,fxi<0.Same as other evolutionary dependent upon optimizer, elitism was utilized for storing an optimum solution(s) at all iterations of optimized procedure. In the mating season, males like every other bird utilize its drives for building and decorating the bower. Noticeably, older and experienced males are appealed further attention of others to their bower. Conversely, this bower has further fitness than the other bower. During the SBO processes, the place of an optimum bower created by bird was estimated as elite ofkth iteration xelite,k that is maximum fitness and is capable of affecting the other places. In all iterations, a novel modification at some bower was computed dependent upon equation demonstrated in (7)χiknew=χi,kold+βkxjk+xelite,k2−χi,kold.It can be worth maintaining that roulette wheel selective process was utilized for picking up bower with superior probabilityxjk. In SBO, Parameter βk defines the count of steps for selecting target bowers that are calculated to all variables and modified based on(8)βk=α1+Propi.Arbitrary modifies were executed toxik with specific probability, where normal distribution (N) has been utilized with average of xi,kold and variance of σ as stated in equation.(9)Xikneω∼Xikold+σ⋅N0,1,σ=Z⋅VarMax−VarMin.Finally, all the cycle is an old population and population attained in modifies as aforementioned were evaluated, integrated, sorted and novel population was created. The pseudocode of SBO algorithm is given in2.Algorithm 2:Pseudocode of SBO Algorithm.
Input: populationPsp⟶Output: optimal searching agent,Pbst⟶Procedure SOAParameter Initialization:CA and CBDetermine the fitness of every search agentPbst⟶← optimal searching agentWhilez<Maxiterationsdofor every searching agent doUpgrade the location of searching agentend forUpgrade variablesCA and CBDetermine fitness value of all searching agentsUpgradePbst⟶ when better solution exist over earlier optimum solutionz←z+1End whileReturnPbst⟶End procedureThe SBO approach develops a FF for attaining enhanced classification efficiency. It defines a positive integer for representing the optimum efficiency of candidate solution. During this case, the minimized classification error rate was regarded as FF is provided in equation (10). The optimum solutions have reduced error rates and the worst solutions obtain an enhanced error rate.(10)fitnessxi=ClassifierErrorRatexi,=number of  misclassified instancestotal number of instances∗100.


## 3.1. Image Preprocessing Using at Technique

At the primary level, the AT technique is applied on MRI images to remove the noise and enhance the quality. It is an effective method to determine the infected regions by the use of thresholding concept. In the AT technique, the investigation of the MRI images takes place for the distributed pixel intensities and the threshold value is chosen. In this case, the input MRI image can be denoted asgx,y, I implies the threshold value, and the final image can be defined as fx,y. It can be mathematically defined as follows [17]:(1)fx,y=1,gx,y≥I,0,otherwise.


## 3.2. Ensemble of Feature Extraction Approaches

During the feature extraction process, the ensemble of feature extractors namely MobileNet, CapsuleNet, and EfficientNet models are used. The DL is a type of CNN and has extremely utilized for images [18]. In recent times, DL was extremely utilized in the analysis of several medicinal diseases. Also, several researchers are developed by analysis of skin disease utilizing DL. The DL has several linked layers using distinct weight as well as activation functions. A fundamental DL technique involves convolution, pooling, and connected layers. Many activation functions were utilized for adjusting the weight. During this case, EfficientNetB3 was utilized for glaucoma detection. The EfficientNetB3 is current, cost-efficient, and robust technique established by scaling 3 parameters namely depth, width, and resolution [19]. An EfficientNetB3 method with noisy-student weight was utilized from scenarios I and III to the transfer learning (TL) procedure, but “isicall_eff3_weights” weight is utilized as pretrained to scenarios II and IV. The GlobalAveragePooling2D layers were added to all scenarios for generalizing the optimum model. The amount of parameters is decreased. Also, the rectified linear unit (ReLU) activation function was utilized with 3 dense and 2 dropout layers. The resultant layer has several outcome units to multiclass classification utilizing the softmax activation functions. Figure 2 demonstrates the structure of CapsNet.Figure 2
Structure of CapsNet.The MobileNet [20] has lesser framework, minimum computation, and superior precision that is utilized to mobile terminal and embedding devices. According to depthwise separable convolutional, MobileNets utilize 2 global hyperparameters for keeping a balance amongst efficacy and accuracy. The basic concept of MobileNet is decomposition of convolutional kernel. With utilizing depthwise separable convolutional, the typical convolutional was decomposed as to depthwise convolutional and pointwise convolutional with convolutional kernels. The depthwise convolutional filter execute convolutional for all channels, and convolutional was utilized for combining the outcomes of depthwise convolutional layer. During this technique, N typical convolutional kernel. The typical convolution filters integrate an input as to a novel group of outputs, but the depthwise separable convolutional separates the inputs as to 2 layers, one to filter and another to merge. The MobileNetV2 establishes novel components with inverted remaining framework.In order to compensate for shortcomings of CNN, the network framework named the CapsNet was presented [21]. The CapsNet is a deep network technique involving capsules. The capsule was comprised of a set of neurons. The activation neuron signifies the features of modules from the objects. All the capsules are responsible to determine a single module from the object, and every capsule jointly defines the entire framework of objects. Conversely, for any DNNs (for instance, DBN), this framework preserves object modules and spatial data. Related to CNN, the CapsNet was comprised of multi-layer networks.


## 3.3. Hyperparameter Tuning Using IDFO Algorithm

For optimally adjusting the hyperparameters of the DL models, the IDFO algorithm is applied. The DFO method was coined by Mirjalili at Griffith University in 2016 [22]. This method is a meta-heuristic approach-based SI is stimulated by dynamic as well as static behaviors of dragonflies in nature. There are 2 primary phases of optimization: exploitation and exploration. These two stages are modelled by dragonflies, either statically or dynamically searching for food or avoiding the enemy. The 2 further behaviors are added to these three fundamental behavior in DA: move to the food and avoid the enemy. Thus, once each individual moves to food source (equation (5)), they need to avoid the enemy simultaneously (equation (6)).(2)Si=−∑j=1NX−Xj,Ai=∑j=1NVjN,Ci=∑j=1NXjN−X,Fi=X+−X,Ei=X−+X,where, X indicates the immediate location of the individual, in which Xj indicates the immediate location of jth individual. N characterizes the amount of neighboring individuals, in which yj shows the speed of jth neighboring individual. X+ and X− denotes the position of the food and enemy source, correspondingly [23]. The overall steps of the DFO algorithm are given in 1.Algorithm 1: Pseudocode of DFO Algorithm.
Parameter InitializationAssume maximum number of hyperspheresRepresent the archive sizeWhile the termination criteria is not fulfilledDetermine the objective value of every dragonflyCompute nondominated solutionUpgrade the archives based on the attained nondominated solutionIf the archive is occupiedExecute the archive maintenance scheme to discard the present archive memberAppend the newly attained solutions to the archiveEnd ifIf any of the newly appended solutions to the archive is situated external the hyper sphereUpgrade and reposition the hypersphere for covering the newly obtained solutionsEnd ifElect a food source from archiveElect an enemy from archiveUpgrade step vector by the use ofTΔx=Δx/Δx2+1Upgrade position vector byXt+1=−Xtr<TΔxt+1Xtr≥TΔxt+1Ensure and adjust the newly obtained position depending upon the boundary variableEnd whileTo upgrade the place of artificial dragonflies in the searching space and simulate the motion, two vectors are taken into consideration: position (X) and step (X). The step vector considers as speed, shows the direction of dragonfly motion (equation (7)). Then estimating the step vectors, the position vector is upgraded (equation (8)):(3)∇Xt+1=sSi+aAi+cCi+fFi+eEi+w∇Xt,Xt+1=Xt+∇Xt+1.In which, andf,e,w, and t represents the food factor, enemy factor, inertia coefficient, iteration number, correspondingly and the, a, and c indicates separation, alignment, and cohesion coefficient, correspondingly. This coefficient and the abovementioned factor enable to implementation of exploitative and exploratory behaviors. In the IDFO algorithm, the traditional DFO algorithm is integrated into the flower authorization algorithm, we set the value ranges Smin,Smax. To efficiently evade the situation where the dragonfly collectively gathers in the first phase, the uniform distribution is utilized for implementing random initialization process on all the dimensions [24],(4)xid0=Smin+Smax−Smin.Afterward preprocessing, the 2 procedures are further merged for guiding the dragonfly to fly to an optimal location.


## 3.4. Image Classification Using SBO-SAE Model

Finally, the SBO-SAE model can be employed for the classification of MRI images. The SAE is developed based on the concept of auto encoder (AE). In SAE model, the encoding part of the AE is stacked together, i.e., the input of initial layer of an AE model is actual data and the input of lower layer is hidden layer data. Lastly, a classification model is appended to the network [25]. The training process of the SAE model involves the pretraining and the inverse fine-tuning procedure. It makes use of a huge quantity of unlabeled data for unsupervised learning, independently extracted the features, and utilizes the labelled data for inverse fine tuning of the network. For boosting the performance of the SAE technique, the weight and bias values are optimally chosen by the SBO algorithm.SBO technique begins generating a primary uniform arbitrary population that contains a group of places to bower [26]. All positions (pop(i).Pos) are determined to the parameter which is supposed that optimize as written in equation (6). It could be noticeable the value of primary population lie among the existing minimal as well as maximal limit of optimizing parameters.(5)popi⋅Pos=rand1,nvar⋅VarMax−VarMin+VarMin,∀i∈nPop.Comparatively, same as ABC, the probability of fascinating of male/femaleProbi to bower was calculated as follows.(6)Probi=costi∑k=1nPopcosti,∀i∈nPop,costi=11+fxi,fxi≥0,1+fxi,fxi<0.Same as other evolutionary dependent upon optimizer, elitism was utilized for storing an optimum solution(s) at all iterations of optimized procedure. In the mating season, males like every other bird utilize its drives for building and decorating the bower. Noticeably, older and experienced males are appealed further attention of others to their bower. Conversely, this bower has further fitness than the other bower. During the SBO processes, the place of an optimum bower created by bird was estimated as elite ofkth iteration xelite,k that is maximum fitness and is capable of affecting the other places. In all iterations, a novel modification at some bower was computed dependent upon equation demonstrated in (7)χiknew=χi,kold+βkxjk+xelite,k2−χi,kold.It can be worth maintaining that roulette wheel selective process was utilized for picking up bower with superior probabilityxjk. In SBO, Parameter βk defines the count of steps for selecting target bowers that are calculated to all variables and modified based on(8)βk=α1+Propi.Arbitrary modifies were executed toxik with specific probability, where normal distribution (N) has been utilized with average of xi,kold and variance of σ as stated in equation.(9)Xikneω∼Xikold+σ⋅N0,1,σ=Z⋅VarMax−VarMin.Finally, all the cycle is an old population and population attained in modifies as aforementioned were evaluated, integrated, sorted and novel population was created. The pseudocode of SBO algorithm is given in2.Algorithm 2:Pseudocode of SBO Algorithm.
Input: populationPsp⟶Output: optimal searching agent,Pbst⟶Procedure SOAParameter Initialization:CA and CBDetermine the fitness of every search agentPbst⟶← optimal searching agentWhilez<Maxiterationsdofor every searching agent doUpgrade the location of searching agentend forUpgrade variablesCA and CBDetermine fitness value of all searching agentsUpgradePbst⟶ when better solution exist over earlier optimum solutionz←z+1End whileReturnPbst⟶End procedureThe SBO approach develops a FF for attaining enhanced classification efficiency. It defines a positive integer for representing the optimum efficiency of candidate solution. During this case, the minimized classification error rate was regarded as FF is provided in equation (10). The optimum solutions have reduced error rates and the worst solutions obtain an enhanced error rate.(10)fitnessxi=ClassifierErrorRatexi,=number of  misclassified instancestotal number of instances∗100.


## 4. Experimental Validation

The performance validation of the CAD-BSDC technique takes place using the benchmark dataset [27], which contains MRI images under six distinct classes. The details relevant to the dataset are given in Table 1. Figure 3 shows the sample MRI images.Table 1
Dataset descriptions.
Categories of MR brain stroke imagesClass labelsDimensionsNumber of imagesAcute (speech arrest)Class 0256∗ 25625Cerebral haemorrhagesClass 1256∗ 25625Fatal strokeClass 2256∗ 25624Normal imagesClass 3256∗ 25654Subacute stroke (hesitating speech)Class 4256∗ 25626Subacute stroke (loss of sensation)Class 5256∗ 25624Figure 3
Sample test images.Figure4 shows the confusion matrices offered by the CAD-BSDC technique on the classification of brain stroke. The figure shows that the CAD-BSDC technique has effectually identified distinct classes of brain stroke. For instance, under 500 epochs, the CAD-BSDC technique has categorized 23 images in class 0, 24 images under class 1, 24 images in class 2, 52 images under class 3, 24 images in class 4, and 22 images in class 5, respectively. Simultaneously, in 1000 epochs, the CAD-BSDC approach has classified 23 images under class 0, 22 images in class 1, 24 images in class 2, 54 images under class 3, 23 images in class 4, and 22 images in class 5 correspondingly. Furthermore, under 1500 epochs, the CAD-BSDC methodology has classified 25 images in class 0, 21 images under class 1, 22 images in class 2, 52 images in class 3, 26 images in class 4, and 23 images in class 5 correspondingly. Furthermore, under 2000 epochs, the CAD-BSDC system has categorized 25 images in class 0, 20 images in class 1, 23 images in class 2, 54 images under class 3, 26 images in class 4, and 23 images in class 5 correspondingly.Figure 4
Confusion matrix of CAD-BSDC technique.
(a)(b)(c)(d)Table2 offers a detailed classification result analysis of the CAD-BSDC technique under various classes and epoch counts. The results ensured the effective performance of the CAD-BSDC technique interms of different measures.Table 2
Result analysis of CAD-BSDC technique with different classes and epoch counts.
ClassesSensitivitySpecificityAccuracyPrecisionF-scoreMCCEpoch-500Class 092.0098.0497.1988.4690.2088.58Class 196.0098.6998.3192.3194.1293.16Class 2100.0098.0598.3188.8994.1293.36Class 396.3099.1998.3198.1197.2096.00Class 492.31100.0098.88100.0096.0095.45Class 591.67100.0098.88100.0095.6595.13Average94.7199.0098.3194.6394.5593.61Epoch-1000Class 092.00100.0098.88100.0095.8395.30Class 188.0098.6997.1991.6789.8088.19Class 2100.0098.0598.3188.8994.1293.36Class 3100.0097.5898.3194.7497.3096.15Class 488.4698.6897.1992.0090.2088.58Class 591.67100.0098.88100.0095.6595.13Average93.3598.8398.1394.5593.8292.78Epoch-1500Class 0100.0098.0498.3189.2994.3493.56Class 184.00100.0097.75100.0091.3090.48Class 291.6799.3598.3195.6593.6292.67Class 396.3099.1998.3198.1197.2096.00Class 4100.00100.00100.00100.00100.00100.00Class 595.8397.4097.1985.1990.2088.77Average94.6399.0098.3194.7194.4493.58Epoch-2000Class 0100.0099.3599.4496.1598.0497.74Class 180.00100.0097.19100.0088.8988.02Class 295.83100.0099.44100.0097.8797.58Class 3100.0097.5898.3194.7497.3096.15Class 4100.0098.0398.3189.6694.5593.75Class 595.83100.0099.44100.0097.8797.58Average95.2899.1698.6996.7695.7595.13Table3and Figure 5 depict the overall classification result analysis of the CAD-BSDC technique under varying epochs. The results show that the CAD-BSDC technique has resulted in improved classification results. For instance, with 500 epochs, the CAD-BSDC technique has resulted in the sensy, specy, accuy, precn, Fscore, and MCC of 94.71%, 99%, 98.31%, 94.63%, 94.55%, and 93.61%, respectively. As well as, with 1000 epochs, the CAD-BSDC process has resulted in sensy, specy, accuy, precn, Fscore, and MCC of 93.35%, 98.83%, 98.13%, 94.55%, 93.82%, and 92.78% correspondingly. Furthermore, with 1500 epochs, the CAD-BSDC method has resulted to the sensy, specy, accuy, precn, Fscore, and MCC of 94.63%, 99%, 98.31%, 94.71%, 94.44%, and 93.58% correspondingly. Finally, with 2000 epochs, the CAD-BSDC approach has resulted in the sensy, specy, accuy, precn, Fscore, and MCC of 95.28%, 99.16%, 98.69%, 96.76%, 95.75%, and 95.13% correspondingly.Table 3
Overall Classification result analysis of CAD-BSDC technique.
No. of epochsSensitivitySpecificityAccuracyPrecisionF-scoreMCCEpoch-50094.7199.0098.3194.6394.5593.61Epoch-100093.3598.8398.1394.5593.8292.78Epoch-150094.6399.0098.3194.7194.4493.58Epoch-200095.2899.1698.6996.7695.7595.13Average94.4999.0098.3695.1694.6493.78Figure 5
Overall classification result analysis of CAD-BSDC technique.In order to ensure the improvements of the CAD-BSDC technique, a comprehensive comparison study is made in Table4 [28].Table 4
Comparative analysis of CAD-BSDC technique with existing approaches.
MethodsSensitivitySpecificityF-measureAccuracyCAD-BSDC94.4999.0096.6498.36SIFT-DT model91.0498.2391.9197.25SURF-DT model78.1095.1180.1592.62EM-PSORF92.5095.8095.1793.40EM-PSOSVM90.4094.6093.4493.20FODPSO-RF89.4093.7093.5492.40FODPSO-SVM88.3092.6091.6991.70Figure6 investigates the comparative accuracy analysis of the CAD-BSDC with recent methods on the test dataset. The figure demonstrated that the FODPSO-SVM technique has accomplished ineffectual outcomes with the least values of accuracy. In line with, the SURF-DT and FODPSO-RF techniques have obtained slightly increased values of accuracy. Followed by, the EM-PSORF and EM-PSOSVM techniques have reached moderately improved accuracy values. Though the SIFT-DT technique has reached near optimal accuracy of 97.25%, the CAD-BSDC technique has accomplished maximum accuracy of 98.36%.Figure 6
Accuracy analysis of CAD-BSDC technique with existing approaches.Figure7 explores the comparative sensy, specy, and Fmeasure analysis of the CAD-BSDC with current methodologies on the test dataset. The figure illustrates that the FODPSO-SVM approach has achieved ineffectual outcomes with the least values of sensy, specy, and Fmeasure. In line with, the SURF-DT and FODPSO-RF methodologies have attained slightly improved values of sensy, specy, and Fmeasure. Then, the EM-PSORF and EM-PSOSVM algorithms have reached better sensy, specy, and Fmeasure values. Although the SIFT-DT model has reached to near optimum sensy, specy, and Fmeasure of 91.04% 98.23%, and 91.91%, the CAD-BSDC model has attained maximal sensy, specy, and Fmeasure of 94.49%, 99%, and 96.64%.Figure 7
Comparative analysis of CAD-BSDC technique with existing methods.The above mentioned tables and figures demonstrated that the CAD-BSDC technique has showcased superior performance over the other techniques.


## 5. Conclusion

In this study, a new CAD-BSDC model has been developed for MRI images for classifying them into normal or abnormal. The CAD-BSDC technique involves different subprocesses such as AT based preprocessing, ensemble of feature extraction, IDFO-based hyperparameter tuning, SAE based classification, and SBO based parameter tuning. The experimental result analysis of the CAD-BSDC technique takes place utilizing benchmark dataset which includes T2-weighted MR brain images. The simulation outcomes indicated the promising efficiency of the proposed CAD-BSDC technique over the latest state of art approaches in terms of various performance measures. Thus, the CAD-BSDC technique can be realized in a real time environment to aid physicians. As a part of future extension, the classification performance of the CAD-BSDC technique can be enhanced by the use of DL-based segmentation approaches.



---

*Source: 7815434-2022-11-18.xml*