16 +ijisae-26
16 +ijisae-26
16 +ijisae-26
Abstract:Alzheimer's disease, also known as Alzheimer's degeneration, is an irreversible brain disorder affecting over 65-year-olds.AD
cannot currently be cured, but its progression can be slowed by certain treatments.It is imperative to diagnose AD accurately and early to
improve patient care and future treatment options.Many ways evaluate picture features to retrieve handmade characteristics and then
design a classifier to differentiate AD from other groups. The Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset is used to
propose a new method for categorizing AD and MCI.Preprocessing of brain pictures, including image segmentation, is essential for these
methods.To reduce noise and factor fluctuations, the pictures are preprocessed using several complex methods.The preprocessed images
are then used to segment the images.This study presents a novel classification algorithm based on deep learning and ResNet 50, inspired
by deep learning's success in image analysis.The suggested classifier approach allows the selection of relevant characteristics while
avoiding overfitting issues.When the proposed algorithm was compared to the existing models, the results proved that it had better
accuracy values.
Normal
ResNet-50 K-means Clustering
AD
a. Preprocessing Step 2: Depending on the grey scale in the above photo, make a
Pre-main processing's goal is to improve the picture's histogram for each contextual area.
uniformity. It removes or minimizes non-related and step 3: The contrast restricted histogram of the platform can be
unnecessary components in medical data to prepare them for calculated based on the CL score.
subsequent processing.
Contrast Limited Adaptive Histogram Equalisation 𝑁𝑎𝑣𝑔 = (𝑁𝑟𝑋 × 𝑁𝑟𝑌)/𝑁𝑔𝑟𝑎𝑦 (1)
In the first place, CLAHE was designed to aid in low-contrast Navg is the average number of pixels in the platform,N gray is
medical imaging.Regular AHE has different limitations.Noise the number of grayscale pixels, and NrX and NrY are the pixels
amplification was combated by implementing clipping per direction in the platform.
limitations on the CLAHENoise amplification was combated Step 4: Re-distribute the remaining pixels until none remain.
by implementing clipping limitations on the CLAHE.There are The following formula is used to determine the redistributing
multiple contextual components in the CLAHE picture, pixel stage:
including sub-images, tiles, and blocks. Two parameters are 𝑠𝑡𝑒𝑝 = 𝑁𝑔𝑟𝑎𝑦 /𝑁𝑟𝑒𝑚𝑎𝑖𝑛 (2)
critical in CLAHE: the Block Size (BS) and Clip Limit N_ pixels are still cut.A step is a one-digit positive integer. The
(CL).Image quality is determined by these two variables.Due to value indicates how many snipped pixels were left. A phase is
the low intensity of the input picture and the flattening effect of an integer that is at least one. Whilethe system scans from the
a larger CL, the picture appears brighter as CL is lowest to the highest grey level, as it did in the previous
increased.This dynamic range and visual contrast increase as step,the software will add one pixel to grey levels that are less
the BS grows larger. With the entropy of the picture [15, 16], than N CL.If there is unequal dispersion of pixels at the end of
the two factors set at the place with the greatest entropy the research, the algorithm will calculate a new path using
curvature give subjectively good picture quality. Eq.(2) and repeat the lookup until all leftover pixels are evenly
The phases in the CLAHE approach for enhancing the actual scattered.
photo are as follows:
Step 1: By converting the original pixel intensity into non- Step 5: Each region's brightness distribution is boosted by the
overlapping contextual zones.MN refers tothe "total number of Rayleigh transform.The accumulated probability
image tiles," and an 88 percent figure is optimum for 𝑃𝑖𝑛𝑝𝑢𝑡 (𝑖)function is employed on the trimmed histogram.When
preserving chromatic knowledge in photographs. the Rayleigh distribution is utilized, the underwater picture
International Journal of Intelligent Systems and Applications in Engineering IJISAE, 2022, 10(2)s, 96–104 | 98
looks to be more natural. The forward transform of Rayleigh is Gaussian mixture filtering, which provides a consistent filter in
calculated as follows: various situations. Both the expected and posterior densities of
the state are considered to be Gaussian mixes when using a
1 Gaussian mixture filter.
𝑦(𝑖) = 𝑌𝑚𝑖𝑛 √2𝛼 2 𝑙𝑛 ( ) (3) 𝐿∗
1−𝑃𝑖𝑛𝑝𝑢𝑡 (𝑖) ∗ ∗ ∗
𝑓𝑘∗ (𝑥𝑘 ) = ∑𝑖=1
𝑘
𝜔𝑘,𝑖 . 𝑁(𝑥𝑘 ; 𝑥𝑘,𝑖 , 𝐶𝑘,𝑖 ), 𝑤𝑖𝑡ℎ ∗∈ [𝑒, 𝑝] (8)
Where Y min is the pixel value's lower bound, and α is a
L_k^* is the number of mixture components for every time
Rayleigh distribution scaling parameter that is determined by
step is k.
the input image. The Rayleigh function has an α value of 0.04
b. Segmentation
in this investigation. For each brightness point, the
Medical image segmentation, also known as natural image
outcome probability density is:
segmentation, is the process of manually, semi-automatically,
or fully automating the extraction of the desired object (organ)
𝑦(𝑖)−𝑌𝑚𝑖𝑛 (𝑦(𝑖)−𝑌𝑚𝑖𝑛 )2
𝑃(𝑦(𝑖)) = 𝑒𝑥𝑝 (− ) for𝑦(𝑖) ≥ 𝑌𝑚𝑖𝑛 (4) from a medical image (2D or 3D). In a variety of applications,
𝛼2 2𝛼 2
medical picture classification is crucial. Microscopy,
A greater number will give in more significant picture contrast dermoscopy, X-ray, ultrasound, Computed Tomography (CT),
enhancement while also raising saturation and noise levels. Magnetic Resonance Imaging (MRI), and positron emission
Step 6: Mitigating the effect of a sudden change, Linear tomography are just a few of the imaging techniques that have
intensity stretch is used to rescale the result of the transfer recently gotten a lot of attention and funding. One of the most
function in Eq (9). The linear contrast stretch is calculated as significant medical imaging techniques is picture segmentation,
follows: which retrieves the ROI using a semiautomatic or automatic
process. It used border identification, tumor tracking, and mass
𝑥(𝑖)−𝑥𝑚𝑖𝑛 recognition in clinical uses to segment body organs and
𝑦(𝑖) = (5)
𝑥𝑚𝑎𝑥 −𝑥𝑚𝑖𝑛 tissues.Because classification divides a picture into logical
The transfer function's lowest and maximum variables are xmin sections, clustering algorithms can be used to professionally
and xmaxrespectively, and input data for this function is x(i). separate the ROI from the background by extracting the image's
Step 7: The grey scale distribution of pixels within a sub-matrix global properties [18].
system can be calculated using a bi-linear interpolation of four
separate mappings to remove border artefacts. • K-means Clustering
K-means is a clustering method or strategy that quickly and
Boosted Anisotropic diffusion filter easily organizes a massive quantity of information [19].In
contrast, the k-means algorithm relies on the initial cluster of
By maintaining fine details in the image, it primarily focuses on values to locate the centre and thus has a flaw.K- means
removing noise. After obtaining the scattered picture, this clustering produces optimal topical treatments as an outcome of
BADF includes the Partial Differential Equation (PDE), which the trials. The testing process, on the other hand, should result
gives the anisotropic scattering filter [17] an extra advantage. A in data similarities or proximity. As a result, it can be divided
type of diffusion that is lacking at the edges and borders can into multiple clusters, each with a high degree of similarity
also be used to smooth the surface. among cluster locations. As cited by (celebi et al. 2013), K-
Means is a multifaceted approach due to the ease with which it
The smoothing scheme in anisotropic filtered is based on the can be modulated at each stage, the ease with which it can
PDE regulating system. quantify distance, and its reliance on iteration termination
criteria.The beginning parameters obtained from the cluster's
𝜕𝐼𝑚
= 𝑑𝑖𝑣(𝑇∇𝐼𝑚 ) (6) midpoint are significant because the K-mean cluster is a local
𝜕𝑡
Im is for image intensity, ∇ stands for gradient, div stands for optimization.These changes are made to attain the highest
dispersion, and T stands for time in the weighting direction. accuracy and quickest convergence. Furthermore, starting from
Smoothing orientation is determined by the structure tensor T. a cluster's midway limits the K-mean cluster method to the best
It is constructed using a common gradient tensor G, which is possible site. The k-mean cluster method chooses a beginning
obtained by correlating the total of outer ∇Im goods with a point from the centre at randomized from a range of styles up
Gaussian kernel Kρ across all weighted instructions: to k. Based on the original centroid cluster, which is selected at
𝐺 = 𝑘𝑝 ∗ ∑𝑚(∇𝐼𝑚 ⊕ ∇𝐼𝑚 ) (7) random, the number of iterations with the centroid cluster is
determined. As an outcome, the centroid cluster in the large
The outer product operator is represented by ⊗. The gradient starting data points can be improved. Data points [1,2,3,...,x] n
tensor's spatial scale is ρ, determined by the standard deviation are typically clustered into k-means using k-means clustering.It
of the Gaussian kernel. An anisotropic diffusion filter's main supports multi-dimensional vectors and features high-
benefit is that it smooths out the image's homogeneous sections performance computing. Figure 4 depicts the flow chart of K-
while also enhancing the edges. means clustering. As a result, the distortion measure is reduced
While Gaussian filters function well in many practical uses, by lowering the cost function, which includes:
𝑗 2
they are significantly constrained when the true state |𝑥𝑖 − 𝑐𝑗 | (9)
distribution is complicated, such as when there are several 𝑗
The 𝑥𝑖 metric is used to calculate the distance between both the
modes, high skewness, or large tails. In multi-target tracking or cluster centre and a piece of data.(n) data points are measured
financial forecasting, for example, such circumstances may by (cj) from their cluster centres.The following parts make up
develop. The obvious extension of Gaussian filtering is the algorithm:
International Journal of Intelligent Systems and Applications in Engineering IJISAE, 2022, 10(2)s, 96–104 | 99
1. Set the k points in the clustered object's space. These are different forms, each with a varied number of nodes but the
the initial C_ k centroids. same underlying concept.Resnet50 [21] is a variation that
𝒅 = ‖𝑷(𝒙, 𝒚) − 𝑪𝒌 ‖ (10) supports up to 50 neural network layers.
2. Allocate each object's group to the subcategory with the Deeper convolutional neural networks are used by machine
most nearby centres. learning engineers to solve an issue in computer vision since of
3. While all objects are allocated, compute the locations of Resnet's significance. Since the individual levels can be taught
the k centroids. for various jobs to generate accurate results, these extra stages
aid in the speedier resolution of complex problems. While
𝟏 increasing the number of stacks can improve the model's
𝑪𝒌 = ∑𝒚∈𝑪𝒌 ∑𝒙∈𝑪𝒌 𝑷(𝒙, 𝒚) (11)
𝒌
characteristics, a deeper network can cause performance
4. Keep repeating steps 2 and 3 till the centroids stop
reduction. To put it another way, as the number of channels
moving.
increases, a neural network's accuracy rates may get saturated
The K-means clustering algorithm has two well-known
and begin to decline. As a result, both the training and testing
attribututes in which minimal attributes are divided into groups
data accuracy of the model degrades. Overfitting isn't to blame
for such deterioration. It could otherwise be owing to the
network's initialization, optimization algorithm, or, more
crucially, the issue of vanishing or ballooning biases [22].This
is why ResNet was created. Deep residual networks add
residual blocks into the model to increase their accuracy.
Skipping interconnections can be done in two ways. They start
by generating a new path for the gradient to follow, which
solves the problem of vanishing gradients. They also give the
algorithm the ability to learn a function that defines its identity.
As a result, the model's upper layers operate just as well as its
bottom layers.So, to conclude, residual blocks simplify the
layers' learning of identity values. ResNet improves deep neural
network performance in addition and more neural levels with
minimizing failure rates. To put it differently, skip connections
mix the results of the preceding layer with the outcomes of
stacked layers, enabling the training of far deeper networks
than was previously available.
International Journal of Intelligent Systems and Applications in Engineering IJISAE, 2022, 10(2)s, 96–104 | 101
Sam 69. 34.5 24. 0.97 59. 35.4 29. 0.97
ple 3 6 5 69 35 76 5 69 39
Sam 25. 31. 0.97 20. 36.6 34. 0.97
33.6
ple 4 0 13 60 07 6 1 66
Sam 43. 23.0 32. 0.97 41. 36.0 37. 0.97
ple 5 1 4 77 42 17 4 7 45
Sam 40. 33.1 33. 0.97 30. 36.1 39. 0.97
ple 6 9 5 01 43 91 0 71 47
METRICS K-means
clustering
Image 1 Dice Coefficient 0.7964
Jaccard Coefficient 0.6617
MCC 0.8117
Accuracy(%) 0.9957
Dice Coefficient 0.9088
K-mean clustering
Samples
Standard
Mean Variance
error
International Journal of Intelligent Systems and Applications in Engineering IJISAE, 2022, 10(2)s, 96–104 | 102
obtains the minimum training and validation losses as around
0.12 and 0.20 respectively.In this figure, the blue colour
indicates the validation and the red colour indicates the loss.
Table5 shows the accuracy, sensitivity, and specificity
performance measures of the proposed model compared to the
existing model.
Table 5: Comparison of performance metrics
References Accuracy Sensitivity Specificity
[23] 93.01 89.13 96.8
[24] 91.02 92.7 89.05
[25] 91.95 89.5 93.8
[26] 92 90.9 93
Figure 9: Classification output [27] 91.41 89.06 93.75
[28] 94.7 94.3 95.8
The updated ResNet-50 architecture has been used in the
Proposed 95.9 96.2 97.4
suggested framework for extracting features, identification, and
categorization of MRI images on Alzheimer's disease. Figure 9 100
depicts the detection and classification output, the statistical
98
value under the output represents the probability of positive as
96 Beheshti, et al [45]
well as the probability of negative outputs. Thus the proposed
framework is accurately identifying the affected and non- 94
Suk, et al [46]
affected MRI images. Shi, et al [47]
92
Liu, et al [48]
90
Aderghal, et al [49]
88
Islam, et al [50]
86
Proposed
84
Accuracy Sensitivity Specificity
Figure 12: Comparison of performance metrics
International Journal of Intelligent Systems and Applications in Engineering IJISAE, 2022, 10(2)s, 96–104 | 103
"The cortical origin and initial spread of medial temporal Unnatural light,” International Journal of Engineering Research
tauopathy in Alzheimer’s disease assessed with positron emission and Development, vol. 8, no. 9, pp. 57–61, 2013.
tomography." Science translational medicine 13, no. 577 (2021): [18] Pizer SM, et.al (1990) “Contrast-limited adaptive histogram
eabc0655. equalization: speed and effectiveness”, In Proceedings of the first
[3] Johansson, Maurits, Erik Stomrud, Philip S. Insel, Antoine Leuzy, conference on visualization in biomedical computing. IEEE, pp
Per Mårten Johansson, Ruben Smith, Zahinoor Ismail et al. "Mild 337–345.
behavioural impairment and its relation to tau pathology in [19] Aimi Salihai Abdul, MohdYusuffMasor and Zeehaida Mohamed,
preclinical Alzheimer’s disease." Translational psychiatry 11, no. Colour Image Segmentation Approach for Detection of Malaria
1 (2021): 1-8. Parasite using Various Colour Models and k-Means Clustering, In
[4] Leng, Kun, Emmy Li, Rana Eser, Antonia Pierogies, Rene Sit, WSEAS Transaction on Biology and Biomedicine., vol. 10,
Michelle Tan, Norma Neff et al. "Molecular characterization of January (2013).
selectively vulnerable neurons in Alzheimer’s disease." Nature [20] Hossain, Md Belal, SM Hasan Sazzad Iqbal, Md Monirul Islam,
neuroscience 24, no. 2 (2021): 276-287. Md Nasim Akhtar, and Iqbal H. Sarker. "Transfer learning with
[5] Wightman, Douglas P., Iris E. Jansen, Jeanne E. Savage, Alexey fine-tuned deep CNN ResNet50 model for classifying COVID-19
A. Shadrin, Shahram Bahrami, Dominic Holland, ArvidRongve et from chest X-ray images." Informatics in Medicine
al. "A genome-wide association study with 1,126,563 individuals Unlocked (2022): 100916.
identifies new risk loci for Alzheimer’s disease." Nature [21] .Alsabhan, Waleed, and TurkyAlotaiby. "Automatic Building
genetics 53, no. 9 (2021): 1276-1282. Extraction on Satellite Images Using Unet and
[6] Nguyen, Phuong H., AyyalusamyRamamoorthy, Bikash R. ResNet50." Computational Intelligence and Neuroscience 2022
Sahoo, Jie Zheng, Peter Faller, John E. Straub, Laura Dominguez (2022).
et al. "Amyloid oligomers: A joint experimental/computational [22] Saadna, Youness, AnouarAbdelhakimBoudhir, and Mohamed
perspective on Alzheimer’s disease, Parkinson’s disease, type II Ben Ahmed. "An Analysis of ResNet50 Model and RMSprop
diabetes, and amyotrophic lateral sclerosis." Chemical Optimizer for Education Platform Using an Intelligent Chatbot
reviews 121, no. 4 (2021): 2545-2647. System." In Networking, Intelligent Systems and Security, pp.
[7] Karikari, Thomas K., Andrea L. Benedet, Nicholas J. Ashton, 577-590. Springer, Singapore, 2022.
Juan Lantero Rodriguez, AnniinaSnellman, Marc Suarez-Calvet, [23] Beheshti, I., Demirel, H., Matsuda, H., Initiative, A.D.N., et al.:
Paramita Saha-Chaudhuri et al. "Diagnostic performance and Classification of Alzheimer’s disease and prediction of mild
prediction of clinical progression of plasma phosphor-tau181 in cognitive impairment-to-Alzheimer’s conversion from structural
the Alzheimer’s Disease Neuroimaging Initiative." Molecular magnetic resource imaging using feature ranking and a genetic
psychiatry 26, no. 2 (2021): 429-442. algorithm. Comput. Biol. Med. 83, 109–119 (2017).
[8] Neff, Ryan A., Minghui Wang, SezenVatansever, Lei Guo, Chen [24] Suk, H.I., Lee, S.W., Shen, D.: Deep ensemble learning of sparse
Ming, Qian Wang, Erming Wang et al. "Molecular subtyping of regression models for brain disease diagnosis. Med. Image Anal.
Alzheimer’s disease using RNA sequencing data reveals novel 37, 101–113 (2017).
mechanisms and targets." Science advances 7, no. 2 (2021): [25] Shi, B., et al.: Nonlinear feature transformation and deep fusion
eabb5398. for Alzheimer’s disease staging analysis. Pattern Recognit. 63,
[9] Qiu, Chengxuan, MiiaKivipelto, and Eva Von Strauss. 487–498 (2017).
"Epidemiology of Alzheimer's disease: occurrence, determinants, [26] Liu, M., Zhang, D., Shen, D., Alzheimer’s Disease Neuroimaging
and strategies toward intervention." Dialogues in clinical Initiative: Hierarchical fusion of features and classifier decisions
neuroscience (2022). for Alzheimer’s disease diagnosis. Hum. Brain Mapp. 35(4),
[10] Dubois, Bruno, Gaetane Picard, and Marie Sarazin. "Early 1305–1319 (2014).
detection of Alzheimer's disease: new diagnostic [27] Aderghal, K., Benois-Pineau, J., Afdel, K.: Classification of
criteria." Dialogues in clinical neuroscience (2022). SMRI for Alzheimer’s disease diagnosis with CNN: single
[11] Gao, Shuangshuang, and Dimas Lima. "< PE-AT> A review of Siamese networks with 2d+? approach and fusion on ADNI. In:
the application of deep learning in the detection of Alzheimer's Proceedings of the 2017 ACM on International Conference on
disease." International Journal of Cognitive Computing in Multimedia Retrieval, pp. 494–498. ACM (2017).
Engineering (2021). [28] Islam, Jyoti, Yanqing Zhang, and Alzheimer’s Disease
[12] Attallah, Omneya, Maha A. Sharkas, and HebaGadelkarim. Neuroimaging Initiative. "Deep convolutional neural networks for
"Deep learning techniques for automatic detection of embryonic automated diagnosis of Alzheimer’s disease and mild cognitive
neurodevelopmental disorders." Diagnostics 10, no. 1 (2020): 27. impairment using 3D brain MRI." In International Conference on
[13] Liu, Fei, Huabin Wang, Yonglin Chen, Yu Quan, and Liang Tao. Brain Informatics, pp. 359-369. Springer, Cham, 2018.
"Convolutional neural network based on feature enhancement and
attention mechanism for Alzheimer's disease prediction using
MRI images." In Proc. of SPIE Vol, vol. 12083, pp. 120830X-1.
2022.
[14] Loddo, Andrea, Sara Buttau, and Cecilia Di Ruberto. "Deep
learning based pipelines for Alzheimer's disease diagnosis: a
comparative study and a novel deep-ensemble
method." Computers in biology and medicine 141 (2022):
105032.
[15] A. Kaur and C. Singh, “Contrast enhancement for cephalometric
images using wavelet-based modified adaptive histogram
equalization,” Applied Soft Computing, vol. 51, pp. 180–191,
2017.
[16] Shehroz S. Khan and Amir Ahmad, Cluster Centre Initialization
Algorithm for K-means Cluster, In Pattern Recognition Letters,
pp. 1293–1302, (2004).
[17] D. Sonker, “Comparison of Histogram Equalization Techniques
for Image Enhancement of Grayscale images in Natural and
International Journal of Intelligent Systems and Applications in Engineering IJISAE, 2022, 10(2)s, 96–104 | 104