# Optimized Reformed Anisotropic Diffusion Unsharp Masking Filter for MR Images

<figure><img src="image_1.png" /></figure>

Check for
updates

Kavery Verma<sup>1</sup>, Subodh Srivastava<sup>1</sup>, Ritesh Kumar Mishra*<sup>1</sup>

Department of Electronics and Communication Engineering, National Institute of Technology Patna, Patna 800005, India

Corresponding Author Email: ritesh@nitp.ac.in

Copyright: ©2025 The authors. This article is published by IIETA and is licensed under the CC BY 4.0 license
(http://creativecommons.org/licenses/by/4.0/).

https://doi.org/10.18280/ts.420429

Received: 6 December 2024

Revised: 28 May 2025

Accepted: 29 July 2025

Available online: 14 August 2025

Keywords:

denoising, enhancement, Magnetic Resonance (MR) imaging, optimization, Rician noise

## ABSTRACT

Magnetic Resonance (MR) imaging is a powerful digital imaging technique that provides detailed insights into the abnormal structure and function of the brain. However, during image acquisition, these MR images are affected by artifacts and noise, which primarily follow the Rician distribution. The quality of the image is diminished by these inconsistencies, limiting the interpretive effectiveness of radiologists. To overcome these issues, an optimized reformed Anisotropic Diffusion Unsharp Masking (OADUM) filter has been proposed that preserves the sharpness, contrast, edges, and fine details of Rician noise-corrupted MR images. In this proposed methodology, the edge threshold constant of the diffusion coefficient is automated using the Enhancement Measurement on Entropy (EMEE) method and clubbed with Maximum Likelihood Estimation (MLE) instead of manual calculation. Further, to improve the quality of smoothen images, the Greedy Search Optimization (GSO) algorithm is applied, where Peak Signal-to-Noise Ratio (PSNR) is taken as a fitness function. The performance of the restored and enhanced output image has been analyzed with earlier existing methods in both qualitative and quantitative ways on COBRE dataset. The quantitative assessment parameters taken are MSE, PSNR, UQI, SSIM, MS-SSIM, NAE, CP, and DE, whose average values are coming out to be 0.4486, 51.9872, 0.8268, 0.9947, 0.9857, 0.6075, 0.9862, and 5.0547, respectively. Experimental results demonstrated that the proposed methodology outperformed earlier existing state-of-the-art methods, significantly improving the visual quality and performance indexes of the dataset, thereby making the method more useful for diagnostic and clinical purposes.

## 1. INTRODUCTION

Magnetic resonance imaging has revolutionized medical diagnosis by providing unparalleled anatomical details and functional information about the brain. Precise detection of abnormalities within the brain tissue is crucial for accurate diagnosis and timely intervention. However, Magnetic Resonance (MR) images are inherently susceptible to noise [1]. Due to the thermal turbulence of electrons, MR images are sensitive mostly to Rician noise [2]. The presence of Rician noise in MR images can significantly degrade image quality, particularly at low Signal-to-Noise Ratio (SNR) [3]. This noise can obscure critical features, hindering the accurate diagnosis of abnormalities [4]. Furthermore, existing denoising methods often fail to balance noise reduction and preservation of structural detail, leading to dusky images and misdiagnosis of diseases. According to a survey by the National Center for Biotechnology Information in 2024, the misdiagnosis rate of Schizophrenia (SZ) in clinical practice can be as high as 25% [5]. Approximately 30% of individuals with SZ demonstrate treatment-resistant traits and respond inadequately to conventional antipsychotic medications, which presents a significant challenge [6]. Further, a report from the Miami Neuroscience Centre indicates that 80,000 new cases of brain cancer arise in the US each year [7]. This paper proposes a novel method to address these challenges and improve the

quality of Rician noise-corrupted MR images. The proposed methodology integrates two powerful techniques, reformed Anisotropic Diffusion Unsharp Masking (ADUM) with Greedy Search Optimization (GSO) algorithm with the Peak Signal-to-Noise Ratio (PSNR) serving as the fitness function. This method effectively reduces noise while preserving crucial features such as edges and contours. It ensures that fine details remain visible, even in regions characterized by low contrast or noise, thereby enhancing image quality. The method begins with the removal of noise to improve the quality of image. Here modified Anisotropic Diffusion (AD) acts as a sophisticated denoising filter [8]. To reduce the Rician noise, AD filter is integrated with Maximum Likelihood Estimation (MLE) simultaneously automating the edge threshold constant of diffusion coefficient by Enhancement Measurement on Entropy (EMEE) method [9]. Unlike traditional filters that blur the entire image, this reformed AD selectively smooths out the noise while preserving sharp edges and crucial structural details within the brain tissue [10, 11]. Here, the regularization parameter for the smoothed image is varied by the average SNR calculation. Following denoising, optimization of these images is done with the computation of the Global Variance (GV), using GSO algorithm, which informs the subsequent processing steps where Peak Signal-to-Noise Ratio (PSNR) is taken as fitness function [12]. Unlike fixed-parameter approaches, this algorithm actively searches
for the best possible configuration [13]. This technique
sharpens edges by highlighting the difference between
neighboring pixels [14]. Through a series of iterative
adjustments guided by the greedy search, the method achieves
optimal results in terms of noise reduction and overall image
clarity. After that, scaling of the edge image is done using
manual and random search optimization followed by
employing modified Unsharp Masking (UM) to enhance the
contrast and sharpness of image [15]. Finally, the restored and
enhanced output image obtained from modified UM improves
the visibility of subtle anatomical features within the brain,
making it visually clear and allows for accurate diagnosis.

The effectiveness of the proposed method is thoroughly
assessed by conducting both qualitative and quantitative
comparisons with existing state-of-the-art techniques. The
experimental results demonstrate that the proposed method
significantly improves the visual quality of Rician noise-
corrupted MR images. The enhanced clarity and detail
afforded by this method hold substantial promise for
diagnostic and clinical applications, potentially leading to
more accurate and reliable medical assessments.

1.1 Motivation

Brain diseases are constantly increasing due to stressful
lifestyles, environmental factors, and chronic diseases. For
accurate diagnoses of these diseases, an enhanced quality of
MR image is required. Despite their high-resolution device
imaging capabilities, MR images are frequently subjected to
noise primarily Rician noise, which can obscure crucial
anatomical details and hinder accurate clinical assessments.
To address this issue, the proposed methodology aims to
achieve superior image detail and clarity by systematically
exploring parameter space. This advancement promises to
improve diagnostic accuracy and patient outcomes, providing
a robust solution to the persistent challenge of Rician noise in
MR imaging.

## 1.2 Key contributions and organization

The fundamental contributions of this paper are as follows:

(1) Identification of noise.

(2) Develop a novel method combining reformed anisotropic diffusion unsharp masking filter and a greedy search optimization algorithm to restore and enhance MR images corrupted by Rician noise while preserving the important structural details.

(3) Systematically explored the parameter space to ensure an optimal balance between noise reduction and detail enhancement.

(4) Significantly improved the visual clarity and diagnostic utility of MR images.

(5) Addressed a critical challenge in medical imaging with a robust and practical solution to Rician noise.

The rest of this manuscript is organized as follows: Section 2 gives details about previous works done in this area. Section 3. discusses about the dataset taken, and describes the experimental setup of the proposed methodology and the different performance assessment parameters taken. Results are drawn and discussed in Section 4. Finally, a conclusion and future scope of this methodology is discussed in Section 5.

## 2. PREVIOUS WORK

This section gives details about some earlier work done on

denoising, enhancement, and optimization. Hu et al. introduced Non-Local Means (NLM) filter using random sampling (SNLM) method which reduces noise, improves computational quality, and competitive denoising results [16]. Nguyen et al. enhanced the classical NLM filter by introducing improved Non-Local Self-Weight (NLSW) estimation techniques [17]. While the method improves denoising performance, it has higher computational complexity and can be time consuming, especially for large image data. Chang et al. introduces Trilateral Filter (TLF) with extended the Bilateral Filter (BF) by adding an extra intensity similarity function and an adaptive entropy function to improve noise reduction [18]. While the self-regulating TLF demonstrates significant advancements and effectiveness in denoising brain MR images, it faces limitations related to automation challenges and potential over-smoothing. Zhang et al. proposed denoising method, MR image utilizes a combination of image Low-Rank and Sparse Gradient prior Gaussian Mixture (LRSGM) model clustering and iterative optimization techniques to achieve effective noise reduction while preserving image details [19]. The use of Gaussian Mixture (GM) for clustering and the iterative algorithm can be computationally intensive, requiring significant processing power and time, which might be a limitation for real-time applications or large datasets. The proposed method of Kanoun et al. enhances the traditional NLM filter by incorporating the Kolmogorov-Smirnov (KS) distance for better patch similarity estimation [20]. This method coupled with local anisotropy analysis (AKSNLM), results in the denoising and preservation of image details. While the method is effective at moderate noise levels, its performance may degrade in extremely noisy conditions. The anisotropic weighting and KS distance calculation might not be sufficient to handle very high noise levels, leading to the potential loss of important image details. Rai et al. proposed Augmented Deep Residue Network (ADRN) framework which performs denoising by combining the strengths of both Residual Learning (RL) and Dictionary Learning (DCL) [21]. The performance of the denoising framework is highly dependent on the quality and diversity of the training data. Also, the integration of RL and DCL in a single framework adds complexity to the implementation. Hou et al. utilizes truncated residual based plug-and-play Alternating Direction Method of Multipliers (ADMM) framework called TRPA, which enables the incorporation of pre-trained denoisers to address the denoising subproblem in ADMM-based MR image reconstruction [22]. TRPA relies on the effectiveness of pre-trained denoisers. If the denoiser is not well-optimized for the specific noise characteristics or MR images being reconstructed, the overall performance of TRPA may be compromised. Chuang et al. proposed a denoising method which is Score-based Reverse Diffusion Sampling (SRDS), to tackle the challenges of noise in MR image scans, offering robust performance on diverse and complex noise distributions [23]. It enhances image resolution, and quantifies uncertainty with significant improvements over Traditional Minimum Mean Squared Error (MMSE) based methods. The sampling approach may involve complex computations and a sophisticated architecture, resulting in high computational demands. This complexity might limit its practicality in real time applications. The scalability of the model to larger datasets or different MR imaging devices is yet to be extensively tested. Variations in imaging hardware and acquisition parameters could impact the performance of the
model. Huang et al. had proposed a method that integrates a self-supervised denoising network with a plug-and-play optimization framework [24]. Here, the concept of Regularization by Denoising (RED) is used to enhance MR image reconstruction. This approach named DURED imposes a denoising network to act as a regularizer, ensuring high-quality reconstruction by incorporating imaging physics. However, this approach is dependent on the quality of the

denoising network, which may lead to longer processing time, computational complexity, integration challenges with clinical workflows, and risk of overfitting for small MR image data. Addressing these limitations is essential for improving the robustness, efficiency, and applicability of the proposed denoising methods across diverse imaging contexts. Table 1 summarizes these earlier methods on denoising and enhancement.

<table><caption>**Table 1.** Earlier reported works on denoising and enhancement</caption><thead><tr><th>Author</th><th>Year</th><th>Method</th><th>Remark</th></tr></thead><tbody><tr><td>Hu et al. [16]</td><td>2016</td><td>SNLM</td><td>Requires accurate selection of the sampling ratio.</td></tr><tr><td>Nguyen et al. [17]</td><td>2017</td><td>NLSW</td><td>Higher computational complexity and time consumption.</td></tr><tr><td>Chang et al. [18]</td><td>2018</td><td>TLF</td><td>Automation challenges and potential over-smoothing.</td></tr><tr><td>Zhang et al. [19]</td><td>2019</td><td>LRSGM</td><td>Significant processing power and time.</td></tr><tr><td>Kanoun et al. [20]</td><td>2020</td><td>AKSNLM</td><td>Effective at moderate noise levels.</td></tr><tr><td>Rai et al. [21]</td><td>2021</td><td>ADRN</td><td>Dependence on high-quality training data and computational complexity.</td></tr><tr><td>Hou et al. [22]</td><td>2022</td><td>TRPA</td><td>Dependence on pre-trained denoisers.</td></tr><tr><td>Chung et al. [23]</td><td>2023</td><td>SRDS</td><td>High computational demand and scalability issues.</td></tr><tr><td>Huang et al. [24]</td><td>2024</td><td>DURED</td><td>Longer processing time and the risk of overfitting.</td></tr></tbody></table>

# 3. PROPOSED WORK

This section offers a comprehensive overview of the proposed methodology and the dataset employed for this analysis.

## 3.1 Datasets

The dataset for this study was provided by the Center for Biomedical Research Excellence (COBRE) [25]. It includes raw anatomical and functional magnetic resonance imaging brain data from 72 patients diagnosed with schizophrenia and 75 healthy control subjects. The dataset consists of sample MR image of patients with age ranges from 18 to 65 years. Class imbalance does not affect the performance of the proposed method, as it operates independently for each individual image. Figure 1 shows sample MR image view of a patient suffering from Schizophrenia. Sample images contain three different orientation Axial, Coronal, and Sagittal scan of brain MR image.

<figure><img src="image_2.png" /><figcaption>**Figure 1.** Sample MR image view of a Schizophrenia patient, (a) Axial, (b) Coronal, and (c) Sagittal from COBRE dataset [25]</figcaption></figure>

## 3.2 Methodology

The block diagram of methodology taken for implementation of the proposed methods are shown in Figure 2. First and foremost, identification of noise in MR images is done. In order to have noise-free MR images, the proposed method starts with denoising using reformed AD filter followed by optimization and modified UM to obtain a restored and enhanced output image. The detail description of

proposed methodology is explained below in mathematical way.

### 3.2.1 Proposed methodology with mathematical evaluation

With pixel-by-pixel magnitude calculation of real and imaginary section of MR image, the noise distribution identified is Rician as both the section is distorted by uncorrelated Gaussian noise with zero-mean ($\mu = 0$) equal variance $\sigma^2$ [26]. Noisy corrupted image '$I_\eta$' is given as:

$$I_{\eta} = \sqrt{I_{R}^{2} + I_{I}^{2}} \qquad (1)$$

where, '$I_R$' denotes real part of noisy image and '$I_I$' is the imaginary part of noisy image.

The Rician Probability Density Function (PDF) of noisy MR image of pixel intensity '$M$' is given as [27]:

$$p(I/M) = \frac{M}{\sigma^2} e^{-\frac{(M^2+I^2)}{2\sigma^2}} J_0\left(\frac{IM}{\sigma^2}\right) H(M) \qquad (2)$$

where, '$I$' denotes the noise-free image, '$\sigma^2$' is the Rician noise variance, '$J_0(\cdot)$' is zero-order modified Bessel's function, and '$H(\cdot)$' represents the Heaviside function.

For MR image '$M$', the magnitude of a signal cannot be negative. So, the value of $H(M) = 1$, then, the Rician PDF is given as [28]:

$$p(I/M) = \frac{M}{\sigma^2} e^{-\frac{(M^2+I^2)}{2\sigma^2}} J_0\left(\frac{IM}{\sigma^2}\right) \qquad (3)$$

Here, noisy image '$M$' is processed using an Anisotropic Diffusion (AD) filter, where the diffusion is governed by the MLE and EMEE for the noise-free image '$I$'. This filter aims to reduce noise while preserving essential structural details and edges in the image.

For '$n$' set of observations, the likelihood function is given as [29]:

$$L(p(I/M)) = \sum_{i=1}^{n} \ln \left( \frac{M}{\sigma^2} e^{-\frac{(M^2+I^2)}{2\sigma^2}} J_0\left(\frac{IM}{\sigma^2}\right) \right) \qquad (4)$$
<figure><img src="image_3.png" /><figcaption>Figure 2. Framework for proposed methodology to obtain denoised and enhanced MR image</figcaption></figure>

For maximum likelihood estimation [30]:

$$ \frac{\partial}{\partial I} L(p(I/M)) = 0 \qquad (5) $$

The general regularization function of the Anisotropic Diffusion equation is [31]:

$$ f(I) = \nabla \cdot (c(||\nabla I||)\nabla I) \qquad (6) $$

where, 'c(||∇I||)' is the diffusion coefficient whose value is given as:

$$ c(||\nabla I||) = \frac{1}{1 + \left(\frac{\nabla I}{\beta}\right)^2} \qquad (7) $$

where, 'β' is a constraint of the diffusion coefficient.

Here, the value of 'β' is calculated as edge threshold value of Enhancement Measurement based on Entropy (EMEE). EMEE focusses on maximising local entropy around edges, in contrast to traditional methods that depend on global intensity distributions [32, 33]. It enhances edge regions adaptively, maintaining fine details even in areas with low contrast or noise [34, 35]. By directly linking entropy to edge strength, EMEE ensures superior edge preservation compared to conventional entropy-based techniques [36, 37].

The reformed diffusion coefficient is given as [38]:

$$ c'(||\nabla I||) = \frac{1}{1 + \left(\frac{\nabla I}{\beta'}\right)^2} \qquad (8) $$

where, 'β' is a threshold value of EMEE that controls the sensitivity to edges. The value is given as [39]:

$$ \beta' = \frac{1}{p_1 p_2} \sum_{m=1}^{p_1} \sum_{l=1}^{p_2} \alpha \left( \frac{l_{\max}^{l,m}}{l_{\min}^{l,m}} \right)^{\alpha} \frac{l_{\max}^{l,m}}{l_{\min}^{l,m}} \qquad (9) $$

where, 'p₁' and 'p₂' show the number of cells used to split the denoised image, 'l, m' denotes maximum values of pixel in

each block of denoised image, 'l, m' denotes minimum values of pixel in each block of denoised image, and 'α' is the scaling factor.

The Energy functional of image 'I' that is 'E(I)' obtained from a reformed AD filtered image is given as [40]:

$$ E(I) = \arg_{min} \left[ \int_{\Omega} \left[ \frac{\partial}{\partial I} L(p(I/M)) + \gamma f(I) \right] d\Omega \right] \qquad (10) $$

where, 'γ' is called the regularization parameter, whose value is given as [41]:

$$ \gamma = \frac{1}{\text{Avg.SNR}} \qquad (11) $$

where, 'SNR' denotes signal to noise ratio.

The value of 'Avg. SNR' is given as:

$$ \text{Avg. SNR} = \frac{\text{mean}}{\text{standard deviation}} = \frac{\mu}{\sigma} \qquad (12) $$

The denoised filtered output image obtained is represented as:

$$ \frac{\partial E(I)}{\partial t} = - \frac{1}{\sigma^2} + \frac{2k_1}{l} + \gamma \nabla \cdot (c'(||\nabla I||)\nabla I) \qquad (13) $$

Further, the discretization of the above Eq. (13) is given as:

$$ \frac{l^{n+1}(i,j) - l^n(i,j)}{\Delta t^n} = \frac{l^n(i,j)}{\sigma^2} + \frac{2k_1}{l} + \gamma \nabla \cdot (c'(||\nabla I||)\nabla I) \qquad (14) $$

Again, it can be written as:

$$ l^{n+1}(i,j) = l^n(i,j) + \Delta t \left[ \frac{l^{n}(i,j)}{\sigma^2} + \frac{2k_1}{l} + \gamma \nabla \cdot (c'(||\nabla I||)\nabla I) \right] \qquad (15) $$

where, 'i' and 'j' are the pixel indices of an image 'I', 'Δt' is the grid constant, and 'n' is the number of iterations.

Finally, the value of the filtered image can be given as:
$$I' = I^n(i, j) + \Delta t \left[ \frac{I^n(i, j)}{\sigma^2} + \frac{2k_1}{I} + \gamma \nabla \cdot (c'(||\nabla I||)\nabla I) \right] \quad (16)$$

To incorporate the global variance (GV) into the reformed anisotropic filtered image 'I' for Greedy Search Optimization (GSO), the global variance $\sigma_g^2$ of the filtered MR image 'I' is calculated as [42]:

$$\sigma_g^2 = \frac{1}{P \times N} \sum_{i=1}^{P} \sum_{j=1}^{N} (I'_{ij} - \mu)^2 \quad (17)$$

where, 'P' and 'N' are the dimensions of the image, 'I' is the intensity of the pixel at position (i, j), and 'μ' is the mean intensity of the image.

The value of 'μ' the mean intensity of the image is given as:

$$\mu = \frac{1}{P \times N} \sum_{i=1}^{P} \sum_{j=1}^{N} I'_{ij} \quad (18)$$

Now, adding the GV $\sigma_g^2$, to the output of the filtered image 'I', the value of the reformed output image obtained is given as:

$$I^r = I' + \sigma_g^2 \quad (19)$$

GSO aims to define an objective function and iteratively make local adjustments to enhance the reformed image 'I^r', obtained from the previous step. The stopping condition for the GSO algorithm determines the condition where the optimization function should terminate the number of iterations [43]. In the proposed methodology, PSNR is taken as fitness function for the GSO. Convergence threshold and max. number of iterations clearly define stopping condition for GSO algorithm. Mathematically it can be defined as:

Suppose 'n' be defined as number of iteration and '$\epsilon$' denotes convergence threshold, then stopping condition for GSO algorithm can be defined as [44]:

$$|PSNR_n - PSNR_{n-1}| < \epsilon \quad (20)$$

where, value of '$\epsilon$' is a positive number such as around 0.001 dB or 0.01 dB.

This shows that there is no further scope for improvement in PSNR, so the optimization algorithm stops. The proposed method achieves the maximum PSNR value of 51.9872 dB for n = 50, the number of iterations.

Let 'J' denote the optimized output image after performing GSO on 'I^r'. The objective function 'E(J)' can be defined as:

$$E(J) = \sum_{i,j} \left[ (I_{ij}^r - J_{ij})^2 + \lambda \sum_{(i',j') \in \mathcal{N}(i,j)} (J_{ij} - J_{i'j'})^2 \right] \quad (21)$$

where, '$\lambda$' is a regularization parameter that balances fidelity to the original noisy image and smoothness, and '$\mathcal{N}(i, j)'$ denotes the set of neighbouring pixels of (i, j).

This objective function has two components that is data fidelity term '$(I_{ij}^r - J_{ij})^2$' which shows the output image 'J' remains close to the original noisy image 'I^r' and the smoothness term '$(J_{ij} - J_{i'j'})^2$' which shows the output image 'J' to smoothed by the fine differences between neighboring pixels.

The GSO algorithm evaluates the objective function 'E(J)'

locally and updates the pixel value 'J_{ij}' to minimize the local objective function.

Mathematically, it can be written as:

$$J_{ij}^{(k+1)} = J_{ij}^{(k)} + \Delta J_{ij} \quad (22)$$

where, '$\Delta J_{ij}'$ is the change that minimizes the local objective function 'E' at pixel (i, j).

The iterative process is done until the objective function 'E(J)' converges or until a maximum number of iterations is reached.

Hence, the smoothen output image obtained after the GSO algorithm can be expressed as:

$$J' = \operatorname{argmin} \sum_{i,j} \left( (I_{ij}^r - J_{ij})^2 + \lambda \sum_{(i',j') \in \mathcal{N}(i,j)} (J_{ij} - J_{i'j'})^2 \right) \quad (23)$$

where, 'J' represents the optimized image or smoothen image obtained after filtering Rician noise using reformed AD, adding global variance, and refining with greedy search optimization. The optimization ensures that the image is smooth and retains essential features while minimizing noise.

Further, edge images can be calculated as follows:

$$I_{\text{Edge}} = M - J' \quad (24)$$

Again, the modified unsharp masked image is given as:

$$I_{\text{UM}} = \alpha I_{\text{Edge}} \quad (25)$$

where, '$\alpha$' is a weighted parameter known as the scaling factor ($\alpha > 0$) that determines the level of sharpness.

The value of '$\alpha$' is calculated with the help of random search optimization.

This formula encapsulates the entire process, combining the benefits of noise reduction, edge enhancement, and the addition of the original image details.

Algorithm 1 depicts the pseudocode for the proposed methodology. Also, the preferred values of parameters taken for this methodology are given in Table 2.

<table><caption>**Table 2.** Detail description of parameters taken for proposed methodology</caption><thead><tr><th>Parameters</th><th>Description</th><th>Value</th></tr></thead><tbody><tr><td>Δt</td><td>Grid constant</td><td>0.1</td></tr><tr><td>n</td><td>Number of iterations</td><td>50</td></tr><tr><td>β'</td><td>Threshold value for reformed AD</td><td>10 to 50</td></tr><tr><td>γ</td><td>Regularization parameter</td><td>Eq. (11)</td></tr><tr><td>σ<sub>g</sub><sup>2</sup></td><td>Global variance</td><td>Eq. (17)</td></tr><tr><td>μ</td><td>Mean intensity</td><td>Eq. (18)</td></tr><tr><td>λ</td><td>Diffusion parameter</td><td>0 to 1.0</td></tr><tr><td>α</td><td>Weighted parameter</td><td>α > 0</td></tr></tbody></table>

**Algorithm 1:** Pseudo code for proposed method

**Input:** Read noisy input image $M(i, j)$.

**Output:** Enhanced MR Image $I_o$.

Initialize $I^n(i, j)$ with input image $M(i, j)$.

Identification of dominant Rician noise.

Compute noise-free image using Rician probability distribution:

for each pixel (i, j) in the image
Perform MLE to estimate 'I' by setting
$$ \frac{\partial}{\partial I} L(p(I/M)) = 0 $$

Apply Anisotropic Diffusion filtering:

For $t = 1$ to no. of iteration 'n'
for each pixel $(i, j)$ in the image do
Compute reformed diffusion coefficient based on threshold value

$\beta'$ of EMEE.

Evaluate regularization parameter 'γ'.

Update image $I^{n+1}(i, j)$ using:

$$ I^{n+1}(i, j) = I^n(i, j) + \Delta t \left[ \frac{I^{n(i,j)}}{\sigma^2} + \frac{2k_1}{l} + \gamma \nabla \cdot (c'(|\nabla I|)\nabla I) \right] $$

Set $I' = I^{n+1}(i, j)$.

Compute global variance $\sigma_g^2$ of the filtered image $I'$:

Calculate mean intensity $\mu$ of the image.
Add global variance to the filtered image $I'$.

$$ I^r = GV(I', \sigma^2) $$

Return $I^r$.

Perform Greedy Search Optimization (GSO):

GSO stops: $|PSNR_n - PSNR_{n-1}| < \varepsilon$.

Initialize optimized image $J$
repeat until convergence or maximum iterations reached
for each pixel $(i, j)$ in the image
Compute objective function $E(J)$ Eq. (21).

Update pixel value $J_{ij}$ using:

$$ J_{ij}^{(k+1)} = J_{ij}^{(k)} + \Delta J_{ij} $$

Set
$$ J' = \operatorname{argmin} \sum_{i,j} \left( (I_{ij}^T - J_{ij})^2 + \lambda \sum_{(i',j') \in N(i,j)} (J_{ij} - J_{i'j'})^2 \right) $$

Compute edge image, $I_{Edge}$.

Initialize UM to enhance edge details obtained sharpen image $I_{UM} \cdot I_{UM} = UM(I_{Edge}, \alpha)$

Final output image obtained as $I_O = I_{UM}$.

### 3.3 Performance assessment

Evaluating the quality of the processing applied to an image is known as image performance assessment. This crucial step determines the final quality of the processed image. To assess the accuracy of the proposed method, different assessment parameters of output images are considered. Sensitivity analysis of the method can be conducted to assess how various parameters influence the quality and robustness of the denoised output. Here, the parameters taken for sensitivity analysis are: Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR), Universal Quality Index (UQI), Structural Similarity Index (SSIM), Multiscale SSIM (MS-SSIM), Normalized Absolute Error (NAE), Correlation Parameter or Correlation Coefficient (CP/CC), and Discrete Entropy (DE). These are defined as:

(1) MSE-It is commonly used to quantify the difference between the original and processed images [45]. It is measured in squared intensity values.

(2) PSNR-It evaluates the quality of a reconstructed or processed image relative to the original by comparing the maximum possible pixel intensity value to the noise introduced during processing [46]. It is measured in Decibels (dB).

(3) UQI-It measures image quality by considering both structural and luminance similarities between the original and

processed images [47]. It does not have a specific unit of measurement.

(4) SSIM-It evaluates the perceived quality of a processed image by comparing its structural information, luminance, and contrast with the original image [48]. It is dimensionless.

(5) MS-SSIM-It extends SSIM by evaluating parameters like luminance, contrast, and structural similarity across multiple scales. These results are then combined to produce a comprehensive similarity measure [49]. It is also dimensionless.

(6) NAE-It provides a normalized measure of the absolute error between the original noisy image and the processed image [50]. It has no units.

(7) CP/CC-It is a statistical measure that describes the linear relationship between two images [51]. There is no unit associated with it.

(8) DE-It shows the amount of information or randomness in the intensity values of images [52]. It is measured in terms of bits per symbol or bits per pixel.

<table><caption>**Table 3.** Mathematical formula of performance assessment parameters</caption><thead><tr><th>Index</th><th>Mathematical Formula</th><th>Expected Value</th></tr></thead><tbody><tr><td>MSE [45]</td><td>$\frac{1}{P \times N} \sum_{i=1}^{P-1} \sum_{j=1}^{N-1} (M(i,j) - I(i,j))^2$</td><td>Low</td></tr><tr><td>PSNR [46]</td><td>$20 \log_{10} \frac{(L-1)}{\sqrt{MSE}}$</td><td>High</td></tr><tr><td>UQI [47]</td><td>$\frac{4 \mu_M \mu_I \sigma_{MI}}{(\mu_M^2 + \mu_I^2)(\sigma_{MI}^2 + \sigma_I^2)}$</td><td>High</td></tr><tr><td>SSIM [48]</td><td>$\frac{(2 \mu_M \mu_I + C_1)(2 \sigma_{MI} + C_2)}{(\mu_M^2 + \mu_I^2 + C_1)(\sigma_{MI}^2 + \sigma_I^2 + C_2)}$</td><td>High</td></tr><tr><td>MS-SSIM [49]</td><td>$\frac{(2 \mu_M \mu_I + C_1)}{(\mu_M^2 + \mu_I^2 + C_1)} \prod_{l=0}^{L-1} \frac{(2 \sigma_{MI} + C_2)}{(\sigma_{MI}^2 + \sigma_I^2 + C_2)}$</td><td>High</td></tr><tr><td>NAE [50]</td><td>$\frac{\sum_{i=1}^{P-1} \sum_{j=1}^{N-1} (M(i,j) - I(i,j))}{\sum_{i=1}^{P-1} \sum_{j=1}^{N-1} M(i,j)}$</td><td>Low</td></tr><tr><td>CP [51]</td><td>$\frac{\sum_{i=1}^{P} \sum_{j=1}^{N} (M(i,j) - \mu_M)(I(i,j) - \mu_I)}{\sqrt{\sum_{i=1}^{P} \sum_{j=1}^{N} (M(i,j) - \mu_M)^2 \sum_{i=1}^{P} \sum_{j=1}^{N} (I(i,j) - \mu_I)^2}}$</td><td>High</td></tr><tr><td>DE [52]</td><td>$-\sum_{i=0}^{L-1} I(i,j) \log_2(I(i,j))$</td><td>High</td></tr></tbody></table>

<table><caption>**Table 4.** Detailed description of symbols taken for the mathematical formulation of assessment parameters</caption><thead><tr><th>Symbol</th><th>Description</th></tr></thead><tbody><tr><td>$M(i, j)$</td><td>Noisy MR image.</td></tr><tr><td>$I(i, j)$</td><td>Processed output image.</td></tr><tr><td>$(i, j)$</td><td>Pixel coordinates of image.</td></tr><tr><td>$P \times N$</td><td>Dimension size of the image.</td></tr><tr><td>$L$</td><td>Dynamic possible pixel range of image.</td></tr><tr><td>$\mu_M$</td><td>Mean of reference noisy MR image.</td></tr><tr><td>$\mu_I$</td><td>Mean of processed output MR image.</td></tr><tr><td>$\sigma_M$</td><td>Standard deviation of reference noisy MR image.</td></tr><tr><td>$\sigma_I$</td><td>Standard deviation of processed MR image.</td></tr><tr><td>$\sigma_{MI}$</td><td>Covariance of noisy input and processed image.</td></tr><tr><td>$C_I, C_2$</td><td>Constant taken to prevent the resulting instability.</td></tr></tbody></table>

Table 3 shows a detailed description of the mathematical parameters taken for performance assessment. Table 4 shows a detailed description of symbols used for the mathematical formulation of performance assessment parameters in Table 3. The value of these performance assessment parameters obtained in output images is drawn in box plot form. With the help of a box plot, it is easy to find the spread of the data [53].
## 4. RESULT AND DISCUSSION

This section shows the findings of the qualitative and quantitative outputs of the proposed methodology. This illustrates the amount of information or randomness present in the intensity values of images. Figure 3 shows the output MR images obtained at each step of the proposed methodology. Figure 3(a), 3(e), and 3(i) show sample Axial, Coronal, and Sagittal scan MR images taken from the dataset, respectively [25]. Figure 3(b), 3(f), and 3(j) represent a smoothen image obtained after optimization. Figures 3(c), 3(g), and 3(k) show the edge image obtained after deducting the smoothed image from the input MR image. Finally, Figures 3(d), 3(h), and 3(l) exhibit a restored and sharpened enhanced image obtained after the proposed methodology. Further, Figures 4-6 show a comparative study of the final output image obtained with the proposed methodology and the earlier existing method discussed in Section II with Axial, Coronal, and Sagittal MR images of the dataset, respectively. In this comparative analysis, it can be seen that the visual output of the proposed methodology is more enhanced and sharper in comparison to earlier existing methods. For a more subjective evaluation, we conducted a comprehensive study involving a diverse group of

individuals with expertise in medical imaging, including radiologists, clinicians, and imaging scientists. Finally, based on the recommendations from the doctors of the medical department at the National Institute of Technology Patna, India, the proposed methodology produces a denoised and enhanced MR image that sharpens the details of abnormalities, aiding in the accurate detection of disorders.

Apart from qualitative analysis, a quantitative analysis of the parameters discussed in Table 3 has also been done in between the proposed method and earlier existing methods. A comparison of the average performance assessment parameters between the earlier existing method and the proposed method is shown in Table 5 for this dataset. It can be observed that the proposed methodology imparts better results, such as a high PSNR ratio, low MSE, higher UQI, SSIM, MS-SSIM, lower NAE, higher CC, and lower DE than earlier existing methods. The marked bold values in Table 5 show the optimal value of the performance metrics. However, the underlined values show the second-best value, and the dotted lines show the third-best value observed for these performance assessment parameters. The box plot of the parameters of evaluation given in Table 5 has been shown in Figure 7.

<figure><img src="image_4.png" /><figcaption>**Figure 3.** MR image (a) Sample axial [25], (b) Smoothen axial, (c) Edge image of axial, (d) Enhanced axial output, (e) Sample coronal [25], (f) Smoothen coronal, (g) Edge image of coronal, (h) Enhanced coronal output, (i) Sample sagittal [25], (j) Smoothen sagittal, (k) Edge image of sagittal, and (l) Enhanced sagittal output</figcaption></figure>

<figure><img src="image_5.png" /><figcaption>**Figure 4.** (a) Sample axial MR image [25], (b) SNLM [16], (c) NLSW [17], (d) TLF [18], (e) LRSGM [19], (f) AKSNLM [20], (g) ADRN [21], (h) TRPA [22], (i) SRDS [23], (j) DURED [24], and (k) Proposed</figcaption></figure>
<figure><img src="image_6.png" /><figcaption>**Figure 5.** (a) Sample coronal MR image [25], (b) SNLM [16], (c) NLSW [17], (d) TLF [18], (e) LRSGM [19], (f) AKSNLM [20], (g) ADRN [21], (h) TRPA [22], (i) SRDS [23], (j) DURED [24], and (k) Proposed</figcaption></figure>

<figure><img src="image_7.png" /><figcaption>**Figure 6.** (a) Sample sagittal MR image [25], (b) SNLM [16], (c) NLSW [17], (d) TLF [18], (e) LRSGM [19], (f) AKSNLM [20], (g) ADRN [21], (h) TRPA [22], (i) SRDS [23], (j) DURED [24], and (k) Proposed</figcaption></figure>

<table><caption>**Table 5.** Comparative assessment of earlier work with proposed method on dataset</caption><thead><tr><th>S. No.</th><th>Methods</th><th>MSE</th><th>PSNR</th><th>UQI</th><th>SSIM</th><th>MS-SSIM</th><th>NAE</th><th>CC</th><th>DE</th></tr></thead><tbody><tr><td>1.</td><td>SNLM [16]</td><td>2.0451</td><td>41.5897</td><td>0.5331</td><td>0.6445</td><td>0.6277</td><td>0.8051</td><td>0.7623</td><td>5.8160</td></tr><tr><td>2.</td><td>NLSW [17]</td><td>1.5897</td><td>43.7481</td><td>0.6547</td><td>0.7541</td><td>0.7431</td><td>0.8127</td><td>0.7858</td><td>6.3873</td></tr><tr><td>3.</td><td>TLF [18]</td><td>2.7440</td><td>37.7412</td><td>0.5126</td><td>0.7519</td><td>0.7203</td><td><u>0.6366</u></td><td>0.5646</td><td>4.4289</td></tr><tr><td>4.</td><td>LRSGM [19]</td><td>1.9626</td><td>40.2513</td><td>0.6185</td><td>0.7926</td><td>0.7157</td><td>0.7653</td><td>0.5764</td><td>6.3763</td></tr><tr><td>5.</td><td>AKSNLM [20]</td><td><u>0.8886</u></td><td>48.6484</td><td><u>0.7949</u></td><td>0.6187</td><td>0.6063</td><td><u>0.7473</u></td><td><u>0.8998</u></td><td>6.8774</td></tr><tr><td>6.</td><td>ADRN [21]</td><td>1.3912</td><td>46.7031</td><td>0.7881</td><td>0.7234</td><td>0.7146</td><td>0.8759</td><td>0.7827</td><td><u>7.3678</u></td></tr><tr><td>7.</td><td>TRPA [22]</td><td>1.3956</td><td>46.6796</td><td>0.7247</td><td><u>0.8637</u></td><td>0.8138</td><td>0.6378</td><td>0.8537</td><td>7.6085</td></tr><tr><td>8.</td><td>SRDS [23]</td><td>0.8658</td><td><u>48.7468</u></td><td>0.7908</td><td>0.8439</td><td><u>0.8156</u></td><td>0.8471</td><td>0.8953</td><td>5.2561</td></tr><tr><td>9.</td><td>DURED [24]</td><td><u>0.6942</u></td><td><u>49.7221</u></td><td>0.7917</td><td><u>0.9648</u></td><td><u>0.9162</u></td><td>0.7511</td><td><u>0.9125</u></td><td><u>6.9126</u></td></tr><tr><td>10</td><td>Proposed</td><td>0.4486</td><td>51.9872</td><td>0.8268</td><td>0.9947</td><td>0.9857</td><td>0.6075</td><td>0.9862</td><td>5.0547</td></tr></tbody></table>

<table><caption>**Table 6.** Combination of parametric values for finding the best performance assessment parameters on dataset</caption><thead><tr><th rowspan="2">Experimental Parameter Values</th><th colspan="8">Performance Parameters</th></tr><tr><th>MSE</th><th>PSNR</th><th>UQI</th><th>SSIM</th><th>MS-SSIM</th><th>NAE</th><th>CC</th><th>DE</th></tr></thead><tbody><tr><td>Case 1: Δt = 0.1, n = 02, β = 10, α = 0.5</td><td>4.9354</td><td>32.8756</td><td>0.8846</td><td>0.9745</td><td>0.9707</td><td>0.8657</td><td>0.7358</td><td>4.1269</td></tr><tr><td>Case 2: Δt = 0.2, n = 05, β = 15, α = 0.9</td><td>4.6209</td><td>35.7754</td><td>0.6089</td><td>0.9786</td><td>0.9782</td><td>0.8012</td><td>0.7686</td><td>4.5275</td></tr><tr><td>Case 3: Δt = 0.3, n = 10, β = 20, α = 1.0</td><td>4.7428</td><td>35.6465</td><td>0.7178</td><td>0.9836</td><td>0.9806</td><td>0.6456</td><td>0.7655</td><td>4.2467</td></tr><tr><td>Case 4: Δt = 0.4, n = 15, β = 25, α = 1.2</td><td>3.1489</td><td>40.2513</td><td>0.7656</td><td>0.9857</td><td>0.9832</td><td>0.8754</td><td>0.7439</td><td>4.6531</td></tr><tr><td>Case 5: Δt = 0.5, n = 20, β = 30, α = 1.5</td><td>4.0623</td><td>37.8761</td><td>0.7949</td><td>0.9886</td><td>0.9854</td><td>0.7335</td><td>0.8234</td><td>4.5738</td></tr><tr><td>Case 6: Δt = 0.6, n = 25, β = 35, α = 1.9</td><td>4.2954</td><td>36.5793</td><td>0.7356</td><td>0.9945</td><td>0.9924</td><td>0.7665</td><td>0.8592</td><td>4.7874</td></tr><tr><td>Case 7: Δt = 0.7, n = 30, β = 40, α = 2.0</td><td>1.4142</td><td>46.6421</td><td>0.7144</td><td>0.9967</td><td>0.9936</td><td>0.7488</td><td>0.8061</td><td>4.9234</td></tr><tr><td>Case 8: Δt = 0.8, n = 35, β = 45, α = 2.3</td><td>3.4854</td><td>40.7468</td><td>0.8298</td><td>0.9843</td><td>0.9876</td><td>0.5382</td><td>0.8955</td><td>5.2095</td></tr><tr><td>Case 9: Δt = 0.9, n = 40, β = 47, α = 2.5</td><td>0.7246</td><td>49.5381</td><td>0.8965</td><td>0.9921</td><td>0.9911</td><td>0.7511</td><td>0.8976</td><td>5.2871</td></tr><tr><td>Case 10: Δt = 1.0, n = 45, β = 50, α = 2.7</td><td>0.8848</td><td>48.3268</td><td>0.7956</td><td>0.9987</td><td>0.9925</td><td>0.5376</td><td>0.9154</td><td>5.1843</td></tr><tr><td>Case 11: Δt = 0.1, n = 50, β = 40, α = 2.0</td><td>0.4486</td><td>51.9872</td><td>0.8268</td><td>0.9947</td><td>0.9857</td><td>0.6075</td><td>0.9862</td><td>5.0547</td></tr></tbody></table>
<figure><img src="image_8.png" /><figcaption>(a)</figcaption></figure>

<figure><img src="image_9.png" /><figcaption>(b)</figcaption></figure>

<figure><img src="image_10.png" /><figcaption>(c)</figcaption></figure>

<figure><img src="image_11.png" /><figcaption>(d)</figcaption></figure>

<figure><img src="image_12.png" /><figcaption>(e)</figcaption></figure>

<figure><img src="image_13.png" /><figcaption>(f)</figcaption></figure>
<figure><img src="image_14.png" /><figcaption>**Figure 7.** Box plot of comparative parameter assessment for performance evaluation between proposed method and existing state of art (a) MSE, (b) PSNR, (c) UQI, (d) SSIM, (e) MS-SSIM, (f) NAE, (g) CC, and (h) DE</figcaption></figure>

<figure><img src="image_15.png" /><figcaption>**Figure 8.** Dot plot of combination of parameter values taken in all 11 cases (a) PSNR, (b) MSE and DE, and (c) UQI, SSIM, MS-SSIM, NAE, and CC</figcaption></figure>
<table><caption>**Table 7.** Quantitative evaluation of the proposed methodology on phantom MR image with different noise variations</caption><thead><tr><th>S. No.</th><th>Noisy Image</th><th>MSE</th><th>PSNR</th><th>UQI</th><th>SSIM</th><th>MS-SSIM</th><th>NAE</th><th>CC</th><th>DE</th></tr></thead><tbody><tr><td>1.</td><td>Figure 9(b)</td><td>0.5287</td><td>42.7652</td><td>0.6684</td><td>0.8602</td><td>0.8929</td><td>0.4941</td><td>0.8435</td><td>6.8445</td></tr><tr><td>2.</td><td>Figure 9(f)</td><td>0.6586</td><td>41.8170</td><td>0.7515</td><td>0.8058</td><td>0.8887</td><td>0.5367</td><td>0.8194</td><td>6.9318</td></tr><tr><td>3.</td><td>Figure 9(j)</td><td>0.4402</td><td>43.5621</td><td>0.7461</td><td>0.7429</td><td>0.7961</td><td>0.5801</td><td>0.7285</td><td>6.7683</td></tr><tr><td>4.</td><td>Figure 9(n)</td><td>1.2821</td><td>38.9205</td><td>0.9735</td><td>0.8930</td><td>0.9693</td><td>0.1730</td><td>0.9934</td><td>5.2310</td></tr></tbody></table>

To show the best possible output combination of this method, a total of 11 cases have been taken with the help of random search optimization using the parameters described in Table 2. The values of those iterations are shown in Table 6. The parameters taken for the final output performance assessment calculation are shown in Case 11. A comparative study of these cases is shown with dot plots in Figure 8.

The major advantage of the proposed method is that it effectively reduces Rician noise in MR images while preserving critical structural details through reformed AD with MLE and EMEE. Parameter optimization via GSO and enhancement using modified UM significantly improve the sharpness and contrast of images, improving both qualitative visual quality and quantitative values, thereby aiding in better diagnosis and clinical applications. Our proposed work and comparison of those works are completely based on traditional image denoising methods; that's why real-time denoising methods have been omitted. Real-time denoising methods, such as lightweight CNNs, are deep learning models that require a large training dataset to learn effective noise patterns and work aggressively on denoising [54]. Our proposed methodology is robust to small datasets. The proposed method selectively smooths regions based on the edge threshold constant of the diffusion coefficient. It is automated using the Enhancement Measurement on Entropy (EMEE) method and is combined with Maximum Likelihood Estimation (MLE) rather than relying on manual calculation. To further enhance the quality of the smoothed images, the Greedy Search Optimization (GSO) algorithm is employed, with the Peak Signal-to-Noise Ratio (PSNR) serving as the fitness function.

This approach facilitates denoising while preserving significant structures, such as edges and contours. In the context of real-time denoising images, it is extremely important to preserve edges rather than solely concentrating on aggressive noise removal. Additionally, real-time denoising methods typically demand more computational resources compared to traditional denoising techniques [55]. Also, in the case of small datasets, these real-time denoising models frequently struggle to generalize effectively because they lack sufficient training samples, resulting in overfitting [56].

Generally, denoising methods are affected by class imbalance, especially when the number of healthy controls in datasets is greater than individuals with abnormalities [57-59]. Model-based or data-driven methods typically learn noise patterns primarily from the majority class [60]. This highlights the importance of balancing the datasets in data-driven denoising methods. To address the issues related to class imbalance, the process of data augmentation is used [61]. Data augmentation increases the number of samples in data using zooming, cropping, rotation, etc., and enhances generalization by introducing diversity into the data. Generative Adversarial Networks (GANs) are the most preferred data augmentation used for balancing the datasets [62]. However, class imbalance does not affect the performance of the proposed method, as it operates independently on each individual image. Also, the main objective of the methodology is to check the ability of the algorithm to improve the quality of the image by removing noise.

<figure><img src="image_16.png" /><figcaption>**Figure 9.** MR image (a) Phantom image [63], (b) 5% Rician noisy image, (c) Edge image, (d) Enhanced output image, (e) Phantom image [63], (f) 10% Rician noisy image, (g) Edge image, (h) Enhanced output image, (i) Phantom image [63], (j) 20% Rician noisy image, (k) Edge image, (l) Enhanced output image, (m) Phantom image [63], (n) Gaussian and poisson noisy Image, (o) Edge image, and (p) Enhanced output image</figcaption></figure>

Though the proposed method is tailored for Rician noise. However, its inherent properties that suppresses noise while keeping edges sharp and adjusting the smoothness makes it

effective for denoising images affected by Gaussian and Poisson noise too. Some phantom MR images from the Kaggle dataset were taken to support the statement [63]. The proposed
methodology has been applied to those images. Figures 9(a), 9(e), 9(i), and 9(m) show sample phantom MR images taken from the dataset [63]. Figures 9(b), 9(f), and 9(j) represent images obtained after adding 5%, 10%, and 20% of Rician noise, respectively. Figures 9(n) comprises a combination of additive Gaussian and Poisson noise. Figures 9(c), 9(g), 9(k), and 9(o) show edge images obtained after deducting the smoothened image from those noisy MR images. Finally, Figures 9(d), 9(h), 9(l), and 9(p) exhibit restored and sharpened enhanced images obtained after the proposed methodology. These noisy images have also undergone a quantitative analysis of the parameters discussed in Table 3. The values of parameter obtained is shown in Table 7. The qualitative and quantitative outputs of the phantom images shows that the proposed method performs well with various other types of noises too.

Apart from advantages, this methodology has some disadvantage too. This proposed method has high computational complexity and requires precise parameter tuning, which may not always yield optimal results. Additionally, Unsharp Masking can introduce artifacts, and implementing the combined approach requires extensive expertise in image processing. These disadvantages highlight the need for careful consideration and potential improvement of methods when taken for future application in other digital image processing.

## 5. CONCLUSION

The primary objective of this method is to achieve superior visual quality with reducing noise and preserving critical structural details thereby enhancing the features of MR images for diagnostic and clinical applications. The proposed method effectively restores and enhances Rician noise-corrupted MR images by integrating AD for denoising, GSO for parameter optimization, and OADUM for improving the sharpness and contrast of the MR image. The efficiency of the model can be validated through qualitative and quantitative analyses. From the comparative study, it can be seen that the proposed method is giving best visual output MR image of taken dataset.

Through quantitative analysis shown in Table 5., the values of parameter MSE, PSNR, UQI, SSIM, MS-SSIM, NAE, CC, and DE are coming out to be 0.4486, 51.9872, 0.8268, 0.9947, 0.9857, 0.6075, 0.9862, and 5.0547, respectively. Out of eight parameters, this method is giving best output for seven parameters which show its utility in diagnostic and clinical settings, contributing to better diagnosis, treatment planning, and patient outcomes. Also, the qualitative and quantitative output values of the phantom images indicate that the proposed methodology produces good denoised output images for various types of noise as well.

Enhancing computational efficiency for real-time processing and integrating machine learning for automatic parameter adjustment can improve its robustness and practicality. This can be further supported by hardware implementation on platforms like GPUs or FPGAs. Implementing the proposed method on GPUs accelerates parallel processing using computing platforms Open Computing Language (OpenCL) or Compute Unified Device Architecture (CUDA). For FPGAs, the use of pipelined fixed-point architectures alongside custom data dataflows can guarantee high throughput and minimal latency. Optimized memory management and fixed-point computations enhance speed and energy efficiency, making them suitable for

embedded devices. Additionally, further enhancing its utility and effectiveness in clinical settings can be achieved by extending its application to multimodality imaging, developing a user-friendly interface, validating on larger datasets, and combining it with other enhancement techniques like deep learning-based super resolution.

## REFERENCES

[1] Chaitanya, P.S., Satpathy, S.K. (2023). A multilevel Denoising approach for precision Edge-based fragmentation in MRI brain tumor segmentation. Traitement du Signal, 40(4): 1715-1722. https://doi.org/10.18280/ts.400440

[2] Tao, M.J., Lou, J.S., Wang, L. (2022). MRI liver image assisted diagnosis based on improved faster R-CNN. Traitement du Signal, 39(4): 1347-1355. https://doi.org/10.18280/ts.390428

[3] Mohan, J., Krishnaveni, V., Guo, Y. (2014). A survey on the magnetic resonance image denoising methods. Biomed Signal Process Control, 9: 56-69. https://doi.org/10.1016/J.BSPC.2013.10.007

[4] Hamad, R.W., Ismail, M.H., Raed, S. (2024). Efficient MRI image real-time processing using FPGA-based IIR filters. Journal Européen des Systèmes Automatisés, 57(3): 869-876. https://doi.org/10.18280/jesa.570326

[5] Xue, T., Liu, W., Wang, L., Shi, Y., Hu, Y., Yang, J., Li, G., Huang, H., Cui, D. (2024). Extracellular vesicle biomarkers for complement dysfunction in schizophrenia. Brain, 147(3): 1075-1086. https://doi.org/10.1093/BRAIN/AWAD341

[6] Jiang, S., Jia, Q., Peng, Z., Zhou, Q., An, Z., Chen, J., Yi, Q. (2025). Can artificial intelligence be the future solution to the enormous challenges and suffering caused by Schizophrenia? Schizophrenia, 11: 1-16. https://doi.org/10.1038/S41537-025-00583-4

[7] Brain Tumor Symptoms, Causes, and Types. https://miamineurosciencecenter.com/en/conditions/brain-tumors/, accessed on May 28, 2025.

[8] Riya, Gupta, B., Lamba, S.S. (2021). An efficient anisotropic diffusion model for image denoising with edge preservation. Computers & Mathematics with Applications, 93: 106-119. https://doi.org/10.1016/J.CAMWA.2021.03.029

[9] Thazeen, S., Mallikarjunaswamy, S., Siddesh, G.K., Sharmila, N. (2021). Conventional and subspace algorithms for mobile source detection and radiation formation. Traitement du Signal, 38(1): 135-145. https://doi.org/10.18280/ts.380114

[10] Nair, R.R., Ranganathan, S.S. (2024). Classification of lung adenocarcinoma using convolutional neural networks: A bioinformatics approach. Traitement du Signal, 41(2): 999-1007. https://doi.org/10.18280/ts.410240

[11] Verma, K., Srivastava, S., Mishra, R.K. (2025). Unveiling the best edge detection algorithm for brain magnetic resonance imaging: A qualitative and quantitative comparative study. In: Kumar Singh, K., Singh, S., Srivastava, S., Bajpai, M.K. (eds) Machine Vision and Augmented Intelligence. MAI 2023. Lecture Notes in Electrical Engineering, vol 1211. Springer, Singapore. https://doi.org/10.1007/978-981-97-4359-9_71

[12] Tsiaras, V., Maia, R., Diakoloukas, V., Stylianou, Y.,
Digalakis, V. (2016). Global variance in speech synthesis with linear dynamical models. IEEE Signal Processing Letters, 23(8): 1057-1061.
https://doi.org/10.1109/LSP.2016.2580672

[13] Verma, K., Srivastava, S., Mishra, R.K. (2024). Revolutionizing medical image processing through immersive metaverse: A paradigm shift. In 2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT), Kamand, India, pp. 1-7.
https://doi.org/10.1109/ICCCNT61001.2024.10723867

[14] Fan, Y., Wang, L., Wu, W., Du, D. (2021). Cloud/edge computing resource allocation and pricing for mobile blockchain: An iterative greedy and search approach. IEEE Transactions on Computational Social Systems, 8(2): 451-463.
https://doi.org/10.1109/TCSS.2021.3049152

[15] Javeed, A., Zhou, S., Liao, Y., Qasim, I., Noor, A., Nour, R. (2019). An intelligent learning system based on random search algorithm and optimized random forest model for improved heart disease detection. IEEE Access, 7: 180235-108043.
https://doi.org/10.1109/ACCESS.2019.2952107

[16] Hu, J., Zhou, J., Wu, X. (2016). Non-local MRI denoising using random sampling. Magnetic Resonance Imaging, 34(7): 990-999.
https://doi.org/10.1016/J.MRI.2016.04.008

[17] Nguyen, M.P., Chun, S.Y. (2017). Bounded self-weights estimation method for non-local means image denoising using minimax estimators. IEEE Transactions on Image Processing, 26(4): 1637-1649.
https://doi.org/10.1109/TIP.2017.2658941

[18] Chang, H.H., Li, C.Y., Gallogly, A.H. (2018). Brain MR image restoration using an automatic trilateral filter with GPU-based acceleration. IEEE Transactions on Biomedical Engineering, 65(2): 400-413.
https://doi.org/10.1109/TBME.2017.2772853

[19] Zhang, Y., Yang, Z., Hu, J., Zou, S., Fu, Y. (2019). MRI denoising using low rank prior and sparse gradient prior. IEEE Access, 7: 45858-45865.
https://doi.org/10.1109/ACCESS.2019.2907637

[20] Kanoun, B., Ambrosanio, M., Baselice, F., Ferraioli, G., Pascazio, V., Gómez, L. (2020). Anisotropic weighted KS-NLM filter for noise reduction in MRI. IEEE Access, 8: 184866-184884.
https://doi.org/10.1109/ACCESS.2020.3029297

[21] Rai, S., Bhatt, J.S., Patra, S.K. (2021). Augmented noise learning framework for enhancing medical image denoising. IEEE Access, 9: 117153-11768.
https://doi.org/10.1109/ACCESS.2021.3106707

[22] Hou, R., Li, F., Zhang, G. (2022). Truncated residual based plug-and-play ADMM algorithm for MRI reconstruction. IEEE Transactions on Computational Imaging, 8: 96-108.
https://doi.org/10.1109/TCI.2022.3145187

[23] Chung, H., Lee, E.S., Ye, J.C. (2023). MR image denoising and super-resolution using regularized reverse diffusion. IEEE Transactions on Medical Imaging, 42(4): 922-934.
https://doi.org/10.1109/TMI.2022.3220681

[24] Huang, P., Zhang, C., Zhang, X., Li, X., Dong, L., Ying, L. (2024). Self-supervised deep unrolled reconstruction using regularization by denoising. IEEE Transactions on Medical Imaging, 43(3): 1203-1213.
https://doi.org/10.1109/TMI.2023.3332614

[25] COBRE. http://fcon_1000 projects.nitrc.org/indi/retro/cobre.html, accessed on August 23, 2024.

[26] Gudbjartsson, H., Patz, S. (1995). The Rician distribution of noisy MRI data. Magnetic Resonance in Medicine, 34(6): 910-914.
https://doi.org/10.1002/MRM.1910340618

[27] Pankaj, D., Govind, D., Narayanankutty, K.A. (2021). A novel method for removing Rician noise from MRI based on variational mode decomposition. Biomedical Signal Processing and Control, 69: 102737.
https://doi.org/10.1016/J.BSPC.2021.102737

[28] Hoskins, R.F. (2011). The Dirac delta function. In Delta Functions (Second Edition), Woodhead Publishing Limited, pp. 26-46.
https://doi.org/10.1533/9780857099358.26

[29] Kornilov, M.V. (2020). Maximum likelihood estimation for disk image parameters. IEEE Signal Processing Letters, 27: 1480-1484.
https://doi.org/10.1109/LSP.2020.3017371

[30] Yadav, R.B., Srivastava, S., Srivastava, R. (2016). A partial differential equation-based general framework adapted to Rayleigh's, Rician's and Gaussian's distributed noise for restoration and enhancement of magnetic resonance image. Journal of Medical Physics, 41(4): 254-265.
https://doi.org/10.4103/0971-6203.195190

[31] Bai, J., Feng, X.C. (2018). Image denoising using generalized anisotropic diffusion. Journal of Mathematical Imaging and Vision, 60: 994-1007.
https://doi.org/10.1007/S10851-018-0790-4

[32] Zhao, W., Huang, L., Wang, J., Sun, Z. (2015). Entropy maximisation histogram modification scheme for image enhancement. IET Image Process, 9(3): 226-235.
https://doi.org/10.1049/IET-IPR.2014.0347

[33] Celik, T. (2014). Spatial entropy-based global and local image contrast enhancement. IEEE Transactions on Image Processing, 23(12): 5298-5308.
https://doi.org/10.1109/TIP.2014.2364537

[34] Gupta, S., Porwal, R. (2016). Appropriate contrast enhancement measures for brain and breast cancer images. International Journal of Biomedical Imaging, 2016(1): 4710842.
https://doi.org/10.1155/2016/4710842

[35] Subramani, B., Veluchamy, M. (2020). A fast and effective method for enhancement of contrast resolution properties in medical images. Multimedia Tools and Applications, 79: 7837-7855.
https://doi.org/10.1007/S11042-019-08521-0

[36] Li, H., Wu, S., Deng, L., Liu, C., Chen, Y., Chen, H., Yu, H., Dong, M., Zhu, L. (2015). Enhancing infrared and visible image fusion through multiscale Gaussian total variation and adaptive local entropy. The Visual Computer, 41: 7817-7838.
https://doi.org/10.1007/S00371-025-03840-W

[37] Huang, Y., Zhao, Y., Capstick, A., Palermo, F., Haddadi, H., Barnaghi, P. (2024). Analyzing entropy features in time-series data for pattern recognition in neurological conditions. Artificial Intelligence in Medicine, 150: 102821.
https://doi.org/10.1016/J.ARTMED.2024.102821

[38] Yang, J., Guo, Z., Wu, B., Du, S. (2023). A nonlinear anisotropic diffusion model with non-standard growth for image segmentation. Applied Mathematics Letters,
141: 108627.
https://doi.org/10.1016/J.AML.2023.108627

[39] Kumar, A., Kumar, P., Srivastava, S. (2022). A skewness reformed complex diffusion based unsharp masking for the restoration and enhancement of Poisson noise corrupted mammograms. Biomedical Signal Processing and Control, 73: 103421.
https://doi.org/10.1016/J.BSPC.2021.103421

[40] Kumar, R., Srivastava, S., Srivastava, R. (2017). A fourth order PDE based fuzzy C-means approach for segmentation of microscopic biopsy images in presence of Poisson noise for cancer detection. Computer Methods and Programs in Biomedicine, 146: 59-68.
https://doi.org/10.1016/J.CMPB.2017.05.003

[41] Verma, K., Srivastava, S., Mishra, R.K. (2024). Novel fuzzy type-II driven modified Anisotropic Diffusion filter framework for restoration and enhancement of Rician noise corrupted MR images. Multimedia Tools and Applications, 83: 86621-86655.
https://doi.org/10.1007/S11042-024-19624-8

[42] Nose, T. (2016). Efficient implementation of global variance compensation for parametric speech synthesis. IEEE/ACM Transactions on Audio, Speech, and Language Processing, 24(10): 1694-1704.
https://doi.org/10.1109/TASLP.2016.2580298

[43] Noroozi, M., Mohammadi, H., Efatinasab, E., Lashgari, A., Eslami, M., Khan, B. (2022). Golden search optimization algorithm. IEEE Access, 10: 37515-37532.
https://doi.org/10.1109/ACCESS.2022.3162853

[44] Lai, T., Fujita, H., Yang, C., Li, Q., Chen, R. (2019). Robust model fitting based on greedy search and specified inlier threshold. IEEE Trans Ind Electron, 66: 7956-7966.
https://doi.org/10.1109/TIE.2018.2881950

[45] Mishra, H.K., Kaur, M. (2022). An approach for enhancement of MR images of brain tumor. Traitement du Signal, 39(4): 1133-1144.
https://doi.org/10.18280/ts.390405

[46] Kumar, P., Srivastava, S., Padma Sai, Y., Choudhary, S. (2021). Optimal Bayesian estimation framework for reduction of speckle noise from breast ultrasound images. In Innovations in Cyber Physical Systems. Lecture Notes in Electrical Engineering, pp. 255-263.
https://doi.org/10.1007/978-981-16-4149-7_22

[47] Hou, G., Zhao, X., Pan, Z., Yang, H., Tan, L., Li, J. (2020). Benchmarking underwater image enhancement and restoration, and beyond. IEEE Access, 8: 122078-122091.
https://doi.org/10.1109/ACCESS.2020.3006359

[48] Patsariya, S., Dixit, M. (2022). Entropy based secure and robust image watermarking using lifting wavelet transform and multi-level-multiple image scrambling technique. Traitement du Signal, 39(5): 1751-1759.
https://doi.org/10.18280/ts.390533

[49] Zhu, Y.B. (2020). Color management of digital media art images based on image processing. Ingénierie des Systèmes d'Information, 25(4): 445-452.
https://doi.org/10.18280/isi.250406

[50] Mendo, L. (2009). Estimation of a probability with guaranteed normalized mean absolute error. IEEE Communications Letters, 13(11): 817-819.
https://doi.org/10.1109/LCOMM.2009.091128

[51] Jiang, Y. (2021). Application of deep learning and brain images in diagnosis of Alzheimer's patients. Traitement du Signal, 38(5): 1431-1438.

https://doi.org/10.18280/ts.380518

[52] Çiğ, H., Güllüoğlu, M.T., Er, M.B., Kuran, U., Kuran, E.C. (2023). Enhanced disease detection using contrast limited adaptive histogram equalization and multi-objective cuckoo search in deep learning. Traitement du Signal, 40(3): 915-925.
https://doi.org/10.18280/ts.400308

[53] Liu, S., Fang, L., Zhou, Z., Hong, Y. (2020). Uncertain box-cox regression analysis with rescaled least squares estimation. IEEE Access, 8: 84769-84776.
https://doi.org/10.1109/ACCESS.2020.2989211

[54] Heunis, S., Lamerichs, R., Zinger, S., Caballero-Gaudes, C., Jansen, J.F.A., Aldenkamp, B., Breeuwer, M. (2020). Quality and denoising in real-time functional magnetic resonance imaging neurofeedback: A methods review. Human Brain Mapping, 41(12): 3439-34367.
https://doi.org/10.1002/HBM.25010

[55] Juneja, M., Rathee, A., Verma, R., Bhutani, R., Baghel, S., Saini, S.K., Jindal, P. (2024). Denoising of magnetic resonance images of brain tumor using BT-Autonet. Biomedical Signal Processing and Control, 87: 105477.
https://doi.org/10.1016/J.BSPC.2023.105477

[56] Nazir, N., Sarwar, A., Saini, B.S. (2024). Recent developments in denoising medical images using deep learning: An overview of models, techniques, and challenges. Micron, 180: 103615.
https://doi.org/10.1016/J.MICRON.2024.103615

[57] Thölke, P., Mantilla-Ramos, Y.J., Abdelhedi, H., Maschke, C., et al. (2023). Class imbalance should not throw you off balance: Choosing the right classifiers and performance metrics for brain decoding with imbalanced data. NeuroImage, 277: 120253.
https://doi.org/10.1016/J.NEUROIMAGE.2023.120253

[58] Cui, L., Li, D., Yang, X., Liu, C., Yan, X. (2024). A unified approach addressing class imbalance in magnetic resonance image for deep learning models. IEEE Access, 12: 27368-27384.
https://doi.org/10.1109/ACCESS.2024.3365544

[59] Sun, Z., Ying, W., Zhang, W., Gong, S. (2024). Undersampling method based on minority class density for imbalanced data. Expert Systems with Applications, 249: 123328.
https://doi.org/10.1016/J.ESWA.2024.123328

[60] Afzal, S., Maqsood, M., Nazir, F., Khan, U., Aadil, F., Awan, K.M., Mehmood, I., Song, O. (2019). A data augmentation-based framework to handle class imbalance problem for Alzheimer's stage detection. IEEE Access, 7: 115528-115539.
https://doi.org/10.1109/ACCESS.2019.2932786

[61] Jiang, X., Ge, Z. (2021). Data augmentation classifier for imbalanced fault classification. IEEE Transactions on Automation Science and Engineering, 18(3): 1206-1217.
https://doi.org/10.1109/TASE.2020.2998467

[62] Goodfellow, I.J., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y. (2014). Generative adversarial nets. Advances in Neural Information Processing Systems.
https://papers.nips.cc/paper_files/paper/2014/hash/f033e d80deb0234979a61f95710dbe25-Abstract.html

[63] human brain phantom MRI dataset.
https://www.kaggle.com/datasets/ukeppendorf/frequentl y-traveling-human-phantom-fthp-dataset?select=1.nii, accessed on June 4, 2025.