# A New Image Denoising Method Based on Adaptive Multiscale Morphological Edge Detection

Authors: Gang Wang; Zesong Wang; Jinhai Liu
Journal: Mathematical Problems in Engineering
 (2017)

---

## Abstract

Wavelet transform is an effective method for removal of noise from image. But traditional wavelet transform cannot improve the smooth effect and reserve image’s precise details simultaneously; even false Gibbs phenomenon can be produced. This paper proposes a new image denoising method based on adaptive multiscale morphological edge detection beyond the above limitation. Firstly, the noisy image is decomposed by using one wavelet base. Then, the image edge is detected by using the adaptive multiscale morphological edge detection based on the wavelet decomposition. On this basis, wavelet coefficients belonging to the edge position are dealt with with the improved wavelet domain wiener filtering, and the others are dealt with with the improved Bayesian threshold and the improved threshold function. Finally, wavelet coefficients are inversely processed to obtain the denoised image. Experimental results show that this method can effectively remove the image noise without blurring edges and highlight the characteristics of image edge at the same time. The validation results of the denoised images with higher peak signal to noise ratio (PSNR) and structural similarity (SSIM) demonstrate their robust capability for real applications in the future.


---

## Body

## 1. Introduction

The image will be contaminated by random noise in the process of collection and transmission, which would inevitably lead to the degradation of the image quality in the subsequent process such as image compression and feature extraction. Hence, it is important to estimate the original image from the noisy image [1].Image denoising is the basic problem of signal recovery in image process and is required to reduce or eliminate the noise of the observed images, while preserving the texture, corner, and edge details of the original image as much as possible is needed. Many scholars have devoted a lot of energy to the study of image denoising and put forward many effective methods over the past few decades. Wavelet analysis has good localization properties and multiresolution characteristics in either time domain or frequency domain, which makes it more effective to distinguish useful signal and noise. Therefore, wavelet has become a very effective method for the image denoising [2–10]. At present, there are mainly three kinds of wavelet denoising techniques to remove noise from image data. The first is to separate signal from noise through the singularity detection with wavelets [11–13]; the second is to reduce image noise through the wavelet coefficient thresholding method [14–16]; and the third is to reduce image noise through the wavelet domain Bayesian threshold criterion coefficient of shrinkage method [17–19]. Among them, wavelet coefficient thresholding method is the most widely used method for the image denoising because of its simpleness and effectiveness. The basic idea of wavelet coefficient thresholding method is derived from theory of Donoho. The general threshold denoising method based on orthogonal wavelet transform is initially presented by Donoho, which is based on the assumption that the complex noise reduction problem can be solved by simple coefficient process. However, the estimation of Donoho threshold does not have the adaptability for different scale spaces and will zero the wavelet coefficients in excess, which will lead to the loss in image details. So many scholars have proposed different scales of wavelet coefficients using the adaptive threshold to reduce noise, such as VisuShrink threshold, SureShrink threshold, and NormalShrink threshold. Although these algorithms can obtain better denoising effect to some extent, more details are eliminated so that the image quality is severely reduced; even false Gibbs phenomenon can be produced.In this paper, we propose a new image denoising method based on adaptive multiscale morphological edge detection. Traditional or modern image edge detection method is accurate for the edge location of the nonnoisy image. However, the edge of the noisy image cannot be detected by it. In contrast, adaptive multiscale morphological edge detection method is able to locate the edge location of noisy image accurately. This is because the adaptive multiscale morphological edge detection method uses mathematical morphology theory based on the multistructuring elements and is constructed by using the improved morphological edge detection operator. Therefore, the adaptive multiscale morphological edge detection method can preserve more edge information by changing the size of structuring elements [20–22]. We decompose the noisy image by using wavelet firstly. Then, the edge of the image is detected via adaptive multiscale morphological edge detection according to the characteristics of the wavelet decomposition. On this basis, the wavelet coefficients belonging to the edge position are dealt with with the improved wavelet domain wiener filtering and the others are dealt with with the improved Bayesian threshold and the improved threshold function. Finally, wavelet coefficients are inversely processed to obtain the denoised image. The experimental results show that this method can not only remove the noise without blurring of edges and important characteristics of images but also highlight the characteristics of image edge compared with the existing methods. The denoised images obtain higher PSNR and higher SSIM; what is more, the denoising effect is better than the previous article [23–28]; hence, the method is of great application value.


## 2. Adaptive Multiscale Morphological Edge Detection

Suppose that the model of the image with Gauss white noise is as follows:(1)yni,j=xi,j+ni,j,where (i,j) denotes the location of a pixel in the whole image space: i=1,2,…,M, and j=1,2,…,N; x(i,j) is the original image (not containing Gauss white noise) and its size is M×N; n(i,j) is Gauss white noise.The wavelet transform of the noisy imageyn(i,j) is as follows:(2)Wy=Wx+Wn,where Wn is the wavelet coefficient of the noise, Wx is the wavelet coefficient of the original image, and Wy is the wavelet coefficient of the noisy image.Assume thatf(x,y) represents a gray-scale image and b(x,y) is the given structuring element. Df and Db are the domains of definition of f(x,y) and b(x,y), respectively.The dilation operation ofb(x,y) to the gray-scale image f(x,y) is as follows:(3)f⊕b=max⁡fs-x,t-y+bx,y∣s-x,t-y∈Df;x,y∈Db.The erosion operation ofb(x,y) to the gray-scale image f(x,y) is as follows:(4)fΘb=min⁡fs+x,t+y-bx,y∣s+x,t+y∈Df;x,y∈Db.The opening operation ofb(x,y) to the gray-scale image f(x,y) is as follows:(5)f∘b=fΘb⊕b.The closing operation ofb(x,y) to the gray-scale image f(x,y) is as follows:(6)f•b=f⊕bΘb.Assume thatE(x,y) represents the image edge detection operator. Thus, an antinoise edge detection operator is obtained by using morphological dilation, erosion, opening, and closing operation.Antinoise dilation operator is as follows:(7)F1=f⊕b-f•b.Antinoise erosion operator is as follows:(8)F2=f∘b-fΘb.Antinoise dilation erosion operator is as follows:(9)F3=f∘b⊕b-f•bΘb.Let(10)Fminx,y=min⁡F1x,y,F2x,y,F3x,y(11)Fmaxx,y=max⁡F1x,y,F2x,y,F3x,y(12)Fdecx,y=Fmaxx,y-Fminx,y.Since the edge of the image is weak and not continuous, we propose the following improved morphological edge detection operator to improve the image effect:(13)Ex,y=F3x,y+αFdecx,y,where 0<α<1 is an adjustable parameter. Because the improved morphological edge detection operator can add image edge information, the discontinuity in image is reduced to some extent. When α becomes bigger, more edge information can be detected, but antinoise performance will drop. In order to strike a balance between more edge information and antinoise performance, usually α is between 0.3 and 0.6.In order to reduce image noise and detect the detailed information of image edge in different directions, the choosing of structuring elements is a key factor in morphological image processing. The size and shape of structuring elements decide the final result of detected edges. Multiscale morphological edge detection is to use different sizes of structuring elements to extract edge characteristics of the image. Large scale structuring elements have good ability to remove the noise, but the detection result is rough. On the other hand, the ability to remove noise is weak for small scale structuring elements but can detect the edge details very well.We use multiscale morphological edge detection to filter noise and keep image details simultaneously. Generally speaking, the3×3, 5×5, and 7×7 windows are usually used, among which 3×3 window is the fastest, and its edge is the most exquisite [20]. In this paper, we choose six representative structuring elements as follows: (14)b1=010111010b2=010110000b3=000011010b4=000110010b5=010011000b6=101010101,where bi is 3×3 square window: i=1,2,…,6.Multiscale structuring elements are defined asnb=b⊕b⊕⋯⊕b, where n is scale parameter (a positive integer) and b is the given structuring element. In addition, nb indicates that the large scale structuring elements are obtained by the dilation of small scale elements.The edge detection operatorsEi(x,y)(i=1,2,…,6) of six representative structuring elements above can be obtained by (13). Because different structuring elements have different adaptability to detect image edge, in order to preserve more edge information and make the edge more smooth, we first give different weight coefficients βni to Ei(x,y). Because performance of antinoise of the large scale structuring elements is more obvious but that of small scale structuring elements is relatively weak, it is necessary to utilize this feature to distinguish the edge of image. So we introduce the adaptive coefficient βni, which can better filter out the pseudoedge at large scale and take the advantages of multiscale edge detection and better detect the edge of the image. Then sum up Ei(x,y); that is, Enb(x,y)=⋃i=16βniEi(x,y), where n represents scale. Image edge can be detected using Enb(x,y). By changing the scale n of the structuring elements, the image edge information is obtained. The new edge is as follows:(15)f′x,y=∑n=l1l2Enbx,y,where [l1,l2] is the range of scale n.The weight coefficientβni is calculated as follows:(1)
Get the mean filtered image under different scales structuring elements:(16)fnx,y=ff∘nb•nb+f•nb∘nb2.(2)
Calculate the standard deviation under different scales:Δn=f-fn.(3)
Based on the fact that the weight coefficientsβni are inversely proportional to the standard deviation Δn, that is to say, large scale weight coefficients are bigger and small scale weight coefficients are smaller, we have (17)βni=kiΔl2-n∑n=l1l2Δn,where ki represents adjustable parameters related with bi: i=1,2,…,6.


## 3. Improved Threshold Denoising

Bayesian threshold is derived through the statistical theory of Bayes. For a given high frequency subband, the traditional threshold value is(18)λ=σNoise2σImage,where σNoise and σImage are the estimation for the noise variance and the standard deviation of the image on the subband, respectively.The noise variance is estimated as follows:(19)σNoise=medianYi,j0.6745,where Yi,j is the wavelet coefficient of subband HH1 of wavelet decomposition and median(·) is the median function.The standard deviation of the image is estimated as follows:(20)σImage2=1I×J∑i,jWI×Jsi,j2-σNoise2,where WI×J presents a template with a size of I×J; WI×J(si,j) present coefficient values of the image in the template. However, the distribution characteristics of the noise during the wavelet decomposition are not taken into account in (18).Here, we introduce an adaptive coefficientη, which changes with wavelet coefficients adaptively. Therefore, the adaptive threshold is as follows:(21)T=ηλ,where η=1/log(K+1); K is the number of decomposition levels. We improve the traditional threshold in (18) so that the improved Bayesian threshold in (21) can change with the number of decomposition levels K adaptively. When the decomposition level K increases, the threshold becomes smaller, which is in line with distribution characteristics of the noise decomposed by wavelet. By this way, the noise is removed to the maximum extent possible, but the wavelet coefficients of the original image are not affected.Next, we propose the improved threshold function as follows:(22)fsgn⁡yi,jpyi,jp-Tyi,jpTpyi,j>T0yi,j≤T,where p can be adjusted according to the wavelet coefficients y(i,j) and usually p=20r. Here, r is the percentage of the wavelet coefficients y(i,j) and is greater than 2T. The improved threshold function f can automatically change with wavelet coefficients, which can effectively overcome the defects of hard threshold function and soft threshold function.


## 4. Improved Wavelet Domain Wiener Filtering

Wiener filter is a locally adaptive linear filter using observation window. Assuming that the size of the observation window ism×n, usually take m=n. The following steps are locally adaptive wiener filtering in wavelet domain and can obtain the denoised image.(1) Calculate the variance of the wavelet coefficients of the noisy image with observation window units:(23)qi,j=σ^yi,j2=1M∑y2i,j,where y(i,j) is the wavelet coefficient; M=m•n.(2) Calculate the variance of the wavelet coefficients of the original image without noise:(24)σ^xi,j2=max⁡σ^yi,j2-σNoise2,0,where σNoise is the noise variance and can be calculated by (19).(3) Process wavelet coefficients as follows:(25)x^i,j=σ^xi,j2σ^xi,j2+σNoise2•yi,j.In the following, we will improve wavelet domain wiener filtering through adding threshold processing before step (3). The steps added are as follows:(1) Select the appropriate wavelet “coif3” to decompose the noisy image and the decomposition level is K=4.(2) Estimate the noise variance σNoise2 from the high frequency subband HH1.(3) Calculate parameter c of each scale in order to further improve the adaptability of threshold.(26)c=LkLlog⁡LkK,where Lk is the length of kth subband, L is the length of the noisy image, k=1,2,…,K, and K is the number of decomposition levels. It is obvious that the parameter c will change adaptively with K.(4) The wavelet coefficients are processed as follows:(27)yi,j=yi,jqi,j≥cσNoise20qi,j<cσNoise2.Parameterc in (26) is related to SNR (signal to noise ratio). The bigger SNR becomes, the bigger parameter c becomes, the more details are retained, and the clearer the image becomes. In addition, the improved wavelet domain wiener filtering implements the minimum variance estimation. What is more, this treatment is consistent with the visual characteristics of human and the denoised image has better visual effects.


## 5. Denoising Method Proposed in This Paper

It is notable that many problems still exist in the threshold denoising. Worst of all is the fact that too much detail is eliminated, so that the image quality is severely reduced; even pseudo-Gibbs phenomenon is produced.Combing improved Bayesian threshold with wavelet domain wiener filtering, a new method based on adaptive multiscale morphological edge detection is proposed to solve the threshold denoising problems above. Steps are as follows.Step 1.
Use the wavelet base “sym3” to decompose the noisy image into four layers.Step 2.
For each group of wavelet coefficients, apply adaptive multiscale morphological edge detection method to detect wavelet coefficients belonging to the edge of the image.Step 3.
Deal with wavelet coefficients belonging to the edge through improved wavelet domain wiener filtering, and window size of5×5 is chosen for each group.Step 4.
Deal with wavelet coefficients not belonging to the edge with improved threshold denoising.Step 5.
Inversely process wavelet coefficients through the wavelet base “sym3” for each group to get the final denoised image.The proposed method in this paper has the following characteristics. Firstly, this method based on adaptive multiscale morphological edge detection can not only detect edge details but also protect and highlight them. So this method has higher PSNR and SSIM. Secondly, the traditional Bayesian threshold is improved by adding adaptive coefficientη=1/log(K+1), which can change with the number of decomposition levels K adaptively. To be more precise, when the decomposition level K increases, the threshold becomes smaller. This feature is in line with distribution characteristics of the noise decomposed by wavelet. By this way, the noise is removed to the maximum extent possible, but the wavelet coefficients of the original image are not affected. Finally, wavelet domain wiener filtering is improved by adding parameter c in order to further enhance the adaptability of threshold, which can retain edge features and increase clarity of the image. Thus, the proposed method has better visual effects and can provide better visual performance.


## 6. Image Denoising Evaluation

At present, there are two ways to evaluate the quality of the denoised image: subjective evaluation and objective evaluation. Subjective evaluation is to evaluate the denoising effect from the qualitative point of view. On the contrary, objective evaluation is to evaluate the denoising effect from the quantitative point of view. However, there are no uniform evaluation criteria to evaluate the denoising effect until now. PSNR and SSIM are adopted to evaluate the results of denoised image in [29, 30].Assuming thatf(i,j) is the gray value of the original image without noise and D(i,j) is the gray value of the denoised image, the size of the image is M×N.PSNR is defined as follows:(28)MSE=1M•N∑i=1M∑j=1Nfi,j-Di,jPSNR=10log10⁡2552MSE.The smaller MSE value is, the bigger PSNR value is. It means that the difference between the original image and the denoised image is small, and the denoising effect is better.SSIM is a kind of image quality evaluation index based on structural similarity. Assuming that the human eye is suitable for extracting the structural information from the perspective of the visual field, we have(29)SSIM=2u1u2+c1u12+u22+c12σ12+c2σ12+σ22+c2,where u1 and u2 are the pixel means before and after the treatment, respectively. σk is the pixel variance, σ12 is the pixel covariance, and ck is constant: k=1,2. In this paper, we take c1=(0.01×255)2 and c2=(0.03×255)2. The range of SSIM is [0,1] and its maximum value is 1. If SSIM is closer to 1, it indicates that the denoised image is more similar to the original image. This is to say that more edge details of the original image can be retained.


## 7. Simulation Experiments

In this section, three groups of experiments are provided to illustrate the effectiveness of the proposed method in this paper.Figure1 is an example of remote sensing image. The denoised image is Aerial image with the size of 512×512 pixels. We compare the denoising results with articles [23–28] from the qualitative and quantitative aspects. The denoised images are shown in Figure 1 (the noise standard deviation σn=30), and the comparison results of denoised index PSNR and SSIM are shown in Table 1.Table 1
Comparison of different denoising methods on PSNR and SSIM for Aerial image.
Denoising method
σ
n
=
10
σ
n
=
20
σ
n
=
30
PSNR
SSIM
PSNR
SSIM
PSNR
SSIM
Noisy image
28.1428
0.6488
22.3143
0.4013
18.5941
0.2612
Article [23]
31.5413
0.8224
26.8412
0.7133
24.8298
0.6328
Article [24]
31.6817
0.8341
27.1353
0.7262
24.9526
0.6581
Article [25]
31.8256
0.8536
27.3763
0.7486
25.1833
0.6739
Article [26]
31.1601
0.8110
27.0601
0.7021
24.1912
0.6525
Article [27]
31.6325
0.8882
27.8442
0.7858
25.6135
0.7083
Article [28]
31.8812
0.8991
27.9914
0.8164
25.6002
0.7213
The new method
32.0131
0.9189
28.0675
0.8343
25.9070
0.7553Figure 1
Comparison of different image denoising methods for Aerial image.
(a)
The original image
(b)
The noisy image
(c)
Article [23]
(d)
Article [24]
(e)
Article [25]
(f)
Article [26]
(g)
Article [27]
(h)
Article [28]
(i)
The new methodIn Figure1, the image processed by [23, 24, 27] or [28] is more blurred because it loses much edge information. The image processed by [25] or [26] includes much noise which destroys the clarity of the image. On the contrary, the denoising effect of the new method proposed in this paper is more significant and can preserve more edge information than the others.From Table1, we find that the new method has better performance than the others for Aerial image. The results of experiments show the high effectiveness of the proposed method in this paper for remote sensing image, no matter from the subjective or objective aspects.Figure2 is an example of Lena, Barbara, and Boat image with the size of 512×512 pixels. We compare denoising results with articles [23–28] from qualitative and quantitative aspects. The denoised images are shown in Figure 2 (the noise standard deviation σn=30), and the comparison results of denoised index PSNR and SSIM are shown in Table 2.Table 2
Comparison of different denoising methods on PSNR and SSIM for images.
Denoising method
Lena
Barbara
Boat
σ
n
=
10
σ
n
=
20
σ
n
=
30
σ
n
=
10
σ
n
=
20
σ
n
=
30
σ
n
=
10
σ
n
=
20
σ
n
=
30
Noisy image
28.18
22.15
18.67
28.12
22.12
18.66
28.14
22.16
18.62
0.5646
0.3398
0.2333
0.7036
0.4945
0.3673
0.6072
0.3992
0.2888
Article [23]
34.53
31.56
29.88
32.81
28.68
26.79
32.93
29.75
27.68
0.8894
0.8282
0.7683
0.8846
0.8318
0.7632
0.8498
0.7746
0.7226
Article [24]
34.27
31.07
28.96
31.96
28.16
26.11
32.37
29.11
27.31
0.8798
0.8175
0.7618
0.8503
0.7938
0.7323
0.8324
0.7763
0.7105
Article [25]
33.37
29.63
27.35
32.76
28.29
26.57
32.03
28.02
26.29
0.8878
0.8013
0.7856
0.8996
0.8489
0.7811
0.8768
0.7863
0.6802
Article [26]
34.98
31.73
29.62
33.01
29.18
27.01
33.11
29.77
27.74
0.9035
0.8494
0.8066
0.9161
0.8528
0.7837
0.8573
0.7953
0.7106
Article [27]
33.98
30.86
28.68
31.76
27.37
26.31
32.58
29.32
27.72
0.8469
0.7484
0.6586
0.8678
0.7723
0.7426
0.8302
0.7563
0.6752
Article [28]
34.81
31.28
30.03
31.62
29.02
26.81
32.66
29.18
28.12
0.8990
0.8545
0.8203
0.9074
0.8331
0.7780
0.8387
0.7619
0.7129
The new method
35.21
31.76
30.08
33.02
29.19
27.21
33.48
30.18
28.34
0.9070
0.8558
0.8212
0.9218
0.8532
0.7921
0.8788
0.7976
0.7408Figure 2
Comparison of denoising methods for image Barbara.
(a)
The original image
(b)
The noisy image
(c)
Article [23]
(d)
Article [24]
(e)
Article [25]
(f)
Article [26]
(g)
Article [27]
(h)
Article [28]
(i)
The new method
(j)
Magnified images cropped from (h)
(k)
Magnified images cropped from (i)In Figure2, the new method highlights the features of the edge and retains most of the edge information. So the denoised edge details are more obvious and closer to the original image. Furthermore, we magnify the details to show the subtle differences between different denoised images. Because image denoising method based on adaptive multiscale morphological edge detection can detect the image edges with different direction structuring elements and each structuring element can detect an image edge, the ideal image edge with detailed character in Figure 2(k) can be obtained by combining different orientations.In addition, from Table2, we find that PSNR and SSIM of the reconstructed image obtained by the new method are highest. It is shown that the new method has strong denoising ability no matter in the low SNR or in the high SNR. In other words, the denoised images processed by the new method have higher peak signal to noise ratio and mean structural similarity.Figure3 is an example of infrared image. The denoised image is infrared image of Cassiopeia A with the size of 640×480 pixels. We compare denoising results with articles [23–28] from qualitative and quantitative aspects. The denoised images are shown in Figure 3 (the noise standard deviation σn=30), and the comparison results of denoised index PSNR and SSIM are shown in Table 3.Table 3
Comparison of different denoising methods on PSNR and SSIM for Cassiopeia A.
Denoising method
σ
n
=
10
σ
n
=
20
σ
n
=
30
PSNR
SSIM
PSNR
SSIM
PSNR
SSIM
Noisy image
28.1328
0.6297
22.1122
0.3594
18.5904
0.2291
Article [23]
31.9312
0.8286
28.1201
0.8035
27.9811
0.6882
Article [24]
31.1877
0.8415
28.1838
0.7762
26.8825
0.6673
Article [25]
30.0256
0.7866
27.7673
0.7544
25.7336
0.6694
Article [26]
32.3656
0.8810
30.1614
0.8201
28.8912
0.7325
Article [27]
30.5267
0.8092
28.4142
0.7785
26.3635
0.6738
Article [28]
32.5267
0.8819
30.2484
0.8234
28.6222
0.7363
The new method
33.9213
0.8989
31.0765
0.8266
29.0733
0.7458Figure 3
Comparison of different infrared image denoising methods for Cassiopeia A.
(a)
The original image
(b)
The noisy image
(c)
Article [23]
(d)
Article [24]
(e)
Article [25]
(f)
Article [26]
(g)
Article [27]
(h)
Article [28]
(i)
The new method
(j)
Magnified images cropped from (h)
(k)
Magnified images cropped from (i)In Figure3, the image processed by [23, 24] or [27] is more blurred because it loses much edge information. The image processed by [25] or [26] includes much noise which destroys the clarity of the image. The denoising effect of [28] is more close to our proposed method and can preserve more edge information than the others. A Further comparison between Figures 3(j) and 3(k) illustrates that the denoised edge details are more obvious using the proposed method in this paper.From Table3, we find that the new method has better performance than the others for the infrared image.The proposed method in this paper is dependent on parameterα in (13). Linear parameter α is the weighting value of Fdecx,y in (12) to adjust edge detection operator, whose sensitivity is decided by Fdecx,y. When α becomes bigger, more edge information can be detected, but antinoise performance will drop. Through repeated experiments, the denoising effect is ideal when α is between 0.3 and 0.6. In this paper, we set α=0.5. Figure 4 shows the PSNR of Aerial image, Barbara, and Cassiopeia A for parameter α∈[0,1].Figure 4
The PSNR of Aerial image, Barbara, and Cassiopeia A for parameterα∈[0,1].At last, we note down the computational cost of different denoising methods. We test the algorithms to process one512×512 image on a Windows machine with Intel(R) Celeron G550 @ 2.60 GHz CPU and 4.00 GB RAM. Results are illustrated in Table 4.Table 4
Comparison of different denoising methods on computational burdens.
Method
Article [23]
Article [24]
Article [25]
Article [26]
Article [27]
Article [28]
The new method
Unit of time (s)
88
1.7782
1.5506
1.3011
1.1112
0.9382
0.9532In [27], most of the runtime latency was caused by the reading of coefficients back from GPU’s framebuffer and the sorting operation on CPU, and the runtime of these two tasks dramatically increases along with the image size. In [26], since the BRISQUE approach requires a training procedure to calibrate the regressor module, the computational complexity is high. Although the method in [28] dividing the image into three segments is more close to our proposed method, from the above comparisons, it can be concluded that our proposed method allows an efficient denoising algorithm with relatively low complexity.The computation times have been averaged over twenty runs.


## 8. Conclusion

In this paper, we propose a new method to remove Gaussian noise from digital images. Based on adaptive multiscale morphological edge detection combining improved Bayesian threshold and wiener filtering, the method proposed in this paper not only can remove the noise from remote sensing image but also can remove the noise from general image. It is able to retain the edge details of the image and highlight features of the edge. The simulation experiments show that the denoised images have higher peak signal to noise ratio and mean structural similarity and are of great application value.



---

*Source: 4065306-2017-04-05.xml*