Beruflich Dokumente
Kultur Dokumente
π
H0∗ H1∗ ↓ (M, M ) ↑ (M, M ) e0H
H e1
∗ ∗
11
00 11
00
HM e M −1 H
e M −1
−1 HM −1 ↓ (M, M ) ↑ (M, M ) H
−π 00
11 00
11 π G∗ ∗
0 G0 ↓ (M, M ) ↑ (M, M ) e0 G
G e0
00
11 00
11 ω1
00
11 00
11
G∗ ∗
0 G1 ↓ (M, M ) ↑ (M, M ) e0 G
G e1
00
11 00
11 G∗ ∗
M −1 GM −1 ↓ (M, M ) ↑ (M, M ) e M −1 G
G e M −1
G∗ ∗
0 H0 ↓ (M, M ) ↑ (M, M ) e0 H
G e0
−π
G∗ ∗
0 H1 ↓ (M, M ) ↑ (M, M ) e0 H
G e1
4, j = 1 and (m1 , m2 ) = (2, 1). The four crosshatched areas H0∗ G∗ ↓ (M, M ) ↑ (M, M ) e0G
H e0
0
are separated using tensor products of analytic/anti-analytic
H0∗ G∗ ↓ (M, M ) ↑ (M, M ) e0G
H e1
wavelets. 1
∗ ∗ e M −1
e M −1 G
HM −1 GM −1 ↓ (M, M ) ↑ (M, M ) H
In other words, in order to implement the decomposition onto Assume that the digital image (rk1 ,k2 )(k1 ,k2 ) to be analyzed
(ψm²1 ²2
(x1 )ψm (x2 ))(m1 ,m2 )∈N?2 , we need four separable 2D is related to its analog version r(x1 , x2 ) by the relation:
1 2 M
wavelet analyses (see the corresponding filter bank structures X
r(x1 , x2 ) = rk1 ,k2 χ(x1 − k1 , x2 − k2 )
in Fig. 2). The two upper analyses, which are also present in
(k1 ,k2 )
the real parts, are implemented in the real biorthogonal case.
These four M -band wavelet decompositions generate co- where χ is an interpolation function in L2 (R2 ). To perform
efficients denoted by c•• HH H• •H
j,m [k], cj,m [k], cj,m [k] and cj,m [k] the first separable wavelet decomposition, we need to deter-
where j ∈ Z denotes the resolution level, m = mine the approximation coefficients: c0,(0,0) [k1 , k2 ] =
(m1 , m2 ) ∈ N2M is the frequency band index and k ∈ Z2 is hr(x1 , x2 ), ψ0 (x1 −k1 )ψ0 (x2 −k2 )i. Similar approximations
the spatial position. Finally, to obtain the desired directional have to be computed for the three remaining trees. It is easy
analysis, we compute the inner product of the image to be to show that these operations can be performed by applying
processed with the RP and IP terms of the two-dimensional four digital prefilters with frequency responses:
wavelets as previously expressed. This is equivalent to per- ∞ ∞
X X
form the following linear combinations of the subbands: for F1 (ω1 , ω2 ) = χ
b(ω1 + 2p1 π, ω2 + 2p2 π)
all m ∈ N?2 M, p1 =−∞ p2 =−∞
1 F3 (ω1 , ω2 ) = χ
b(ω1 + 2p1 π, ω2 + 2p2 π)
d•H H• •H
j,m [k] = √ (cj,m [k] − cj,m [k]). p1 =−∞ p2 =−∞
2
(ψb0H (ω1 + 2p1 π))∗ ψb0∗ (ω2 + 2p2 π)
3.2. Prefiltering stage ∞
X X∞
F4 (ω1 , ω2 ) = χ
b(ω1 + 2p1 π, ω2 + 2p2 π)
In a digital implementation of the dual-tree decomposition, p1 =−∞ p2 =−∞
prefilters must be added to make the transition from the ana-
log formalism to discrete processing [8]. ψb0∗ (ω1 + 2p1 π)(ψb0H (ω2 + 2p2 π))∗ .
3.3. Reconstruction to an equal-subband wavelet packet analysis. Classical es-
timators are applied to the resulting coefficients: Visushrink
As already mentioned, the complex dual-tree transform has a
(Visu), SUREshrink (SURE) and the bivariate shrinkage (Biv)
redundancy of a factor 4. As a consequence, the reconstruc-
[9]. Quantitative results are given in Table 1. Here, the initial
tion is not unique and we have to pay attention to the choice
SNR is equal to 5.67dB.
of the synthesis scheme.
Let r ∈ `2 (Z2 ) be the vector of image values and c•• , cHH , Visu SURE Biv
cH• , c•H denote the coefficient vectors generated by the com- DTT2 9.47 12.66 13.69
plex dual-tree transform. The linear combination of the sub- DTT4 10.70 13.23 14.31
bands is not taken into account as it reduces to a basic isome- DTT2cx 9.72 12.84 13.95
try. The global decomposition operator can be written as DTT4cx 11.06 13.41 14.32
•• DTTbi2 8.55 11.65 12.73
c D1 r
cHH D2 r 5/3 DTTbi4 9.39 12.14 13.45
Dc : r 7→
cH• = D3 r
(7) DTTbi2cx 8.78 11.88 13.44
c•H D4 r DTTbi4cx 9.71 12.35 13.82
DTTbi2 9.33 12.40 13.62
where, for all i ∈ {1, . . . , 4}, Di = Ui Fi where Fi repre- 9/7 DTTbi4 10.55 12.96 14.25
sents the i-th prefiltering operation and Ui is the i-th M -band DTTbi2cx 9.56 12.59 13.97
separable biorthogonal wavelet decomposition. DTTbi4cx 10.90 13.13 14.34
A robust reconstruction of r is then obtained as the solution
of the minimization problem Table 1. Denoising results in terms of SNR (in dB).
4
X
inf kci − Di rk2Qi (8) One can observe that, for all estimators, the 4-band struc-
r
i=1
tures always bring significant improvements (at least 0.2dB)
with respect to the dyadic ones. Moreover, the complex de-
where Qi is a positive self-adjoint operator and k.k2Qi = compositions outperform the real ones; the differences are
h., Qi .i. The minimizer allows us to defines a generalized however smaller with the bivariate shrinkage, for 4-band or-
pseudo-inverse of the operator Dc which is expressed as: thogonal filter banks. One can also see that the 9/7 biorthog-
onal decompositions provide results close to orthogonal ones.
³X
4 ´−1 Nevertheless, biorthogonal decompositions could be more use-
Dc ] = F†i U†i Qi Ui Fi (F†1 U†1 Q1 , . . . , F†4 U†4 Q4 ).
ful in image coding applications where they are known to be
i=1
very effective.
In practice, iterative approaches are generally necessary to
5. REFERENCES
compute Dc ] . Notice however that, by choosing Qi =
(Ui U†i )−1 , the generalized pseudo-inverse takes a simple form, [1] I. W. Selesnick, R. G. Baraniuk, and N. G. Kingsbury, “The dual-tree complex
wavelet transform,” IEEE Signal Processing Magazine, pp. 123–151, Nov. 2005.
which can be easily implemented by combining the standard
synthesis filter bank structures with filtering operations. [2] E. Le Pennec and S. Mallat, “Sparse geometric image representations with ban-
delets,” IEEE Trans. on Image Proc., vol. 14, no. 4, pp. 423–438, Apr. 2005.
[3] E. J. Candès and D. L. Donoho, Curves and Surfaces, chapter Curvelets - a sur-
4. EXPERIMENTAL RESULTS prisingly effective nonadaptive representation for objects with edges, pp. 105–120,
Vanderbilt University Press, Nashville, TN, 1999.
We apply these different decompositions to image denoising. [4] M. N. Do and M. Vetterli, “The contourlet transform: an efficient directional mul-
More precisely, we aim at restoring the 512 × 512 Barbara tiresolution image representation,” IEEE Trans. on Image Proc., vol. 14, no. 12, pp.
2091–2106, Dec. 2005.
image which is corrupted by an additive zero-mean white
[5] N. G. Kingsbury, “The dual-tree complex wavelet transform: a new technique for
Gaussian noise. Four orthogonal decompositions are tested: shift invariance and directional filters,” in Proc. IEEE Digital Signal Processing
the real dual-tree transform with dyadic (DTT2) and 4-band Workshop, Bryce Canyon, UT, USA, Aug. 9-12 1998, number 86.
(DTT4) filter banks; the complex dual-tree transform with [6] I. W. Selesnick, “Hilbert transform pairs of wavelet bases,” Signal Processing
dyadic (DTT2cx) and 4-band (DTT4cx) filter banks. In this Letters, vol. 8, no. 6, pp. 170–173, Jun. 2001.
case, we use symlets of length 8 and 4-band filters of length [7] R. Yu and H. Ozkaramanli, “Hilbert transform pairs of biorthogonal wavelet bases,”
22. Moreover, we consider 4 additional biorthogonal trans- IEEE Trans. on Signal Proc., vol. 54, no. 6, pp. 2119–2125, June 2006.
forms: the dual-tree transform with dyadic (DTTbi2) and 4- [8] C. Chaux, L. Duval, and J.-C. Pesquet, “Image analysis using a dual-tree M -band
wavelet transform,” IEEE Trans. on Image Proc., vol. 15, no. 8, pp. 2397–2412,
band (DTTbi4) filter banks; the complex dual-tree transform Aug. 2006.
with dyadic (DTTbi2cx) and 4-band (DTTbi4cx) filter banks.
[9] L. Şendur and I. W. Selesnick, “Bivariate shrinkage with local variance estimation,”
In this case, we use standard biorthogonal 5/3 and 9/7 wave- Signal Processing Letters, vol. 9, no. 12, pp. 438–441, Dec. 2002.
lets and the associated 4-band basis functions corresponding