# Edge-Preserving Median Filter and Weighted Coding with Sparse Nonlocal Regularization for Low-Dose CT Image Denoising Algorithm

Authors: Quan Yuan; Zhenyun Peng; Zhencheng Chen; Yanke Guo; Bin Yang; Xiangyan Zeng
Journal: Journal of Healthcare Engineering
 (2021)

---

## Abstract

The impulse noise in CT image was removed based on edge-preserving median filter algorithm. The sparse nonlocal regularization algorithm weighted coding was used to remove the impulse noise and Gaussian noise in the mixed noise, and the peak signal-to-noise ratio (PSNR) and structural similarity index (SSIM) were calculated to evaluate the quality of the denoised CT image. It was found that in nine different proportions of Gaussian noise and salt-and-pepper noise in Shepp-Logan image and CT image processing, the PSNR and SSIM values of the proposed denoising algorithm based on edge-preserving median filter (EP median filter) and weighted encoding with sparse nonlocal regularization (WESNR) were significantly higher than those of using EP median filter and WESNR alone. It was shown that the weighted coding algorithm based on edge-preserving median filtering and sparse nonlocal regularization had potential application value in low-dose CT image denoising.


---

## Body

## 1. Introduction

CT images are susceptible to the interference of quantum noise and electronic noise of detectors and other noises during the acquisition process, which causes the quality of reconstructed images to decrease, which in turn affects the diagnosis of diseases by doctors [1]. Under normal circumstances, the scan dose is proportional to the sharpness of the CT image. However, CT radiation dose is accumulated throughout the life, and multiple CT scans will increase the risk of cancer [2, 3]. Low-dose CT scan can reduce the radiation dose of patients, reduce equipment damage, reduce costs, and is conducive to the general investigation and cure of certain diseases [4]. However, the reduction of low-dose CT tube current leads to rapid degradation of projection data. After traditional algorithms are reconstructed, there are still obvious noises and artifacts in the CT reconstructed image, which seriously affects the credibility of the doctor’s diagnosis. Low-dose CT scan technology is unable to give full play to its accurate diagnostic efficacy in clinical practice [5]. There may be some isolated impulse noise points in some areas of low-dose CT images. After these isolated impulse noise points are filtered, the CT image data is distributed in the form of Gaussian noise [6]. Due to the complexity of the distribution of noise and artifacts in low-dose CT images, it is difficult to establish a suitable and accurate prior model of noise in the image domain reconstruction method. The image preprocessing is complex, and the calculation is large, which affects the real-time clinical application of CT. The postprocessing method is a method that is directly applied to the reconstructed low-dose CT image to improve its image quality [7]. The method is simple and easy to implement and has good compatibility with existing CT equipment.According to the sparse representation theory, the differences in the learning dictionary caused by individual differences and differences in tissues and organs in CT images are very small [8]. Chen et al. [5] improved the reconstruction quality of low-dose CT images with a sparse image reconstruction method. Cui et al. [9] proposed a learning method based on morphological component analysis, which can automatically generate an adaptive discriminant dictionary and effectively suppress the artifacts of low-dose CT images under the framework of sparse representation. Jiang et al. [10] proposed a denoising algorithm based on weighted coding and sparse nonlocal regularization (WESNR), which simultaneously removes impulse noise and Gaussian noise through soft impulse pixel detection. The principal component analysis (PCA) dictionary was used to encode image blocks, and the coding residuals were weighted to suppress the heavy tail of the distribution. The image sparse prior and nonlocal self-similarity prior were merged into a single nonlocal sparse regularization term, which enhances the stability of weighted coding. However, when this method was applied to low-dose CT image denoising, details were lost, and edges were destroyed. A variety of edge preservation filters can solve the problem of incorrect removal of edges and lines in the image denoising process. The feature of edge-preserving filtering is that it can extract the spatial constraint factors of the edge information in the reference image to process the original image, thereby smoothing and edge-preserving it. Among them, edge-preserving median filter (EP median filter) has a good performance in terms of operation speed and edge protection [11]. However, the edge-preserving filtering algorithm is not effective for mixed noise and noise with low signal-to-noise ratio.In this exploration, a denoising algorithm based on EP median filter and WESNR is proposed, which can remove the mixed noise of low-dose CT image and preserve the edge information of the image.


## 2. Algorithm Based on WESNR and EP Median Filter

### 2.1. Mixed Noise Model

For imagex with size m×n, xi,j is the gray value at i,j, and y is set as the observed image of image x. For adding Gaussian noise, the pixels yi,j in y are defined as yi,j=xi,j+vi,j, where vi,j is the independent and identically distributed noise; for the salt-and-pepper noise, dmin,dmax represents the dynamic range of y pixels in the observation image, and the probability of salt-and-pepper noise is s, 0≤s≤1. Then, the probability of yi,j=dmin is s/2, and the probability of yi,j=dmax is s/2. Therefore, the observation image mixed with Gaussian noise and salt-and-pepper noise can be described as follows:(1)yi,j=dmin,the probability iss2,dmax,the probability iss2,xi,j+vi,j,the probability is1−s.


### 2.2. EP Median Filter Algorithm

The pixel ati,j3≤i≤m−2,3≤j≤n−2 in image y has the neighborhood of 5×5 in Figure 1. If i,j is a point in a flat area, most of the gray values of 24 pixels in its neighborhood should be close to it. Even if there are few noise points, it can be set to less than one-fourth; that is, the number ti,j of absolute values of gray value difference greater than a certain threshold T is less than or equal to 6; if i,j is an edge point, about half of the gray values of the 24 pixels in its neighborhood should be close to it, and the other half should have a large difference with it; that is, the number ti,j of gray values whose absolute value is greater than a certain threshold T should be about 12; if i,j is a noise point, most of the gray values of the 24 pixels in its neighborhood should not be close to it. It can be set as no less than three-fourths; that is, the number ti,j of absolute values of gray value difference greater than a certain threshold value T is greater than or equal to 18.Figure 1
Gray value ofi,j and its neighborhood Algorithm 1 Pixels participating in ai,j′ assignment and their gray values.The standard deviation of imagey is taken as the threshold T; that is, (2)T=∑i=1m∑j=1nyi,j−y¯2m·n,where y¯ is the mean value of all gray values of image y; that is,(3)y¯=∑i=1m∑j=1nyi,jm·n,Based on the above assumption,i,j3≤i≤m−2,3≤j≤n−2 can be divided into points in flat area, edge points, and noises.①
ti,j≤6, i,j is the point of the flat area.②
6<ti,j<18, i,j is the edge point.③
ti,j≥18, i,j is the noise.Wheni,j is noise, the gray value at i,j of the original image is replaced by the mean value of yi,j, yi,j−1, yi−1,j, yi+1,j, yi,j+1, yi−1,j−2, yi+1,j−2, yi−2,j−1, yi+2,j−1, yi−2,j+1, yi+2,j+1, yi−1,j+2, and yi+1,j+2. The pixels participating in the assignment and their gray values are the shadow parts in Algorithm 1, and the mean value is ai,j; that is,(4)ai,j=yi,j+yi,j−1+yi−1,j+yi+1,j+yi,j+1+yi−1,j−2+yi+1,j−2+yi−2,j−1+yi+2,j−1+yi−2,j+1+yi+2,j+1+yi−1,j+2+yi+1,j+213.Algorithm 1:Flow chart of the algorithm proposed.
Input: noisy imagey.Fori,j1≤i≤m,1≤j≤n:①
Wheni≤2,ori≥m−1,orj≤2,orj≥n−1, make: yi,j′=yi,j.②
When3<i<m−2,3<j<n−2,andti,j<18, make: yi,j′=yi,j.③
When3<i<m−2,3<j<n−2,andti,j≥18, make: yi,j′=ai,j.Imagey′ is obtained.Initialization:e0=y′−x0, Wii=exp−aei2, μ=0, k=1, y″0=y′.Whenk≤K, the following cycle is performed:(1)
α^k=ΦTWΦ+Vk−1ΦTWy′−ΦTWΦμ+μ is calculated;(2)
y″k=Φαk is calculated and the nonlocal coding vector μ is updated;(3)
ek=y′−y″k is calculated;(4)
Wii=exp−aei2 is used to calculate weight W;(5)
k≤k+1y″=ΦαKOutput: denoised imagey″.The gray values of all the pixels ini,ji≤2,ori≥m−2,orj≤2,orj≥n−2 are not modified, the gray values of the points in the flat area and the edge points in i,j3≤i≤m−2,3≤j≤n−2 are not modified, and the noise in i,j3≤i≤m−2,3≤j≤n−2 is replaced by the value of ai,j, so that the gray values of the pixels in the i,j position of the denoised image are yi,j′. There is(5)yi,j′=yi,j,i≤2,ori≥m−1,orj≤2orj≥n−1,yi,j,3<i<m−2,3<j<n−2andti,j<18,ai,j,3<i<m−2,3<j<n−2andti,j≥18.Ify′ is the image with size m×n and the gray value at i,j is yi,j′, y′ is the denoised image of observation image y by EP median filter algorithm.


### 2.3. WESNR Algorithm

For imagex, xi=Rix∈Rn′ represent the image block of size n′×n′, where Ri is the matrix vector. Based on the sparse representation theory, the image block is sparse-coded through the overcomplete dictionary Φ=ϕ1;ϕ2;…;ϕn∈Rn′×m′, so that xi=Φαi, where αi is the sparse coding vector of nonzero matrix. The results are as follows:(6)x=Φα,where α is the set of all sparse coding vectors αi.The traditional sparse representation denoising algorithm can be expressed as(7)α^=argminαy−Φα22+λRα,where Rα is a regularization term corresponding to α and λ is a regularization parameter.To make the distribution of data fitting residuals more regular, data residuals are weighted [12]. A new loss function is used, and the following mixed noise removal model is obtained:(8)α^=argminαW1/2y−Φα22+λRα,where W is a diagonal weight matrix with diagonal elements.Image blockxi and its nonlocal prediction are encoded by a given dictionary ϕi; that is, xi=ϕiαi and x^i=ϕiμi, and then the encoding coefficients xi and μi are similar. Therefore, ∑iαi−μilp is used as the regularization term and applied to the above equation. There is(9)α^=argminαW1/2y−Φα22+λ∑iαi−μilp,where lp (p=1 or p=2) is the lp norm. l1 is chosen as the norm. The model is as follows:(10)α^=argminαW1/2y−Φα22+λ∑iαi−μi1,where W is a diagonal weighted matrix whose element Wii will be determined automatically. The coding residual ei can be used to determine the weight Wii, and the strength of Wii is inversely proportional to that of ei. Wii∈0,1 is set. Wii is determined as(11)Wii=exp−aei2.Iterative reweighting is used to solve the problem.V is set to a diagonal matrix and initialized as an identity matrix. In k+1 times of iteration, each element of V is updated as follows:(12)Viik+1=λαik−μi2+ε21/2,where ε is a scalar and αik is the i-th element of the coding vector α in the k-th iteration. The sparse coding α is updated by the following function:(13)α^k+1=ΦTWΦ+Vk+1−1ΦTWy−ΦTWΦμ+μ.A set of local PCA dictionaries are learned from natural images, and the model can be solved by iteratively updatingW and α. The update of W depends on the coding residual e, and the adaptive median filter is selected for y to get an initial image x0. Then, e is initialized to(14)e0=y−x0.The above optimization is repeated for the subproblem until the iteration stop condition is satisfied. When there is no significant change in the solution of continuous iteration or the corresponding objective function value, that is, when the difference norm between two continuous iterative solutions is less than the given positive norm, the algorithm stops, or when the running time exceeds the upper limit, the iterative process stops. In this exploration,t=Φαk+1−Φαk2/Φαk2<τ is regarded as the termination condition. The obtained image is the denoised image of the observed image y by the WESNR algorithm.


### 2.4. Denoising Algorithm Based on EP Median Filter and WESNR

The general denoising algorithm will inevitably lose the details of the image. In particular, for the image with more lines, it will cause the blurring of the visual effect. In order to avoid the situation that the lines and edges of objects in the image are eliminated by mistake in the process of denoising, EP median filter algorithm distinguishes lines or edges from noise in advance, which has good performance in image details and edge preservation. However, EP median filter algorithm is only suitable for the removal of impulse noise in the image, and it does not perform well in the removal of other noises or mixed noises. When low-dose CT images with complex noise are processed, the phenomenon of incomplete noise removal will appear.WESNR algorithm encodes each noise contaminated block, which can remove the mixed noise of impulse noise and Gaussian noise at the same time. However, for low-dose CT image denoising, when WESNR algorithm is used directly, there will be loss of details and edge damage.In order to achieve the purpose of removing mixed noise in the process of low-dose CT image denoising without destroying the details and edges, EP median filter algorithm is combined with WESNR algorithm. First, the points in the center region of the noisy imagey are classified into points in flat areas, edge points, and noise points. The points in the flat area, the edge points, and the points outside the central area are not replaced. The noise in the central region is replaced by the mean value of the gray value of 13 pixels around it to get image y′ after the first step. Then, y′ is input into WESNR algorithm as noisy image, and local PCA dictionary is selected to iterate the target problem, subproblem, and parameters. When the preset termination condition is satisfied, image y″ is the result of the denoising algorithm based on EP median filter and WESNR. Algorithm 1 shows the flow of the algorithm.The steps of denoising algorithm based on EP median filter and WESNR are as follows.


## 2.1. Mixed Noise Model

For imagex with size m×n, xi,j is the gray value at i,j, and y is set as the observed image of image x. For adding Gaussian noise, the pixels yi,j in y are defined as yi,j=xi,j+vi,j, where vi,j is the independent and identically distributed noise; for the salt-and-pepper noise, dmin,dmax represents the dynamic range of y pixels in the observation image, and the probability of salt-and-pepper noise is s, 0≤s≤1. Then, the probability of yi,j=dmin is s/2, and the probability of yi,j=dmax is s/2. Therefore, the observation image mixed with Gaussian noise and salt-and-pepper noise can be described as follows:(1)yi,j=dmin,the probability iss2,dmax,the probability iss2,xi,j+vi,j,the probability is1−s.


## 2.2. EP Median Filter Algorithm

The pixel ati,j3≤i≤m−2,3≤j≤n−2 in image y has the neighborhood of 5×5 in Figure 1. If i,j is a point in a flat area, most of the gray values of 24 pixels in its neighborhood should be close to it. Even if there are few noise points, it can be set to less than one-fourth; that is, the number ti,j of absolute values of gray value difference greater than a certain threshold T is less than or equal to 6; if i,j is an edge point, about half of the gray values of the 24 pixels in its neighborhood should be close to it, and the other half should have a large difference with it; that is, the number ti,j of gray values whose absolute value is greater than a certain threshold T should be about 12; if i,j is a noise point, most of the gray values of the 24 pixels in its neighborhood should not be close to it. It can be set as no less than three-fourths; that is, the number ti,j of absolute values of gray value difference greater than a certain threshold value T is greater than or equal to 18.Figure 1
Gray value ofi,j and its neighborhood Algorithm 1 Pixels participating in ai,j′ assignment and their gray values.The standard deviation of imagey is taken as the threshold T; that is, (2)T=∑i=1m∑j=1nyi,j−y¯2m·n,where y¯ is the mean value of all gray values of image y; that is,(3)y¯=∑i=1m∑j=1nyi,jm·n,Based on the above assumption,i,j3≤i≤m−2,3≤j≤n−2 can be divided into points in flat area, edge points, and noises.①
ti,j≤6, i,j is the point of the flat area.②
6<ti,j<18, i,j is the edge point.③
ti,j≥18, i,j is the noise.Wheni,j is noise, the gray value at i,j of the original image is replaced by the mean value of yi,j, yi,j−1, yi−1,j, yi+1,j, yi,j+1, yi−1,j−2, yi+1,j−2, yi−2,j−1, yi+2,j−1, yi−2,j+1, yi+2,j+1, yi−1,j+2, and yi+1,j+2. The pixels participating in the assignment and their gray values are the shadow parts in Algorithm 1, and the mean value is ai,j; that is,(4)ai,j=yi,j+yi,j−1+yi−1,j+yi+1,j+yi,j+1+yi−1,j−2+yi+1,j−2+yi−2,j−1+yi+2,j−1+yi−2,j+1+yi+2,j+1+yi−1,j+2+yi+1,j+213.Algorithm 1:Flow chart of the algorithm proposed.
Input: noisy imagey.Fori,j1≤i≤m,1≤j≤n:①
Wheni≤2,ori≥m−1,orj≤2,orj≥n−1, make: yi,j′=yi,j.②
When3<i<m−2,3<j<n−2,andti,j<18, make: yi,j′=yi,j.③
When3<i<m−2,3<j<n−2,andti,j≥18, make: yi,j′=ai,j.Imagey′ is obtained.Initialization:e0=y′−x0, Wii=exp−aei2, μ=0, k=1, y″0=y′.Whenk≤K, the following cycle is performed:(1)
α^k=ΦTWΦ+Vk−1ΦTWy′−ΦTWΦμ+μ is calculated;(2)
y″k=Φαk is calculated and the nonlocal coding vector μ is updated;(3)
ek=y′−y″k is calculated;(4)
Wii=exp−aei2 is used to calculate weight W;(5)
k≤k+1y″=ΦαKOutput: denoised imagey″.The gray values of all the pixels ini,ji≤2,ori≥m−2,orj≤2,orj≥n−2 are not modified, the gray values of the points in the flat area and the edge points in i,j3≤i≤m−2,3≤j≤n−2 are not modified, and the noise in i,j3≤i≤m−2,3≤j≤n−2 is replaced by the value of ai,j, so that the gray values of the pixels in the i,j position of the denoised image are yi,j′. There is(5)yi,j′=yi,j,i≤2,ori≥m−1,orj≤2orj≥n−1,yi,j,3<i<m−2,3<j<n−2andti,j<18,ai,j,3<i<m−2,3<j<n−2andti,j≥18.Ify′ is the image with size m×n and the gray value at i,j is yi,j′, y′ is the denoised image of observation image y by EP median filter algorithm.


## 2.3. WESNR Algorithm

For imagex, xi=Rix∈Rn′ represent the image block of size n′×n′, where Ri is the matrix vector. Based on the sparse representation theory, the image block is sparse-coded through the overcomplete dictionary Φ=ϕ1;ϕ2;…;ϕn∈Rn′×m′, so that xi=Φαi, where αi is the sparse coding vector of nonzero matrix. The results are as follows:(6)x=Φα,where α is the set of all sparse coding vectors αi.The traditional sparse representation denoising algorithm can be expressed as(7)α^=argminαy−Φα22+λRα,where Rα is a regularization term corresponding to α and λ is a regularization parameter.To make the distribution of data fitting residuals more regular, data residuals are weighted [12]. A new loss function is used, and the following mixed noise removal model is obtained:(8)α^=argminαW1/2y−Φα22+λRα,where W is a diagonal weight matrix with diagonal elements.Image blockxi and its nonlocal prediction are encoded by a given dictionary ϕi; that is, xi=ϕiαi and x^i=ϕiμi, and then the encoding coefficients xi and μi are similar. Therefore, ∑iαi−μilp is used as the regularization term and applied to the above equation. There is(9)α^=argminαW1/2y−Φα22+λ∑iαi−μilp,where lp (p=1 or p=2) is the lp norm. l1 is chosen as the norm. The model is as follows:(10)α^=argminαW1/2y−Φα22+λ∑iαi−μi1,where W is a diagonal weighted matrix whose element Wii will be determined automatically. The coding residual ei can be used to determine the weight Wii, and the strength of Wii is inversely proportional to that of ei. Wii∈0,1 is set. Wii is determined as(11)Wii=exp−aei2.Iterative reweighting is used to solve the problem.V is set to a diagonal matrix and initialized as an identity matrix. In k+1 times of iteration, each element of V is updated as follows:(12)Viik+1=λαik−μi2+ε21/2,where ε is a scalar and αik is the i-th element of the coding vector α in the k-th iteration. The sparse coding α is updated by the following function:(13)α^k+1=ΦTWΦ+Vk+1−1ΦTWy−ΦTWΦμ+μ.A set of local PCA dictionaries are learned from natural images, and the model can be solved by iteratively updatingW and α. The update of W depends on the coding residual e, and the adaptive median filter is selected for y to get an initial image x0. Then, e is initialized to(14)e0=y−x0.The above optimization is repeated for the subproblem until the iteration stop condition is satisfied. When there is no significant change in the solution of continuous iteration or the corresponding objective function value, that is, when the difference norm between two continuous iterative solutions is less than the given positive norm, the algorithm stops, or when the running time exceeds the upper limit, the iterative process stops. In this exploration,t=Φαk+1−Φαk2/Φαk2<τ is regarded as the termination condition. The obtained image is the denoised image of the observed image y by the WESNR algorithm.


## 2.4. Denoising Algorithm Based on EP Median Filter and WESNR

The general denoising algorithm will inevitably lose the details of the image. In particular, for the image with more lines, it will cause the blurring of the visual effect. In order to avoid the situation that the lines and edges of objects in the image are eliminated by mistake in the process of denoising, EP median filter algorithm distinguishes lines or edges from noise in advance, which has good performance in image details and edge preservation. However, EP median filter algorithm is only suitable for the removal of impulse noise in the image, and it does not perform well in the removal of other noises or mixed noises. When low-dose CT images with complex noise are processed, the phenomenon of incomplete noise removal will appear.WESNR algorithm encodes each noise contaminated block, which can remove the mixed noise of impulse noise and Gaussian noise at the same time. However, for low-dose CT image denoising, when WESNR algorithm is used directly, there will be loss of details and edge damage.In order to achieve the purpose of removing mixed noise in the process of low-dose CT image denoising without destroying the details and edges, EP median filter algorithm is combined with WESNR algorithm. First, the points in the center region of the noisy imagey are classified into points in flat areas, edge points, and noise points. The points in the flat area, the edge points, and the points outside the central area are not replaced. The noise in the central region is replaced by the mean value of the gray value of 13 pixels around it to get image y′ after the first step. Then, y′ is input into WESNR algorithm as noisy image, and local PCA dictionary is selected to iterate the target problem, subproblem, and parameters. When the preset termination condition is satisfied, image y″ is the result of the denoising algorithm based on EP median filter and WESNR. Algorithm 1 shows the flow of the algorithm.The steps of denoising algorithm based on EP median filter and WESNR are as follows.


## 3. Experiment

In addition to the visual effect comparison, the following numerical criteria are given: peak signal-to-noise ratio (PSNR) and structural similarity (SSIM). PSNR is the most commonly used objective index to evaluate image quality, which is an objective description of the degradation degree of an image. The higher the value of PSNR is, the closer it is to the original image. SSIM is mainly used to measure the similarity between the original image and the restored image. The higher the SSIM, the higher the image quality [13].


### 3.1. Shepp-Logan Head Model Experiment

The Shepp-Logan head model of 256∗ 256 is selected as the experimental object. This model was proposed by Shepp and Logan in 1974 [14]. The image is composed of 10 ellipses with different positions, sizes, directions, and densities. Different gray value of ellipse can simulate attenuation coefficient of different tissues, and Shepp-Logan head model can simulate human head sectional image well. In Shepp-Logan image, the mixed noise with different proportions of Gaussian noise and salt-and-pepper noise are added, respectively. EP median filter algorithm, WESNR algorithm, and the algorithm proposed in this exploration are used to denoise the image. The reconstruction effect and numerical comparison of various algorithms under nine kinds of noise are listed, as shown in Figure 2 and Table 1. The bold fonts in the table indicate the advantages of the algorithm.Figure 2
Denoising effect of different methods on Shepp-Logan image. (a) The original Shepp-Logan image. (b) The Shepp-Logan image after adding mixed noiseσ=5,ρ=20%. (c) Denoising effect of EP median filter algorithm. (d) Denoising effect of WESNR algorithm. (e) Denoising effect of the algorithm proposed in this exploration.
(a)(b)(c)(d)(e)Table 1
Comparison of PSNR and SSIM of denoised Shepp-Logan image.
σρ (%)EP median filterWESNRThe algorithm proposed in this explorationPSNRSSIMPSNRSSIMPSNRSSIM51023.250.523332.760.858933.310.88412019.850.451128.680.834130.010.90263016.780.339927.140.815327.590.9028101022.600.333731.220.692231.940.73932019.620.296329.290.682930.200.77663016.240.219226.430.653426.730.7819201020.770.194328.160.481628.960.53492018.280.168126.830.448227.850.54183015.850.138225.990.441327.380.5813The experimental results show that, for nine kinds of Shepp-Logan images with different proportions of Gaussian noise and salt-and-pepper noise, the reconstruction effect and numerical comparison of the proposed denoising algorithm based on EP median filter and WESNR are better than those of EP median filter algorithm and WESNR algorithm alone. Moreover, the proposed algorithm has the advantages of good edge preservation and good effect of removing mixed noise.


### 3.2. Low-Dose Brain CT Simulation Image

A brain CT image with 512∗ 512 pixels is selected as the experimental object. Different proportions of Gaussian noise and salt-and-pepper noise are added to simulate the image output effect of low-dose CT. The reconstruction effect and numerical comparison of various algorithms under nine kinds of noise are listed, as shown in Figure 3 and Table 2. The bold fonts in the table indicate the advantages of the algorithm.Figure 3
Denoising effect of different methods on brain CT image. (a) The original image of brain CT. (b) Simulated low-dose brain CT images with mixed noise ofσ=5,ρ=20%. (c) Denoising effect of EP median filter algorithm. (d) Denoising effect of WESNR algorithm. (e) Denoising effect of the algorithm proposed in this exploration.
(a)(b)(c)(d)(e)Table 2
Numerical comparison of PSNR and SSIM after denoising of simulated low-dose brain CT images.
σρ (%)EP median filterWESNRThe algorithm proposed in this explorationPSNRSSIMPSNRSSIMPSNRSSIM101025.400.411533.870.542834.200.61232021.410.381331.950.530432.260.67573017.110.293328.680.530229.410.7335201022.490.216528.380.395030.000.41072020.110.197027.840.352629.170.47103016.430.153926.750.337627.790.5054301020.050.149825.670.277326.920.31622018.480.133725.140.270226.830.36043015.520.108924.290.263225.940.4110The experimental results show that, for nine kinds of simulated low-dose brain CT images with different proportions of Gaussian noise and salt-and-pepper noise, the proposed denoising algorithm based on EP median filter and WESNR outperforms EP median filter algorithm and WESNR algorithm alone in terms of reconstruction effect and numerical comparison. Moreover, the proposed algorithm has the advantages of good details and edge preservation and good effect of removing mixed noise.


## 3.1. Shepp-Logan Head Model Experiment

The Shepp-Logan head model of 256∗ 256 is selected as the experimental object. This model was proposed by Shepp and Logan in 1974 [14]. The image is composed of 10 ellipses with different positions, sizes, directions, and densities. Different gray value of ellipse can simulate attenuation coefficient of different tissues, and Shepp-Logan head model can simulate human head sectional image well. In Shepp-Logan image, the mixed noise with different proportions of Gaussian noise and salt-and-pepper noise are added, respectively. EP median filter algorithm, WESNR algorithm, and the algorithm proposed in this exploration are used to denoise the image. The reconstruction effect and numerical comparison of various algorithms under nine kinds of noise are listed, as shown in Figure 2 and Table 1. The bold fonts in the table indicate the advantages of the algorithm.Figure 2
Denoising effect of different methods on Shepp-Logan image. (a) The original Shepp-Logan image. (b) The Shepp-Logan image after adding mixed noiseσ=5,ρ=20%. (c) Denoising effect of EP median filter algorithm. (d) Denoising effect of WESNR algorithm. (e) Denoising effect of the algorithm proposed in this exploration.
(a)(b)(c)(d)(e)Table 1
Comparison of PSNR and SSIM of denoised Shepp-Logan image.
σρ (%)EP median filterWESNRThe algorithm proposed in this explorationPSNRSSIMPSNRSSIMPSNRSSIM51023.250.523332.760.858933.310.88412019.850.451128.680.834130.010.90263016.780.339927.140.815327.590.9028101022.600.333731.220.692231.940.73932019.620.296329.290.682930.200.77663016.240.219226.430.653426.730.7819201020.770.194328.160.481628.960.53492018.280.168126.830.448227.850.54183015.850.138225.990.441327.380.5813The experimental results show that, for nine kinds of Shepp-Logan images with different proportions of Gaussian noise and salt-and-pepper noise, the reconstruction effect and numerical comparison of the proposed denoising algorithm based on EP median filter and WESNR are better than those of EP median filter algorithm and WESNR algorithm alone. Moreover, the proposed algorithm has the advantages of good edge preservation and good effect of removing mixed noise.


## 3.2. Low-Dose Brain CT Simulation Image

A brain CT image with 512∗ 512 pixels is selected as the experimental object. Different proportions of Gaussian noise and salt-and-pepper noise are added to simulate the image output effect of low-dose CT. The reconstruction effect and numerical comparison of various algorithms under nine kinds of noise are listed, as shown in Figure 3 and Table 2. The bold fonts in the table indicate the advantages of the algorithm.Figure 3
Denoising effect of different methods on brain CT image. (a) The original image of brain CT. (b) Simulated low-dose brain CT images with mixed noise ofσ=5,ρ=20%. (c) Denoising effect of EP median filter algorithm. (d) Denoising effect of WESNR algorithm. (e) Denoising effect of the algorithm proposed in this exploration.
(a)(b)(c)(d)(e)Table 2
Numerical comparison of PSNR and SSIM after denoising of simulated low-dose brain CT images.
σρ (%)EP median filterWESNRThe algorithm proposed in this explorationPSNRSSIMPSNRSSIMPSNRSSIM101025.400.411533.870.542834.200.61232021.410.381331.950.530432.260.67573017.110.293328.680.530229.410.7335201022.490.216528.380.395030.000.41072020.110.197027.840.352629.170.47103016.430.153926.750.337627.790.5054301020.050.149825.670.277326.920.31622018.480.133725.140.270226.830.36043015.520.108924.290.263225.940.4110The experimental results show that, for nine kinds of simulated low-dose brain CT images with different proportions of Gaussian noise and salt-and-pepper noise, the proposed denoising algorithm based on EP median filter and WESNR outperforms EP median filter algorithm and WESNR algorithm alone in terms of reconstruction effect and numerical comparison. Moreover, the proposed algorithm has the advantages of good details and edge preservation and good effect of removing mixed noise.


## 4. Conclusion

In this exploration, a new low-dose CT image denoising algorithm is proposed. According to the characteristics of low-dose CT image and noise, this algorithm is to combine EP median filter with WESNR. The experimental results show that the algorithm proposed in this exploration has a good ability to suppress the mixed noise in low-dose CT images, and the edge information is well preserved. However, this study still has some shortcomings. The proposed method is not compared with other related low-dose CT image noise reduction algorithms, and its effect on low-dose CT image noise reduction needs further study. In the future work, we will continue to compare it with related algorithms to clarify the value of this algorithm in low-dose CT images for noise reduction. In short, the algorithm of this research has a significant effect on denoising mixed noise in low-dose CT images.



---

*Source: 6095676-2021-07-27.xml*