 Open Access
 Total Downloads : 103
 Authors : Kaushik Sinha, Debalina Jana
 Paper ID : IJERTV3IS060953
 Volume & Issue : Volume 03, Issue 06 (June 2014)
 Published (First Online): 19062014
 ISSN (Online) : 22780181
 Publisher Name : IJERT
 License: This work is licensed under a Creative Commons Attribution 4.0 International License
Image Denoising Using MBand Wavelets
A Study on MBand Wavelet and its Application for Image Denoising
Kaushik Sinha
Assistant Professor, Dept. of IT
College of Engineering and Management, Kolaghat KTPP Township, West Bengal, India
Debalina Jana
Assistant Professor, Dept. of AEIE College of Engineering and Management, Kolaghat
KTPP Township, West Bengal, India
AbstractThis work addresses to a study on the different techniques of noise removal from an image using MBand Wavelet Transform. The standard wavelet transform technique has already proven its capability for different image processing problems such as image denoising. Noise removal from image is best done in the frequency domain. Psychophysical results indicate human visual processes an image by decomposing into multiple channels corresponding to its frequency and orientation components at different scales. It is also capable of preserving both local and global information. So, multi scale wavelet analysis is an ideal approach to describe noise removal. In this paper, the capability of MBand Wavelet Transform is discussed in the process of noise removal from different images.
KeywordsMBand Wavelet Transform; Additive White Gaussian noise; Thresholding; Image Denoise

INTRODUCTION
Many types of noises due to sensor or channel

Gaussian white noise
This is the most common type of noise [3], [79] which can be generated artificially using the formula
Y = X + sqrt(variance) Ã— random(s) + mean; (1)
Where, X is the input image, Y is the output image, s is the size of X. The value of mean and variance is taken as input.

Poisson noise
In probability theory and statistics, Poisson distribution is a discrete probability distribution that expresses the probability of a number of events occurring in a fixed interval of time and/or space. If the expected number of occurrences in a particular time interval is , then probability that there are exactly k (k = 0, 1, 2 ) occurrences is given by
transmission errors often corrupt images and noise suppression becomes a particularly delicate and a difficult task [56]. Applied noise removal techniques should take into

Speckle noise
(, ) =
(2)
!
account a tradeoff between noise reduction and preservation of actual image content in a way that enhances the diagnostically relevant image content.
The need for efficient image restoration methods has grown with the massive production of digital images and movies of all kinds, often taken in poor conditions. No matter how good cameras are, an image improvement is always desirable to extend their range of action [4].
The two main limitations in image accuracy are categorized as blur and noise. Blur is intrinsic to image acquisition systems, as digital images have a finite number of samples and must satisfy the ShannonNyquist sampling conditions. The second main image perturbation is noise. There are different types of noises that can affect an image. Some of them are

Salt and pepper noise
It is the type of noise where some black and white pixels occurs randomly on an image. A false saturation gives a white spot (salt) and a failed response gives a black spot in the image (pepper) [3], [9].
Within each resolution cell, a number of elementary
scatters reflect the incident wave towards the sensor. The received image is thus corrupted by a random granular pattern, called Speckle. A speckle noise can be modelled as
= (3)
Where, v is the speckle noise, f is the noisefree image and is a unit mean random field. In this paper, the experimental work is done with Gaussian white noise [9].
In the field of Image Processing, the wavelet transform has emerged with a great success [10]. The Mband wavelet transform[24] is a specific area of wavelet transform which has so many advantages over standard wavelet transform [17 23].


MBAND WAVELET TRANSFORM
The term wavelet means a small wave. The smallness refers to the condition that this (window) function is of finite length (compactly supported). The wave refers to the
condition that this function is oscillatory [6].The wavelet transform (WT) is a powerful tool of signal processing for its multiresolutional possibilities [2]. Unlike the Fourier transform, the WT is suitable for handling the nonstationary signals variable frequency with respect to time.

(b)
Fig. 1 Representation of a wave (a), and a wavelet (b)
The gu,v, and hu,v, in these equations are called forward and inverse kernels respectively. They determine the nature computational complexity and ultimate usefulness of the transform pair.
The discrete wavelet transform (DWT) is a linear transformation that operates on a data vector whose length is an integer power of two, transforming it into a numerically different vector of the same length [1], [2].
2
L
2
L
x a1 a2
The illustration in figure2 is commonly used to explain how time and frequency resolutions should be interpreted. Every box in figure2 corresponds to a value of the wavelet
d1 d2
2
H
2
H
Fig. 3 DWT Tree
transform in the time frequency plane. Note that boxes have a certain nonzero area, which implies that the value of a particular point in the timefrequency plane cannot be known. All the points in the timefrequency plane that falls into a box are represented by one value of the WT.
Better time
It separates data into different frequency components, and then matches each component with resolution to its scale. DWT is computed with a cascade of filters followed by a factor 2 subsampling.
H and L denotes high and lowpass filters respectively, 2 denotes subsampling. Outputs of these filters are given by
Better
Fre que
resolution;
equations (6) and (7).
+
frequency resolution; poor time resolution
ncy
poor
frequency resolution
+1
= [ 2]
=
(6)
+
Time
Fig. 2Representation oftimefrequency plane
+1 = [ 2]
=
(7)
First thing to notice in figure 2 is that although the widths and heights of the boxes change, the area is constant. That is each box represents an equal portion of the timefrequency plane, but giving different proportions to time and frequency. At higher frequencies the width of the boxes decreases, means the time resolution gets better, and the heights of the boxes increase, i.e., the frequency resolution gets poorer.

Discrete Wavelet Transform (DWT)
Consider an image f(x,y) of size MÃ—N whose forward
Elements aj are used for next step (scale) of the transform and elements dj, called wavelet coefficients, determine output of the transform. l[n] and h[n] are coefficients of low and highpas filters respectively. Assume that on scale j+1 there is only half from number of a and d elements on scale j.
DWT algorithm for twodimensional pictures is similar. The DWT is performed firstly for all image rows and then for all columns (figure4) [20], [22].
2
L
2
L
x
LL
a j+1
H
discrete transform, T(u, v, ) can be expressed in terms of the general relation [1]
LH
2
d j+1
, , = , ,,(, )
,
(4)
HL
2/p>
L
2
H
d j+1
Where x and y are spatial variables and u, v, are transform variables. Given T(u, v, ), f(x,y) can be obtained using generalized inverse discrete transform
H
2
Fig. 4 Wavelet Decomposition for 2D Signals
HH
d j+1
, = , , ,,(, )
,
(5)
A vector contains energies of wavelet coefficients calculated in subbands at successive scales. As a result of this transform there are 4 subband images [21], [23] at each scale (figure5).
a(n)
h(n)
h(n1)
h(n2)
v(n)
d(n)
v(n1)
d(n1)
v(n2)
d(n2)
=
1
+ ()
,
=1
(14)
The expansion coefficients can be expressed as,
= , , ,
= , , = 1, , 1
,
(15)
Using (9) and (10) in (15), it can be shown that,
1
= ( )
Fig. 5 Subband Images for Wavelet Decomposition
Sub band image a is used only for DWT calculation at the next scale.

MBand Wavelet Transform
= ()( )
(16)
(17)
The wavelet transform maps a function f(x) L2(R) onto a scalespace plane [18], [19]. The wavelets are obtained from a single prototype function (x) by scaling parameters a and shift parameters b. The continuous wavelet transform of a function f(x) is given as,
=
Which is equivalent to processing the sequence a(k) with a set of linear timeinvariant filters of impulse responses and down sampling filter outputs by M. The Mband wavelet system has been in the focus of several recent investigations [25]. Noteworthy advantages of Mband wavelet systems over twoband wavelet systems are their richer parameter space which leads to a greater variety of compactly supported
,
(8)
wavelets. These are practically implementable and have their ability to achieve more rapidly a given frequency resolution as
Mband wavelet decomposition is a direct generalization of the above twoband case [25]. Let (x) be the scaling function satisfying,
= ( )
a function of decomposition scale. These facts provide greater freedom and flexibility in choosing time frequency tilling.
The structure of the classical onedimensional filter bank problem [18] is given in figure 6. The filter bank problem involves the design of the real coefficient realizable. Closely
In addition there are M – 1 wavelets which also satisfy
= ()( )
(9)
related to the filter bank problem is the transmultiplexer problem. A transmultiplexer[18] is a device for converting timedomainmultiplexed (TDM) signals to frequency domainmultiplexed signals (FDM).
(10)
In discrete form these equations can be written as
d0(n)
g1(n)
M
M
p(n)
g0(n)
M
M
h0(n)
d1(n)
=
2 (
)
x(n)
+
(11)
= /2 ( )( )
gM1(n)
M
M
hM1(n)
dM1(n)
y(n)
(12)
A function f(x) V0 L2(R) can be constructed from a discrete sequence a(k) l2(R) in the form,
Fig. 6 An Mchannel filter bank
= ()( )
(13)
i
f(x) can also be expressed in terms of the sum of projections onto subspaces Vi and W (j) as,
M1
–
1 0 0
– /M 0
1
/M
M1
Fig. 7 Ideal frequency responses in an Mchannel filter bank
g0(n)
M
y0(n)
g1(n)
M
y1(n)
gM1(n)
M
yM1(n)
+
d(n)
x0(n)
M
p(n)
M
h0(n)
x1(n)
M
hM1(n)
xM1(n)
– –

(b)

Fig. 10 Thresholding functions; (a) hard, (b) soft
Fig. 8An Mchannel Transmultiplexer
The basic structure of a transmultiplexer is shown in figure
The hard thresholding function is given as

The transmultiplexer problem is to design filters such that perfect reconstruction is guaranteedand the filter responses approximate in figure 7.
=
, >
= 0, (19)


IMAGE DENOISING
Two main limitations in.The image and noise model is given as equation (18)
X = S + .g (18)
Where, S is an original image and X is a noisy image corrupted by additive white Gaussian noise g of standard deviation . Both images s and X are of size N by M (mostly M = N and always power of 2) [1114].

Basic steps for image denoising
The basic steps involved in image denoising as followed in this paper is shown in the block diagram (figure 9) below.
Similarly, soft thresholding function is given as [14]
= =
() Ã— ( , 0), >
, (20)
Where, w and z are the input and output wavelet coefficients respectively, is a selected threshold value for both (19) and (20).
C. Performance Measurement
The performance of various denoising algorithms is quantitatively compared using MSE (mean square error) [5],
[15] and PSNR [16] (Peak Signal to Noise Ratio) asApply MBand Wavelet Transform
Noisy Input Image
= 1
=1
=1
, (, ) 2
(21)
= 10 log10
255 2 (22)
Channel M2 Coefficient
Channel 2 Coefficient
Channel 1 Coefficient
Apply Denoise (Hard or Soft)
Denoised Output Image
Apply Inverse MBand Wavelet Transform
Fig. 9Basic Steps for Image Denoising
B. Threshold Determination
The standard thresholding of wavelet coefficients is governed mainly by either hard or soft thresholding function [10] as shown in figure 10. The first function in figure10(a) is a hard function, and figure 2(b) is a soft function [17].
Where, s is an original image and y(n,m) is a recovered image from a noisy image s(n,m).


EXPERIMENTAL RESULTS AND DISCUSSION The experiments are conducted (process was as shown in
figure 9) taking M=4 (for MBand) on natural greyscale test images like Lena, Barbara, Peppers, Boat etc. of size 512Ã—512. The kind of noise, added to original image, is Gaussian of different noise levels = 2, 5 and 10 one after another. Figure 11 shows the original and noisy version of barbara image.

(b)
Fig. 11Experimental Image of barbara (256Ã—256)

Original, (b) After adding Gaussian White Noise of =2, variance=30

(b)

Fig. 12Peppers image 300% magnified; (a) Noisy, (b) Denoised Image
(a) (b) (c)
Fig. 13Boat Image 400% magnified (a)noisy image, (b)denoised image using hard threshold, (c) denoised image using soft threshold

(b) (c)
Fig. 14Lena Image 400% magnified (a)noisy image, (b)denoised image using hard threshold, (c) denoised image using soft threshold
The PSNR values as given in equation (21) and (22), are obtained as shown in table I. The PSNR from various methods are compared in Table I and the data are collected from an average of fifteen to twenty runs on the each imageof size 512Ã—512.
TABLE I
PSNR VALUES FOR IMAGES OF SIZE 512Ã—512
Th. Typea
Value of Sigma ()
2
5
10
lena
Hard
35.0385
30.5835
28.8199
Soft
31.3728
27.3253
23.6765
barbara
hard
35.3577
30.0593
27.0913
soft
30.9910
26.3386
22.7523
baboon
hard
36.0850
28.2366
24.1164
soft
29.6279
24.1578
20.7253
boat
hard
35.1460
29.8883
27.4503
soft
30.8520
26.4326
22.8586
fruits
hard
35.1648
30.0153
27.8897
soft
31.0728
26.7965
23.3131
goldhill
hard
35.0529
29.5271
27.6074
soft
30.7525
26.5456
23.1724
peppers
hard
35.1891
31.4086
29.5094
soft
31.8152
27.6794
23.7337

Type of threshold hard or soft

From the PSNR values shown in table I, it is very much clear that, as we increase the value of noise level (), PSNR
value gradually decreases. A comparison among all the pictures are given in the following figure 15 and 16.
Fig. 15Comparison among all the images as graph
Fig. 16 Comparison among all the images as bar chart



CONCLUSION
In this paper, the advantages, applications, and limitations ofMband wavelet transform and its extensions are realized. Mband Wavelet Transforms is a powerful extension to standard DWT. This transform technique is investigated to reduce the major limitations of standard DWT and its extensions in certain signal processing applications.
The history, basic theory, recent trends, and various forms of Mband wavelet transforms with their applications are collectively and comprehensively analysed. Recent developments in Mband wavelet transforms are critically compared with existing forms of WTs. Potential applications are investigated and suggested that can be benefited with the use of different variants of Mband wavelet transforms.
Individual software codes are developed for simulation of selected applications such as Denoising both WTs and M band wavelet transforms. The performance is statistically validated and compared to determine the advantages and limitations of Mband wavelet transforms over well established WTs. Promising results are obtained using individual implementation of existing algorithms incorporating novel ideas into wellestablished frameworks.
ACKNOWLEDGMENT
The authors express their sincere thanks to Prof. Dr. Santi Prasad Maity for his invaluable guidance for this paper.
REFERENCES

DIGITAL IMAGE PROCESSING Rafael C. Gonzalez, Richard E. Woods and Steven L. Eddins, Pearson Education.

The wavelet tutorial by Robi Polikar.

http://en.wikipedia.org/wiki/Image_noise

D.L. Donoho, DeNoising by Soft Thresholding, IEEE Trans. Info. Theory 43, pp. 933936, 1993.

S. Grace Chang, Student Member, IEEE, Bin Yu, Senior Member, IEEE, and Martin Vetterli, Fellow, IEEE, Adaptive Wavelet Thresholding for Image Denoising and Compression, IEEE Transactions on Image Processing, Vol. 9, No. 9, pp. 15321546, September 2000.

Ruban Brar and Rajesh Kumar, Image Denoising Using Wavelet Thresholding Hybrid Approach, Proceedings of SARCIRAJ International Conference, 22nd June 2013, New Delhi, India, ISBN: 9788192714769.

Nima Khademi Kalantari and Pradeep Sen, Removing the Noise in Monte Carlo Rendering with General Image Denoising Algorithms, Â© 2013 The Eurographics Association and Blackwell Publishing Ltd.

S. M. Mahbubur Rahman, M. Omair Ahmad, Fellow, IEEE, and M. N.
S. Swamy, Fellow, IEEE, Bayesian WaveletBased Image Denoising Using the GaussHermite Expansion, IEEE Transactions on Image Processing, Vol. 17, NO. 10, pp. 17551770, October 2008.

Priyanka Kamboj and Versha Rani, A Brief Study of Various Noise Model and Filtering Techniques, Journal of Global Research in Computer Sc., Vol 4, No. 4, April 2013.

D.L. Donoho and I.M. Johnstone, Adapting to unknown smoothness via wavelet shrinkage, Journal of American Statistical Assoc., Vol. 90, no. 432, pp 2001224, Dec. 1995.

P.R. Hill, A. Achim, and D.R. Bull, M.E. AlMualla, Image Denoising Using Dual Tree Statistical Models for Complex Wavelet Transform Coefficients Magnitude, IEEE Transaction, 9781479923410/13.

Tang Hui, Liu Zengli, Chen Lin, Chen Zaiyu, Wavelet Image Denoising Based on The New Threshold Function, Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013).

Jiecheng Xie, Student Member, IEEE, Dali Zhang, and Wenli Xu, Spatially Adaptive Wavelet Denoising Using the Minimum Description Length Principle, IEEE Transactions on Image Processing, Vol. 13, NO. 3, pp. 179187, February 2004.

Javier Portilla, Vasily Strela, Martin J. Wainwright, Eero P. Simoncelli, Javier Portilla, Vasily Strela, Martin J. Wainwright, Eero P. Simoncelli, IEEE Transactions on Image Processing, Vol. 12, NO. 11, pp. 13381351, November 2003.

Hari Om, Mantosh Biswas, An Improved Image Denoising Method Based on Wavelet Thresholding, Journal of Signal and Information Processing, 2012, 3, pp. 109116, http://dx.doi.org/10.4236/jsip.2012. 31014.

Ashish Khare and Uma Shanker Tiwary, Member, IEEE, A New Method for Deblurring and Denoising of Medical Images using Complex Wavelet Transform, Proceedings of the 2005 IEEE Engineering in Medicine and Biology 27th Annual Conference, Shanghai, China, September 14, 2005.

Jingyu Yang, Wenli Xu, Yao Wang, and Qionghai Dai, 2D Anisotropic Dual Tree Complex Wavelet Packets and Its Application to Image Denoising, IEEE Transaction, 9781424417643/08.

Caroline Chaux, Laurent Duval, JeanChristophe Pesquet, Image Analysis Using a DualTree MBandWavelet Transform, IEEE Transaction on Image Processing, Volume 15 , Issue 8, pp: 2397 2412, August, 2006.

Chaux, C., Duval, L., BenazzaBenyahia, A., Pesquet, J., A New Estimator for Image Denoising Using A 2D Dualtree MBand Wavelet Decomposition, IEEE International Conference onAcoustics, Speech and Signal Processing, Vol 3, 2006.

Pravinkumar Rathod, Mrs. A. V. Kulkarni, "Image Resolution Enhancement by Discrete and Stationary Wavelet Decomposition using Bicubic Interpolation", International Journal of Engineering Research & Technology (IJERT), ISSN: 22780181, Vol. 2 Issue 11, November
2013.

Siddharth Bhalerao, Papiya Dutta, "Image Denoising Using Riesz Wavelet Transform and SVR", International Journal of Engineering Research & Technology (IJERT), ISSN: 22780181, Vol. 2 Issue 11, November 2013.

Dr. Anna Saro Vijendran, S. Vinod Kumar, "A New Content Based Image Retrieval System by HOG of Wavelet Sub Bands", International Journal of Engineering Research & Technology (IJERT), SSN: 2278 0181, Vol. 3 Issue 3, March 2014.

Arya P Unni, "Satellite Image Enhancement Using 2D Level DWT", International Journal of Engineering Research & Technology (IJERT), ISSN: 22780181, Vol. 3 Issue 3, March 2014.

J. Tian and R. O. Wells, A Fast Implementation of Wavelet Transform for Mband Filter Banks, Proc. SPIE, 3391:534545 (1998).

Q. Sun, N. Bi, and D. Huang, An Introduction to Multiband Wavelets, Zhejiang University Press, China, 2001.