Professional Documents
Culture Documents
fis ®
2
a
at
)rhe symmetric covariation coefficient is defined as
@)
Corr, (X,,X,)= Ay, x,
side (9)
(1, X11 Yoda
Where it takes values between -1 and 1.
D. Undecimated Discrete Wavelet Transform (UDWT)
The Discrete Wavelet Transform (DWT) is referred to
aS Mallat’s algorithm [21], which is based on orthogonal
decomposition of the image onto a wavelet basis in order
to avoid the redundancy of information in the pyramid at
cach level of resolution. Consequently, Undecimated
Copyright 2015 GSTFSth Annual International Conference on Advances in Biotechnology (BioTech 2015)
Discrete Wavelet Transform (UDWT) avoids image
decimation which has been developed for image
processing applications such as denoising [22], texture
classification [23]. pattern recognition and fusion. The
discrete implementation of UDWT can be accomplished
by using the ‘a trous’ (with holes) algorithm, which
presents interesting properties such as:
* The evaluation of the wavelet decomposition can
be followed from level to level.
A single wavelet coefficient plane is produced at
each level of decomposition,
‘The wavelet coeificients are computed for each
location allowing a better detection of dominant
feature.
© Itiseasily implemented,
‘The ‘a trous” wavelet transform is a non-orthogonal
‘multiresolution decomposition, which separates the low
frequency information (approximation) from high-
frequency information (detail coefficients), Such a
separation uses a low-pass filter h(n), associated with the
scale function g(x), to obtain successive approximations
ofa signal through scales as follows:
a(k
SY htna, (keen), j=l
Where a,(k)corresponds to the original discrete
signals(k); and N are the scale index and the
number of scales, respectively.
‘The wavelet coefficients are extracted by using a
high-pass filter g(n), associated with the wavelet
function y/(x).. through the following filtering operation
0 (= gla, (k-+ 02)
‘The perfect reconstruction of data is performed by
introducing two dual filters far(n) and. gr(v) that should
satisfy the quadrature mirror filter condition
Lirhl =n) + gr(ng(l-n) = 6)
Where d(N)is the Dirac fumetion. A simple choice
consists in considering jar(n)and gr(m)filters as equal
to Dirac function (d-(71) = gr(m) = d()). Therefore
1g (7) is deduced from (3) as
g(r) = 5(1)- h(n)
Hence, the wavelet coefficients are obtained by a
simple difference between two _ successive
approximations as follows
wj(k
=a,()-a,(%) (1)
To construct the sequence, this algorithm performs
successive convolutions with a filter obtained from an
auxiliary function named as the scaling function. Given
an imageT, the sequence of approximations are
constructed are as follows
A=FU), A =F(A), A= F(A) (15)
Where Fis a scale function, A B3 cubic spline
function is often used for the characterization of the scale
function [24] and the use of a B3 eubic spline leads to a
convolution with a mask of 5x5
14-6 41
416 24 16 4