<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">IASC</journal-id>
<journal-id journal-id-type="nlm-ta">IASC</journal-id>
<journal-id journal-id-type="publisher-id">IASC</journal-id>
<journal-title-group>
<journal-title>Intelligent Automation &#x0026; Soft Computing</journal-title>
</journal-title-group>
<issn pub-type="epub">2326-005X</issn>
<issn pub-type="ppub">1079-8587</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">35905</article-id>
<article-id pub-id-type="doi">10.32604/iasc.2023.035905</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>CNN-LSTM: A Novel Hybrid Deep Neural Network Model for Brain Tumor Classification</article-title>
<alt-title alt-title-type="left-running-head">CNN-LSTM: A Novel Hybrid Deep Neural Network Model for Brain Tumor Classification</alt-title>
<alt-title alt-title-type="right-running-head">CNN-LSTM: A Novel Hybrid Deep Neural Network Model for Brain Tumor Classification</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Dhaniya</surname><given-names>R. D.</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Umamaheswari</surname><given-names>K. M.</given-names></name><xref ref-type="aff" rid="aff-2">2</xref><email>umamahek@srmist.edu.in</email></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Science and Engineering, SRM Institute of Science and Technology</institution>, <addr-line>Kattankulathur, 603202</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computing technologies, SRM Institute of Science and Technology</institution>, <addr-line>Kattankulathur, 603202</addr-line>, <country>India</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: K. M. Umamaheswari. Email: <email>umamahek@srmist.edu.in</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic"><year>2023</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>1</day><month>5</month><year>2023</year></pub-date>
<volume>37</volume>
<issue>1</issue>
<fpage>1129</fpage>
<lpage>1143</lpage>
<history>
<date date-type="received"><day>09</day><month>9</month><year>2022</year>
</date>
<date date-type="accepted"><day>24</day><month>2</month><year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Dhaniya and Umamaheswari</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Dhaniya and Umamaheswari</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_IASC_35905.pdf"></self-uri>
<abstract>
<p>Current revelations in medical imaging have seen a slew of computer-aided diagnostic (CAD) tools for radiologists developed. Brain tumor classification is essential for radiologists to fully support and better interpret magnetic resonance imaging (MRI). In this work, we reported on new observations based on binary brain tumor categorization using HYBRID CNN-LSTM. Initially, the collected image is pre-processed and augmented using the following steps such as rotation, cropping, zooming, CLAHE (Contrast Limited Adaptive Histogram Equalization), and Random Rotation with panoramic stitching (RRPS). Then, a method called particle swarm optimization (PSO) is used to segment tumor regions in an MR image. After that, a hybrid CNN-LSTM classifier is applied to classify an image as a tumor or normal. In this proposed hybrid model, the CNN classifier is used for generating the feature map and the LSTM classifier is used for the classification process. The effectiveness of the proposed approach is analyzed based on the different metrics and outcomes compared to different methods.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Brain tumor</kwd>
<kwd>segmentation</kwd>
<kwd>particle swarm optimization</kwd>
<kwd>CNN-LSTM</kwd>
<kwd>convolution neural network</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Diagnose brain tumors as soon as possible for the best chance of successful therapy. It&#x2019;s crucial to recognize the tumor&#x2019;s stage, pathological kind, and grade before deciding on a therapy method. Neuro-oncologists have benefited from CAD methods in a variety of ways. Tumor identification, categorization, and grading are all possible using CAD in neuro-oncology. The categorization of benign and malignant brain tumors using computer-aided design (CAD) is a hotly debated subject [<xref ref-type="bibr" rid="ref-1">1</xref>]. Glioma grading, a significant issue in cancer research [<xref ref-type="bibr" rid="ref-2">2</xref>], is another example of this. All of the aforementioned computer-aided design (CAD) technologies make use of brain MRI scans. Because MRI provides a greater contrast for brain soft tissues than computed tomography (CT) pictures, this is possible. Recently developed deep learning ideas in computer-aided medical diagnostics have enhanced performance. Medical image analysis of brain tumor research has widely utilized deep learning methods [<xref ref-type="bibr" rid="ref-3">3</xref>].</p>
<p>The earlier a brain tumor can be detected, the better the prognosis. The use of brain MRI in the diagnosis of individuals with brain tumors is critical. The ability of MRIs to give high-resolution information on brain structure and abnormality has a significant effect on medical image processing and analysis [<xref ref-type="bibr" rid="ref-4">4</xref>,<xref ref-type="bibr" rid="ref-5">5</xref>]. Neuroradiologist looks for tumors in brain images to see whether there are any abnormalities there. However, if a large amount of MRI data is being examined, there is a risk of incorrect categorization. Another reason for misdiagnosis is that human eyesight becomes less sensitive as the number of instances increases, especially when just a few slices are affected. It&#x0027;s also a lengthy process. As a result, an effective method for analyzing and classifying brain anomalies is required. An early diagnosis will enable the harm to be repaired and the appropriate therapy to be given to the patient as quickly as possible. For medical diagnosis, MRI scans are increasingly widely utilized in hospitals and clinics, particularly in brain imaging. With MRI, you can see details in soft tissues more clearly and it&#x0027;s painless. No ionizing radiation is used in MRI scans. Because it is non-radioactive, non-aggressive, and pain-free, MRI is often utilized in brain imaging.</p>
<p>Because of its efficient design and intricate connections without needing a large number of nodes, deep learning algorithms have recently established trends in object categorization [<xref ref-type="bibr" rid="ref-6">6</xref>]. Deep learning algorithms, particularly DLSTM, were used to classify brain MRI images as cancerous or benign in this study. The suggested approach makes use of augmentation methods including rotating, cropping, zooming, CLAHE equalization, and Random Rotation with panoramic stitching because of data constraints.</p>
<p>The rest of the paper is organized as follows; the proposed topic-related manuscript is analyzed in Section 2 and the proposed concept is explained in Section 3. In Section 4, experimental results are analyzed and the conclusion part is presented in Section 5.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Works</title>
<p>Many of the researchers had developed tumor classification using machine learning algorithms. Among them some of the works are analyzed here; According to Huang et al. [<xref ref-type="bibr" rid="ref-7">7</xref>], various data augmentation techniques are evaluated by using the most up-to-date deep learning modulation classifier. Modulated signals may be used to enhance the deep learning-based classifier using three different techniques: rotation, flip, and Gaussian noise. These methods can be used both during training and during classification. Calculations indicate that all three augmentation techniques increase classification accuracy. The rotation augmentation technique beats the flip method, both of which produce a better classification accuracy than the Gaussian noise method. An original 100% training dataset with no augmentation may achieve better classification accuracy with rotation and flip augmentation given just 12.5% of it.</p>
<p>Meta et al. [<xref ref-type="bibr" rid="ref-8">8</xref>] presented a classification model to optimize the productivity of categorizing floral pictures utilizing Deep CNN for feature extraction and other machine learning techniques for classification applications. After that, we showed how picture augmentation may help you do better on tests of skill. In the end, we examined the results of several machine-learning classifiers, such as the Support Vector Machine (SVM), Random Forest (RF), KNN, and Multi-Layer Perceptron (MLP). We used two datasets to test our categorization system: Oxford-17 Flowers and Oxford-102 Flowers. To create training and test datasets, we split each dataset in half. Using SVM Classifier, we were able to get an accuracy of 98.5% for the Oxford 102-Flowers Dataset. A 99.8% accuracy rate using MLP Classifier was obtained while using it to classify the Oxford 17-Flower Dataset.</p>
<p>Ramirez Rochacand et al. [<xref ref-type="bibr" rid="ref-9">9</xref>] investigates the effectiveness of such a technique on three deep learning classifiers: MLP, CNN, and LSTM. To begin, they use the original dataset to create a baseline. In the second step, they use principal component analysis to prepare the dataset for analysis (PCA). Third, they use PCA to clean up the dataset before using our Gaussian data augmentation (GDA) method to add more information to it. Based on the confusion matrix and classification report, we may evaluate performance by utilizing k-fold cross-validation and compiling our findings in numerical as well as visual form. All three classifiers performed better when used in conjunction with our PCA &#x002B; GDA method, according to our tests.</p>
<p>A Fuzzy C-Mean (FCM) method was proposed by Saleck et al. [<xref ref-type="bibr" rid="ref-10">10</xref>] for determining a patient&#x2019;s brain tumor mass. Through the use of pixel intensities, we were able to overcome the estimating problem of the number of clusters in the FCM. In this method, the texture feature extraction algorithm GLCM (Gray Level Co-Occurrence Matrix) is utilized to extract the features needed to estimate the threshold value. System sensitivity, specificity, and accuracy are analyzed to determine its overall performance.</p>
<p>Brain MRI characteristics were extracted using a transfer learning method by Deepak [<xref ref-type="bibr" rid="ref-11">11</xref>]. Meningioma, glioma, and pituitary tumors are the subject of this study, which uses a three-class categorization system. The input brain MRI characteristics are extracted using the GoogLeNet transfer learning model and then fed back into the model. SVM and KNN algorithms were used to classify the deep CNN feature that had been extracted. For 5-fold cross-validation, this method had a precision of 98 percent.</p>
<p>Sajjada et al. [<xref ref-type="bibr" rid="ref-12">12</xref>] demonstrated a deep-learning technique for categorizing multigrade brain tumors. Using a CNN model, the tumor is first segmented, and then different parameters are added to the segmented data to enhance the training samples before the model is trained using the pre-trained VGG-19 CNN model. These computations are 87.38% reliable with the raw data and 91.67% accurate with upgraded data.</p>
<p>Amin [<xref ref-type="bibr" rid="ref-13">13</xref>] used an image fusion technique to discriminate tumor- and non-tumor-bearing regions of the brain using MRI. MRI structural and texture data from the T1C, T1, and T2 MRI sequences are combined to look for brain tumors. Next, the combined data has been analyzed. Fusion uses the Daubechies wavelet kernel of the Discrete Wavelet Transform (DWT). When a fusion tumor is compared to a single sequence, the fusion process produces a more informative tumor. A partial differential diffusion filter (PDDF) is used to attenuate noise in the combined image. The brain MRI is segmented using the global thresholding method into the foreground (tumor) and background (non-tumor) areas.</p>
<p>In the above literature, the authors developed brain tumor classification using different algorithms with better output. Even though, some of the improvements are urgently needed for brain tumor classification. In [<xref ref-type="bibr" rid="ref-7">7</xref>], the accuracy of the classification system is to be improved. In [<xref ref-type="bibr" rid="ref-8">8</xref>], they used a limited number of images for the classification process. Moreover, some method needs improvement in time complexity and accuracy. To overcome the problems, in this paper efficient method is presented.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Proposed Tumour Classification Using Optimized LSTM Classifier</title>
<p>The proposed approach aims to effectively segment the tumor portion and classify a class of the tumor. To achieve this objective, hybrid CNN-LSTM is utilized. The overall structure of recommended technique is given in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. The recommended technique involves four main steps namely, pre-processing, data augmentation, segmentation, and classification. In the beginning, the images are given to the pre-processing stage to remove the noise present in the image. Then, to increase the dataset quantity, the data augmentation process is used. For data augmentation, five operations are used Cropping, rotation, Zooming, contrast limited adaptive histogram equalization (CLAHE), and RRPS Algorithm. Then, the enhanced images are segmented using the APSO algorithm. After the segmentation, each segmented portion is given to the hybrid CNN-LSTM classifier to classify an image as normal. Finally, the performance of the proposed approach is evaluated. The proposed system architecture is given in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Proposed system architecture</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_35905-fig-1.tif"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Preprocessing</title>
<p>Patient data may be seen on the pictures in the database since they are unprocessed and noisy. Rician and salt-and-pepper noise dominate medical pictures [<xref ref-type="bibr" rid="ref-14">14</xref>]. The wiener filter works well with salt and pepper noise, as well as unipolar and bipolar impulse noise [<xref ref-type="bibr" rid="ref-15">15</xref>]. The wiener filter is employed in this technique to remove noise before the judgment step to obtain accuracy. One of the finest techniques for removing noise from MRI images is to use a wiener filter with a mask size of 7 &#x002A; 7. Because patient movement causes distortions or noise in these pictures.
<list list-type="bullet">
<list-item>
<p>Image degradation due to additive noise and blur may be remedied using the MSE-optimal stationary linear Wiener filter.</p></list-item>
<list-item>
<p>To compute the Wiener filter, the signal and noise processes must be considered to be second-order stationery (in the random process sense).</p></list-item>
<list-item>
<p>The frequency domain is where Wiener filters are most often used. To get X from a deteriorated picture, one uses the DFT (Discrete Fourier Transform) (u,v). The Wiener filter G estimates the original picture spectrum by taking the product X(u,v) (u,v) [<xref ref-type="bibr" rid="ref-16">16</xref>]</p></list-item>
</list></p>
<p><disp-formula id="eqn-1">
<label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">u</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="normal">G</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">u</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">X</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">u</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Data Augmentation</title>
<p>The amount of information in the dataset under consideration is very little. To achieve high accuracy, a classification model must be trained on a large volume of data. Images will be transformed into new kinds of data by changing size, zoom range, and theta. It creates new information from the old pictures by adjusting the angle, zoom, and flip. The model under consideration carries out the following five tasks:
<list list-type="bullet">
<list-item>
<p>Cropping</p></list-item>
<list-item>
<p>Rotation</p></list-item>
<list-item>
<p>Zoom</p></list-item>
<list-item>
<p>CLAHE equalization</p></list-item>
<list-item>
<p>Panorama stitching with random rotation</p></list-item>
</list></p>
<sec id="s3_2_1">
<label>3.2.1</label>
<title>Cropping</title>
<p>The Centre patch of each frame may be cropped as a feasible processing step for image data that has a combination of height and width dimensions. You may also use random cropping in conjunction with translations to get the same results. With random cropping, smaller inputs will be produced, but with translations, the original image&#x2019;s spatial dimensions are preserved. Let the upper-left corner&#x2019;s coordinates serve as the origin, and the bottom-right corner&#x2019;s coordinates serve as the end. (x, y) pixels in the new picture are equivalent to (x &#x002B; origin.x, y &#x002B; origin.y) pixels in the old image in terms of coordinates.</p>
</sec>
<sec id="s3_2_2">
<label>3.2.2</label>
<title>Rotation</title>
<p>Incorporating visual rotation in matching, alignment, and other image-based algorithms is quite ubiquitous. An image rotation method has three inputs: a picture, a rotation angle, and a rotation point. Rotation augmentations include turning the picture by 30 degrees either right or left. As previously mentioned, the rotation degree parameter significantly influences rotation augmentation safety. When a point&#x2019;s coordinates (u<sub>1</sub>, v<sub>1</sub>) is rotated by an angle around (u<sub>0</sub>, v<sub>0</sub>), the new coordinates are (u<sub>2</sub>, v<sub>2</sub>) [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>].</p>
<p><disp-formula id="eqn-2">
<label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mi>u</mml:mi><mml:mn>2</mml:mn><mml:mo>=</mml:mo><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>u</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi><mml:mn>0</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>sin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>v</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>v</mml:mi><mml:mn>0</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="eqn-3">
<label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:mi>v</mml:mi><mml:mn>2</mml:mn><mml:mo>=</mml:mo><mml:mi>sin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>u</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi><mml:mn>0</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>v</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>v</mml:mi><mml:mn>0</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
</sec>
<sec id="s3_2_3">
<label>3.2.3</label>
<title>Zooming</title>
<p>Zooming simply means expanding a photograph such that the image&#x2019;s fine features become more apparent and distinct. Zooming pictures requires the use of pixel replication. Narrowest neighbor interpolation is yet another name for it. This technique duplicates the pixels in the surrounding area, as the name suggests. By using this technique, new pixels are generated from the ones that have previously been provided. This technique duplicates each pixel n times, one in each row and column.</p>
</sec>
<sec id="s3_2_4">
<label>3.2.4</label>
<title>Contrast Limited Adaptive Histogram Equalization</title>
<p>As opposed to adaptive histogram equalization, contrast-restricted adaptive equalization is a more advanced version of it. It is a spatial domain contrast enhancement technique. It was first designed to improve the contrast in low-contrast medical pictures. In this method, pictures are divided into similar areas and equalization is found in every single region [<xref ref-type="bibr" rid="ref-16">16</xref>]. It flattens the distribution of grey levels, revealing more and more of the image&#x2019;s previously hidden highlights as a result. It equalizes a picture to the greatest extent possible while also limiting the contrast. Because of the high brightness required, this method is very beneficial when used.</p>
</sec>
<sec id="s3_2_5">
<label>3.2.5</label>
<title>RRPS Algorithm</title>
<p>RRPS rotates the picture at random and either adds new pixel values around the image or interpolates existing pixel values, depending on the results. Then it stitches the original image with the reference image. The steps of the RRPS algorithm are given below;
<list list-type="bullet">
<list-item>
<p>The clip is revolved right or left by 1&#x00B0; to 359&#x00B0; on an axis used for rotation augmentations.</p></list-item>
<list-item>
<p>The rotation degree parameter has a substantial impact on the rotation augmentation.</p></list-item>
<list-item>
<p>Then the similarity of the original image with the adjacent reference image which is having at least 40% of overlap is calculated. Then the images are placed in the order from left to right.</p></list-item>
<list-item>
<p>Further SIFT features among images are generated.</p></list-item>
<list-item>
<p>Then the correspondence between features is established.</p></list-item>
<list-item>
<p>An initial estimate of Homography using inlier correspondence points is estimated to refine the Homography estimate using Levenberg&#x2013;Marquardt optimization.</p></list-item>
<list-item>
<p>The above steps are repeated for each of the adjacent image pairs.</p></list-item>
<list-item>
<p>After obtaining Homographies for each of the picture pairs, get the demographics for the central image</p></list-item>
<list-item>
<p>All the images are projected using inverse warping.</p></list-item>
</list></p>
</sec>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Image Segmentation Using APSO Algorithm</title>
<p>After the data augmentation process, the images are given to the segmentation stage. For segmentation, in this paper, the APSO algorithm is utilized [<xref ref-type="bibr" rid="ref-17">17</xref>]. The APSO is a combination of PSO and oppositional-based learning (OBL) [<xref ref-type="bibr" rid="ref-18">18</xref>]. This OBL strategy avoids the local optimal of PSO and increases the searching ability. Using PSO-based methods for picture segmentation has been more common in the last decade. Using swarm intelligence, PSO is both a heuristic technique for global optimization and an optimization algorithm in and of itself. The idea of PSO was inspired by the behavior of swarms of particles and the social interactions that occur inside them. It&#x2019;s like behavior for birds to become dispersed or to travel in groups in quest of food. As the birds migrate in search of food, the bird closest to it will be able to detect the scent of that food. There are n swarm particles in PSO, and the location of each particle represents a possible solution. The step-by-step process of APSO-based segmentation is explained below;
<list list-type="bullet">
<list-item>
<p>Keep its inertia</p></list-item>
<list-item>
<p>Improve the situation by relocating it to its ideal location.</p></list-item>
<list-item>
<p>Ensure that the swarm is at the best possible location by updating the condition.</p></list-item>
</list></p>
<p><bold><italic>Step 1: Solution Encoding:</italic></bold> Solution encoding is a very crucial procedure for optimization. Initially, a user defines the number of clusters. Based on the number of clusters, the center points are randomly initialized. The center point is chosen in the X-axis value within the image width while the Y-axis value is within the image height. After the center point initialization, the parameters of PSO are also initialized.</p>
<p><bold><italic>Step 2: Opposite Solution Generation:</italic></bold> After the solution initialization, to enhance the searching ability opposite solutions are generated.</p>
<p><bold><italic>Step 3: Fitness Calculation:</italic></bold> After generating the initial solutions, the robustness of the solution is evaluated. The selection of fitness is a vital phase of the PSO algorithm. It is used to assess the ability (goodness) of solutions. The minimum distance is considered the objective function.</p>
<p><bold><italic>Step 4: Updation Using PSO:</italic></bold> After the fitness calculation, the solutions are updated using the PSO operations. The velocity and positions of pixels are updated using <xref ref-type="disp-formula" rid="eqn-4">Eqs. (4)</xref> and <xref ref-type="disp-formula" rid="eqn-5">(5)</xref>.</p>
<p><disp-formula id="eqn-4">
<label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:msubsup><mml:mi>&#x03BD;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>&#x03BD;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msubsup><mml:mi>r</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mi>p</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:msubsup><mml:mi>r</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mi>g</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-5">
<label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>&#x03BD;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:math></disp-formula></p>
<p>It is easy to see that in these two equations, each term represents a different quantity, such as the v<sup>k</sup><sub>id</sub> and x<sup>k</sup><sub>id</sub> denotes the speed of an individual particle at its most optimistic point in space and time pbest<sup>k</sup><sub>id</sub>, and the location of that particle in space and time xbest<sup>k</sup><sub>id</sub>. gbest<sup>k</sup><sub>id</sub> represents the swarm&#x2019;s optimistic d-dimension quantity. c 1 and c 2 represent the accelerating figures; they control the length while traveling to the most particle of the whole swarm and the most optimistic individual particle.</p>
<p><bold><italic>Step 5</italic>: Termination Criteria:</bold> The solutions are updated until attaining the optimal solution or best segmentation output. Once the solution is obtained, the algorithm will be terminated.</p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Classification Using Hybrid CNN-LSTM</title>
<p>After the segmentation process, the image is given to the input of a hybrid CNN-LSTM classifier. This classifier is a combination of individual CNN and LSTM classifiers. In this paper, for the training process, we set the learning rate as 0.005 with 1 &#x003D; 0.9 and 2 &#x003D; 0.999.</p>
<sec id="s3_4_1">
<label>3.4.1</label>
<title>Convolution Neural Network</title>
<p>CNN is a multilayer perceptron utilized for some applications like image classification, object identification, and medical image classification. The fundamental thought behind a CNN is that it can get local features from high-layer inputs and move them to lower layers for additional complex features. A CNN comprises of convolution layer, a pooling layer, and a completely associated layer. The convolutional layer incorporates a bunch of kernels for deciding the tensor of component maps. These kernels connect the whole input utilizing &#x201C;stride(s)&#x201D; with the goal that the elements of a result block become numbers. The elements of the input block are diminished after the convolutional layer is utilized to execute the striding process.</p>
<p><disp-formula id="eqn-6">
<label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:mi>M</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>I</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x2211;</mml:mo><mml:mo>&#x2211;</mml:mo><mml:msup><mml:mi>I</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>+</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where; I<sup>in</sup> represents the input matrix, K<sub>e</sub> represents a 2D filter of size <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>m</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:math></inline-formula>, and F represents the output of a 2D feature map. In this paper, rectified linear unit (ReLU) layer is used to maximize the non-linearity feature map. The mathematical expression of the ReLU function is given in <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref>.</p>
<p><disp-formula id="eqn-7">
<label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>0.</mml:mn><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The pooling layer is used to reduce the number of parameters and the fully connected layer performs the classification process.</p>
</sec>
<sec id="s3_4_2">
<label>3.4.2</label>
<title>LSTM Network</title>
<p>The LSTM is a sort of artificial neural network. Traditional neural networks don&#x0027;t think about consecutive factors. Additionally can&#x2019;t survey past substances. To fathom this issue, the RNN is proposed. In this idea, the hidden state Ht is taken the input At from the input state and produces the result Lt-1. This approach is primarily utilized for present model loss capability and assess the following layer yield Lt &#x002B; 1. Essentially RNN has criticism circles in a ceaseless layer. This licenses information to be taken care of in &#x2018;memory&#x2019; long term. Nonetheless, it is hard to prepare standard RNNs to settle an issue that requires learning long-haul fleeting conditions. This is because the slant of the misfortune cycle diminishes dramatically with time. To avoid the problem, an efficient LSTM is proposed, which can fix long-distance reliability.</p>
<p><disp-formula id="eqn-8">
<label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>tan</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>L</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula>where the hidden state control parameter is represented as c<sub>L,</sub> the weight parameter is denoted as w<sub>L</sub>, the input is represented as input A<sub>T</sub> and the tanL is utilized to add or remove data to the earlier input. the structure of LSTM is given in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. The LSTM consists of forget gate, input gate, output gate, and TanL layer.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Architecture of LSTM</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_35905-fig-2.tif"/>
</fig>
<p>The forget gate is calculated using <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref></p>
<p><disp-formula id="eqn-9">
<label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo fence="false" stretchy="false">&#x230A;</mml:mo><mml:mi>W</mml:mi><mml:mi>e</mml:mi><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>F</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>F</mml:mi></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">&#x230B;</mml:mo></mml:math></disp-formula>where, forget gate is represented as Ft, the control parameter of the forgetting gate is represented as CF, the weight of forget gate is represented as WeiF, the existing LSTM block output is represented as Lt-1 and the logistic sigmoid function is represented as &#x03C3;. For the situation, the output accomplished is the &#x2018;0&#x2019; signifies gates are blocked. If the result is &#x2018;1&#x2019; gates permit all to go through. The input gate function is given in <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref>.</p>
<p><disp-formula id="eqn-10">
<label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo fence="false" stretchy="false">&#x230A;</mml:mo><mml:mi>W</mml:mi><mml:mi>e</mml:mi><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>I</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>I</mml:mi></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">&#x230B;</mml:mo></mml:math></disp-formula>where, the input gate is representing I<sub>t</sub>, LSTM block present output is represented as A<sub>t</sub>, the weight present in the input gate is Wei<sup>I</sup> and the bias value of the input gate is represented as CI. The candidate value of tanL layer is calculated using <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref> as follows;</p>
<p><disp-formula id="eqn-11">
<label>(11)</label>
<mml:math id="mml-eqn-11" display="block"><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>tan</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>L</mml:mi><mml:mo fence="false" stretchy="false">&#x230A;</mml:mo><mml:mi>W</mml:mi><mml:mi>e</mml:mi><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>V</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">&#x230B;</mml:mo></mml:math></disp-formula>where V<sub>t</sub> represent the timestamp (t) for the cell state. tanL layer informs the network about weather information to be added or removed. The control parameter is C<sub>v</sub> and W<sub>v</sub> denotes the weight parameter. The output gate is calculated using <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref>.</p>
<p><disp-formula id="eqn-12">
<label>(12)</label>
<mml:math id="mml-eqn-12" display="block"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo fence="false" stretchy="false">&#x230A;</mml:mo><mml:mi>W</mml:mi><mml:mi>e</mml:mi><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>O</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>O</mml:mi></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">&#x230B;</mml:mo></mml:math></disp-formula>where, the output gate is denoted a O<sub>t</sub>, wo denote the weight value of the output neuron, and the bias value is denoted as C<sub>o</sub>. The output function is calculated using <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref>.</p>
<p><disp-formula id="eqn-13">
<label>(13)</label>
<mml:math id="mml-eqn-13" display="block"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mi>tan</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where, the &#x002A; denotes the vector&#x2019;s element-wise multiplication and the memory cell state is represented as V<sub>t</sub>. H<sub>t</sub> indicated the output of the current block. The total loss function of the LSTM system is given in <xref ref-type="disp-formula" rid="eqn-14">Eq. (14)</xref>.</p>
<p><disp-formula id="eqn-14">
<label>(14)</label>
<mml:math id="mml-eqn-14" display="block"><mml:mi>L</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></disp-formula>where T<sub>t</sub> is denoted as desired output and N represent the total number of data point to calculate the loss mean square error.</p>
</sec>
<sec id="s3_4_3">
<label>3.4.3</label>
<title>Hybrid CNN-LSTM</title>
<p>The proposed hybrid CNN-LSTM classifier is used to classify a given image as a normal or tumor image. The structure of the hybrid CNN-LSTM-based classification is given in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Structure of proposed hybrid CNN-LSTM</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_35905-fig-3.tif"/>
</fig>
<p>In this paper, a hybrid for automatic detection of tumor and non-tumor images is presented. CNN is used to extract features from the image and LSTM is used for the classification process. The proposed hybrid system consists of 20 layers, including 12 convolution layers, five pooling layers, a fully connected layer, an LSTM layer, and an output layer. Each convolution layer consists of two or three 2D CNNs and a pooling layer followed by a dropout layer. The convolution layer used a 3 &#x00D7; 3 kernel and ReLu activation function. A maximum-pooling layer with size 2 &#x00D7; 2 kernels is used to reduce the dimensions of the input image. In the last part of the architecture, the functional graph is transferred to the LSTM layer to extract the timing information. After the convolutional block, the output format is found to be (none, 7, 7, 512). Using the reconstruction method, the input size of the LSTM layer is (49, 512). After analyzing the time characteristics, the architecture sorts the X-ray images by fully connected layers, which are divided into two categories (normal image or tumor image).</p>
</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Results and Discussion</title>
<p>The experimental results of the proposed tumor classification are presented in this section. The proposed approach is implemented using MATLAB with windows 10 and 4 GB RAM. The performance of the proposed approach is analyzed based on different metrics. For experimental analysis images were collected from the UCI Machinery laboratory. The image&#x2019; test results are shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. <xref ref-type="fig" rid="fig-4">Fig. 4a</xref> depicts the original image, whereas <xref ref-type="fig" rid="fig-4">Fig. 4b</xref> depicts the filtered version of the primitive image. The rotated image is exposed in <xref ref-type="fig" rid="fig-4">Fig. 4c</xref>, while the cropped image is shown in <xref ref-type="fig" rid="fig-4">Fig. 4d</xref>. <xref ref-type="fig" rid="fig-4">Figs. 4e</xref> and <xref ref-type="fig" rid="fig-4">4f</xref> depict a zoomed-in picture and a segmented image. The Wiener filter is used to expel any distortion and noise from the primary picture. With the optimal pixel count, this image seems perfectly obvious. MATLAB is used throughout the whole brain tumor categorization procedure. A confusion matrix is presented in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Experimental results (a) primary image, (b) filtered image, (c) rotated image, (d) cropped image, (e) zoomed image, and (f) segmented output</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_35905-fig-4.tif"/>
</fig><fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Confusion matrix (a) Hybrid CNN-LSTM, (b) LSTM, (c) SVM, and (d) ANN</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_35905-fig-5.tif"/>
</fig>
<sec id="s4_1">
<label>4.1</label>
<title>Evaluation Metrics</title>
<p>Hybrid CNN-LSTM performance is obtained by counting the number of correct predictions of healthy and tumor images. To evaluate the quality of each designed architecture, the following performance metrics were used: accuracy, precision, recall, and specificity. These metrics are shown in the <xref ref-type="table" rid="table-1">Table 1</xref>.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Evaluation metrics</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Metrics</th>
<th align="center">Formula</th>
</tr>
</thead>
<tbody>
<tr>
<td>Accuracy</td>
<td><inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:msup><mml:mi>A</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:msup><mml:mi>A</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mstyle></mml:math></inline-formula></td>
</tr>
<tr>
<td>Specificity</td>
<td><inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:msup><mml:mi>A</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mstyle></mml:math></inline-formula></td>
</tr>
<tr>
<td>Recall</td>
<td><inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:msup><mml:mi>A</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mstyle></mml:math></inline-formula></td>
</tr>
<tr>
<td>Precision</td>
<td><inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:msup><mml:mi>A</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mstyle></mml:math></inline-formula></td>
</tr>
<tr>
<td>F-measure</td>
<td><inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:mrow></mml:mfrac></mml:mstyle></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>where; TR<sup>P</sup>, TR<sup>N</sup>, FA<sup>N</sup>, and FA<sup>P</sup> denote true positive, true negative, false negative, and false positive, respectively.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Comparative Analysis</title>
<p>To demonstrate the effectiveness of our recommended approach, we compare our work with various classifiers such as Support Vector Machine (SVM) [<xref ref-type="bibr" rid="ref-19">19</xref>], Artificial Neural Networks (ANN) [<xref ref-type="bibr" rid="ref-20">20</xref>], LSTM [<xref ref-type="bibr" rid="ref-21">21</xref>], and hybrid CNN-LSTM.</p>
<p>In <xref ref-type="fig" rid="fig-6">Fig. 6</xref>, the effectiveness of the recommended approach is discussed based on accuracy. A good classification system should have maximum accuracy. In <xref ref-type="fig" rid="fig-6">Fig. 6</xref>, we compare the effectiveness of the recommended approach with the different methods ANN, SVM, and LSTM. When analyzing <xref ref-type="fig" rid="fig-6">Fig. 6</xref>, the recommended approach reached a maximum accuracy of 92.03%, which is 88.5% for the LSTM-based classification, 87.06% for the SVM-based classification, and 85.7% for the ANN-based classification. This is due to the hybridization of CNN and LSTM. Similarly, in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, the efficiency of the recommended approach is depicted based on the recall measurement. When analyzing <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, the recommended approach attained a maximum recall of 92.36%, which is 3.32% better than the LSTM-based classification, 3.7% better than the SVM-based classification, and 5.19% better than the ANN-based classification. In <xref ref-type="fig" rid="fig-8">Fig. 8</xref>, the efficiency of the recommended approach is analyzed based on the specification. Again, the recommended approach achieved better results compared to the existing methods. In <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, the efficiency of the recommended approach is analyzed based on an accurate measurement. When analyzing <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, our proposed approach reached a maximum accuracy of 92.93%, which is high compared to other methods. Similarly, our proposed approach reached the maximum F-measure compared to other methods which is shown in <xref ref-type="fig" rid="fig-10">Fig. 10</xref>. The overall results of the proposed and existing approach are presented in <xref ref-type="table" rid="table-2">Table 2</xref>. It is clear from the results that the proposed approach achieved better results compared to other methods.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Comparative analysis based on accuracy</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_35905-fig-6.tif"/>
</fig><fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Comparative analysis based on sensitivity</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_35905-fig-7.tif"/>
</fig><fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Comparative analysis based on specificity</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_35905-fig-8.tif"/>
</fig><fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Comparative analysis based on precision</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_35905-fig-9.tif"/>
</fig><fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Comparative analysis based on F-measure</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_35905-fig-10.tif"/>
</fig><table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Overall outcome of proposed and existing methods</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Accuracy</th>
<th>Sensitivity</th>
<th>Specificity</th>
<th>Precision</th>
<th>F-measure</th>
</tr>
</thead>
<tbody>
<tr>
<td>ANN</td>
<td>85.7</td>
<td>87.8</td>
<td>82.3</td>
<td>86.7</td>
<td>88.6</td>
</tr>
<tr>
<td>SVM</td>
<td>87.06</td>
<td>89.06</td>
<td>83.56</td>
<td>88.06</td>
<td>89.4</td>
</tr>
<tr>
<td>LSTM</td>
<td>88.5</td>
<td>89.39</td>
<td>86.95</td>
<td>89.5</td>
<td>90.2</td>
</tr>
<tr>
<td>CNN-LSTM</td>
<td>92.03</td>
<td>92.36</td>
<td>91.42</td>
<td>92.93</td>
<td>94.3</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>This report outlines a precise and completely automated method for the categorization of brain tumors that requires very little pre-processing. To extract characteristics from MRI scans, the suggested system made use of deep transfer learning. To enhance the prediction rate, more pictures are added using data augmentation methods. More fresh examples may be generated by utilizing label-maintained modifications and a picture superimposition method for data augmentation. To capture the most essential information, superimposed augmented pictures over the matching original images are utilized for training in this study, the hybrid CNN-LSTM classification model applies them. A novel Random rotation with a panoramic stitching method is presented using current data augmentation techniques such as rotation, cropping, and zooming. The proposed approach attained a maximum accuracy of 92.03%.</p>
</sec>
</body>
<back>
<ack>
<p>The author with a deep sense of gratitude would thank the supervisor for his guidance and constant support rendered during this research.</p>
</ack>
<sec><title>Funding Statement</title>
<p>The authors received no specific funding for this study.</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>: The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Dabas</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Godara</surname></string-name></person-group>, &#x201C;<article-title>Classification of brain MRI tumor images: A hybrid approach</article-title>,&#x201D; <source>Procedia Computer Science</source>, vol. <volume>122</volume>, no. <issue>9</issue>, pp. <fpage>510</fpage>&#x2013;<lpage>517</lpage>, <year>2017</year>. <pub-id pub-id-type="doi">10.1016/j.procs.2017.11.400</pub-id></mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Mohan</surname></string-name> and <string-name><given-names>M. M.</given-names> <surname>Subashini</surname></string-name></person-group>, &#x201C;<article-title>MRI based medical image analysis: Survey on brain tumor grade classification</article-title>,&#x201D; <source>Biomedical Signal Processing and Control</source>, vol. <volume>39</volume>, pp. <fpage>139</fpage>&#x2013;<lpage>161</lpage>, <year>2019</year>. <pub-id pub-id-type="doi">10.1016/j.bspc.2017.07.007</pub-id></mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Talo</surname></string-name>, <string-name><given-names>U. B.</given-names> <surname>Baloglu</surname></string-name> and <string-name><given-names>U. R.</given-names> <surname>Acharya</surname></string-name></person-group>, &#x201C;<article-title>Application of deep transfer learning for automated brain abnormality classification using MR images</article-title>,&#x201D; <source>Cognitive Systems Research</source>, vol. <volume>54</volume>, no. <issue>C</issue>, pp. <fpage>176</fpage>&#x2013;<lpage>188</lpage>, <year>2019</year>. <pub-id pub-id-type="doi">10.1016/j.cogsys.2018.12.007</pub-id></mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Litjens</surname></string-name></person-group>, &#x201C;<article-title>A survey on deep learning in medical image analysis</article-title>,&#x201D; <source>Journal of Medical Image Analysis</source>, vol. <volume>42</volume>, no. <issue>13</issue>, pp. <fpage>60</fpage>&#x2013;<lpage>88</lpage>, <year>2017</year>. <pub-id pub-id-type="doi">10.1016/j.media.2017.07.005</pub-id>; <pub-id pub-id-type="pmid">28778026</pub-id></mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Singh</surname></string-name></person-group>, &#x201C;<article-title>A novel machine learning approach for detecting the brain abnormalities from MRI structural images</article-title>,&#x201D; in <conf-name>Proc. of IAPR Int. Conf. on Pattern Recognition in Bioinformatics</conf-name>, <publisher-loc>Berlin Heidelberg</publisher-loc>, <publisher-name>Springer</publisher-name>, pp. <fpage>94</fpage>&#x2013;<lpage>105</lpage>, <year>2012</year>. </mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Ravi</surname></string-name></person-group>, &#x201C;<article-title>Deep learning for health informatics</article-title>,&#x201D; <source>IEEE Journal of Biomedical and Health Informatics</source>, vol. <volume>21</volume>, no. <issue>1</issue>, pp. <fpage>4</fpage>&#x2013;<lpage>21</lpage>, <year>2017</year>. <pub-id pub-id-type="doi">10.1109/JBHI.2016.2636665</pub-id>; <pub-id pub-id-type="pmid">28055930</pub-id></mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Pan</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Qian</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Gao</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Data augmentation for deep learning-based radio modulation classification</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>1498</fpage>&#x2013;<lpage>1506</lpage>, <year>2020</year>. <pub-id pub-id-type="doi">10.1109/ACCESS.2019.2960775</pub-id></mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B. R.</given-names> <surname>Mete</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Ensari</surname></string-name></person-group>, &#x201C;<article-title>Flower classification with deep CNN and machine learning algorithms</article-title>,&#x201D; in <conf-name>Proc. of Int. Symp. on Multidisciplinary Studies and Innovative Technologies (ISMSIT)</conf-name>, <publisher-loc>Turkey</publisher-loc>, <year>2019</year>. </mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J. F.</given-names> <surname>Ramirez Rochacand</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Liang</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Oladunni</surname></string-name></person-group>, &#x201C;<article-title>A gaussian data augmentation technique on highly dimensional, limited labeled data for multiclass classification using deep learning</article-title>,&#x201D; in <conf-name>Proc. of Int. Conf. on Intelligent Control and Information Processing</conf-name>, <publisher-loc>Marrakesh, Morocco</publisher-loc>, pp. <fpage>14</fpage>&#x2013;<lpage>19</lpage>, <year>2019</year>. </mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Saleck</surname></string-name></person-group>, &#x201C;<article-title>Tumor detection in mammography images using fuzzy C-means and GLCM texture features</article-title>,&#x201D; in <conf-name>Int. Conf. on Computer Graphics, Imaging and Visualization</conf-name>, <publisher-loc>Marrakesh</publisher-loc>, pp. <fpage>122</fpage>&#x2013;<lpage>125</lpage>, <year>2017</year>. </mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Deepak</surname></string-name></person-group>, &#x201C;<article-title>Brain tumor classification using deep CNN features via transfer learning</article-title>,&#x201D; <source>Journal of Computers in Biology and Medicine</source>, vol. <volume>111</volume>, no. <issue>3</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>7</lpage>, <year>2019</year>. <pub-id pub-id-type="doi">10.1016/j.compbiomed.2019.103345</pub-id>; <pub-id pub-id-type="pmid">31279167</pub-id></mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Sajjada</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Khanb</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Muhammad</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>A. U.</given-names> <surname>Sung</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Multi-grade brain tumor classification using deep CNN with extensive data augmentation</article-title>,&#x201D; <source>Journal of Computational Science</source>, vol. <volume>30</volume>, pp. <fpage>174</fpage>&#x2013;<lpage>182</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Amin</surname></string-name></person-group>, &#x201C;<article-title>Brain tumor classification based on DWT fusion of MRI sequences using convolutional neural network</article-title>,&#x201D; <source>Pattern Recognition Letters</source>, vol. <volume>129</volume>, pp. <fpage>115</fpage>&#x2013;<lpage>122</lpage>, <year>2020</year>. <pub-id pub-id-type="doi">10.1016/j.patrec.2019.11.016</pub-id></mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Wasule</surname></string-name></person-group>, &#x201C;<article-title>Classification of brain MRI using SVM and KNN classifier</article-title>,&#x201D; in <conf-name>Third Int. Conf. on Sensing, Signal Processing and Security (ICSSS)</conf-name>, <publisher-loc>Chennai</publisher-loc>, pp. <fpage>218</fpage>&#x2013;<lpage>223</lpage>, <year>2017</year>. </mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Cadena</surname></string-name></person-group>, &#x201C;<article-title>Noise reduction techniques for processing of medical images</article-title>,&#x201D; in <conf-name>Proc. of the World Congress on Engineering</conf-name>, <publisher-loc>London</publisher-loc>, pp. <fpage>4</fpage>&#x2013;<lpage>9</lpage>, <year>2017</year>. </mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B. B.</given-names> <surname>Singh</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Patel</surname></string-name></person-group>, &#x201C;<article-title>Efficient medical image enhancement using CLAHE enhancement and wavelet fusion</article-title>,&#x201D; <source>International Journal of Computer Applications</source>, vol. <volume>167</volume>, no. <issue>5</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Poli</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Kennedy</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Blackwell</surname></string-name></person-group>, &#x201C;<article-title>Particle swarm optimization</article-title>,&#x201D; <source>Swarm Intelligence</source>, vol. <volume>1</volume>, no. <issue>1</issue>, pp. <fpage>33</fpage>&#x2013;<lpage>57</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Rahnamayan</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Ventresca</surname></string-name></person-group>, &#x201C;<article-title>Enhancing particle swarm optimization using generalized opposition-based learning</article-title>,&#x201D; <source>Information Sciences</source>, vol. <volume>181</volume>, no. <issue>20</issue>, pp. <fpage>4699</fpage>&#x2013;<lpage>4714</lpage>, <year>2011</year>. <pub-id pub-id-type="doi">10.1016/j.ins.2011.03.016</pub-id></mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Abdullah</surname></string-name>, <string-name><given-names>U. K.</given-names> <surname>Ngah</surname></string-name> and <string-name><given-names>S. A.</given-names> <surname>Aziz</surname></string-name></person-group>, &#x201C;<article-title>Image classification of brain MRI using support vector machine</article-title>,&#x201D; in <conf-name>The Proc. of the IEEE Int. Conf. on Imaging Systems and Techniques</conf-name>, <publisher-loc>Malaysia</publisher-loc>, pp. <fpage>242</fpage>&#x2013;<lpage>247</lpage>, <year>2011</year>. </mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Mohan</surname></string-name>, <string-name><given-names>S. S.</given-names> <surname>Chee</surname></string-name>, <string-name><given-names>D. K. P.</given-names> <surname>Xin</surname></string-name> and <string-name><given-names>L. P.</given-names> <surname>Foong</surname></string-name></person-group>, &#x201C;<article-title>Artificial neural network for classification of depressive and normal in EEG</article-title>,&#x201D; in <conf-name>2016 IEEE EMBS Conf. on Biomedical Engineering and Sciences (IECBES)</conf-name>, <publisher-loc>Malaysia</publisher-loc>, pp. <fpage>286</fpage>&#x2013;<lpage>290</lpage>, <year>2016</year>. </mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Hu</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Yang</surname></string-name></person-group>, &#x201C;<article-title>Bidirectional long short-term memory networks for relation classification</article-title>,&#x201D; in <conf-name>Proc. of the 29th Pacific Asia Conf. on Language, Information and Computation</conf-name>, <publisher-loc>China</publisher-loc>, pp. <fpage>73</fpage>&#x2013;<lpage>78</lpage>, <year>2015</year>. </mixed-citation></ref>
</ref-list>
</back>
</article>