# Image Denoising Based on Improved Gaussian Mixture Model

Authors: Hui Wei; Wei Zheng
Journal: Scientific Programming
 (2021)

---

## Abstract

An image denoising method is proposed based on the improved Gaussian mixture model to reduce the noises and enhance the image quality. Unlike the traditional image denoising methods, the proposed method models the pixel information in the neighborhood around each pixel in the image. The Gaussian mixture model is employed to measure the similarity between pixels by calculating the L2 norm between the Gaussian mixture models corresponding to the two pixels. The Gaussian mixture model can model the statistical information such as the mean and variance of the pixel information in the image area. The L2 norm between the two Gaussian mixture models represents the difference in the local grayscale intensity and the richness of the details of the pixel information around the two pixels. In this sense, the L2 norm between Gaussian mixture models can more accurately measure the similarity between pixels. The experimental results show that the proposed method can improve the denoising performance of the images while retaining the detailed information of the image.


---

## Body

## 1. Introduction

Due to the effects of different illumination and changes in sensor temperature during image acquisition, transmission, and digitization, random noises will be introduced into the acquired images, and these noises often exhibit Gaussian characteristics [1–4]. The existence of noise will not only affect the visual effect of the image but also further affect the subsequent processing of the image, such as image feature extraction, image classification and recognition, and so on. Therefore, before image processing, it is necessary to perform denoising processing on the acquired image to improve the quality of the image and facilitate the postprocessing of the image. There are many methods of image denoising, which are often divided into frequency-domain filtering and spatial-domain filtering. Common frequency-domain filtering methods include wavelet denoising [5], high-pass filtering, Wiener filtering [6], etc. The spatial filtering methods are also rich, such as partial differential equations, variational methods [7], statistical methods [8], and so on, which are widely used in practical applications. The classic partial differential equation method includes mean filtering, which is an isotropic filtering algorithm that can remove noise very well. However, because the image information is also averaged while averaging the noises, the effective information in the original images becomes vague at the same time. To handle this problem, many researchers have improved the isotropy. A typical example is the anisotropic filtering method proposed by Perona, which can change the weight coefficient when averaging the noise and image information. In this way, the smoothing effect of the noise is good while the effective information can be maintained. The anisotropic filtering can remove noises very well, but because the image information is less smooth, its denoising effect is poor in areas with rich details. In addition, the blocking effects are prone to appear in these methods. As a remedy, Le Montagner defined the similarity between pixels according to the difference of pixel gray levels, the so-called Yaroslavsky filter [9]. The Yaroslavsky filter can change the smoothing weight coefficient according to the pixel information of the image, and its denoising effect is better than the general anisotropic filter. Moreover, it can well retain the detailed information of the image. On the basis of Yaroslavsky filtering, Tomasi and Manduchi combined the grayscale difference and spatial distance between pixels to define the similarity between pixels and obtained the bilateral filtering [10]. Bilateral filtering not only considers the impact of grayscale differences on the weights but also considers the impact of pixels at different distances. Compared with mean filtering and Gaussian filtering, the bilateral filtering can be achieved in both flat areas of the image and areas with rich details. At the same time, the detailed information of the image can be well retained. However, the denoising performance of the bilateral filtering is limited in areas with rich image texture. In recent years, some improved algorithms have also appeared for the bilateral filtering [11–15], mainly focusing on the selection of filtering parameters and the improvement of algorithm efficiency. Among them, Ghosh and Chaudhury [16] proposed the concept of distance kernel and applied it to the definition of pixel similarity weights, especially in areas with rich details. The denoising performance of the algorithm is greatly improved, and the calculation efficiency of the algorithm is also optimized. In recent years, new signal processing algorithms represented by compressed sensing and machine learning algorithms represented by deep learning have also been widely used in the field of image denoising. The works in [17–20] are based on the theory of compressed sensing and realize image reconstruction and denoising through the method of sparse representation. The works in [21–24] employ a variety of deep learning models for noise image processing and achieve a good denoising effect.The above methods mainly use information such as pixel gray difference and spatial geometric distance to measure the similarity between pixels. This paper uses the Gaussian mixture model to model the pixel information in the neighborhood around the pixel. The L2 norm and the spatial distance between Gaussian mixture models are combined to define the similarity weight between pixels. The Gaussian mixture model of the pixel information in the image area represents the pixel grayscale and the richness of details in the local area of the image. Based on the spatial distance between pixels, the pixel gray intensity and the richness of details in the local area of the image can be more accurately measured. The similarity between the two improves the denoising performance of the algorithm and maintains the detailed information of the image. In the experiment, some classic image samples are used to test the proposed method, and the adaptability of the method to different noise samples is tested through the noise level. After comparative analysis with several existing methods, the experimental results verify the superior performance of the proposed method for image denoising.


## 2. Image Denoising Based on Gaussian Mixture Model

The basic idea of image denoising based on the Gaussian mixture model is as follows. First, the pixel information of the neighborhood around each pixel is used to estimate the parameters of the Gaussian mixture model. The pixel information is modeled as a Gaussian mixture model to obtain a prefiltered image. Afterwards, the L2 norm between the Gaussian mixture models corresponding to the two pixels is calculated. The L2 norm and the spatial position distance between the two pixels are combined to define the similarity weight between the two pixels. Finally, the weighted smoothing filtering is performed on each pixel to obtain a denoised image.Different from the traditional spatial denoising methods, the image denoising method based on the Gaussian mixture model defines the similarity weight between pixels according to the statistical difference of the information around the pixels. The detailed steps of the proposed method can be summarized as follows:Step 1: for a certain pixel, the pixel information in its surrounding neighborhood is used to estimate the parameters of the Gaussian mixture model to obtain a Gaussian mixture model.Step 2: a Gaussian mixture model is estimated for each pixel in the image, and all Gaussian mixture models constitute a prefiltered image.Step 3: the L2 norm between the Gaussian mixture models corresponding to two pixels is calculated, which is combined with the spatial distance between the two pixels to define the similarity between the pixels.Step 4: each pixel in the image is subjected to weighted smoothing filtering to obtain a filtered image.It can be seen from the above steps that image denoising based on the Gaussian mixture model is based on two pixelsx and y. The spatial distance between the two pixels and the L2 norm between the corresponding Gaussian mixture models define the similarity weight wx,y. Afterwards, the weighted smoothing and filtering are performed to obtain the filtered image as follows:(1)fx=1Sx∫Ψxwx,yIydy,where Sx=∫Ψxwx,ydy is to normalize the integral value; Ψx is the neighborhood window with the center of the pixel x; and Iy represents the gray value of the pixels y. The similarity weight wx,y in equation (1) is calculated as follows:(2)wx,y=exp−dx,yL2Gx,Gyr2,where Gx and Gy represent the Gaussian mixture models of the pixels x and y, respectively; d2x,y=x−y2 calculates the spatial distance between x and y; and the parameter r is the filter control coefficient. The larger the value of r, the better the smoothing effect of the image and the higher the loss of the image’s detail information. On the contrary, the smaller the value of r, the worse the smoothing effect of the image and the smaller the loss of image’s detail information.  Therefore, it is necessary to select appropriate filter control coefficients in the filtering process. The basic idea of the image denoising method based on the Gaussian mixture model is shown in Figure 1.Figure 1
Main steps of image denoising based on the Gaussian mixture model.


## 3. L2 Norm between Gaussian Mixture Models

For each pixel, the pixel information in its surrounding neighborhood is used to estimate the parameters of the Gaussian mixture model to obtain a Gaussian mixture model. The Gaussian mixture model corresponding to the pixel indicates the local grayscale intensity and the richness of the details of the pixel information in the neighborhood around the pixel. The L2 norm between two Gaussian mixture models and the spatial distance between the pixels are used to define the similarity between pixels. According to the similarity weights, each pixel in the image is weighted and smoothed. The following mainly introduces the Gaussian mixture modeling of pixel information and the calculation of the L2 norm between two Gaussian mixture models.


### 3.1. Gaussian Mixture Model Estimation of Pixel Information

For a certain pixelx, the neighboring window Ψx has the size of M×M including M2 pixels. The gray value of the pixel at the location i,j is denoted as Ii,j. The information of these pixel is used to estimate a Gaussian mixture model as follows:(3)Gx=∑m=1KαmNμm,σm2π,where αm is the mixed weight coefficient; Nμm,σm2 represents a Gaussian distribution with the mean of μm and variance of σm2; and K represents the number of mixture components of the Gaussian mixture model. In Gaussian mixture modeling, the number of mixture components is usually set in advance.In the following, the expectation-maximization (EM) algorithm is employed to estimate the parameters of the Gaussian mixture model. The EM algorithm provides an iterative estimation way to maximize the posterior probability. Assuming that the parameters of the Gaussian mixture model areθ=α1,…,αK,μ1,…,μK,σ12,…,σK2, there are n2 samples to perform the estimation, where yi,i=1,…,n2 represents the ith sample value and γim denotes that sample yi belongs to the mth class. Given y and θ, γim can be calculated according to the maximum posterior probability as follows:(4)γ^im=Pz=m|yi,θ=Pz=m,yi|θPyi|θ=Pz=m|θPyi|z=m,θ∑m=1KPz=m|θPyi|z=m,θ=αmNy|θm∑m=1KαmNy|θm,where z is the class label and P⋅ represents the probability. Equation (4) gives the way to obtain γim,i=1,…,n2,m=1,…,K, and the remaining parameters can be calculated as follows:(5)αm=∑i=1n2γ^imn2,μm=∑i=1n2yiγ^im∑i=1n2γ^im,σm2=∑i=1n2γ^imyi−μm2∑i=1n2γ^im.According to equations (4) and (5), the EM algorithm can be used to iteratively estimate the parameters of the Gaussian mixture model. The detailed steps of parameter estimation are summarized as follows:Step 1: initialize value of the parameter setθ.Step 2: according to the maximum posterior probability,γ^im can be calculated according to equation (4).Step 3: based on the estimation ofγ^im from step 2, the remaining parameters α,μ,σ2 of the Gaussian mixture model are calculated according to equation (5).Repeat step 2 and step 3 until convergence.Based on the above steps, the parameters of the Gaussian mixture model of each pixel can be estimated. The Gaussian mixture model corresponding to all pixels constitutes the prefiltered image. In the prefiltered image, the L2 range between the Gaussian mixture models corresponding to the two pixels and the spatial distance are combined to calculate the similarity weight between two pixels.


### 3.2. Distance Measure for Gaussian Mixture Models

Assuming that the pixel information around each pixel is modeled asK mixed components, the Gaussian mixture models for two pixels x and y are formulated as follows:(6)Gx;θx=∑i=1KαiNt;μi,σi2,Gy;θy=∑i=1KβjNt;νj,εj2.Actually, there are many calculation methods for the distance measurement, such as the KL divergence, Monte Carlo method, and so on. However, the KL divergence does not have an analytical expression and can only be calculated in an approximate way. The Monte Carlo method requires too much calculation, which is not suitable in real-time processing. As a remedy, this paper uses the L2 norm to calculate the difference between two Gaussian mixture models. The L2 norm between the Gaussian mixture models has an analytical expression, which is convenient for the implementation of the algorithm.For the above two Gaussian mixture models, the L2 norm can be calculated as follows:(7)dGx;θx,Gy;θy=∫0∞Gx;θx−Gy;θy2dt.It can be expanded as follows:(8)dGx;θx,Gy;θy=∫0∞Gx;θx−Gy;θy2dt=∫0∞G2x;θx+G2y;θy−2Gx;θxGy;θydt=∫0∞G2x;θxdt+∫0∞G2y;θydt−2×∫0∞Gx;θxGy;θydt.Substituting equation (6) into equation (8), the simplification can be obtained as follows:(9)dGx;θx,Gy;θy=∑i=1K∑j=1Kαiαj∫0∞Nt;μi,σi2Nt;μj,σj2dt+∑i=1K∑j=1Kβiβj∫0∞Nt;νi,εi2Nt;νj,εj2dt−2×∑i=1K∑j=1Kαiβj∫0∞Nt;μi,σi2Nt;νj,εj2dt.According to the integral nature of Gaussian distribution, the following can be obtained:(10)∫0∞Nt;μi,σi2Nt;νj,εj2dt=N0;μi−νj,σi2+εj2.Equation (10) can be further simplified as follows:(11)dGx;θx,Gy;θy=∑i=1K∑j=1KαiαjN0;μi−μj,σi2+σj2+∑i=1K∑j=1KβiβjN0;νi−νj,εi2+εj2−2×∑i=1K∑j=1KαiβjN0;μi−νj,σi2+εj2.According to equation (11), the L2 norm distance between two Gaussian mixture models can be smoothly calculated.


## 3.1. Gaussian Mixture Model Estimation of Pixel Information

For a certain pixelx, the neighboring window Ψx has the size of M×M including M2 pixels. The gray value of the pixel at the location i,j is denoted as Ii,j. The information of these pixel is used to estimate a Gaussian mixture model as follows:(3)Gx=∑m=1KαmNμm,σm2π,where αm is the mixed weight coefficient; Nμm,σm2 represents a Gaussian distribution with the mean of μm and variance of σm2; and K represents the number of mixture components of the Gaussian mixture model. In Gaussian mixture modeling, the number of mixture components is usually set in advance.In the following, the expectation-maximization (EM) algorithm is employed to estimate the parameters of the Gaussian mixture model. The EM algorithm provides an iterative estimation way to maximize the posterior probability. Assuming that the parameters of the Gaussian mixture model areθ=α1,…,αK,μ1,…,μK,σ12,…,σK2, there are n2 samples to perform the estimation, where yi,i=1,…,n2 represents the ith sample value and γim denotes that sample yi belongs to the mth class. Given y and θ, γim can be calculated according to the maximum posterior probability as follows:(4)γ^im=Pz=m|yi,θ=Pz=m,yi|θPyi|θ=Pz=m|θPyi|z=m,θ∑m=1KPz=m|θPyi|z=m,θ=αmNy|θm∑m=1KαmNy|θm,where z is the class label and P⋅ represents the probability. Equation (4) gives the way to obtain γim,i=1,…,n2,m=1,…,K, and the remaining parameters can be calculated as follows:(5)αm=∑i=1n2γ^imn2,μm=∑i=1n2yiγ^im∑i=1n2γ^im,σm2=∑i=1n2γ^imyi−μm2∑i=1n2γ^im.According to equations (4) and (5), the EM algorithm can be used to iteratively estimate the parameters of the Gaussian mixture model. The detailed steps of parameter estimation are summarized as follows:Step 1: initialize value of the parameter setθ.Step 2: according to the maximum posterior probability,γ^im can be calculated according to equation (4).Step 3: based on the estimation ofγ^im from step 2, the remaining parameters α,μ,σ2 of the Gaussian mixture model are calculated according to equation (5).Repeat step 2 and step 3 until convergence.Based on the above steps, the parameters of the Gaussian mixture model of each pixel can be estimated. The Gaussian mixture model corresponding to all pixels constitutes the prefiltered image. In the prefiltered image, the L2 range between the Gaussian mixture models corresponding to the two pixels and the spatial distance are combined to calculate the similarity weight between two pixels.


## 3.2. Distance Measure for Gaussian Mixture Models

Assuming that the pixel information around each pixel is modeled asK mixed components, the Gaussian mixture models for two pixels x and y are formulated as follows:(6)Gx;θx=∑i=1KαiNt;μi,σi2,Gy;θy=∑i=1KβjNt;νj,εj2.Actually, there are many calculation methods for the distance measurement, such as the KL divergence, Monte Carlo method, and so on. However, the KL divergence does not have an analytical expression and can only be calculated in an approximate way. The Monte Carlo method requires too much calculation, which is not suitable in real-time processing. As a remedy, this paper uses the L2 norm to calculate the difference between two Gaussian mixture models. The L2 norm between the Gaussian mixture models has an analytical expression, which is convenient for the implementation of the algorithm.For the above two Gaussian mixture models, the L2 norm can be calculated as follows:(7)dGx;θx,Gy;θy=∫0∞Gx;θx−Gy;θy2dt.It can be expanded as follows:(8)dGx;θx,Gy;θy=∫0∞Gx;θx−Gy;θy2dt=∫0∞G2x;θx+G2y;θy−2Gx;θxGy;θydt=∫0∞G2x;θxdt+∫0∞G2y;θydt−2×∫0∞Gx;θxGy;θydt.Substituting equation (6) into equation (8), the simplification can be obtained as follows:(9)dGx;θx,Gy;θy=∑i=1K∑j=1Kαiαj∫0∞Nt;μi,σi2Nt;μj,σj2dt+∑i=1K∑j=1Kβiβj∫0∞Nt;νi,εi2Nt;νj,εj2dt−2×∑i=1K∑j=1Kαiβj∫0∞Nt;μi,σi2Nt;νj,εj2dt.According to the integral nature of Gaussian distribution, the following can be obtained:(10)∫0∞Nt;μi,σi2Nt;νj,εj2dt=N0;μi−νj,σi2+εj2.Equation (10) can be further simplified as follows:(11)dGx;θx,Gy;θy=∑i=1K∑j=1KαiαjN0;μi−μj,σi2+σj2+∑i=1K∑j=1KβiβjN0;νi−νj,εi2+εj2−2×∑i=1K∑j=1KαiβjN0;μi−νj,σi2+εj2.According to equation (11), the L2 norm distance between two Gaussian mixture models can be smoothly calculated.


## 4. Experiment and Discussion

### 4.1. Evaluation Indexes

The performance of image denoising algorithms can be generally evaluated by two aspects, i.e., how much noise is removed and how much image detail information is lost. The more the noise is removed, the stronger the denoising ability of the denoising algorithm is. On the contrary, the less the noise is removed, the worse the denoising ability of the algorithm is. At the same time, the more the image detail information is retained, the better the image quality is. The less the image detail information is retained, the worse the image quality is. While removing image noise, the detail information of the image should be preserved as much as possible. This paper adopts the peak signal-to-noise ratio (PSNR) to measure the denoising ability of the algorithm. At the same time, the structure similarity index measure (SSIM) is used to evaluate the quality of the image after denoising, that is, the ability to retain the detailed information of the image. With a large PSNR and a SSIM approaching 1, the denoising performance of the method is good.Generally, the PSNR can be calculated as follows:(12)PSNR=10log10vmax2meanvi−ui2,where vmax indicates the maximum pixel value in the image (for an image with grayscale value from 0 to 255, vmax=255); vi and ui represent the gray values of the noisy image and the noise-free image, respectively; and meanvi−ui2 refers to the average power of noise.SSIM is an evaluation index for image denoising defined according to the human visual mechanism. From a visual point of view, the more detailed the information of the image, the clearer the image, and vice versa. SSIM is an evaluation index that combines the three characteristics of image contrast, edge structure, and image brightness and is obtained by weighted product. SSIM can be calculated by the following equation [25]:(13)SSIMi,j=2mimj+c12sij+c2mi2+mj2+c1si2+sj2+c2,where mi and mj are the mean values corresponding to the pixel positions i and j, respectively; si2 and sj2 are the variances; and sij represents the covariance.In this paper,c1=k1L2, c2=k2L2, L indicates the range of pixel values, and k1 and k2 are the weight coefficients, which are generally set as k1=0.01 and k2=0.03. The index mSSIM is the average of the SSIMs from different windows in an image.


### 4.2. Analysis of Experimental Results

In order to verify the effectiveness of the proposed algorithm (denoted as GMMD), several reference methods are employed for comparison including the bilateral filtering (BF), mean filtering (MF), kernel bilateral filtering (KBF), sparse representation (SR), and deep learning (DL). The indexes PSNR and SSIM are used to evaluate the denoising performance of different methods. The following experiment uses 4 images: “Lena,” “Academy,” “Einstein,” and “Mandrill,” as shown in Figure2, which are classical samples for the test and evaluation of image denoising algorithms.Figure 2
Illustration of the noisy images. (a) Lena. (b) Academy. (c) Einstein. (d) Mandrill.
(a)(b)(c)(d)Figure3 shows the denoising results achieved by the proposed method for a local area from the “Lena” image. It is clearly shown that the proposed method can effectively remove the noises while maintaining the detail information in the image. Furthermore, different levels of noises (denoted by the noise variance) are added in the 4 samples and different denoising methods are examined. The performance of those methods is summarized in Tables 1 and 2, which use the PSNR and mSSIM, respectively.Figure 3
Denoising results of local area of “Lena” image using the proposed method. (a) Original noisy image. (b) After denoising.
(a)(b)Table 1
PSNR achieved by different denoising methods (dB).
Image labelNoise levelNoisy imageDenoising imageBFMFKBFSRDLGMMDLena0.211.01711.77311.72111.65211.82311.90312.0080.1512.83314.10213.97914.19814.26214.27714.3300.115.93317.21116.72717.01817.23217.26517.3470.0517.06819.59519.78020.92821.60221.67421.770Academy0.215.26216.65215.64416.45616.44216.54316.9690.1516.38118.52017.00718.29018.76418.78818.9590.117.42320.01918.39420.45120.72120.73420.8050.0518.22219.43719.44522.66322.88722.92423.043Einstein0.28.1218.4448.5548.4058.5328.5688.6490.1511.02511.82811.83411.71912.01412.08712.1680.112.89714.18214.12914.02914.22614.27614.4250.0514.97817.26617.00117.07617.23117.23917.328Mandrill0.214.11915.51814.95315.42115.67215.69315.8670.1515.47117.40916.41917.14817.84217.90217.9610.111.06511.77411.49611.60411.78911.80211.8430.0512.89414.07413.52613.79014.61414.64514.711Table 2
mSSIM achieved by different denoising methods.
Image labelDenoising imageBFMFKBFSRDLGMMDLena0.7820.7770.7140.8120.8170.821Academy0.8620.7420.8350.8760.8820.885Einstein0.7360.7030.6730.7620.7690.776Mandrill0.6940.4770.7570.7820.7850.789From the results in Tables1 and 2, it can be seen that the denoising and detail information retention ability of the GMMD algorithm and the KBF algorithm is better than that of the MF and BF algorithms. In the relatively flat image denoising results of “Lena” and “Einstein,” GMMD’s denoising ability and detail information retention ability are better than those of the KBF algorithm. However, in the images “Academy” and “Mandrill” with richer image detail information, the denoising performance improvement of the GMMD algorithm is not obvious. The results show that the combination of the local average gray intensity of image pixel information and the richness of details to define the similarity weight between pixels is more accurate compared to traditional methods. Compared with the two emerging methods of SR and DL, the proposed method is very close to their denoising performance but has a slight advantage, reflecting its effectiveness. It shows the advantages of the Gaussian mixture model in image representation and similarity measurement. In addition, this paper also calculates the average time required for these three types of methods to process a single noisy image on the same hardware platform, which is 1.8 ms, 2.3 ms, and 4.7 ms, respectively. In contrast, the proposed method has better computing efficiency and more practicality. The DL method generally requires an offline training process, which reduces its overall efficiency.


## 4.1. Evaluation Indexes

The performance of image denoising algorithms can be generally evaluated by two aspects, i.e., how much noise is removed and how much image detail information is lost. The more the noise is removed, the stronger the denoising ability of the denoising algorithm is. On the contrary, the less the noise is removed, the worse the denoising ability of the algorithm is. At the same time, the more the image detail information is retained, the better the image quality is. The less the image detail information is retained, the worse the image quality is. While removing image noise, the detail information of the image should be preserved as much as possible. This paper adopts the peak signal-to-noise ratio (PSNR) to measure the denoising ability of the algorithm. At the same time, the structure similarity index measure (SSIM) is used to evaluate the quality of the image after denoising, that is, the ability to retain the detailed information of the image. With a large PSNR and a SSIM approaching 1, the denoising performance of the method is good.Generally, the PSNR can be calculated as follows:(12)PSNR=10log10vmax2meanvi−ui2,where vmax indicates the maximum pixel value in the image (for an image with grayscale value from 0 to 255, vmax=255); vi and ui represent the gray values of the noisy image and the noise-free image, respectively; and meanvi−ui2 refers to the average power of noise.SSIM is an evaluation index for image denoising defined according to the human visual mechanism. From a visual point of view, the more detailed the information of the image, the clearer the image, and vice versa. SSIM is an evaluation index that combines the three characteristics of image contrast, edge structure, and image brightness and is obtained by weighted product. SSIM can be calculated by the following equation [25]:(13)SSIMi,j=2mimj+c12sij+c2mi2+mj2+c1si2+sj2+c2,where mi and mj are the mean values corresponding to the pixel positions i and j, respectively; si2 and sj2 are the variances; and sij represents the covariance.In this paper,c1=k1L2, c2=k2L2, L indicates the range of pixel values, and k1 and k2 are the weight coefficients, which are generally set as k1=0.01 and k2=0.03. The index mSSIM is the average of the SSIMs from different windows in an image.


## 4.2. Analysis of Experimental Results

In order to verify the effectiveness of the proposed algorithm (denoted as GMMD), several reference methods are employed for comparison including the bilateral filtering (BF), mean filtering (MF), kernel bilateral filtering (KBF), sparse representation (SR), and deep learning (DL). The indexes PSNR and SSIM are used to evaluate the denoising performance of different methods. The following experiment uses 4 images: “Lena,” “Academy,” “Einstein,” and “Mandrill,” as shown in Figure2, which are classical samples for the test and evaluation of image denoising algorithms.Figure 2
Illustration of the noisy images. (a) Lena. (b) Academy. (c) Einstein. (d) Mandrill.
(a)(b)(c)(d)Figure3 shows the denoising results achieved by the proposed method for a local area from the “Lena” image. It is clearly shown that the proposed method can effectively remove the noises while maintaining the detail information in the image. Furthermore, different levels of noises (denoted by the noise variance) are added in the 4 samples and different denoising methods are examined. The performance of those methods is summarized in Tables 1 and 2, which use the PSNR and mSSIM, respectively.Figure 3
Denoising results of local area of “Lena” image using the proposed method. (a) Original noisy image. (b) After denoising.
(a)(b)Table 1
PSNR achieved by different denoising methods (dB).
Image labelNoise levelNoisy imageDenoising imageBFMFKBFSRDLGMMDLena0.211.01711.77311.72111.65211.82311.90312.0080.1512.83314.10213.97914.19814.26214.27714.3300.115.93317.21116.72717.01817.23217.26517.3470.0517.06819.59519.78020.92821.60221.67421.770Academy0.215.26216.65215.64416.45616.44216.54316.9690.1516.38118.52017.00718.29018.76418.78818.9590.117.42320.01918.39420.45120.72120.73420.8050.0518.22219.43719.44522.66322.88722.92423.043Einstein0.28.1218.4448.5548.4058.5328.5688.6490.1511.02511.82811.83411.71912.01412.08712.1680.112.89714.18214.12914.02914.22614.27614.4250.0514.97817.26617.00117.07617.23117.23917.328Mandrill0.214.11915.51814.95315.42115.67215.69315.8670.1515.47117.40916.41917.14817.84217.90217.9610.111.06511.77411.49611.60411.78911.80211.8430.0512.89414.07413.52613.79014.61414.64514.711Table 2
mSSIM achieved by different denoising methods.
Image labelDenoising imageBFMFKBFSRDLGMMDLena0.7820.7770.7140.8120.8170.821Academy0.8620.7420.8350.8760.8820.885Einstein0.7360.7030.6730.7620.7690.776Mandrill0.6940.4770.7570.7820.7850.789From the results in Tables1 and 2, it can be seen that the denoising and detail information retention ability of the GMMD algorithm and the KBF algorithm is better than that of the MF and BF algorithms. In the relatively flat image denoising results of “Lena” and “Einstein,” GMMD’s denoising ability and detail information retention ability are better than those of the KBF algorithm. However, in the images “Academy” and “Mandrill” with richer image detail information, the denoising performance improvement of the GMMD algorithm is not obvious. The results show that the combination of the local average gray intensity of image pixel information and the richness of details to define the similarity weight between pixels is more accurate compared to traditional methods. Compared with the two emerging methods of SR and DL, the proposed method is very close to their denoising performance but has a slight advantage, reflecting its effectiveness. It shows the advantages of the Gaussian mixture model in image representation and similarity measurement. In addition, this paper also calculates the average time required for these three types of methods to process a single noisy image on the same hardware platform, which is 1.8 ms, 2.3 ms, and 4.7 ms, respectively. In contrast, the proposed method has better computing efficiency and more practicality. The DL method generally requires an offline training process, which reduces its overall efficiency.


## 5. Conclusion

This paper proposes an image denoising method based on the Gaussian mixture model. The statistical characteristics of the local gray information of pixels around the pixel are modeled as a Gaussian mixture model. The L2 norm between Gaussian mixture models and the spatial distance of pixel positions are combined to define the similarity weight between pixels. The weighted smoothing filter is used to denoise the image. The experimental results show that the denoising performance of the proposed method is more obvious in the relatively flat area of the image. In addition, the denoising performance of the proposed method is improved to a certain extent in the area with rich detailed information. The comparison between the proposed method and several existing image denoising algorithms validates the superior effectiveness of the used method.



---

*Source: 7982645-2021-09-22.xml*