Dubuc-Deslauriers Interpolation Wavelets Tese

DUBUC-DESLAURIERS
INTERPOLATION WAVELETS
ISAAC OLUKUNLE ABIODUN
African Institute for Mathematical Sciences,
e-mail: newton@aims.ac.za; i.o.abiodun@ieee.org
Supervisor : Prof. Johan de Villiers
Department of Mathematical and Physical Sciences,
University of Stellenbosch,
e-mail: jmdv@sun.ac.za
MAY 2006
Contents
Abstract ii
Dedication iii
Acknowledgements iv
Notation v
Introduction 1
1 The renement mask 2
2 The renable function 10
3 The interpolation wavelet 29
Conclusion 36
References 38
i
AIMS
Abstract
Wavelet decomposition techniques have grown over the last two decades into an important math-
ematical tool in signal analysis. The main building block in wavelet construction is a so called
renable function (scaling function), with the intrinsic property of being expressible as a linear
combination of the integer shifts of its own dilation with a factor 2. An important class of renable
functions are the Dubuc-Deslauriers renable functions, which are also fundamental interpolants,
and can therefore be used to construct corresponding interpolation wavelets by means of the asso-
ciated interpolation operator.
In this essay, after proving results on the existence, construction and properties of Dubuc-Deslauriers
renable functions, as was done in [1], [7], [8], the method adopted in [4] is shown to yield an
explicit construction procedure for the Dubuc-Deslauriers interpolation wavelets, and the accom-
panying decomposition algorithm. A practical application in signal analysis is then investigated.
ii
AIMS
Dedication
This essay is dedicated to my siblings, Cecilia, Paul and Timothy, you guys mean a lot to me. I set
the record for you to break.
iii
AIMS
Acknowledgements
I give all glory to God, the alpha and omega, for the grace and strength He gave me in the course
of this essay and the whole of AIMS programme. Indeed, I appreciate the fatherly guidance of my
supervisor, Prof. Johan de Villiers. You are more than helpful and I will always remember your
contribution to my life. My gratitude also goes to the administration of AIMS: the founder, Prof.
Neil Turok, the director, Prof. Fritz Hahne, and others, for the opportunity given me to study here.
Thanks for all your support. Special regards to Dr Mike Pickles, Nneoma Ogbonna and the rest of
the tutors at AIMS. I must not fail to appreciate Akwum Onwunta who proved to be a brother to
me. You are indeed a star.
My profound gratitude to my parents, Pastor and Mrs Abiodun, and my siblings, Cecilia, Paul
and Timothy. Your love and care has always been of tremendous help, you are the best. I cannot
end this acknowledgement without appreciating the Nigerian team at AIMS for the 2005/2006 set,
Bolaji, Femi, Henry, Gideon, Okeke, Naziga and Doom-null. Our unity is our strength, the G8 is
going places. In general, a lot of thanks also goes to all the students whose company made AIMS
an interesting place to be.
I also appreciate the Redeemed Christian Church of God, Victory Center, Cape Town, for their
spiritual and moral assistance. Thanks also to my brothers and friends in Nigeria whose love and
care are well felt while I was thousands of miles away. The likes of Seun Oluwalade, Lekan
Adesanya, Haz Oladejo, Goke Ogun and all others. My regards also to my brothers in South
Africa here in person of Richard Akinola, Abel Ajibesin and all my senior friends. May God bless
you all.
iv
AIMS
Notation
Symbol Denition
N the set of natural numbers {1, 2, 3, . . .}.
Z the set of integers {. . . , 2, 1, 0, 1, 2, . . .}.
Z
+
the set of nonnegative integers.
Z
m
the set of nonnegative integers m.
C the set of complex numbers.
R the real line (, ).
M(Z) the set of bi-innite real-valued sequences, i.e. c M(Z) c {c
j
: j Z} R.
M
0
(Z) {c M(Z) : c is nitely supported}. A sequence c M(Z) is nitely supported if
there exist integers J and K such that c
j
= 0, j {J, ..., K}.
M(R) { f : R R}.
M
0
(R) { f M(R) : f is nitely supported}. A function f M(R) is nitely supported if
there exists a bounded interval [, ] such that f (x) = 0, x [, ].
C(R) { f M(R) : f is continuous on R}.
C
k
(R) { f C(R) : f
(k)
C(R), j = 1, 2, . . . , k}.
C
0
(R) C(R) M
0
(R).
L
1
(R) the space of Lebesque integrable functions.
n
the linear space of polynomials of degree n., where n Z
+
.
j,k
=
_
_
1, j = k,
0, j k,
j, k Z. The Kronecker delta .
j
=
j,0
, j Z.
v
AIMS
CONTENTS CONTENTS
Symbol Denition
(
j
k
) =
_
_
j!
k!( jk)!
, k {0, 1, . . . , j},
0, k {0, 1, . . . , j},
are the binomial coecients {(
j
k
) : j, k Z
+
}, with the convention that 0! = 1.
vi
AIMS
Introduction
Wavelets have developed into an important mathematical tool in signal and image processing ap-
plications such as noise reduction and restoration, texture analysis and segmentation, feature ex-
traction and detection, approximation theory, just to mention a few. The word wavelet means
small wave and can be dened as a nitely supported funtion whose dilations and translations
{(2
r
x j) : r, j Z} provide localised information on the details of a given signal at dierent
resolution levels r.
Of fundamental importance in the construction of wavelets is the concept of a renable (scaling)
function , that is, a function which satises the fundamental equation =
_
j
a
j
(2 j), where
the bi-innite sequence a = {a
j
: j Z} is called the corresponding renement mask. The renable
function is often not known analytically, and the analysis of its properties is therefore based on
the explicitly known mask with nitely many non-zero coecients.
In this essay, we rst study a special class of renement masks called the Dubuc-Deslauriers masks
fromwhich we prove the existence of the associated renable function
m
. The function
m
, in turn,
yields the DD interpolation wavelet
m
. First, in Chapter 1, we give necessary conditions for the
construction of the renement mask. In Chapter 2, we discuss in detail the existence and properties
of
m
, and its construction through a subdivision operator. The function
m
is the main building
block in the construction of wavelets through multi resolution analysis (MRA) because it forms
the basis for the construction of the renement spaces.
The focus in Chapter 3 is on the Dubuc-Deslauriers interpolation wavelets. Here, the fundamental
decomposition result is proved, which leads to the decomposition algorithm. Finally we use a
given signal to demonstrate the eciency of our decomposition algorithm.
1
AIMS
1
The renement mask
In this essay, our ultimate goal is to construct an interpolation wavelet which is suitable for the
analysis of signals. However, we need to lay a solid foundation by rst showing the existence of a
suitable renement pair which is the fundamental building block for this wavelet.
Denition: If a sequence a M
0
(Z) and a function M
0
(R) are such that
=
j
a
j
(2 j), (1.1)
then (a, ) forms what is known as a renement pair, the sequence a = {a
j
} is called the renement
mask, and the function is said to be a renable function corresponding to the mask a. Equation
(1.1) is called a renement equation. A renable function has the intrinsic characteristic of being
expressible as a nite linear combination of the integer shifts of its own dilation by factor 2.
With the eventual view of constructing interpolation wavelets, we shall seek a renement pair (a, )
such that the renable function is interpolatory in the sense that
( j) =
j
, j Z. (1.2)
If both (1.1) and (1.2) hold, we shall call (a, ) an interpolatory renement pair. Associated with
each mask a M
0
(Z) is a Laurent polynomial A, known as the mask symbol, which we dene by
A(z) =
j
a
j
z
j
, z C\{0}. (1.3)
2
AIMS
CHAPTER 1. THE REFINEMENT MASK
We proceed to establish necessary conditions on a mask for the corresponding renement pair to
be interpolatory.
Proposition 1.1 Suppose (a, ) is an interpolatory renement pair. Then
a
2j
=
j
, j Z. (1.4)
Moreover, the condition (1.4) holds if and only if the corresponding mask symbol A, as dened by
(1.3), satises the identity
A(z) + A(z) = 2, z C\{0}. (1.5)
Proof.
Using (1.1) and (1.2), we obtain, for k Z,
k
= (k) =
j
a
j
(2k j) =
j
a
2kj
( j) =
j
a
2kj
j
= a
2k
,
thereby proving (1.4).
To prove the equivalence of (1.4) and (1.5),we use (1.3) to rewrite the left-hand side of (1.5), for
z C\{0}, as
A(z) + A(z) =
j
a
j
z
j
+
j
a
j
(z)
j
=
_
j
a
2j
z
2j
+
j
a
2j+1
z
2j+1
_
_
+
_
j
a
2j
z
2j
j
a
2j+1
z
2j+1
_
_
and thus
A(z) + A(z) = 2
j
a
2j
z
2j
, z C\{0}. (1.6)
Now suppose (1.4) holds. Then (1.6) gives
A(z) + A(z) = 2
j
z
2j
= 2, z C\{0},
so that (1.5) holds. If (1.5) holds, then (1.6) implies
2 = A(z) + A(z) = 2
j
a
2j
z
2j
, z C\{0},
3
AIMS
and thus
j
a
2j
z
2j
= 1, z C\{0},
giving (1.4).
For a given renement pair (a, ), we dene the linear space sequence {V
(r)
= V
(r)
: r Z} by
means of
V
(r)
= span{(2
r
j) : j Z} :=
_
j
c
j
(2
r
j) : c M(Z)
_
_
, r Z. (1.7)
The sequence {V
(r)
: r Z} is nested in the following sense.
Proposition 1.2 Suppose (a, ) is a renement pair. Then the linear space sequence
{V
(r)
: r Z} dened by (1.7) is nested in the sense that
V
(r)
V
(r+1)
, r Z.
Proof. Suppose f V
(r)
, that is, there exists a sequence c M(Z) such that f =
_
j
c
j
(2
r
j).
Using (1.1), we deduce that
f =
j
c
j
k
a
k
(2
r+1
2 j k)
=
j
c
j
k
a
k2j
(2
r+1
k) =
k
_
j
a
k2j
c
j
_
_
(2
r+1
k),
that is, f =
_
k
d
k
(2
r+1
k), with d M(Z) dened by d
k
=
_
j
a
k2j
c
j
, k Z, so that f V
(r+1)
.
In our eventual interpolation wavelet decomposition technique, we shall require, for a given inter-
polatory renement pair, and for every integer N Z, the approximation operator
Q
N
: M(R) V
(N)
, as dened by
Q
N
f =
j
f
_
j
2
N
_
(2
N
j), f M(R). (1.8)
Our following result shows that Q
N
is then an interpolation operator.
4
AIMS
Proposition 1.3 Suppose (a, ) is an interpolatory renement pair, and let Q
N
denote the ap-
proximation operator dened by (1.8). Then Q
N
is an interpolation operator in the sense that
(Q
N
f )
_
j
2
N
_
= f
_
j
2
N
_
, j Z, f M(R). (1.9)
Proof.
For f M(R) and j Z, it follows from (1.8) and (1.2) that
(Q
N
f )
_
j
2
N
_
=
k
f
_
k
2
N
_
( j k) =
k
f
_
k
2
N
_
jk
= f
_
j
2
N
_
.
In our wavelet decomposition application, we shall need the operator Q
N
to be exact on polynomi-
als up to some given odd degree, that is, for some integer m N, we shall require that
Q
N
f = f , f
2m1
. (1.10)
Our next result gives a sucient condition on an interpolatory renement pair for (1.10) to hold.
Proposition 1.4 Suppose (a, ) is an interpolatory renement pair, with C
0
(R). If, moreover,
the mask a satises the condition
k
a
2j+12k
k
l
=
_
j +
1
2
_
l
, j Z, l Z
2m1
, (1.11)
then (1.10) holds.
Proof.
Using (1.8), we see that the condition (1.10) has the equivalence formulation
j
f
_
j
2
N
_
(2
N
j) = f , f
2m1
,
which, in turn, holds if and only if
j
_
j
2
N
_
l
(2
N
x j) = x
l
, x R, l Z
2m1
,
or, equivalently,
j
j
l
(x j) = x
l
, x R, l Z
2m1
. (1.12)
5
AIMS
Since the dyadic set {
k
2
r
: k Z, r Z
+
} is dense in R, and since is continuous on R, we conclude
that (1.12) holds if and only if
j
j
l
_
k
2
r
j
_
=
_
k
2
r
_
l
, k Z, r Z
+
, l Z
2m1
. (1.13)
To prove (1.13), we rst show that
k
a
j2k
k
l
=
_
j
2
_
l
, j Z, l Z
2m1
. (1.14)
To this end, we rst note that, since (1.4) holds, we have
k
a
2j2k
k
l
= j
l
=
_
2 j
2
_
l
, j Z. (1.15)
Next, we use (1.11) to obtain
k
a
2j+12k
k
l
=
_
j +
1
2
_
l
=
_
2 j + 1
2
_
l
, j Z. (1.16)
Together, (1.15) and (1.16) then imply (1.14). Using (1.1) and (1.14), we get, for k Z, r Z
+
,
and l Z
2m1
,
j
j
l
_
k
2
r
j
_
=
j
j
l
n
a
n2j
_
k
2
r1
n
_
(1.17)
=
n
_
j
a
n2j
j
l
_
_
k
2
r1
n
_
=
1
2
l
j
j
l
_
k
2
r1
j
_
=
1
2
2l
j
j
l
_
k
2
r2
j
_
.
.
.
=
1
2
rl
j
j
l
(k j) =
1
2
rl
j
j
l
kj
=
_
k
2
r
_
l
, (1.18)
thereby proving the desired result (1.13).
Observe also the following immediate consequence of Proposition 1.4:
6
AIMS
Corollary 1.5 Under the conditions of Proposition 1.4, we have
2m1
V
(r)
, r Z .
Observe that the condition (1.11) has the equivalent formulation
k
a
2j+12k
p(k) = p
_
j +
1
2
_
, j Z, p
2m1
. (1.19)
Now, for a given positive integer m, we consider the problem of nding a minimally supported
mask a such that the conditions (1.4) and (1.19) are satised.
To achieve this, we introduce, for m N, the Lagrange fundamental polynomials L
m,k

2m1
,
k = m + 1, ..., m, as dened by
L
m,k
=
m
_
kj=m+1
j
k j
, k = m + 1, ..., m, (1.20)
for which
L
m,k
( j) =
kj
, k, j = m + 1, ..., m, (1.21)
and
m
k=m+1
p(k)L
m,k
= p, p
2m1
. (1.22)
Since {L
m,k
: k = m+ 1, ..., m} is a basis for the polynomial space
2m1
, we see that the condition
(1.19) has the equivalent formulation
k
a
2j+12k
L
m,l
(k) = L
m,l
( j +
1
2
), j Z, l = m + 1, ..., m. (1.23)
Setting j = 0 in (1.23), and using (1.21), we deduce that a necessary condition for (1.19) to hold is
given by
a
12l
+
k{m+1,...,m}
a
12k
L
m,l
(k) = L
m,l
_
1
2
_
, l = m + 1, ..., m,
or, equivalently,
a
2j+1
+
k{m,...,m1}
a
2k+1
L
m, j
(k) = L
m,j
_
1
2
_
, j = m, ..., m 1. (1.24)
A minimally supported sequence {a
2j+1
: j Z} satisfying (1.24) is given by
a
2j+1
= L
m,j
_
1
2
_
, j = m, ..., m 1, (1.25)
a
2j+1
= 0, j {m, ..., m 1}. (1.26)
7
AIMS
Since, for j m + 1, ..., m, we have
m
_
jl=m+1
_
1
2
l
_
=
1
2
2m+1
1
1 2 j
m
_
l=m1
(2l + 1) =
(1)
m
2
4m+1
1
2j 1
_
(2m + 1)!
m!
_
2
and
m
_
jl=m+1
( j l) = (1)
m+1+j
(m + j)!(m + 1 j)!,
we have from (1.20) that
L
m, j
_
1
2
_
=
m + 1
2
4m+1
_
2m + 1
m
_
(1)
j+1
2 j 1
_
2m + 1
m + j
_
, j = m + 1, ..., m. (1.27)
Observe from (1.25) and (1.27) that, for j {m, ..., m 1}, we have
a
2j1
= a
2(j1)+1
= L
m, j+1
_
1
2
_
=
m + 1
2
4m+1
_
2m + 1
m
_
(1)
j
2 j + 1
_
2m + 1
m + j + 1
_
=
m + 1
2
4m+1
_
2m + 1
m
_
(1)
j+1
2(j) 1
_
2m + 1
m j
_
= L
m,j
_
1
2
_
= a
2j+1
.
Hence the mask a M
0
(Z), as given by (1.4), (1.25) and (1.26), satises the symmetry condition
a
j
= a
j
, j Z. (1.28)
We have therefore shown that if a is a minimally supported symmetric mask satisfying the condi-
tions (1.4) and (1.19), then a is necessarily given by (1.4), (1.25) and (1.26). Our next result proves
that this mask does indeed satisfy the condition (1.19).
Theorem 1.6 [4] The mask a M
0
(Z) dened by
a
2j+1
= L
m,j
_
1
2
_
=
m+1
2
4m+1
_
2m+1
m
_
(1)
j
2j+1
_
2m+1
m+j+1
_
, j = m, ..., m 1,
a
2j
=
j
, j Z,
a
j
= 0, j {2m + 1, ..., 2m 1},
_
_
(1.29)
is the minimally supported mask satisfying the conditions (1.4), (1.19) and (1.28).
8
AIMS
Proof. It remain to prove that (1.29) implies (1.19). To this end, let j Z and p
2m1
, and note
that if the polynomial q is dened by q(x) = p( j + x), x R, then q also belongs to
2m1
. Now we
use (1.29) and (1.22) to obtain
k
a
2j+12k
p(k) =
k
a
2k+1
p( j k) =
k
a
2k+1
p( j + k)
=
m
k=m+1
p( j + k)a
2k+1
=
m
k=m+1
p( j + k)L
m,k
_
1
2
_
=
m
k=m+1
q(k)L
m,k
_
1
2
_
= q(
1
2
) = p( j +
1
2
).
For a given integer m N and j Z, the mask a = a
m
M
0
(Z) dened by (1.29) was rst
introduced in [3], and will henceforth be referred to as the Dubuc-Deslauriers (DD) mask of order
m. The corresponding mask symbol A = A
m
, as dened, in (1.3), by
A
m
(z) =
j
a
m
j
z
j
, z C\{0}, (1.30)
will be called the DD mask symbol of order m.
Using (1.29) and (1.30), we compute the cases m = 1, 2, 3 to be given by
(i) A
1
(z) =
1
2
_
1
z
+ 2 + z
_
,
(ii) A
2
(z) =
1
16
_
1
z
3
+
9
z
+ 16 + 9z z
3
_
, (1.31)
(iii) A
3
(z) =
1
256
_
3
z
5

25
z
3
+
150
z
+ 256 + 150z 25z
3
+ 3z
5
_
.
In a similar manner, we can derive the DD mask symbol up to any desired order.
In this chapter, we have shown that if (a, ) is an interpolatory renement pair, if, moreover, the
interpolation operator Q
N
: M(R) V
(N)
possesses the polynomial reproduction property (1.10),
then a is necessarily the DD mask sequence as dened by (1.29). In the next chapter, we proceed
to prove that there does indeed exist a function C
0
(R) such that (a
m
j
, ) is an interpolatory
renement pair.
9
AIMS
2
The renable function
In this chapter, we prove the existence and properties of the renable function which together with
the Dubuc-Deslauriers renement mask obtained in the previous chapter, forms an interpolatory
renement pair. We follow the approach employed in [1], [4] and [7].
Existence and properties of the renable function
First, observe from (1.29) and (1.30) that
A
m
(z) = 1 +
m1
j=m
a
m
2j+1
z
2j+1
, z C\{0},
and thus
A
m
(1) = 1 +
m
j=m+1
L
m,j
_
1
2
_
= 1 +
m
j=m+1
L
m, j
_
1
2
_
= 1 + 1 = 2,
as obtained by choosing p
2m1
in (1.22) as the constant polynomial p(x) = 1, x R. Hence,
using also the equivalence of (1.4) and (1.5), we see that A
m
(1)+A
m
(1) = 2, and thus A
m
(1) = 0.
Recalling also (1.28), we have therefore established the following result.
Theorem 2.1 For m N, the DD mask symbol A
m
is a Laurent polynomial of the form (1.30),
with
a
m
j
= 0, j {2m + 1, ..., 2m 1}, (2.1)
a
m
j
= a
m
j
, j Z,
10
AIMS
CHAPTER 2. THE REFINABLE FUNCTION
and where
A
m
(1) = 2, A
m
(1) = 0. (2.2)
The following fundamental existence result will be instrumental in proving the existence of an
interpolatory function
m
C
0
(R) such that (a
m
j
,
m
) is a renement pair.
Theorem 2.2 For a positive integer m, suppose a M
0
(Z) is a sequence such that a
j
= 0,
j {2m + 1, ..., 2m 1}, and a
j
= a
j
, j Z, and such that the corresponding mask symbol A, as
dened by (1.3), satises the following properties:
(i) A(z) + A(z) = 2, z C\{0}, (2.3)
(ii) A(1) = 0, (2.4)
(iii) A(e
ix
) > 0, < x < . (2.5)
Then there exists a continuous function : R C, such that the equation (1.1) is satised.
Remark: Observe that, since a
2j
=
j
, j Z, and a
j
= a
j
, j Z, we have from (1.3) that, for
x R,
A(e
ix
) = 1 +
m1
j=m
a
2j+1
e
(2 j+1)ix
= 1 +
m1
j=0
a
2j+1
[e
(2j+1)ix
+ e
(2 j+1)ix
]
= 1 + 2
m1
j=0
a
2j+1
cos(2 j + 1)x,
that is, A(z) R, for z on the unit circle in C.
Proof of Theorem 2.2.
We see from (2.4) that there exists an integer N such that
A(z) =
1
2
1
(1 + z)
B(z), z C\{0}, (2.6)

with
B(1) = 1, (2.7)
and
B(e
ix
) 0, < x < , (2.8)
11
AIMS
having noted also from (2.3) and (2.4) that
A(1) = 2. (2.9)
We proceed to dene the sequence {
r
: r N} by
r
(x) =
1
2
r
r
_
j=1
A
_
e
i
x
2
j
_
, x R, r N, (2.10)
and continue to examine the convergence of the innite product
lim
r
r
(x) =
_
j=1
_
1
2
A
_
e
i
x
2
j
_
_
, x R. (2.11)
Observe in particular from the remark after the statement of Theorem 2.1 that
r
M(R).
Suppose rst that x {2
l
(2k + 1) : l N, k Z}. It follows from (2.4) and (2.10) that
lim
r
r
(x) = 0. (2.12)
Since
{x R : x = 2k, k Z\{0}} = {x R : x = 2
l
(2k + 1), l N, k Z}, (2.13)
we deduce from (2.12) and (2.13) that
lim
r
r
(2k) = 0, k Z\{0}. (2.14)
We also deduce from (2.9) and (2.10) that
r
(0) = 1, r N, (2.15)
which, together with (2.14), gives
lim
r
r
(2k) =
k
, k Z. (2.16)
Now, dene the set by
= {x R : x 2k, k Z\{0}}, (2.17)
and suppose x . Then, from (2.5), (2.10) and (2.13), we have that A
_
e
i
x
2
j
_
> 0 for j N, so
that we can write
r
(x) = exp
_
_
ln
r
_
j=1
A
_
e
i
x
2
j
_
2
_
_
, x , r N,
12
AIMS
and thus
r
(x) = exp
_
_
r
j=1
ln
_
_
A
_
e
i
x
2
j
_
2
_
_
_
_
, x , r N. (2.18)
Since a series is convergent if its absolute series converges, we deduce from (2.18) that if we can
show that the series
j=1
f
j
(x), (2.19)
where
f
j
(x) =
ln
A
_
e
i
x
2
j
_
2
, x , j Z, (2.20)
converges, then the convergence of the innite product (2.11) will follow.
From (2.9) and (2.20) we have, for j N and x ,
f
j
(x) =
_
A(e
ix/2
j
)
A(1)
1
t
dt
1
min{2, A(e
ix/2
j
)}
|A(e
i
x
2
j
) A(1)|. (2.21)
The continuity of the Laurent polynomial A at z = 1 and (2.9) imply that there exists a > 0 such
that
|z 1| < |A(z) 2| < 1. (2.22)
Also, from the fact that
|e
i
1| = 2
sin
_
2
_
||, R,
we get
|e
i
x
2
j
1|
|x|
2
j
, x R, j N. (2.23)
If we now choose a positive integer
x
to satisfy
x
max
_
1,
ln |x| ln
ln 2
_
, (2.24)
we then see from (2.21), (2.22) and (2.23) that
f
j
(x)
A(e
i
x
2
j
) A(1)
, x , j
x
. (2.25)
Since a
k
= 0, k {2m + 1, ..., 2m 1}, we have
A(z) =
2m1
k=2m+1
a
k
z
k
, z C\{0}, (2.26)
13
AIMS
and consequently, for a xed j N, by (2.23), we get
A(e
i
x
2
j
) A(1)
2m1
k=2m+1
a
k
_
e
i
k
2
j
1
_
2m1
k=2m+1
|a
k
|
e
i
k
2
j
1
_
2m1
k=2m+1
|ka
k
|
_
_
|x|
2
j
. (2.27)
But then (2.25) and (2.27) give
f
j
(x) M
|x|
2
j
, x , j
x
, (2.28)
with
M :=
2m1
k=2m+1
|ka
k
|. (2.29)
From the fact that
_
k=1
1
2
k
is a convergent series, we deduce from (2.28), (2.20), (2.18), (2.17) and
(2.16), that, for each xed x R, the series (2.19), and therefore also the innite product (2.11),
does indeed converge.
The convergence is uniform on compact sets in R, from (2.24), (2.28), and (2.14), hence the limit
function g dened by
g(x) := lim
r
r
(x), x R, (2.30)
is in C(R), with, according to (2.30) and (2.16),
g(2k) =
k
, k Z. (2.31)
We claim that g L
1
(R). To prove this, we see from (2.30) and (2.10) that, for x R,
g(x) =
1
2
A(e
i
x
2
) lim
k
k1
_
j=1
_
1
2
A(e
i
x
2.2
j
)
_
, (2.32)
and thus
g(x) =
1
2
A(e
i
x
2
)g
_
x
2
_
, x R. (2.33)
It follows from (2.32) and (2.10) that
g(x) =
r
(x)g
_
x
2
r
_
, x R, r N. (2.34)
Note also from (2.30), (2.10), (2.4) and (2.9) that
g(x) 0, x R. (2.35)
14
AIMS
Now use (2.34), and (2.35), (2.10) to get, for r N,
_
2
r
2
r
|g(x)|dx =
_
2
r
2
r
g(x)dx =
_
2
r
2
r
r
(x)g
_
x
2
r
_
dx =
_

G
r
(x)g(x)dx, (2.36)
where
G
r
(x) =
r
_
j=1
A
_
e
ix2
j1
_
, x R, r N. (2.37)
Note that, similarly to (2.35), we have
G
r
(x) 0, x R, r N. (2.38)
Since g C(R), there exists a positive number R such that
|g(x)| R, |x| , (2.39)
so that (2.36), (2.38) and (2.39) imply
_
2
r
2
r
|g(x)|dx R
_

G
r
(x)dx, r N. (2.40)
Next, we dene the sequence of Laurent polynomials
A
r
(z) =
r
_
j=1
A(z
2
j1
), z C\{0}, (2.41)
and we dene the sequence {
r, j
: j Z, r N} by
A
r
(z) =
r, j
z
j
, z C\{0}, r N. (2.42)
We claim that
r,2
r
j
=
j
, j Z, r N. (2.43)
We prove (2.43) by induction as follows. For r = 1, we see from (2.41) that A
1
(z) = A(z), z C\{0},
and thus, using (1.3) and (2.42), we obtain
1, j
= a
j
, j Z. (2.44)
But, according to (2.3) and Proposition 1.1, we have that (1.4) holds, which together with (2.44),
yields (2.43) for r = 1. The inductive step from r to r + 1 follows by noting from (2.41) that, for
15
AIMS
z C\{0},
r+1,k
z
k
= A
r
(z)A(z
2
r
)
=
r,k
z
k
j
a
j
z
j2
r
=
j
a
j
_
r,k
z
k+j2
r
_
_
=
j
a
j
_
r,kj2
r z
k
_
_
=
k
_
j
a
j
r,kj2
r
_
_
z
k
,
and thus, for k Z,
r+1,2
r+1
k
=
j
a
j
r,2
r+1
kj2
r =
j
a
j
r,2
r
(2kj)
=
j
a
j
2kj
= a
2k
,
fromthe inductive hypothesis, before using again (1.4), and thereby completing our proof of (2.43).
Observe from (2.37), (2.41) and (2.42) that
G
r
(x) = A
r
(e
ix
) =
r, j
e
i jx
, x R, (2.45)
and thus
_

G
r
(x)dx =
r, j
_

e
i jx
dx = 2
r,0
. (2.46)
_

G
r
(x)dx = 2, r N. (2.47)
Now substitute (2.47) into (2.40) to deduce that
_
2
r
2
r
|g(x)|dx 2R, r N,
and thus g L
1
(R), with
_

|g(x)|dx 2R. (2.48)

Now dene the function : R C by the formula
(t) :=
1
2
_

e
itx
g(x)dx, t R, (2.49)
16
AIMS
for which it follows, by virtue of the fact that g L
1
(R), that is a continuous function on R.
Moreover, using (2.49), (2.33) and (1.3), we have that, for t R, that
(t) =
1
2
_

e
itx
_
_
1
2
k
a
k
e
ikx/2
_
_
g
_
x
2
_
dx
=
1
2
_

e
2itx
_
k
a
k
e
ikx
_
_
g(x)dx
=
k
a
k
1
2
_

e
(2tk)ix
g(x)dx
=
k
a
k
(2t k),
thereby proving that satises the equation (1.1).
We proceed to prove the following properties of the function of Theorem 2.2.
Theorem 2.3 The function of Theorem 2.2 satises the interpolatory property (1.2), and
C
0
(R), with
( j) = 0, x (2m + 1, 2m 1). (2.50)
Proof.
We use the same notation as in the proof of Theorem 2.2. To prove the interpolatory property (1.2),
we rst show that there exists a real number > 0 such that
g(x) , |x| . (2.51)
From (2.30), (2.35), (2.11) and (2.6), it holds for x R that
g(x) = |g(x)| =
_
j=1
_
_
1 + e
i
x
2
j
2
_
_
j=1
B(e
i
x
2
j
)
. (2.52)
Now note that
_
j=1
_
_
1 + e
ix
2
j
2
_
_
= 1, x = 0.
Suppose next that x 0. Then, for M N, we have
2
M
(1 e
i
x
2
M
)
M
_
j=1
_
_
1 + e
i
x
2
j
2
_
_
= 1 e
ix
. (2.53)
17
AIMS
Also, using LH ospital rule, we have
lim
M
2
M
(1 e
i
x
2
M
) = lim
M
1 e
ix2
M
2
M
= lim
M
e
ix2
M
(ix)2
M
(ln 2)
2
M
(ln 2)
= lim
M
ixe
ix2
M
= ix,
which, together with (2.53), gives, for x R\{0},
_
j=1
_
_
1 + e
i
x
2
j
2
_
_
= lim
M
1 e
ix
2
M
(1 e
i
x
2
M
)
=
1 e
ix
ix
= e
i
x
2
_
_
sin
_
x
2
_
x
2
_
_
, (2.54)
and thus
_
j=1
_
_
1 + e
i
x
2
j
2
_
=
_
_
j=1
1 + e
i
x
2
j
2
_
=
_
_
e
i
x
2
_
_
sin
(
x
2
)
x
2
_
, x R\{0},
1, x = 0.
_
_
. (2.55)
Since B is a Laurent polynomial for which (2.8) holds on the unit circle in C, there exists a positive
number such that
|B(e
ix
)| , x . (2.56)
Also, using (2.7), it can be shown, as in the argument that yielded (2.27), that there exists a real
number q > 0 such that
|1 B(e
i
x
2
j
)|
q|x|
2
j
, x R, j N,
and thus
|1 B(e
i
x
2
j
)|
q
2
j
, |x| , j N. (2.57)
If the positive number j
0
is chosen to satisfy
2
j
0
qe, (2.58)
then, using (2.57), we obtain
|1 B(e
i
x
2
j
)| e
1
, |x| , j j
0
. (2.59)
From (2.56),
_
j=1
B(e
i
x
2
j
)
=
j
0
1
_
j=1
|B(e
i
x
2
j
)|
_
j=j
0
|B(e
i
x
2
j
)|
j
0
1
_
j=j
0
_
1 |1 B(e
i
x
2
j
)|
_
. (2.60)
We now make use of the inequality
1 t e
et
, 0 t e
1
,
18
AIMS
in (2.60) to obtain, for |x| , and keeping in mind also (2.59),
_
j=j
0
_
1 |1 B(e
i
x
2
j
)|
_

_
j=j
0
exp
_
e|1 B(e
i
x
2
j
)|
_
= exp
_
_
e
j=j
0
|1 B(e
i
x
2
j
)|
_
_
exp
_
_
eq
j=j
0
1
2
j
_
_
, (2.61)
by virtue of (2.57). But
j=j
0
1
2
j
=
1
2
j
0
j=0
1
2
j
= 2
1j
0
,
which, together with (2.61) and (2.58), gives
_
j=j
0
_
1 |1 B(e
i
x
2
j
)|
_
e
2
1j
0
qe
e
2
. (2.62)
Now combine (2.52), (2.55), (2.60), (2.62), and the inequality
| sin
_
x
2
_
|
|
x
2
|

2
, |x| ,
to deduce that (2.51) does indeed hold, with
=
_
2
j
0
1
e
2
. (2.63)
Recall the function G
r
as given by (2.37), for which, according to (2.45), we have
1
2
_

G
r
(x)e
i2
r
jx
dx =
1
2
r,k
_

e
ix(2
r
jk)
dx =
r,2
r
j
, j Z, r N. (2.64)
Combining (2.43) and (2.64) then gives
1
2
_

G
r
(x)e
i2
r
jx
dx =
j
, j Z, r N. (2.65)
But, according to (2.37), and (2.10), we have for j Z, r N, that
1
2
_

G
r
(x)e
i2
r
jx
dx =
1
2
_

r
_
l=1
A(e
ix2
l1
)e
ix2
r
jx
dx
=
1
2
_
2
r
2
r
1
2
r
r
_
l=1
A(e
i
x
2
rl+1
)e
ix j
dx
=
1
2
_
2
r
2
r
1
2
r
r
_
l=1
A(e
i
x
2
l
)e
ix j
dx
=
1
2
_
2
r
2
r
r
(x)e
ix j
dx. (2.66)
19
AIMS
We now introduce the notation
[a,b]
(x) =
_
_
1, x [a, b],
0, x [a, b].
1
2
_

r
(x)
[2
r
,2
r
]
(x)e
ix j
dx =
j
, j Z, r N. (2.67)
We now use (2.34), (2.35) to deduce that, for |x| 2
r
and j Z, r N, we have
r
(x)
[2
r
,2
r
]
(x)e
ix j
= |
r
(x)| =
|g(x)|
g
_
x
2
r
_
=
g(x)
g
_
x
2
r
_
1
g(x), (2.68)
as a result of (2.51). It is also clear from (2.30) that
lim
r
_
r
(x)
[2
r
,2
r
]
(x)e
ix j
_
= g(x)e
i jx
, x R, j Z. (2.69)
Thus, since g L
1
(R), the equations (2.68) and (2.69) imply that the Lebesgue dominated conver-
gence theorem [9, pp 592] can be applied to the integral in (2.67) to deduce that, for j Z,
1
2
_

e
i jx
g(x)dx =
1
2
_

lim
r
_
r
(x)
[2
r
,2
r
]
(x)e
ix j
_
dx
= lim
r
_
1
2
_

r
(x)
[2
r
,2
r
]
(x)e
ix j
dx
_
=
j
. (2.70)
The result (1.2) then follows as an immediate consequence of (2.70) and (2.49).
We proceed to prove that (x) R. To this end, rst note from (1.1) and (1.2) that
_
k
2
_
=
j
a
j
(k j) =
j
a
j
kj
= a
k
, k Z,
i.e.
_
k
2
_
R, k Z. Similarly, the renement equation (1.1) then yields
_
k
4
_
=
j
a
j
_
k
2
j
_
R, k Z.
Repeated use of this procedure shows that (x) R, x {
k
2
r
: k Z, r Z
+
}. Since the dyadic set
is dense in R, and is continuous on R, we deduce that indeed M(R) and thus also C(R).
We proceed to prove the nite support property (2.50) of . To this end, we rst show that
_
j
2
k
_
= 0, j Z, | j| > 2
k
(2m 1), k = 0, 1, 2, ... (2.71)
20
AIMS
From (1.2), we have that (2.71) holds for k=0, since m is a positive integer. For the inductive step
from k to k +1, suppose that (2.71) holds, and let | j| > 2
k+1
(2m1). Then, using (1.1), and the fact
that a
j
= 0, j {2m + 1, ..., 2m 1}, we get
_
j
2
k+1
_
=
l
a
l
_
j
2
k
l
_
=
|l|2m+1
a
l
_
j 2
k
l
2
k
_
= 0,
since
| j 2
k
l| | j| 2
k
|l| 2
k+1
(2m 1) 2
k
(2m 1) = 2
k
(2m 1),
hence proving (2.71) for all k {0, 1, ...}.
Suppose now that x [2m+1, 2m1], that is, |x| 2m1. Since the dyadic set {
j
2
k
: j Z, k N}
is dense in R, we know that there exist a sequence { j
k
: k N} such that
j
k
2
k
x, k . Since
|x| > 2m 1, there exist a positive integer K such that
j
k
2
k
> 2m 1, k K. Using also the fact

that C(R), so that is continuous at x, we deduce from (2.71) that
|(x)|
(x)
_
j
k
2
k
_
(x)
_
j
k
2
k
_
0, k ,
and thus (x) = 0, x [2m + 1, 2m 1]. By continuity, we then also have
(2m + 1) = (2m 1) = 0,
thereby completing our proof of (2.50).
We have shown in Theorem 2.2 and Theorem 2.3 that, if a M
0
(Z) is a mask satisfying the
conditions of Theorem 2.2, then there exists a function C
0
(R) such that (a, ) is an interpolatory
renement pair.
Denition: For a given sequence a M
0
(Z) we dene the operator S
a
: M(Z) M(Z) by
(S
a
c)
j
:=
k
a
j2k
c
k
, j Z, c M(Z). (2.72)
The operator S
a
is known as the subdivision operator [8].
We proceed to prove the following additional properties of the renable function .
Theorem 2.4 For m N, let (a, ) denote the interpolatory renement pair of Theorems 2.2
and 2.3, and suppose that the mask a satises the condition (1.19). Then the following relations
21
AIMS
hold:
j
p( j)(x j) = p(x), x R, p
2m1
; (2.73)
(x) = (x), x R; (2.74)
_
j
2
_
= a
j
, j Z. (2.75)
Proof.
(a) To prove (2.73), we suppose l Z
2m+1
, k Z, and r Z
+
, and prove that
j
j
l
_
k
2
r
j
_
=
_
k
2
r
_
l
, (2.76)
which then implies (2.73), since the set {
k
2
r
: k Z, r = 0, 1, ...} is dense in R, and since is a
nitely supported continuous function on R.
If r = 0, then (2.76) is an immediate consequence of (1.2). If r 1, we consecutively use (1.1),
(1.11) and (1.2), to deduce, that (2.76) holds, as in the steps leading from (1.17) to (1.18).
(b) Property (2.74) will be proved if we can show that, for k Z and r Z
+
, it holds that
_
k
2
r
_
=
_
k
2
r
_
. (2.77)
For r = 0, (2.77) follows from (1.2), whereas for r 1, it follows from (1.1), (1.2) and (1.28) that,
for k Z, r Z
+
,
k
2
r
_
=
j
a
j
k
2
r1
j
_
=
j
a
j
k
2
r1
+ j
_
=
j
a
j
l
a
l
k
2
r2
+ 2j l
_
=
l
_
j
a
l2j
a
j
_
k
2
r2
+ l
_
=
l
(S
a
a)
l
k
2
r2
+ l
_
.
.
.
=
l
(S
r1
a
a)
l
(k + l) = (S
r1
a
a)
k
, (2.78)
22
AIMS
from (1.2). In a similar manner, it can be shown that
_
k
2
r
_
= (S
r1
a
a)
k
, k Z, r Z
+
, (2.79)
which, together with (2.78), proves (2.77) for r 1.
(c) The property (2.75) is an immediate consequence of (1.2) and (1.1).
We see from Theorems 2.1 to 2.4 that, in order to prove that, for m N, there exists a function
m
C
0
(R) such that, for the DD mask a = a
m
given by (1.29), we have that (a
m
,
m
) is an
interpolatory renement pair, we shall rst have to prove that the corresponding mask symbol
A = A
m
, as given by (1.30), satises the positivity condition (2.5) of Theorem 2.2.
We shall rely on the following result.
Proposition 2.5 [1] For m N, suppose a M
0
(Z) is a mask that satises (1.4), (1.19), and the
bottom line of (1.29). Then the corresponding mask symbol A dened in (1.3) satises
A
(l)
(1) = 0, l = 0, 1, ..., 2m 1; (2.80)
A
(l)
(1) = 0, l = 1, 2, ..., 2m 1. (2.81)
Proof.
Since (1.3) and (1.4) give
A(z) = 1 +
k
a
2k+1
z
2k+1
, z C\{0}, (2.82)
we see that
A
(l)
(1) =
l
+ (1)
l+1
k
h
l
(2k + 1)a
2k+1
, l Z
2m1
,
where, for x R,
h
0
(x) = 1, h
l
(x) =
_
jZ
l1
(x j), l = 1, 2, ..., 2m 1. (2.83)
Observe that h
l

l
, l Z
2m1
. Hence, if we dene
p
l
= h
l
(2 +1 + 2l), l Z
2m1
,
23
AIMS
that is,
h
l
= p
l
_
1
2
+ l
_
, l Z
2m1
,
then also p
l

l
, l Z
2m1
. Moreover,
A
(l)
(1) =
l
+ (1)
l+1
k
p
l
(l k)a
2k+1
, l Z
2m1
, (2.84)
and
p
l
(l +
1
2
) = h
l
(0) =
l
, l Z
2m1
, (2.85)
from (2.83).
Since p
l

l

2m1
, l Z
2m1
, so that also the polynomial q dened by q
l
= p
l
(l +) also belongs
to
2m1
for l Z
2m1
, we have from (2.84), (2.85) and (2.16) that,
A
(l)
(1) =
l
+ (1)
l+1
k
p
l
a
12k
q
l
(k)
=
l
+ (1)
l+1
q
l
(
1
2
)
=
l
+ (1)
l+1
p
l
(l +
1
2
) =
l
[1 + (1)
l+1
] = 0,
thereby proving that (2.80) holds.
To prove (2.81), we follow the same procedure as was used in the steps leading from (2.82) to
(2.85), to obtain, for l {1, 2, ..., 2m 1},
A
(l)
(1) =
l
+ p
l
(l +
1
2
) = 2
l
= 0.
Proposition (2.5) now enables us to prove the following result.
Theorem 2.6 For m N, the Dubuc-Deslauriers mask symbol A = A
m
satises the positivity
condition (2.5) of Theorem 2.2.
Proof.
Since the DD mask a = a
m
M
0
(Z) satises (1.4) and (1.19), we know that, writing E
m
= A
m
,
with A
m
as dened by (1.30) and (1.29), we have
E
(l)
m
(1) = E
(l)
m
(1) = 0, l Z
2m2
. (2.86)
24
AIMS
Also, since (1.30) and (2.1) yield
A
m
(z) =
2m1
j=2m+1
a
m
j
z
j
, z C\{0},
we nd that the Laurent polynomial E
m
has the form
E
m
(z) =
1
z
2m
[e
2m
+ e
2m+1
z + ... + e
2
z
2m2
+ e
0
z
2m
+ ... + e
2m2
z
4m2
], z C\{0}. (2.87)
Combining (2.86) and (2.87), we conclude that
E
m
(z) =
c
z
2m
(1 z)
2m1
(1 + z)
2m1
, z C\{0},
for some constant c, and thus
ie
ix
A
m
(e
ix
) =
cie
ix
e
2mix
(1 e
ix
)
2m1
(1 + e
ix
)
2m1
, x R. (2.88)
It follows from (2.88) that
A
m
(e
ix
) A
m
(e
i
) = ci
_
x
e
(12m)i
(1 e
i
)
2m1
(1 + e
i
)
2m1
d. (2.89)
But, for R, we have
(1 e
i
)
2m1
(1 + e
i
)
2m1
= (1 e
2i
)
2m1
= [e
i
(e
i
e
i
)]
2m1
= (2i)
2m1
e
(2m1)i
_
e
i
e
i
2i
_
2m1
= (1)
m
2
2m1
ie
(2m1)i
(sin )
2m1
. (2.90)
We see from (2.89) and (2.90) that, since (2.82) gives A
m
(1) = 0, we have, for x R, that
A
m
(e
ix
) = ci
_
x
(1)
m
2
2m1
i(sin )
2m1
d = c(1)
m1
2
2m1
_
x
(sin )
2m1
d. (2.91)
We also have from (2.82) that A
m
(1) = 2, so that by setting x = 2 in (2.91), we obtain
2 = c(1)
m1
2
2m1
_
2
(sin )
2m1
d. (2.92)
Combining (2.91) and (2.92) we then get the formula
A
m
(e
ix
) = 2
_
x
(sin )
2m1
d
_
2
(sin )
2m1
d
, x R. (2.93)
25
AIMS
We see that, for x [0, ), we have (sin )
2m1
> 0, x < , so that
_
x
(sin )
2m1
d =
_

x
(sin )
2m1
d < 0, (2.94)
whereas, if x (, 0), we have that x (0, ), so that (sin )
2m1
> 0, x < , and then
_
x
(sin )
2m1
d =
_

x
(sin )
2m1
d =
_
x
x
(sin )
2m1
d
_

x
(sin )
2m1
d
=
_

x
(sin )
2m1
d < 0. (2.95)
Since also
_
2
(sin )
2m1
d < 0, (2.96)
we can combine (2.93), (2.94), (2.95) and (2.96) to conclude that the Laurent polynomial A = A
m
does indeed satisfy the positivity condition (2.5).
By combining the result of Theorems 2.1, 2.2, 2.3, 2.4 and 2.6, we have therefore established the
following result.
Corollary 2.7 For m N, let the DD mask sequence a = a
m
M
0
(Z) be dened by (1.29). Then
there exists a function
m
C
0
(R) such that (a
m
,
m
) is an interpolatory renement pair. Moreover,
m
satises the properties
m
(x) = 0, x (2m + 1, 2m + 1);
j
p( j)
m
(x j) = p(x), p
2m1
;
m
(x) =
m
(x), x R;
m
(
j
2
) = a
m
j
, j Z.
The renable function
m
of Corollary 2.7 is called the Dubuc-Deslauriers (DD) renable function.
Our following result shows that the subdivision operator S
a
dened by (2.72) can be used to ex-
plicitly compute the DD renable function
m
on the dyadic set {
j
2
r
: j Z, r Z
+
}.
Theorem 2.8 [4] For m N, the DD renable function
m
satises the equation
m
_
j
2
r
_
= (S
r
a
)
j
, j Z, r N, (2.97)
26
AIMS
with S
a
= S
a
m denoting the subdivision operator dened in (2.72), with a = a
m
and where
= {
j
: j Z}.
Proof.
In this proof, we write for
m
and a for a
m
. Using (1.1), (2.72) and (1.2), we obtain, for j Z,
r Z
+
,
_
j
2
r
_
=
k
a
k
_
j
2
r1
k
_
=
k
(S
a
)
k
_
j
2
r1
k
_
=
k
(S
a
)
k
l
a
l
_
j
2
r2
2k l
_
=
k
(S
a
)
k
l
a
l2k
_
j
2
r2
l
_
=
l
_
k
a
l2k
(S
a
)
k
_
_
j
2
r2
l
_
=
l
(S
2
a
)
l
_
j
2
r2
l
_
.
.
.
=
l
(S
r
a
)
l
( j l) = (S
r
a
)
j
.
The graphs of the Dubuc-Deslauriers renable function of orders 1, 2 and 3 are shown in gures
2.1, 2.2 and 2.3 respectively.
27
AIMS
1.5 1 0.5 0 0.5 1 1.5
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
Figure 2.1:
1
, the DD renable function of order 1.
3 2 1 0 1 2 3
0.2
0
0.2
0.4
0.6
0.8
1
1.2
Figure 2.2:
2
5 4 3 2 1 0 1 2 3 4 5
0.2
0
0.2
0.4
0.6
0.8
1
1.2
Figure 2.3:
3
28
AIMS
3
The interpolation wavelet
We now proceed to construct, from the interpolatory DD renement pair (a
m
,
m
) of Chapters
1 and 2, the Dubuc-Deslauriers interpolation wavelet
m
and the corresponding decomposition
algorithm.
The fundamental decomposition result
Denition: For m N we dene, according to Proposition 1.2, as in (1.7), the Dubuc-Deslauriers
renement spaces as
V
(r)
m
= span{
m
(2
r
j) : j Z}, r Z, (3.1)
which satisfy the nesting property
V
(r)
m
V
(r+1)
m
, r Z. (3.2)
The following result follows from the interpolatory property (1.2) of =
m
.
Proposition 3.1 For m N and r Z, we have f V
(r)
m
if and only if
f =
j
f
_
j
2
r
_
m
(2
r
j). (3.3)
Proof.
From the denition (3.1), we see that f V
(r)
m
if and only if there exists a sequence c M(Z) such
29
AIMS
CHAPTER 3. THE INTERPOLATION WAVELET
that
f =
k
c
k
m
(2
r
k).
Hence, for j, r Z, we have
f
_
j
2
r
_
=
k
c
k
m
( j k) = c
j
,
thereby completing our proof.
Next we introduce, for m N, r Z, the operator P
m,r
: V
(r+1)
m
V
(r)
m
by the denition
P
m,r
f =
j
c
2j
m
(2
r
j) for f =
j
c
j
m
(2
r+1
j), (3.4)
which, according to Proposition 1.2, is equivalent to the denition
P
m,r
f =
j
f
_
j
2
r
_
m
(2
r
j), f V
(r+1)
m
. (3.5)
Since the operator Q
N
: M(R) V
(N)
m
dened by (1.11), with =
m
, coincides with P
m,N
on V
(N)
m
,
we have from Proposition 1.3, (1.10), and Corollary 1.5, that
(P
m,r
f )
_
j
2
r
_
= f
_
j
2
r
_
, j, r Z, f V
(r+1)
m
,
P
m,r
f = f , f
2m1
, (3.6)
and
2m1
V
(r)
m
, r Z. (3.7)
Our following result shows that the polynomial reproduction property (3.6) can be strengthened as
follows.
Theorem 3.2 For m N, r Z, the interpolation operator P
m,r
: V
(r+1)
m
V
(r)
m
, as dened by
(3.5), is a projection on V
(r)
m
in the sense that
P
m,r
f = f , f V
(r)
m
, r Z. (3.8)
Proof.
Suppose f V
(r)
m
, so that, from Proposition 3.1, we have that (3.3) holds. But then (3.8) is an
immediate consequence of the denition (3.5).
30
AIMS
Next, for r Z, we let f V
(r+1)
m
, so that, from (3.5), we obtain, in the simplied notation
P
r
= P
m,r
, =
m
and a = a
m
,
f = P
r
f + ( f P
r
f ) =
j
f
_
j
2
r
_
(2
r
j) + ( f P
r
f ),
where from Proposition 3.1, denition (3.5), the renement equation (1.1), and (1.4), we have that
f P
r
f =
k
f
_
k
2
r+1
_
(2
r+1
k)
j
f
_
j
2
r
_
(2
r
j)
=
k
f
_
k
2
r+1
_
(2
r+1
k)
j
f
_
j
2
r
_

k
a
k
(2
r+1
2 j k)
=
k
f
_
k
2
r+1
_
(2
r+1
k)
j
f
_
j
2
r
_

k
a
k2j
(2
r+1
k)
=
k
_
_
f
_
k
2
r+1
_
j
a
k2j
f
_
j
2
r
_
_
_
(2
r+1
k)
=
k
_
_
f
_
k
2
r
_
j
a
2k2j
f
_
j
2
r
_
_
_
(2
r+1
2k)
+
k
_
_
f
_
2k + 1
2
r+1
_
j
a
2k+12j
f
_
j
2
r
_
_
_
(2
r+1
2k 1)
=
k
_
_
f
_
2k + 1
2
r+1
_
j
a
2k+12j
f
_
j
2
r
_
_
_
(2(2
r
k) 1)
=
k
_
_
f
_
2k + 1
2
r+1
_
j
a
2k+12j
f
_
j
2
r
_
_
_
(2
r
k),
where = (2 1).
We have therefore now proved the following fundamental decomposition result.
Theorem 3.3 For m N, r Z, we have
f =
j
f
_
j
2
r
_
m
(2
r
j) +
j
d
m,r
j

m
(2
r
j), f V
(r+1)
m
, (3.9)
where the function
m
V
(1)
m
is dened by
m
=
m
(2 1), (3.10)
31
AIMS
and where the coecient sequence d
m,r
M(Z) is given by
d
m,r
j
= f
_
2 j + 1
2
r+1
_
k
a
m
2j+12k
f
_
k
2
r
_
, j Z. (3.11)
Observe in particular that from (3.10) and (2.50) that
m
(x) = 0, x (m + 1, m). (3.12)
Also, (3.10) and (1.2) yield
m
( j) = 0, j Z. (3.13)
Now dene the linear space sequence {W
(r)
m
: r Z} by
W
(r)
m
= span{
m
(2
r
j) : j Z}, r Z. (3.14)
Note in particular that W
(r)
m
V
(r+1)
m
, r Z. We see from Theorem 3.3, together with the denitions
(3.1) and (3.14), that, for r Z, every function f
r+1
V
(r+1)
m
can be decomposed in the form
f
r+1
= f
r
+ g
r
, where f
r
V
(r)
m
and g
r
W
(r)
m
. The function
m
V
(1)
m
, as dened by (3.10),
which generates the linear space W
(r)
m
by means of the denition (3.14), is called a wavelet and in
particular here the DD interpolation wavelet of order m, for which the two cases m = 2 and m = 3
are shown in gures 3.1a and 3.1b.
3 2 1 0 1 2 3
0.2
0
0.2
0.4
0.6
0.8
1
1.2
(a)
2
2 1 0 1 2 3
0.2
0
0.2
0.4
0.6
0.8
1
1.2
(b)
3
Figure 3.1: DD interpolation wavelets of order 2 and 3.
32
AIMS
The spaces W
(r)
m
: r Z are known as the DD wavelet spaces of order m, whereas, for r Z,
the sequence {d
m,r
j
: j Z} M(Z) in (3.9) is known as the m
th
order DD wavelet decomposition
coecient sequence at resolution level r. The following result, in conjunction with (3.7), is of
fundamental importance.
Theorem 3.4 In Theorem 3.3, suppose that, for j, r Z, we have
f
[
jm+1
2
r
,
j+m
2
r
]

2m1
. (3.15)
Then d
m,r
j
= 0.
Proof.
Let j, r Z be given. According to (3.15), there then exists a polynomial p
2m1
such that
f (x) = p(x),
j m + 1
2
r
x
j + m
2
r
.
But then, from (3.11), together with bottom line of (1.29) we have
d
m,r
j
= f
_
_
j +
1
2
2
r
_
j+m
k=jm+1
a
m
2j+12k
f
_
k
2
r
_
= p
_
_
j +
1
2
2
r
_
j+m
k=jm+1
a
m
2j+12k
p
_
k
2
r
_
. (3.16)
With the polynomial q dened by
q(x) = p
_
x
2
r
_
, x R,
we have that q also belongs to
2m1
. It follows from (3.16), together with the property (1.19) of
the DD mask a = a
m
, that
d
m,r
j
= q
_
j +
1
2
_
j+m
k=jm+1
a
2j+12k
q(k)
= q
_
j +
1
2
_
k
a
2j+12k
q(k)
= q
_
j +
1
2
_
q
_
j +
1
2
_
= 0.
Now observe also that (3.12) implies the nite support property
m
(2
r
x j) = 0, x
_
j m + 1
2
r
,
j + m
2
r
_
. (3.17)
We deduce from (3.17) and Theorem 3.4 that, if for, j, r Z, a function f V
(r+1)
m
locally equals
a polynomial in
2m1
in the support interval
_
jm+1
2
r
,
j+m
2
r
_
of the wavelet
m
(2
r
j), then the
corresponding wavelet coecient d
m,r
j
equals zero.
33
AIMS
Decomposition algorithm
Our DD interpolation wavelet decomposition technique is as follows.
Suppose f M(R) is a given signal to be analyzed. First, we use the interpolation operator
Q
N
= Q
m,N
: M(R) V
(N)
m
, as dened by (1.8), to dene f
N
= Q
N
f V
(N)
m
, and with N chosen
suciently large to adequately capture the features of the signal f . Note in particular from Proposi-
tion 1.3 that f
N
interpolates f on the set {
j
2
N
: j Z}. The polynomial reproduction property (1.10)
of Q
N
ensures that local polynomial behaviour of f is preserved by f
N
= Q
N
f . Here, it should also
be kept in mind that, from Taylors theorem, if f is locally C
k
-smooth for some positive integer k,
then f is approximated well by the corresponding Taylor polynomial in
k1
, and one can therefore
expect the wavelet coecient d
m,r
j
corresponding to the wavelet
m
(2
r
j) with support entirely
within the region of smoothness, to be relatively small.
Once the approximation f
N
V
(N)
m
is obtained, we can now proceed to the decomposition phase.
The DD decomposition algorithm is as follows.
Let the sequence { f
r
: r = N, N 1, ..., N M} be dened by
f
r
=
j
f
_
j
2
r
_
m
(2
r
j), r = N, N 1, ..., N M, (3.18)
so that every successive approximation f
r
V
(r)
m
to f is interpolatory in the sense that
f
r
_
j
2
r
_
= f
_
j
2
r
_
, j Z, (3.19)
i.e. f
r
interpolates f at increasingly coarse dyadic levels for r = N, N 1, ..., N M. Here, the
integer M is chosen large enough so that the nal approximation f
NM
is suciently blurred.
But then, according to Theorem 3.3, we have
f
r+1
= f
r
+ g
r
, r = N 1, N 2, ..., N M, (3.20)
where
g
r
=
j
d
m,r
j

m
(2
r
j), r = N 1, N 2, ..., N M, (3.21)
34
AIMS
with
d
m,r
j
= f
_
2 j + 1
2
r+1
_
k
a
m
2j+12k
f
_
k
2
r
_
, j Z, r = N 1, N 2, ..., N M. (3.22)
It follows from (3.20) that
f
N
= f
NM
+
N1
r=NM
g
r
,
where the wavelet components {g
r
: r = N 1, N 2, ..., N M} can be interpreted as representing
the detail components of f
N
at successively coarse resolution levels r. In particular, according
to Theorem 3.3, every function g
r
will provide localized information on the smoothness (or lack
thereof) of f , as represented by the approximation f
N
.
Application
In order to illustrate the eectiveness of the DD decomposition algorithm derived earlier in this
chapter, we choose the signal f M
0
(R) dened by
f (x) =
_
_
1
2
x
2
, x [0, 1),
1
2
(2x
2
+ 6x 3), x [1, 2),
1
2
(3 x)
2
, x [2, 3),
0. x [0, 3).
(3.23)
Our signal f is the cardinal B-spline N
3
of order 3, (see e.g [2], Chapter 4). Note from (3.23)
that f C
1
(R) \ C
2
(R). In fact, f consists of quadratic polynomial pieces, with breakpoints at
x = 0, 1, 2, 3. In particular, the second derivative f
has jump discontinuities at these points.

Hence, for m = 2, if we use the DD wavelet
2
, as given by (3.10), together with the decomposition
algorithm (3.20), (3.21), (3.22) and (1.31), and the approximation operator Q
2,N
: M(R) V
(N)
2
,
dened by (1.8) to decompose the signal f , we deduce from Theorem 3.3 that, at each resolution
level r, it can be expected that the wavelet component g
r
will have peaks at x = 0, 1, 2, 3, and be
zero in regions bounded away from these points, since the wavelet coecient d
2,r
j
= 0 whenever
the support
_
j1
2
r
,
j+2
2
r
_
of
2
(2
r
j) does not overlap with such a breakpoint. Our expectations are
indeed fullled by the graphs in gures 3.3, 3.4 and 3.5, where we chose N=8 and M=3. Note also
that f
N
looks the same to the human eye as our signal f in gure 3.2.
35
AIMS
1 0.5 0 0.5 1 1.5 2 2.5 3 3.5 4
0.2
0
0.2
0.4
0.6
0.8
f
Figure 3.2: Signal f .
1 0.5 0 0.5 1 1.5 2 2.5 3 3.5 4
0.2
0
0.2
0.4
0.6
0.8
(a) f
N1
1 0.5 0 0.5 1 1.5 2 2.5 3 3.5 4
1.5
1
0.5
0
0.5
1
1.5
x 10
5
(b) g
N1
Figure 3.3: First resolution level.
Observe that the wavelets component g
N1
gives the best localization of the discontinuity in the
second derivative f
. This is due to (3.17) and (3.21), together with the comment immediately
after (3.17). Observe from gure 3.2 that the discontinuity in the second derivative of our signal f
is not visible to the human eye. However, our wavelet
2
sees it.
Conclusion
In this essay, we provided a constructive existence proof of the interpolatory Dubuc-Deslauriers
renement pair (a
m
,
m
) of order m, from which we proceeded to construct the corresponding
36
AIMS
1 0.5 0 0.5 1 1.5 2 2.5 3 3.5 4
0.2
0
0.2
0.4
0.6
0.8
(a) f
N2
1 0.5 0 0.5 1 1.5 2 2.5 3 3.5 4
1.5
1
0.5
0
0.5
1
1.5
x 10
4
(b) g
N2
Figure 3.4: Second resolution level.
1 0.5 0 0.5 1 1.5 2 2.5 3 3.5 4
0.2
0
0.2
0.4
0.6
0.8
(a) f
N3
1 0.5 0 0.5 1 1.5 2 2.5 3 3.5 4
5
4
3
2
1
0
1
2
3
4
5
x 10
4
(b) g
N3
Figure 3.5: Third resolution level.
DD interpolation wavelet and decomposition algorithm. Apart from the cardinal B-spline function
which was used to illustrate the eectiveness of our algorithm, this decomposition algorithm can be
used in signal analysis to analyse other functions of interest. This essay altogether can adequately
form a basis for a more substantial study in further research.
37
AIMS
References
[1] C.A. Micchelli, Interpolatory Subdivision Schemes and Wavelets, Journal of Approximation,
86 (1996), 41-71.
[2] C.K. Chui, An Introduction to Wavelet Analysis, Academy Press, Boston, 1992.
[3] G. Deslauriers and S. Dubuc, Symmetric Iterative Interpolation Processes, Constructive Ap-
proximations, 5 (1989), 49-68.
[4] J.M. De Villiers, K.M. Goosen & B.M. Herbst, Dubuc-Deslauriers Subdivision for Finite
Sequence and Interpolation Wavelets on an Interval, SIAM Journal on Mathematical Analysis
and Applications, 35 (2003), 423-452.
[5] J.M. De Villiers, Subdivision, Wavelets and Splines, Lecture notes, Department of Mathe-
matics, University of Stellenbosch, 2005.
[6] J.M. De Villiers, Introduction to Wavelet Analysis, AIMS review course lecture notes, 2006.
[7] K.M. Goosen, Subdivision, Interpolation and Splines, Masters thesis, University of Stellen-
bosch, 2000.
[8] K.M. Hunter, Interpolatory Renable Functions, Subdivisions and Wavelets, Ph.D thesis,
University of Stellenbosch, 2005.
[9] S. Mallat, A Wavelet Tour of Signal Processing, 2nd edition, Academy Press, London, 1999.
38
AIMS

Dubuc-Deslauriers Interpolation Wavelets Tese

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Dubuc-Deslauriers Interpolation Wavelets Tese

Hochgeladen von

Copyright:

Verfügbare Formate

DUBUC-DESLAURIERS

B(z), z C\{0}, (2.6)

|g(x)|dx 2R. (2.48)

> 2m 1, k K. Using also the fact

has jump discontinuities at these points.

Das könnte Ihnen auch gefallen