PERFORMANCE ANALYSIS of IMAGE DENOISING using

HAAR and DAUBECHIES 1&2 WAVELETS

NAME1: Ms. K. Dhana Lakshmi, (M.Tech, DECS), Vignans IIT, India.E-Mail: dhanalakshmik009@gmail.com
NAME2: Mr. B. Eshwararao, Assistant Professor, Vignans IIT, India.E-Mail: eshwar.ece@gmail.com

ABSTRACT
In the Modern age of communications during the
transformational digital data/speech/image distortion
(noise) may be added. In image, denoising will
estimate the noise in image (noisy image) for getting
high quality of original image. Thresholding of detail
sub-band coefficient that depends on wavelet based
denoising methods. Nonlinear technique of wavelet
thresholding, which operates at a time on one wavelet
coefficient, is very simple signal estimation process.
On based on the basic principles of generalized
Gaussian distribution (GGD) modeling of sub-band
coefficients, this paper proposes an adaptive
threshold estimation method for image denoising in
the wavelet domain. For the mathematical
computations, more efficient and adaptive method is
normal shrink from the proposed method, named
mainly because of the parameters, the parameters that
are required for estimating the threshold depends on
subband coefficients data. Performance output result
of an image denoising system using discrete wavelet
transform (DWT) is experimentally analyzed for
three levels of DWT decomposition for Gaussian
noise by using adaptive wavelet threshold. The result
is measured in terms of MSE and PSNR by the
computed process that is performedusing Wavelet
Transformation.
Keywords: ImageDenoising, Wavelet thresholding,
Generalized Gaussian distribution (GGD), Normal
Shrink, Discrete Wavelet transform, MSE, PSNR.

1. INTRODUCTION
When an image is in transmissionphase or
acquisition process then it may be corrupted
by different types of noises. Removing
Noise from an image is an important task in
digital image processing, in the aspects of

process itself and component in other

processes. Removing noise from an image
means that have to reduce the percentage of
noise present in noisy image and increase
the
percentage
of
original
image
information.For a good image denoising
model, the main properties that exist is that
it will remove noise while preserving
important features like edges, textures,
color, information and contrast etc. The
traditional way of denoising the image is the
approach of filter. The major problem of
noise inclusion in image processing system
can be eliminated by the use of wavelets,
and it can be achieved by the inverse
transformation.
Mainly there are two types of wavelet
transforms that are considered in the process
as, Continuous and Discrete Wavelet
Transform. Discrete Wavelet transform is
very efficient, where it is convenient and
easier when it is observed from
computational point of view. In signal
processing, denoising of the original image
that is corrupted by the Gaussian noise is a
major problem that exists. The important
tool for the wavelet transform has become
due to the problem due to its energy
compaction
property.
Denoising
or
estimation
of
functions,
involves
reconstituting the signal as well as possible
on the basis of the observations of a useful
signal corrupted by noise. Based on wavelet

representation, the methods that are used,

works very simple algorithms that are often
more powerful and easy to work with than
traditional methods of function estimation.
By the additive Gaussian noise,these
methods are mainly affecteddue to
thresholding of the DWT coefficients.
Discrete Wavelet transform that is used in its
simplest form of the denoising algorithms
are as follows:
DWT is enhanced, to decomposes the
noisy image and get the wavelet
coefficients.
From the noisy image decomposition
of DWT, the wavelet coefficients that
are obtained are de-noised with
wavelet threshold.
After performing wavelet threshold to
the modified coefficients, Inverse
DWT is applied and resultant image is
a denoised image.
Second step process of nonlinear technique
of wavelet thresholding, which operates at a
time on one wavelet coefficient is a common
non-linear technique. Each coefficient is
thresholded on comparison of the threshold
value; where it is the most basic form.
Small amount of noisy coefficients are
replaced by value of zero and performing
inverse DWT on the resulted coefficient,
then it may lead to reconstruction with the
essential signal characteristics and with less
noise. This way of approach exterminates
many wavelet coefficients that might
contain useful information. The dependent
parameters of the noise power and the size
of the image from the definition of
coefficient independent threshold.

Figure 1: Block diagram of Image denoising

system using DWT

2. DISCRETE WAVELET TRANSFORM

Decomposition of a signal is problematic
task with respective to signal parameters. It
decomposes a signal into a set of basis
functions is done by wavelet transform.
These basis functions are called wavelets.
The transformation of a discrete time
domain signal to DWT. Image signals of the
DWT produces a non-redundant image
representation, on comparison with other
multi scale representation such as Gaussian
pyramid it provides better spatial and
spectral localization of image formation.
Due to its application importance, now a
days DWT has been attracted a more and
more interest in image denoising process.
Withoutany loss of information, the
components can be ensembleback to the
original
signal.
This
processiscalledreconstructionorsynthesis.
Discrete wavelet transform and inverse
discrete wavelet transform is namedby the
mathematical manipulation, which implies
analysis and synthesis. Sub band coding
theory or multi resolution analysis is another
part for the consideration of wavelets.
Through the pairs of low pass and high pass
filters,the signal passes successivelythrough
the analysis filters, which produce the

transform coefficients. If these coefficients,

successively passes through the synthesis
filter, it may reproduce the initial signal at
the decoders side. For, an N level
decomposition in 2D image, is performed,
the resulting is in 3N+1 different frequency
bands namely, LL (low frequency or
approximation coefficients), LH (vertical
details), HL (horizontal details) and HH
(diagonal details) as shown in figure 2.The
next level of wavelet transform is applied to
the low frequency sub-band image LL only.
Image Decomposition levels of graphical
representation is shown in figure 2.1

3. WAVELET THRESHOLDING
Wavelet thresholding which operates
on one wavelet coefficient at a time is a very
simple non-linear technique. In its most
basic form, each coefficient is threshold by
compare against threshold, if coefficient is
smaller than threshold, set to zero; otherwise
it is kept or modified.
The major three steps that involves in the
wavelet thresholding are as follows:
Let the signal be {fij} i=1, M, j=1,
N,where M, N is some integer power of 2.It
has been corrupted by additive noise and
one observes
gij=fij+nij, i=1... , M, j=1... , N
Where {nij} are independent and identically
distributed (iid) zero mean, white Gaussian

Figure2: Image decomposition Levels

Rows

Down sample

Columns

Downsample
Rows
Columns

Figure 2.1:Image Decomposition levels

ofGraphical Representation

noise with standard deviation

i.e., as
2
normal nij~N (0, ).The goal is to estimate
{fij} from noisy observation {gij} such that
mean squared error (MSE) is minimum is
given by,

The other popular alternative threshold

method is the hard threshold function.

For hard and soft thresholding methodsthe

transfer function of this is as follows:
Figure 3:Decomposition levels

Let, consider j=0, 1, 2, 3......

0, 1, 2, 3 Decomposition Levels
H=Horizontal Details
V=Vertical details

Fig 3.1: Thresholding function: (a) Soft threshold (b)

HardThreshold

D=Diagonal Details

4. WAVELETBASEDIMAGEDENOISIG

H-High Frequency Bands

If some degree of noise in image processing

system that is added to the natural image, let
it be a white Gaussian noise. Image denoising algorithm attempts to remove this
noise from the image. The resultant image is
a noisy image. Obtaining the decomposed
wavelet
coefficients
uponperforming
wavelet decomposition to decompose the
image. Thresholding techniques like hard,
soft and adaptive shrinkage thresholding are
applied to the wavelet coefficients for the
application of wavelet denoising. To the
processed
wavelet
thresholding
methods,applications of different wavelet
methods arecomputed. The resultant image
is a denoised image in spatial domain upon
performing
inverse
wavelet
transform.Wavelet transform based image
de-noisingprocess is shown in figure 4.

L-Low Frequency Bands

It is convenient to label the sub bands of the
transform as shown in figure 3.
The sub bands dj+3H,dj+3V,dj+3D are called the
Details. By the inverse wavelet transform of
the modified coefficients, the denoised is
estimated. Here, threshold plays an
important role in the denoising process. The
frequently used methods of thresholding are
of two types:
The soft threshold function (also called the
shrinkage function) takes the argument and
shrinks it towards zero by the threshold T.

threshold value (TN), which is adaptive to

different sub band characteristics.

Where, the scale parameter is computed

once for each scale using the following
equation

LK is the length of the sub band at k th scale.

The noise varianceis given by 2, from the
subbandHH1itisestimated.
Figure 4: Block Diagram of Denoising process
using Wavelet transformation and thresholding
techniques.

The Proposed method is named as Normal

Shrink is functionally and computationally
more efficient and adaptive because the
parameters required for estimating the
threshold depends on sub band data and can
be considered as follows:
5. NORMAL SHRINK
The threshold is computed by 2/ ywhere 2
and y are the standard deviation of the noise
and the sub band data of noisy image
respectively. It is scale parameter, which
depends upon the sub band size and number
of decompositions.
For computing the various parameters,this is
the methodthat is used to calculate the

The total number of

decomposition is represented as J.y is the
standard deviation of the sub-band of noisy
image.
Normal Shrink also performs soft
thresholding, which is calculated by the
thresholdTNwith the data driven sub-band
dependent on threshold.
If the value for n is odd then Median (M)
=value of ((n+1)/2)thitem term.
If the value for n is even then Median(M)
=value of [((n)/2)th item term + ((n)/2+1)th
item term]/2

RESULTS

Pseudo color image

Remaining Noise in image

Histogram of A

SOFT THRESHOLDING:

Polar coordinate form

Table-5: PSNR & MSE Comparison

Wavelet
Technique
Haar Wavelet
Daubechies1
Daubechies2
Haar Wavelet
Daubechies1
Daubechies2
Haar Wavelet
Daubechies1
Daubechies -2

Variance

MSE

PSNR

0.01
0.01
0.01
0.02
0.02
0.02
0.03
0.03
0.03

126.65
126.65
102.49
198.97
198.97
172.60
266.82
266.82
237.04

27.15
27.15
28.02
25.14
25.14
25.77
23.87
23.87
24.38

CONCLUSION and FUTURE SCOPE:

Wavelets serve as a powerful toolfor the task of
signal denoising. For improving analyzethe signal /
image / Speech significantly then the ability of the
decomposing the respective signal into different
scales.Two methods of wavelet shrinkage were
reviewed in this report. Whereas classical denoising
methods of a signal remove high frequencies (i.e.,
smoothing of the signal Soft Thresholding) which
are usually associated with noise, shrinkage methods
attempt to remove whatever noise is present and
retain whatever signal is present regardless of the
frequency content of the signal. The latter method has
been theoretically proven to be nearly optimal when
the smoothness of the signal to be recovered is
unknown.
In effect, no alternative procedure can
perform better without some a priori knowledge on
the smoothness class of the signal. They use the
principle of thresholding, without any complicated
assumptions on the structure of the signal. That isthe
process in which, they are non-parametric methods,
and so no particular model of the signal is needed to
be assumed. In addition, they have low computational
complexity.
Both methods were implemented and
simulation results were presented. The signals that
were used are non-stationary ones which usually pose
a problem for classical methods. Nevertheless, the
methods presented in this report deal quite well with
these signals. Even from the small number of
simulations in this report, it is clear that there is no
single "best" wavelet-based denoising method.

Depending upon the signal intensity and

variation of noise, the recovery methods are choosen.
Five types of wavelets were tried for denoising an image. Those five methods are Haar
Wavelet, Daubechies-1 Wavelets, Daubechies 2
Wavelets. As the resultants of these five, wavelet
transformations are compared, the best one in these
five wavelets are is Daubechies 2 Wavelet
Transformation. By comparing using the parameters
of the Mean Square Error (MSE) and Peak to Signal
Noise Ratio (PSNR), Daubechies-2 Wavelet
Transform will give the best result among on these
three wavelet transformations.Furthermore having an
opportunity to remove some more percentage of
noise from an image.

REFERENCES:
[1]Iain M.Johnstone David L Donoho. Adapting to smoothness via
wavelet
shrinkage.
Journal
of
the
Statistical
Association,90(432):1200 1224,Dec 1995.
[2]David L Donoho.Ideal spatial adaptation by wavelet shrinkage.
Biometrika,
[3]David L Donoho. Denoising by soft thresholding.IEEE
Transactions on Information Theory, 41(3):613-627, May 1995.
[4]Fundamentals of Wavelets: Theory, Algorithms, and
applications, J.C. Goswami and A.K.Chan, 2nd ed., Wiley, 2011.
[5]A friendly guide to Wavelets, Gerald Keiser, Springer, 2011.
[6]Multirate Systems and Filter Banks, P.P.Vaidyanathan, Pearson
Education, 2004.
[7]Wavelets: from math too practice, Desanka.P.Radunovik,
springer, 2009.
[8]Donoho.D.L,Johnstone.I.M,Idealspatialadaptation via wavelet
shrinkage, Biometrika, 81, pp.425-455, 1994.
[9]Aglika Gyaourova Undecimated wavelet transforms for image
de-noising, November 19, 2002.
[10]Michel Misiti, Yves Misiti, Georges Oppenhieum, Jean-Michel
poggi, Wavelets and their Applications, published by ISTE 2007
UK.

[11]jaideva Goswami Andrew K.Chan, Fundamentals of Wavelets

Theory, Algorithms, And Applications, John Wiley Sons.
[12]Donoho.D.L.andJohnstone.I.M.(1994)Ideal spatial adaptation
via wavelet shrinkage. Biometrika, 81,425-455.
[13]D.L.Donoho and I.M.Johnstone, Denoising by soft
thresholding, IEEE Transactions on Information Theory, Vol.41,
pp.613-627, 1995.
[14]J.N.Ellinas,T.Madadelis,A.Tzortzis,L.Aslanoglou, Image denoising using wavelets,T.E.I. of Piraeus Applied Research
Review,vol.IX,no.1,pp.97-109,2004.
[15]Lakhwinder Kaur and Savita Gupta and R.C.Chauhan, Image
denoising using wavelet thresholding,ICVGIP,Proceeding of the
Third
Indian
ConferenceOnComputerVision,Graphics&ImageProcessing,Ahem
dabad,India Dec.16-18,2002.
[16]S.Kother Mohideen,Dr.S.Arumuga Perumal,Dr.M.Mohamed
Sathik. Image De-noising using Discrete Wavelet transform,
IJCSNS International Journal of Computer Science and Network
Security, vol.8, no.1, January 2008.
[17]S.Grace Chang, Bin Yu and M.Vattereli,Adaptive Wavelet
Thresholding for Image Denoising and Compression, IEEE
Trans.Image Processing, vol.9, pp.1532-1546, Sept.2000.
[18]G.Y.Chen and T.D.Bui,Multi-wavelet Denoising using
Neighboring
Coefficients,
IEEESignalProcessingLetters,vol.10,no.7,pp.211-214,2003.
[19]A.K.Jain, 1989, Fundamentals of digital image processing,
Prentice Hall nc., Englewood Cliffs, New Jersey.
[20]D.L.Donoho,Denoisingbysoftthresholding,IEEETransactions
on Information Theory, vol.41, pp.613-67, 1995.
[21]RaghuveerM.RaoandAjitS.Bobaradikar,
1998,
Wavelet
transforms: Introduction to theory and Applications, Addison
Wesley LongmnInc.pp.183-189.

[22]Y Chen and C Han, adaptive wavelet threshold for image

denoising, IEEE Electron, Lett, Vol-11, no 10 May 2005.

Author Information:

01.
Mr. B. Eshwararao completed his Master
of Technology and working as an Assistant professor in the
department of Electronics & Communication Engineering
in Vignans Institute of Information Technology,
Visakhapatnam, India. He is participated around of 30
national level workshops and published 12 international
journals.

02.
I Ms. K. Dhana Lakshmi completed
Bachelor of Technology in the stream of Electronics and
Communication Engineering. Now, I am pursuing my
Master of Technology in Vignans Institute of Information
Technology, Near VSEZ, Duvvada, Visakhapatnam, India.