Académique Documents
Professionnel Documents
Culture Documents
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 1, January February 2013 ISSN 2278-6856
1. INTRODUCTION
In the past two decades, many noise reduction techniques have been developed for removing noise and retaining edge details. Most of the standard algorithms use a defined filter window to estimate the local noise variance of a noise image and perform the individual unique filtering process. The result is generally a greatly reduced noise level in areas that are homogeneous. But the image is either blurred or over smoothed due to losses in detail in non-homogenous areas like edges or lines. This creates a barrier for sensing images to classify, interpret and analyze the image accurately especially in sensitive applications like medical field. The primary goal of noise reduction is to remove the noise without losing much detail contained in an image. To achieve this goal, we make use of a mathematical function known as the wavelet transform to localize an image into different frequency components or useful sub bands and effectively reduce the noise in the sub bands according to the local statistics within the bands. The Volume 2, Issue 1 January - February 2013
main advantage of the wavelet transform is that the image fidelity after reconstruction is visually lossless. The wavelet de-noising scheme thresholds the wavelet coefficients arising from the wavelet transform. The wavelet transform yields a large number of small coefficients and a small number of large coefficients. Wavelets are especially well suited for studying nonstationary signals and the most successful applications of wavelets have been in compression, detection and denoising. The method consists of applying the DWT to the original data, thresholding the detailed wavelet coefficients and inverse transforming the set of thresholded coefficients to obtain the denoised signal. Given a noisy signal y = x + n; where x is the desired signal and n is independent and identically distributed (i.i.d) Gaussian noise N (0, 2), y is first decomposed into a set of wavelet coefficients w = W[y] consisting of the desired coefficient and noise coefficient n. By applying a suitable threshold value T to the wavelet coefficients, the desired Coefficient =T[w] can be obtained; lastly an inverse transform on the desired coefficient will generate the denoise signal x = WT[].
Figure 1: Block Diagram for DWT based denoising framework In the experiments, soft thresholding has been used over hard thresholding because it gives more visually pleasant images as compared to hard thresholding; reason being the latter is discontinuous and yields abrupt artifacts in the recovered images especially when the noise energy is significant. Flowchart for Image Denoising Algorithm using Wavelet Transform is shown in figure 2. 1.1 SURE SHRINK Page 57
A threshold chooser based on Steins Unbiased Risk Estimator (SURE) was proposed by Donoho and Johnstone and is called as Sure Shrink. This method specifies a threshold value for each resolution level j in the wavelet transform which is referred to as level dependent threshold. The goal of Sure Shrink is to minimize the mean squared error, defined as,
Page 58
(15) Let us define f (w) =log (pw (w)) Then using equation (13) and (14)
(17) (18)
Where and represents the derivatives of with respect to w1 and w2 respectively. We know can be written a Figure 3: 22 Block partition for a Wavelet subband As shown in Figure 3, there is a number of subband produced when we perform wavelet decomposition on an image. For every subband, we need to divide it into a lot of square blocks. Block Shrink can select the optimal block size and threshold for the given subband by minimizing Steins unbiased risk estimate. Experimental results show that Block Shrink outperforms significantly the classic Sure Shrink by the term-by-term thresholding and Neigh Shrink with the fixed overlapping block size and threshold proposed by Chen et al. Experimental results showed that the PSNRs which Block Shrink yielded were substantially higher than those that Sure Shrink and Neigh Shrink did. As a matter of fact, Block Shrink enjoys the advantages of Sure Shrink and Neigh Shrink and gets rid of there. Page 59
(19) From this . (20) From equations (18), (19), (20) and (21) MAP estimator can be written as
3. CONCLUSION
Image denoising, using wavelet techniques are effective because of its ability to capture the energy of signal in a few high transform values, when natural image is corrupted by Gaussian noise. Wavelet thresholding is an idea in which is removed by killing coefficient relative to some threshold. Out of various thresholding techniques soft-thresholding is most popular. This paper presents a comparative analysis of various image denoising thresholding techniques (Sure Shrink, Bays Shrink, Bivariate Shrinkage, Block Shrink) using wavelet transforms. A lot of combinations have been applied in order to find the best method that can be followed for denoising intensity images. From the PSNR and MSE values as shown in tables, it is clear that Bivariate Shrinkage giving better results under different noise variance conditions for all of the images. The Comparative graph for PSNR and MSE are given below
Variance () = 0.01 = 0.02 = 0.03 = 0.04 = 0.05 27.41 28.32 29.48 30.47 31.64 24.35 24.93 25.62 26.22 27.07 68.44 68.46 68.48 68.56 68.59 30.48 29.46 28.00 26.60 25.18
Figure 5: Comparative Graph for PSNR for thresholding techniques for Gaussian noise having different variances
Table 2: Gaussian noise, MSE Volume 2, Issue 1 January - February 2013 Page 60
Figure 6: Comparative Graph for MSE for thresholding techniques for Gaussian noise having different variances
REFERENCES
[1] Gao Zhing, Yu Xiaohai, Theory and application of MATLAB Wavelet analysis tools, National defense industry publisher, Beijing, pp.108-116, 2004. [2] Aglika Gyaourova Undecimated wavelet transforms for image denoising, November 19, 2002. [3] C Sidney Burrus, Ramesh A Gopinath, and Haitao Guo, Introduction to wavelet and wavelet transforms, Prentice Hall1997.S. Mallat, A Wavelet Tour of Signal Processing, Academic, New York, second edition, 1999. [4] F.Abramovich and Y. Benjamini, Adaptive thresholding of wavelet coefficients,Comput. Statist. Data Anal., vol. 22, pp. 351361, 1996. [5] Sachin D Ruikar and Dharmpal D Doye, Wavelet Based Image Denoising Technique (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 2, March 2011. [6] F. Abramovich, T. Sapatinas, and B. Silverman, Wavelet thresholding via a Bayesian approach, J. R. Stat., vol. 60, pp. 725749, 1998. [7] Z. CAI, T. H. Cheng, C. Lu, and K. R. Subramanian, Efficient waveletbased image denoising algorithm, Electron. Lett., vol. 37, no. 11, pp.683685, May 2001. [8] Sanyam Anand, Amitabh Sharma and Akshay Girdhar, Undecimated Wavelet Based New Threshold Method for Speckle Noise Removal in Ultrasound Images International Conference on Modeling, Simulation and Control, vol.10, IACSIT Press, 2010. [9] D. L. Donoho and I. M. Johnstone, Denoising by soft thresholding ,IEEE Trans. on Inform. Theory, Vol. 41, pp. 613-627, 1995. [10] X.-P. Zhang and M. D. Desai, Adaptive denoising based on SURE risk, IEEE Signal Volume 2, Issue 1 January - February 2013
Page 61