Wavelets Based On Bernstein Bases IMAGE COMPRESSION

Published in IET Computer Vision
Received on 3rd September 2009

Revised on 26th April 2010
doi: 10.1049/iet-cvi.2009.0083
ISSN 1751-9632
General framework of the construction of biorthogonal
wavelets based on Bernstein bases: theory analysis
and application in image compression
X. Yang Y. Shi B. Yang
Key Laboratory of Mathematics, Informatics and Behavioral Semantics, Ministry of Education, School of Mathematics and
Systems Science, Beihang University, Beijing 100191, Peoples Republic of China
E-mail: xiaoyuanyang@vip.163.com
Abstract: The authors present a general framework of the construction of biorthogonal wavelets based on Bernstein bases along
with theory analysis and application. The presented framework possesses the largest possible regularity, the required vanishing
moments and the passband atness of frequency response of lters. Based on this concept, the authors establish explicit
formulas for lters of biorthogonal wavelets with arbitrary odd lengths. Meanwhile, a new family of parametric lters with
symmetry is constructed. The choice of lter bank in wavelet compression is a critical issue that affects image quality. In this
study, an optimal model of FIR aiming at image compression is brought forward, and the optimal nite impulse response (FIR)
lters can be obtained correspondingly through sequential quadratic programming (SQP) and genetic algorithm (GA). The
authors demonstrate the performance of the new family of lters given in this study for image compression with very
encouraging results.
1 Introduction
Biorthogonal wavelets have become powerful tools in signal
processing, image analysis, communication systems and many
other related elds. Symmetric or antisymmetric compactly
supported wavelets are very desirable in various applications,
since they preserve phase properties and also allow symmetric
boundary conditions in wavelet algorithms which normally
perform better. However, there does not exist any real-valued
symmetric or antisymmetric compactly supported orthogonal
wavelet with dyadic dilation except for the Haar wavelet.
Many subsequent constructions sought to remedy this by
relaxing some restrictions. Indeed, in [1], symmetry was
obtained at the cost of dropping orthogonality; two compactly
supported dual renable functions were needed, only one of
which could be a spline function. In [2], similar non-
orthogonal dual symmetric spline wavelet bases were given,
but only one of them could be compactly supported. As for
examples of [3], symmetric orthogonality and compact
support were combined at the price of having multi-wavelets
from a vector multiresolution analysis. In examples of [4],
symmetry, orthogonality, interpolatory property and compact
support were achieved at the cost of using non-dyadic
dilations. Since then, the theory of biorthogonal wavelets has
been developed rapidly [520].
In this paper, we present a general framework of the
construction of biorthogonal wavelets based on Bernstein
bases along with theory analysis and application. The
presented framework possesses the largest possible regularity,
the required vanishing moments and the passband atness of
frequency response of lters. We investigate the smoothness
properties of multivariate renable functions based on
Bernstein bases in terms of the spectral radius of the
corresponding transition operator restricted to a suitable nite-
dimensional invariant subspace and present a general
algorithm to construct biorthogonal scaling functions f and

f
with the largest possible regularity. By using this framework,
a new family of parametric lters with symmetry are
constructed. Parameterisations of FIR systems are of
fundamental importance to the design of lters with special
properties. It should be mentioned that constructing wavelets
satisfying too many nice properties may become very
difcult. The parameterisation-based construction method
provides one way to this goal. For example, it produces
wavelets with high-order vanishing moments and good
smoothness and compactness representation which play
important roles in image compression. For this reason, the
problem is among attractive problems of wavelet theory and
image processing.
The biorthogonal wavelet lter banks offer outstanding
performance for image compression, but the choice of lter
banks is a critical issue which affects image quality as well
as system design. The regularity and vanishing moments of
biorthogonal wavelets are used in lter evaluation, but their
success at predicting the compression performance is only
partial. Although wavelet lter selection for image
compression has advanced substantially with the
development of useful metrics and criteria [19], the factor
50 IET Comput. Vis., 2011, Vol. 5, Iss. 1, pp. 5067
& The Institution of Engineering and Technology 2011 doi: 10.1049/iet-cvi.2009.0083
www.ietdl.org
that dominates the effect of compression is still open to more
discussion. In our study, the new family of wavelet bases
present a unied framework including the widely favoured
CDF9/7 [12] wavelet lter. Under the new construction
framework, biorthogonal wavelets boast great regularity and
vanishing moments, as well as the atness of the frequency
response of biorthogonal lters. These properties are of great
importance to image compression. Since the framework
proposed in this paper is generally feasible, it sets the theory
foundation for transforms aiming at image compression. In
the meantime, the optimal model of FIR lters aiming at the
characteristic image is brought forward, and the optimal FIR
lter can be obtained through sequential quadratic
programming (SQP) and genetic algorithm (GA). We
demonstrate that the performance of the new family of lters
given in this paper for image compression is very
encouraging. Finally, in the paper, we assume that the
coefcients of lters discussed are real.
The present paper consists of ve parts. Section 2 presents a
general framework of the construction of biorthogonal
wavelets based on Bernstein bases. Section 3 discusses the
regularity analysis of biorthogonal wavelets based on
Bernstein bases. In Section 4, the construction of parametric
lters with symmetry is discussed. In Section 5, the optimal
model of FIR lters aiming at the characteristics of the
image is brought forward, and the optimal FIR lters are
obtained through SQP and GA. In the meantime, results of
our experiments are analysed. In Section 6, we draw the
conclusions and introduce some research prospects.
2 General framework of construction of
biorthogonal wavelets based on Bernstein
bases
In this section, we will provide a general framework of the
construction of biorthogonal wavelets based on Bernstein
bases.
Here we introduce some basic concepts and conclusions.
Dene analysis or synthesis low-pass lter as
H(v) =
1
..
2
n
h
n
e
inv
,

H(v) =
1
..
2
h
n
e
inv
(1)
We assume that only nitely many h
n
,
h
n
are non-zero. Dene
f,

f by
f =
1
j=1
H(2
j
v),

f =
1
j=1
H(2
j
v) (2)
These innite products can only converge if
H(0) =

H(0) = 1 (3)
that is, if
n
h
n
=
h
n
=
..
2
(4)
If (3) is satised, then the innite products in (2) converge
uniformly and absolutely on compacts. Obviously
f(v) = H
v
2
_ _
f
v
2
_ _
,

f(v) =

H
v
2
_ _
f
v
2
_ _
(5)
or, equivalently
f(t) =
..
2

n
h
n
f(2t n),
f(t) =
..
2

n
h
n
f(2t n) (6)
at least in the sense of distributions. From [1], f and

f have
compact support. We also dene the corresponding c and
c by
c = e
iv/2
H
v
2
+p
_ _
f
v
2
_ _
,

c = e
iv/2
H
v
2
+p
_ _
f
v
2
_ _
(7)
or, equivalently
c(x) =
..
2

n
(1)
n
h
1n
f(2x n) (8)
c(x) =
..
2

n
(1)
n
h
1n
f(2x n) (9)
We now discuss the biorthogonality of f and
f. Obviously, if
f and

f dened as (6) are biorthogonal, then we have [14]
H(v)
H(v) + H(v +p)
H(v +p) = 1 (10)

Recall that the Bernstein polynomials [21] B
n
k
(x) =
(
n
k
)x
k
(1 x)
nk
, for k = 1, 2, . . . , n, give polynomial
approximations that converge to a continuous function f
on the unit interval [0, 1]; we express f approximations as a
linear operator
B
n
[ f ](x) =
n
k=0
f
k
n
_ _
B
n
k
(x)
=
n
k=0
f
k
n
_ _
n
k
_ _
x
k
(1 x)
nk
(11)
The Bernstein form of a general polynomial is expressed by
H1(x) =
n
k=0
d(k)
n
k
_ _
x
k
(1 x)
nk
(12)
where d(i) are the Bernstein coefcients.
Theorems 1 and 2 indicate that the representation of
decomposing and reconstructing low-pass lters expressed by
Bernstein polynomials ensures that the coefcients of lters
are symmetric, which is of great signicance in image
processing.
Theorem 1: Suppose that the low-pass lter of analysis (or
synthesis) is as follows
H1(x) =
N
k=0
d(k)
N
k
_ _
x
k
(1 x)
Nk
(13)
H(v) = H sin
2
v
2
_ _ _ _
=
j=N
j=N
h
j
e
ivj
(14)
IET Comput. Vis., 2011, Vol. 5, Iss. 1, pp. 5067 51
doi: 10.1049/iet-cvi.2009.0083 & The Institution of Engineering and Technology 2011
www.ietdl.org
where x = sin
2
(v/2) and z = e
iv
. Then, we have
h
m
= h
m
=
N
k=m
[(km)/2]
n=0
(1)
m
a
k
2
k+2n+m
k
2n + m
_ _
2n + m
n
_ _
, m 0 (15)
and
a
k
=
k
i=0
(1)
ki
d(i)
N
i
_ _
N i
k i
_ _
(16)
Proof: Suppose that
H1(x) =
N
k=0
a
k
x
k
(17)
we have
H1(x) =
N
i=0
d(i)
N
i
_ _
x
i
Ni
j=0
(1)
j
N i
j
_ _
x
j
=
N
i=0
Ni
j=0
d(i)(1)
j
N
i
_ _
N i
j
_ _
x
i+j
Thus
a
k
=
k
i=0
(1)
ki
d(i)
N
i
_ _
N i
k i
_ _
(18)
Furthermore, if x = sin
2
(v/2), z = e
iv
, then
H(v) =
N
k=0
a
k
1cos v
2
_ _
k
=
N
k=0
a
k
2
k
k
j=0
(1)
j
k
j
_ _
cos
j
(v)
=
N
k=0
a
k
2
k
k
j=0
(1)
j
k
j
_ _
z + z
1
2
_ _
j
=
N
k=0
k
j=0
j
l=0
(1)
j
a
k
2
k+j
k
j
_ _
j
l
_ _
z
j2l
Set j 22l m, then l ( j 2m)/2. For the sake of
convenience, we dene the expression given by
k
j m
2
_ _
=
k
j m
2
_ _
, if
j m
2
is a postive integer
0, else
(19)
We obtain
h
m
=
N
k=m
k
j=m
( 1)
j
a
k
2
k+j
k
j
_ _
j
j m
2
_ _
=
N
k=0
km
s=0
( 1)
m+s
a
k
2
k+s+m
k
s + m
_ _
m + s
s
2
_ _
=
N
k=0
[(km)/2]
n=0
( 1)
m
a
k
2
k+2n+m
k
2n + m
_ _
2n + m
n
_ _
Thus, (15) is proven. A
Similarly, we can obtain Theorem 2.
Theorem 2: Suppose that the low-pass lter of synthesis (or
analysis) is as follows
H1(x) =
N+2K+1
k=0
d(k)
N + 2K + 1
k
_ _
x
k
(1 x)
N+2K+1k
(20)
H(v) = H sin
2
v
2
_ _ _ _
=
j=N+2K+1
j=N2K1
h
j
e
ivj
(21)
where x = sin
2
(v/2) and z = e
iv
. Then, we have
h
m
=
h
m
=
N+2K+1
k=m
[(km)/2]
n=0
(1)
m
a
k
2
k+2n+m
k
2n + m
_ _
2n + m
n
_ _
, m 0 (22)
and
a
k
=
k
i=0
(1)
ki
d(i)
N + 2K + 1
i
_ _
N + 2K + 1 i
k i
_ _
(23)
Theorem 3 reveals that the number of zeros in Bernstein
coefcients determines the vanishing moments of wavelets
functions. This conclusion greatly reduces the extent of
complexity in analysing the transforming property of
wavelet functions. Meanwhile, the number of ones in
Bernstein coefcients decides the atness of frequency
response passbands of lters. These two transforming
features are crucial to image compression. The benet of
applying the Bernstein polynomial in constructing
biorthogonal wavelets is further testied in Section 5.
Theorem 3: If we represent analysis and synthesis low-pass
lters with an odd length in Bernstein basis form
H1(x) =
N
k=0
d(k)
N
k
_ _
x
k
(1 x)
Nk
(24)
H(v) = H1 sin
2
v
2
_ _ _ _
(25)
www.ietdl.org
for x = sin
2
(v/2) and satisfy as
d
k
H(v)
dv
k
|
v=p
= 0, k = 0, 1, 2, 3, . . . , 2K 1 (26)
d
k
H(v)
dv
k
|
v=o
= d
k,0
, k = 0, 1, 2, 3, . . . , 2P 1 (27)
where d
k,0
is the Kronecker symbol. If and only if the above
conditions are satised, then d(n) is as follows
d(n) =
1, 0 n , P
arbitrary, P n N K
0, N K , n N
(28)
where P and K are integral numbers.
Theorem 4: If H(v) =

N
N
h
n
e
iv
and

H(v) =
N+2K+1
N2K1
h
n
e
iv
, where h
n
and
h
n
are shown by Theorems
1 and 2. Assume that (10) holds. The corresponding
Bernstein coefcients d(i) and

d(i) satisfy the following
equation
2
mn=2l
N
k=m
[(km)/2]
n
=0
N+2K+1
k
=n
[(k
n)/2]
n
=0
(1)
n+m
_
a
k
2
k+2n
+m
k
2n
+ m
_ _
2n
+ m
n
_ _
a
k
2
k
+2n
+n
k
2n
+ n
_ _
2n
+ n
n
_ __
= d
l0
,
0 l N + K (29)
where
a
k
=
k
i=0
(1)
ki
d(i)
N
i
_ _
N i
k i
_ _
,
a
k
=
i=0
(1)
k
d(i)
N + 2K + 1
i
_ _
N + 2K + 1 i
k
i
_ _
Proof: Since
H(v) =
N
N
h
m
e
imv
,

H(v) =
N+2K+1
N2K1
h
n
e
inv
we have
H(v)
H(v) =
2N+2K+1
s=2N2K1
mn=s
(h
m
h
n
)e
isv
H(v +p)
H(v +p) =
2N+2K+1
s=2N2K1
mn=s
(h
m
h
n
)(1)
s
e
isv
From (10), it follows that
H(v)
H(v) + H(v +p)
H(v +p)
= 2
(N+K)
l=(N+k)
mn=2l
h
m
h
n
_ _
e
i2lv
= 1, 0 l N + K
We immediately obtain (29). A
Suppose that the number of vanishing moments of c
dened by (8) is 2k; according to Theorem 3, we have
H(v) = 1 sin
2
v
2
_ _ _ _
k
Nk
i=0
d(i)
N
i
_ _
sin
2
v
2
_ _ _ _
i
1 sin
2
v
2
_ _ _ _
Nik
=
1 + e
iv
2
_ _
2k
F(v) (30)
where
F(v) = e
ikv
Nk
i=0
d(i)
N
i
_ _
sin
2
v
2
_ _ _ _
i
1 sin
2
v
2
_ _ _ _
Nik
(31)
Similarly, suppose that the number of vanishing moments of
c dened by (9) is 2
k; we have
H(v) =
1 + e
iv
2
_ _
2
F(v) (32)
F(v) = e
i
kv

N+2K+1
k
i=0
d(i)
N + 2K + 1
i
_ _
sin
2
v
2
_ _ _ _
i
1 sin
2
v
2
_ _ _ _
N+2K+1i
k
(33)
Lemma 1: Suppose that F(v) is dened by (31); we have
F(v) = e
iv(Nm)

m
s=m
b
s
e
isv
(34)
where
b
s
=
m
k=s
[(ks)/2]
n=0
a
k
2
k+2n+s
(1)
s
k
2n + s
_ _
2n + s
n
_ _
(35)
a
k
=
k
i=0
( 1)
ki
d(i)
N
i
_ _
m i
k i
_ _
(36)
and s . 0, b
s
= b
s
.
Proof: From (31), we have
F(v) = e
i(Nm)v
m
i=0
d(i)
N
i
_ _
sin
2
v
2
_ _ _ _
i
1 sin
2
v
2
_ _ _ _
mi
= e
i(Nm)v
f (v)
www.ietdl.org
and
f (x) =
m
i=0
d(i)
N
i
_ _
x
i
(1 x)
mi
=
m
i=0
d(i)
N
i
_ _
x
i
mi
j=0
m i
j
_ _
(1)
j
x
j
=
m
i=0
d(i)
m
k=i
(1)
ki
N
i
_ _
m i
k i
_ _
x
k
=
m
k=0
a
k
x
k
where
a
k
=
k
i=0
(1)
ki
d(i)
N
i
_ _
m i
k i
_ _
Consequently, for z = e
iv
f (v) =
m
k=0
k
j=0
a
k
2
k
(1)
j
k
j
_ _
z + z
1
2
_ _j
=
m
k=0
k
j=0
a
k
2
k
(1)
j
k
j
_ _
j
l=0
1
2
j
j
l
_ _
z
j2l
Let j 22l s, we obtain
f (v) =
m
s=m
_
m
k=s
[(ks)/2]
n=0
a
k
2
k+2n+s
(1)
s
k
2n + s
_ _
2n + s
n
_ _
_
z
s
Thus, Lemma 1 is proven. A
Theorem 5 will give sufcient conditions of the
biorthogonality of c,

c.
Theorem 5: Let H(v) =

N
N
h
n
e
inv
and

H(v) =
N+2K+1
N2K1
h
n
e
inv
be shown by Theorems 1 and 2. The
number of vanishing moments of corresponding c and

c
are 2L and 2
L, respectively (which are determined by

the number of zeros in Bernstein coefcients).
Let m N 2L and m = N + 2K + 1
L. Assume that
(10) holds. Let c and

c be functions dened by (8) and
(9). Suppose that Bernstein coefcients d(i) and

d(i)
satisfy the following
m
s=m
m
k=s
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
N
i
_ _
m i
k i
_ _
2
k+2n+s
(1)
s
k
2n + s
_ _
2n + s
n
_ _
, 2
2L1/2
(37)
(see (38))
We obtain the following results:
1. For some arbitrary integer n . 0
B
2
n = max
2
n
1
j=0
F(2
j
v)
1/2
n
, 2
2L(1/2)
(39)
B
2
n = max
2
n
1
j=0
F(2
j
v)
1/2
n
, 2
2
L(1/2)
(40)
where F(v) and

F(v) are dened by (31) and (33).
2.
kf,

f(t l)l = d
l0
f(v) C(1 + |v|)

1/2a
f(v) C(1 + |v|)

1/2 a
where a = 2L 1/2 log
2
B
2
n , a = 2
L 1/2 log
2
B
2
n .
3. The corresponding c and

c are biorthogonal wavelets in
L
2
(R).
Proof: It is easy to nd that sequences B
2
n and

B
2
n are
decreasing
2
n
1
j=0
F(2
j
v)
max
2
n1
1
j=0
F(2
j
v)|max|
2
n
1
j=2
n1
F(2
j2
n1
2
2
n1
v)
= max
2
n1
1
j=0
F(2
j
v)|max|
2
n1
1
j=0
F(2
j
v)
= max
2
n1
1
j=0
F(2
j
v)
m
s=m
m
k=s
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
N + 2K + 1
i
_ _
m i
k i
_ _
2
k+2n+s
(1)
s
k
2n + s
_ _
2n + s
n
_ _
, 2
2
L1/2
(38)
www.ietdl.org
Hence, B
2
n B
2
n1 B
1
= max|F(w)|. Similarly, we
can prove
B
2
n
B
2
n1
B
1
= max|
F(w)|. Combining
Lemma 1, (37) and (38), we obtain conclusion (1) by [1, 14].
From [1, 14], we have kf,

f(t l)l = d
l0
,

f(v)
C(1 + |v|)
1/2a
,

f(v) C(1 + |v|)

1/2 a
; we obtain
conclusion (2).
From [1, 14] it is implied that the corresponding c and

c
are biorthogonal wavelets in L
2
(R). Hence, the proof of the
theorem is completed. A
3 Regularity analysis of biorthogonal
wavelets based on Bernstein bases
In this section, we will provide the regularity analysis of
biorthogonal wavelets based on Bernstein bases.
The regularity is dened as follows: for a n +b, n [ N,
0 b , 1, the Hoder space C
a
[14] is dened as the set of
functions which are n times continuously differentiable and
such that the nth derivative f
(n)
satises the following
condition
| f
(n)
(x + h) f
(n)
(h)| C|h|
b
, for all x, h
The number a is called the regularity (exponent) of f. It is well
known [14] that if
_
R
|
f (v)|(1 + |v|)
a
, 1 (41)
then f [ C
a
, which means that the regularity of f can be
estimated via the decay of its Fourier transform. The Sobolev
regularity of f is studied with the spectral properties of a
transfer operator associated with the coefcients of lters
[14]. Transfer operators are dened as follows.
For a 2p-periodic function u(v) that depends on the
coefcients of lter is xed and the associated transfer
operator T
u
acts on 2p-periodic functions according to
T
u
(v) = u(v/2)f (v/2) + u(v/2 +p)f (v/2 +p) (42)
Note that if u = S
n[Z
f
n
e
inv
is a trigonometric polynomial,
that is, u
n
= 0 if |n| . N, then the nite-dimensional space
E
u
= {
|n|N
c
n
e
inv
: c
n
[ C} is invariant under the
action of T
u
.
One of the main results in the univariate theory is as
follows.
Assume that H(v) can be factorised as H(v) = ((1 +
e
iv
)/2)
L
F(v) where F(v) is a trigonometric polynomial
and dene u(v) = |F(v)|
2
. The Sobolev exponent
[14]: s(f) = sup{s:
_
(1 + |v|
s
)|
f|
2
dv , +1} satises the
estimate
s(f) L
log r
2 log 2
(43)
where r is the spectral radius of T
u
restricted to E
u
.
Dene the associated transfer operator T acts on
2p-periodic functions according to
Tf (v) = F
v
2
_ _
2
f
v
2
_ _
+ F
v
2
+p
_ _
2
f
v
2
+p
_ _
(44)
where F(v) is dened by (31).
Lemma 2: For any 2p-periodic continuous functions f, g, we
consider the conjugate operator T
of T, and have
T
f (v) = 2|F(v)|
2
f (v) (45)
Proof: In fact, for any 2p periodic continuous f and g
,Tf , g. =
_
p
p
F
v
2
_ _
2
f
v
2
_ _
g(v) dv
+
_
p
p
F
v
2
+p
_ _
2
f
v
2
+p
_ _
g(v) dv
= 2
_
p/2
p/2
|F(v)|
2
f (v)g(2v) dv
_
+
_
3p/2
p/2
|F(v)|
2
f (v)g(2v) dv
_
= 2
_
3p/2
p/2
|F(v)|
2
f (v)g(2v) dv =,f , T
g.
Thus, Lemma 2 is proven. A
Lemma 3: Suppose that
|F(v)|
2
=
2m
t=2m
b
t
e
itv
where
b
t
=
mt
k=m
b
k+t
b
k
(t . 0), b
t
= b
t
and b
t
, t = m, . . . , m is dened by (35).
Proof: By Lemma 1, we have
|F(v)|
2
=
m
j=m
b
j
e
ijv
_ _

m
k=m
b
k
e
ikv
_ _
=
m
j=m
m
k=m
b
j
b
k
e
i( jk)v
Setting j 2k t, for t . 0, we have
|F(v)|
2
=
2m
t=2m
mt
k=m
b
k+t
b
k
e
ikv
Therefore, Lemma 3 is proven. A
Lemma 4 shows how to evaluate r(T).
Lemma 4:
r(T) 4m
m
i=m
b
2
i
(46)
where b
i
is shown by (35).
www.ietdl.org
Proof: We consider the conjugate operator T
. By direct
computation, for any 2p-periodic continuous functions f,
we have
T
f (v) = 2|F(v)|
2
f (v) (47)
The matrix of T
is restricted to E = {
2m
j=2m
c
j
e
ijv
,
(c
2m
, c
2m+1
, . . . , c
2m
) [ R
2m+1
}, we have
H = (b
k2l
)
l,k=2m,2m+1,...,2m
(48)
Notice that the matrix H is shown as follows (see (49))
We remark matrix H
c
, which consists of all rows and columns
of H except its rst and last rows and columns. To estimate
the bounds of the eigenvalues of H, by Lemma 3, we have
|b
t
|
1
2
mt
k=m
b
2
k+t
+
mt
j=m
b
2
k
_ _
=
1
2
m
m+t
b
2
l
+
mt
j=m
b
2
k
_ _
m
i=m
b
2
i
(50)
It is obvious by (49) that b
2m
is an eigenvalue of H with
multiplicity 2. Hence, the spectral radius of H is
r(H) = max{|b
2m
|, r(H
c
)} max{|b
2m
|, H
c
1
}
max |b
2m
|,
2m1
i=2m+1
|b
i2j
|
_ _
2m
m
i=m
b
2
i
(51)
By Theorem 5 and Lemma 2-4, Theorem 6 is proven. A
For sufcient conditions of the biorthogonality, and the
regularity analysis of f,

f by (8), we have the following
results. By [5, 6] and Lemma 4, Theorem 6 is proven.
Theorem 6: Let
H(v) =
NK
k=0
d(i)
N K
k
_ _
sin
2k
(v/2)(cos
2(Nk)
(v/2)
(52)
H(v) =
N+2K+1
K
k=0
d(i)
N + 2K + 1
K
k
_ _
sin
2k
(v/2)
(cos
2(N+2K+1k)
(v/2)) (53)
Set m N 2K, m = N + 2K + 1
K. Assume that (10)

holds. Let f and

f be function dened by (6). Suppose
that generalised Bernstein coefcients d(i) and
d(i) satisfy
m
s=m
m
k=s
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
N
i
_ _
m i
k i
_ _
2
k+2n+s
(1)
s
k
2n + s
_ _
2n + s
n
_ _
, 2
2K1/2
(54)
m
s= m
m
k=s
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
N +2K +1
i
_ _
mi
k i
_ _
2
k+2n+s
(1)
s
k
2n +s
_ _
2n +s
n
_ _
,2
2
K1/2
(55)
We obtain the following results:
1. kf,

f(t l)l = d
l0
,

f(v) C(1 + |v|)
1/2a
,

f(v)
C(1 + |v|)
1/2 a
, where a = 2K 1/2 log
2
|F(v)|, a =
2
K 1/2 log
2
F(v), F(v) and

F(v) are dened by (31)
and (33), respectively.
2. The corresponding c and

c are biorthogonal, wavelets
in L
2
(R). c [ C
a
and

c [ C
a
, where a, a are more than
2K
1
2
log
2
4m
m
i=m
b
2
i
, 2
K
1
2
log
2
4m
m
i= m
b
2
i
(56)
where b
i
is dened by (35), and
b
s
=
m
k=0
[(ks)/2]
n=0
a
k
2
k+2n+s
(1)
s
k
2n + s
_ _
2n + s
n
_ _
a
k
=
k
i=0
(1)
ki
d(i)
N + 2K + 1
i
_ _
m i
k i
_ _
We now give a general model to construct the biorthogonal
scaling functions f and

f with the largest possible
regularity. In fact, this method can be described as a
constrained optimisation problem of nding suitable
Bernstein coefcients {d(i)} and {
d(i)}. By (56) of
Theorem 6, when log
2
4m
m
i=m
b
2
i
and log
2
4 m
m
i= m
b
2
i
reach a minimum value, the regularity (exponent) of c and
c will increase. The optimisation problem can be written as

follows.
Model 1: (the non-linear optimisation model of the largest
possible regularity for biorthogonal wavelet function c
H =
b
2m
b
2m2
b
2m4
b
2m6
b
2m
0 0 0
0 b
2m1
b
2m3
b
2m5
b
2m+1
0 0 0
0 b
2m
b
2m2
b
2m4
b
2m+2
b
2m
0 0
0 0 b
2m1
b
2m3
b
2m+3
b
2m+1
0 0
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
0
0 0 0 0 0 0 0 b
2m
(49)
www.ietdl.org
dened by (8): Suppose that the objective function is
f (d(0), d(1), . . . , d(N))
=
m
s=m
m
k=s
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
N
i
_ _
m i
k i
_ _
2
k+2n+s
(1)
s
k
2n + s
_ _
2n + s
n
_ _
The following Bernstein coefcients ensure that the function

reaches its minimum
min f (d(0), d(1), . . . , d(N)) (57)
Subjected to
2
mn=2l
_
N
k=m
[(km)/2]
n
=0
N+2K+1
k
=n
[(k
n)/2]
n
=0
(1)
n+m
a
k
2
k+2n
+m
k
2n
+m
_ _
2n
+m
n
_ _
a
k
2
k
+2n
+n
2n
+n
_ _
2n
+n
n
_ _
_
=d
l0
, 0 l N +K (58)
m
s=m
m
k=s
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
N
i
_ _
mi
k i
_ _
2
k+2n+s
(1)
s
k
2n +s
_ _
2n +s
n
_ _
,2
2L1/2
(59)
m
s= m
m
k=s
[(ks)/2]
n=0
k
i=0
( 1)
ki
d(i)
N +2K +1
i
_ _

Li
k i
_ _
2
k+2n+s
( 1)
s
k
2n +s
_ _
2n +s
n
_ _
, 2
2
L1/2
(60)
Restriction (58) assures that the decomposing and reconstructing

low-pass lters satisfy perfect reconstruction conditions.
Restriction (59) and (60) assure the biorthogonality of c and

c.
If the above constrained optimisation problem (57) is solved, the
largest possible regularity of c dened by (8) can be acquired.
Model 2 (the non-linear optimisation model of the largest
possible regularity for biorthogonal wavelet function

c
dened by (9): Suppose that objective function
g(
d(0),
d(1), . . . ,
d(N + 2K + 1))
=
_

m
s= m
m
k=s
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
N + 2K + 1
i
_ _
m i
k i
_ _
2
k+2n+s
(1)
s
k
2n + s
_ _
2n + s
n
_ _
_
min g(
d(0),
d(1), . . . ,
d(N + 2K + 1)) (61)

Subjected to
2
mn=2l
N
k=m
[(km)/2]
n
=0
N+2K+1
k
=n
[(k
n)/2]
n
=0
(1)
n+m
_
a
k
2
k+2n
+m
k
2n
+ m
_ _
2n
+ m
n
_ _
a
k
2
k
+2n
+n
k
2n
+ n
_ _
2n
+ n
n
_ _
_
= d
l0
,
0 l N + K (62)
m
s=m
m
k=s
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
N
i
_ _
m i
k i
_ _
2
k+2n+s
(1)
s
k
2n + s
_ _
2n + s
n
_ _
, 2
2L1/2
(63)
m
s= m
m
k=s
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
N + 2K + 1
i
_ _

L i
k i
_ _
2
k+2n+s
(1)
s
k
2n + s
_ _
2n + s
n
_ _
, 2
2
L1/2
(64)
Restriction (62) assures that the decomposing and

reconstructing low-pass lters satisfy perfect reconstruction
conditions. Restrictions (63) and (64) assure the
biorthogonality of c and

c. If the above constrained
optimisation problem (61) is solved, the largest possible
regularity of biorthogonal wavelet function

c dened by
(9) can be acquired.
Model 3 (the non-linear optimisation model of the
largest possible regularity for biorthogonal wavelet
functions c and

c dened by (8) and (9)): Suppose that
objective function
w(d(0), d(1),..., d(N),
d(0),
d(1),...,
d(N+2K+1))
=
m
s=m
m
k=s
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
N
i
_ _
mi
k i
_ _
2
k+2n+s

www.ietdl.org
(1)
s
k
2n+s
_ _
2n+s
n
_ _
m
s= m
m
k=s
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
N +2K+1
i
_ _
mi
k i
_ _
2
k+2n+s
(1)
s
k
2n+s
_ _
2n+s
n
_ _
(65)
min w(d(0), d(1),..., d(N),
d(0),
d(1)...,
d(N+2K+1))
Subjected to
2
mn=2l
N
k=m
[(km)/2]
n
=0
N+2K+1
k
=n
[(k
n)/2]
n
=0
(1)
n+m
_
a
k
2
k+2n
+m
k
2n
+ m
_ _
2n
+ m
n
_ _
a
k
2
k
+2n
+n
k
2n
+ n
_ _
2n
+ n
n
_ _
_
= d
l0
,
0 l N + K (66)
m
s=m
m
k=s
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
N
i
_ _
mi
k i
_ _
2
k+2n+s
( 1)
s
k
2n +s
_ _
2n +s
n
_ _
,2
2L1/2
(67)
m
s= m
m
k=s
[(ks)/2]
n=0
k
i=0
( 1)
ki
d(i)
N +2K +1
i
_ _
mi
k i
_ _
2
k+2n+s
(1)
s
k2n +s
_ _ 2n +s
n
_ _
,2
2
L1/2
(68)
Restriction (66) assures that the decomposing and reconstructing
low-pass lters satisfy perfect reconstruction conditions.
Restrictions (67) and (68) assure the biorthogonality of and
c. If the above constrained optimisation problem (65) is

solved, the largest possible regularity of and

c dened by (8)
and (9) can be acquired.
4 Construction of parametric lters of
biorthogonal wavelets
In this section, we shall give a newfamilyof lters withdifferent
lengths and vanishing moments via Theorems 1, 2, 4 and 5.
Moreover, we shall analyse the regularity of f and

f and
show the largest possible regularity by solving Models 13.
Example 1: Let the lengths of low-pass lters in analysis
and synthesis be 9 and 7, respectively (or 7 and 9).
Suppose that the vanishing moments of c and

c dened
by (8) and (9) are 4 and 2. If (10) is satised, then the
corresponding Bernstein coefcients are obtained by (see
equation at the bottom of the page)
where b [ R is a parameter.
Note: when d 1.3069, H(v) and

H(v) are the widely
favoured CDF9/7 [12].
Example 2: Let the lengths of low-pass lters in analysis and
synthesis be 9 and 11, respectively (or 11 and 9). Suppose that
the vanishing moments of c and
c dened by (8) and (9) are

4 and 2. If (10) is satised, then the corresponding Bernstein
coefcients are obtained by (see equation at the bottom of the
page)
where c [ R is a parameter.

page)
synthesis be 11 and 13, respectively (or 13 and 11). Suppose
that the vanishing moments of c and
c dened by (8) and (9)

are 4 and 2. If (10) is satised, then the corresponding
d = [1, b, 0, 0] D = 1,
3
4
b +
7
4
,
7
2
b +
7
2
+
3
2
b
2
,
(27/4)b
3
+ (63/4)b
2
(63/4)b + (35/4)
3b + 1
, 0
_ _
d = [1, 1, c, 0, 0] D = 1, 1,
3
5
c +
8
5
,
1
5
108c
3
50 288c
2
+ 393c
36c
2
+ 24c 5
,
2
5
36c
2
96c + 23
36c
2
+ 24c 5
, 0
_ _
d = [1, b, 0] D = 1,
2
5
b +
7
5
,
2
5
b
2
7
5
b +
21
10
,
1
10
8b
3
35 28b
2
+ 42b
1 + 2b
, 0, 0
_ _
www.ietdl.org
Bernstein coefcients are obtained by (see equation at the
bottom of the page)
where d [ R is a parameter.

are 2 and 2. If (10) is satised, then the corresponding Bernstein
coefcientsareobtainedby(seeequationat thebottomof thepage)
where e [ R is a parameter.
c dened by (8) and (9) are 2

and 4. If (10) is satised, then the corresponding Bernstein


bottom of the page)

d = [1, 1, 1, d, 0, 0]
D = 1, 1, 1,
(1281/2)d + 108 + (2715/2)d
2
375d
3
550d
2
355d + 500d
3
+ 72
,
200d
3
+ (2050/3)d
2
(854/3)d + 48
550d
2
355d + 500d
3
+ 72
,
_
(250/3)d
3
+ (850/3)d
2
(355/3)d + 24
550d
2
355d + 500d
3
+ 72
, 0
_
d = [1, 1, 1, 1, e, 0]
D = 1, 1,
250e
4
+ (11 300/3)e
3
7590e
2
+ (17 543/3)e 1534
1875e
3
6050e
2
+ 5425e 1534 + 625e
4
,
(125/4)e
4
+ 2000e
3
4280e
2
+ 3380e 900
1875e
3
6050e
2
+ 5425e 1534 + 625e
4
,
_
2275e
2
+ (5474/3)e + 1050e
3
(1480/3)
1875e
3
6050e
2
+ 5425e 1534 + 625e
4
,
(875/2)e
3
+ 770e (5675/6)e
2
(634/3)
1875e
3
6050e
2
+ 5425e 1534 + 625e
4
, 0
_
d = [1, 1, c, 0] D = 1, 1,
1
5
c +
6
5
,
(207/10)c 6 (81/10)c
2
+ (27/20)c
3
9c 4 + 9c
2
,
(12/5) (12/5)c
2
+ (39/5)c
9c 4 + 9c
2
, 0, 0
_ _
d = [1, 1, c, 0, 0] D = 1, 1,
2
7
c +
9
7
,
18
35
c +
57
35
,
(648/35)c
3
(2232/35)c
2
+ (3222/35)c (102/7)
24c + 36c
2
5
,
_
24c
2
+ (198/7)c + (72/7)c
3
(18/7)
24c + 36c
2
5
, 0, 0
_
d = [1, 1, 1, d, 0, 0, 0] D = 1, 1, 1,
4
7
d +
11
7
,
(8000/7)d
4
(21 600/7)d
3
+ (35 880/7)d
2
+ 154 (8784/7)d
2000d
3
590d + 77 + 1600d
2
,
_
(8000/7)d
3
+ (24 400/7)d
2
(8360/7)d + (808/7)
2000d
3
590d + 77 + 1600d
2
,
(4000/7)d
3
+ (10 800/7)d
2
(2780/7)d + (54/7)
2000d
3
590d + 77 + 1600d
2
, 0
_
d = [1, 1, c, 0]
D = 1, 1,
3
28
c +
31
28
,
15
56
c +
9
7
,
(789/35)c (342/35)c
2
(228/35) + (27/14)c
3
9c + 9c
2
4
,
_
(27/56)c
3
(81/28)c
2
+ (207/28)c (15/7)
9c + 9c
2
4
, 0, 0, 0
_
www.ietdl.org

page)

are 4 and 4. If (10) is atised, then the corresponding
bottom of the page)

bottom of the page)

bottom of the page)
where e [ R is a parameter.
Example 14: Let the lengths of low-pass lters analysis and
synthesis be 19 and 25, respectively (or 25, 19). Suppose
that the number of vanishing moments of c and

c dened
by (8) and (9) are 10 and 4. If (10) is satised, then the
d = [1, b, 0, 0]
D =
_
1,
3
8
b +
11
8
,
9
28
b
2
33
28
b +
55
28
,
27
56
b
3
+
99
56
b
2
165
56
b +
165
56
,
81
70
b
4
+
99
14
b
2
297
70
b
3
99
14
b +
33
7
,
(243/56)b
5
+ (891/56)b
4
(1485/56)b
3
+ (1485/56)b
2
(495/28)b + (33/4)
3b + 1
, 0, 0, 0
_
d = [1, 1, 1, d, 0, 0]
D = 1, 1, 1,
5
28
d +
33
28
,
(9690/7)d
2
(3250/7)d
3
(8751/14)d + 108 + (500/7)d
4
550d
2
+ 500d
3
355d + 72
,
_
(2875/14)d
3
+ (20 425/28)d
2
(9255/28)d + 54
550d
2
+ 500d
3
355d + 72
,
(500/7)d
3
(1425/14)d + (3425/14)d
2
+ (108/7)
550d
2
+ 500d
3
355d + 72
, 0, 0
_
d = [1, 1, c, 0, 0, 0]
D = 1, 1,
5
14
c +
19
14
,
15
28
c +
12
7
,
10
7
c
2
23
7
c +
47
14
,
(625/7)c
4
+ (2875/14)c
3
(5575/28)c
2
+ (4005/28)c 6
3 + 25c + 50c
2
,
_
(125/7)c
3
25c
2
+ (1105/14)c (289/14)
3 + 25c + 50c
2
, 0, 0
_
d = [1, 1, 1, 1, e, 0, 0, 0]
D = 1, 1, 1, 1,
19 200 + (1 921 535/2)e
3
(1 158 213/2)e
2
+ 167 964e 240 100e
4
300 125e
4
+ 360 150e
3
286 895e
2
+ 99 176e 12 800
,
_
(2 174 375/4)e
3
(1 157 625/4)e
2
+ 82 382e 9600 (300 125/2)e
4
300 125e
4
+ 360 150e
3
286 895e
2
+ 99 176e 12 800
,
85 750e
4
+ (591 675/2)e
3
(309 295/2)e
2
+ 49 588e 6400
300 125e
4
+ 360 150e
3
286 895e
2
+ 99 176e 12 800
,
(1 020 425/8)e
3
(300 125/8)e
4
+ 24 794e (277 095/4)e
2
3200
300 125e
4
+ 360 150e
3
286 895e
2
+ 99 176e 12 800
, 0
_
www.ietdl.org
corresponding Bernstein coefcients are obtained by (see
equation at the bottom of the page)
Theorem 7 shows the sufcient conditions of wavelets c
and

c to be biorthogonal from Examples 114, when
Bernstein coefcients belong to certain range.
Theorem 7: In the following tables, when Bernstein
coefcients belong to certain ranges, c and

c from
Examples 114 are biorthogonal wavelets in L
2
(R).
Furthermore, by solving Models 13, we obtain the largest
possible regularities of c and

c. The detailed conclusions
are given in the Table 1.
Proof: We will prove the conclusion of Example 1 in Table 1,
while the conclusion of other cases can be proven similarly.
Suppose that (see equation at the bottom of the page)
Thus
f (b) = 2
..
2

1
4
+
3
4
b
+
1
2
+
3
2
b
_ _
, 8
..
2
In order to nd out the interval that b belongs to satisfying the

above expression, we draw an image as is shown in Fig. 1.
From Fig. 1a, we know b [ B (22.6667, 2.6667).
Suppose that (see equation at the bottom of the page)
We have
f (b) = 2
..
2
15
64
9
32
b +
9
64
b
2
1
16
(27/4)b
3
+(63/4)b
2
(63/4)b +(35/4)
3b +1
_ _
25
32
+
3
4
b
9
32
b
2
+
3
8
(27/4)b
3
+(63/4)b
2
(63/4)b +(35/4)
3b +1
_ _
1
64
+
9
32
b
9
64
b
2
15
16
(27/4)b
3
+(63/4)b
2
(63/4)b +(35/4)
3b +1
_ _
33
16
3
2
b +
9
16
b
2
+
5
4
(27/4)b
3
+(63/4)b
2
(63/4)b +(35/4)
3b +1
_ _
_
,2
..
2
From Fig. 1b, we know b [

B = (1.1912, 1.2587). So
d = [1, 1, 1, 1, b, 0, 0, 0, 0, 0]
D = 1, 1, 1, 1,
14
55
b +
69
55
,
21
44
b +
18
11
,
9
22
b +
21
11
_
(94 517 766/11)b

5
(5 35 600 674/11)b
4
+ (9 59 604 975/11)b
3
(11 46 216 393/44)b
2
+(1 47 464 725/44)b 11 7650
18 003 384b
4
+ 13 288 212b
3
4 608 576b
2
+ 815 805b 58 825
(7 56 142 128/55)b
5
(3 94 074 072/11)b
4
+ (22 13 447 796/55)b
3
(3 41 604 144/55)b
2
+(1 13 142 630/11)b 1 977 714
18 003 384b
4
+ 13 288 212b
3
4 608 576b
2
+ 815 805b 58 825
(5 67 106 596/55)b
5
(81 015 228/5)b
4
+ (8 35 299 864/55)b
3
(2 12 865 408/55)b
2
+(97 643 826/55)b (2 371 474/11)
18 003 384b
4
+ 13 288 212b
3
4 608 576b
2
+ 815 805b 58 825
(12 002 256/11)b

4
+ (86 516 262/11)b
3
(62 780 886/11)b
2
+ (17 498 835/11)b 162 905
18 003 384b
4
+ 13 288 212b
3
4 608 576b
2
+ 815 805b 58 825
, 0, 0
_
f (b) =
2
s=2
2
k=s
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
4 + 2k + 1
i
_ _
2 i
k i
_ _
2
k+2n+s
(1)
s
k
2n + s
_ _
2n + s
n
_ _
, 2
2(42)1/2
f (b) =
4
s=4
4
k=0
[(ks)/2]
n=0
k
i=0
(1)
ki
d(i)
5 + 2k + 1
i
_ _
4 i
k i
_ _
2
k+2n+s
(1)
s
k
2n + s
_ _
2n + s
n
_ _
, 2
2(54)1/2
www.ietdl.org
by Theorem 6, when Bernstein coefcients belong to
the set B >

B = (2.6667, 2.6667) >(1.1912, 1.2587) =
(1.1912, 1.2587), c and

c are biorthogonal wavelets in L
2
(R).
From Fig. 1c, when b 1.1913 [ (1.1912, 1.2587),
function f (b) reaches a minimum. So the best parameter
(37) of Model 1 is 1.1913.
From Fig. 1d, when b 1.217 [ (1.1912, 1.2587),
function

f (b) reaches a minimum. So the best parameter
(38) of Model 2 is 1.217.
From Fig. 1e, when b 1.217 [ (1.1912, 1.2587), function
f (b) +
f (b) reaches a minimum. So the best parameter (39) of

Model 3 is 1.217. The proof of the theorem is completed. A
5 Construction of optimised biorthogonal
wavelets for image compression
Most applications of wavelet bases exploit their ability to
efciently approximate particular classes of functions with a
few non-zero wavelet coefcients. The design of c must
therefore be optimised to produce a maximum number of
wavelet coefcients k f , c
j,n
l that are close to zero. It is well
known that wavelets can provide sparse and, hence, efcient
representations of smooth functions. This property is
especially advantageous to image coding. However, in the
vicinity of an image discontinuity, large wavelet coefcients
can be generated. When these coefcients are quantised or
lost, a Gibbs-like phenomenon can be observed in the
reconstructed image. For example, artefacts marked by
softness, ringings, halos and colour bleeding can be seen along
the edges. Although regularity and vanishing moments are
sometimes used in lter evaluation, their success at predicting
compression performances are only partial. Many issues
related to the choice of the lter bank for image compression
remain unresolved. Wavelet lter evaluation for image
compression, particularly for remote-sensing image is still an
open question. In this section, we present the optimised model
for image compression and the corresponding solving method.
Taking into account all the factors, for instance, the
vanishing moments and the regularity, we propose a brand
new method of designing optimal lters for application in
the compression of images. We can draw the conclusion
that the lters proper for image compression should be
characterised in the following aspects:
1. The regularity of biorthogonal wavelets functions.
2. Vanishing moments of biorthogonal wavelets functions.
3. The atness of frequency response of low-pass lters of
analysis and synthesis.
4. The concentration of low-frequency energy. In the
frequency domain, the energy of the entire discrete wavelet
transform (DWT) image should concentrate on the low-
frequency sub-band.
5. The concentration of high-frequency energy. The energy
of the high-frequency sub-bands should engross in a small
portion of the coefcients.
The energy in the frequency domain can be presented by
the sum of the square power of all sub-band coefcients of
Fig. 1 Regularity analysis
a function f (b) 8
..
2
around zero
b function
f (b) 4
..
2
around b 1.5
c function f (b) around b 1.2
d function
f (b) around b 1.2

e function
f (b) + f (b) around b 1.2

Table 1 Largest possible regularities of c and c
by Models 13
Filter pair Set Best parameter of
Model 1
Best parameter of
Model 2
Best parameter of
Model 3
Example 1 (1.1912, 1.2587) 1.1913 1.217 1.217
Example 2 (0.8091, 1.3333) 0.8092 1.251 0.8092
Example 3 (0.6218, 1.2) 0.6219 1.185 1
Example 4 (0.4424, 0.81) 0.4425 0.8 0.4425
Example 5 (0.0828, 0.1778) 0.1286 0.1777 0.1285
Example 6 (0.1926, 0.286) < (0.3381, 0.6667) 0.3382 0.3432 0.3432
Example 7 (0.6058, 1.3333) 0.6059 1.3332 0.8333
Example 8 (0.8366, 1.6) 0.8367 1.2268 0.8367
Example 9 (20.0064, 0.3321) < (0.3393, 0.6667) 0.3319 0.6666 0.3320
Example 10 (0.9947, 1.67) 0.9948 1.5078 1.5078
Example 11 (20.0168, 0.8) 0.0666 0.7 0.198
Example 12 (0.9870, 1.6847) 0.9871 1.3262 1.3262
Example 13 (0.4483, 0.9143) 0.4485 0.7406 0.4484
Example 14 (0.8750, 2.0110) 0.8751 1.6412 0.8751
www.ietdl.org
the DWT image. Thus, an objective function is introduced by
us as follows. If the preponderant amount of energy is
concentrated in the low-frequency part, the objective
function can reach its minimum value, which is dened as
min f = min
j,k,m
3
i=1
(D
i
j,k,m
)
2
_ _
j,k,m
((C
j,k,m
)
2
+
3
i=1
(D
i
j,k,m
)
2
)
(69)
where C
j,k,m
are coefcients of a low-frequency sub-band
(LL), D
i
j,k,m
, i 1, 2, 3 are coefcients of high-frequency
sub-bands (LH, HL, HH).
Based on the ve aspects mentioned above, the following
algorithm is suggested. The following steps can be taken in
order to obtain lters which have a better effect on
compression of the image.
Algorithm 1 (algorithm of the optimal lters):
Step 1: Utilising the lters obtained from Examples 114, a
coefcient matrix can be formulated after DWT.
Step 2: Solving the non-linear optimisation models (69) by
SQP [23], we obtain the initialisation value of
parameterisation of lters. The lters of Examples 114 by
the parameterisations of lters can be obtained.
Step 3: Set the group of solutions obtained by Step 2 as the
original population. Finess function is dened by PSNR
of reconstruction of image. Searching range of
parameterisations of lters is restricted by Theorem 7.
Step 4: Calculate the peak signal to noise ratio (PSNR) value
of the reconstructed image. If it converges, then obtain the
optimal solution, otherwise go to Step 5.
Step 5: We use the GA [24] to acquire the new
parameterisation of lters. The lters of Examples 114 by
new parameterisations of lters can be obtained. Utilising
the new lters compress wavelet coefcients by the bit-
plane prediction coding method, go to Step 4.
Since the framework proposed in this paper ensures that the
biorthogonal wavelets have good regularity, vanishing
moments and atness of the frequency response, the rst
three requirements mentioned above are satised. The
purpose of construction of parametric lters is to achieve
(69) by adjusting the parameters. By applying Examples 1
14 and Algorithm 1, we obtain a new family of transforms
BBW17/7, BBW15/13, BBW17/11, BBW17/15 and
BBW25/19 as shown in Table 2.
As Fig. 2 indicates, the passband of the frequency response
of synthesis and analysis low-pass lters of BBW15/13,
BBW17/7, BBW17/11 and BBW17/15 display better
atness than that of CDF9/7, which testies the efciency
of Algorithm 1.
In order to evaluate energy compaction of the transforms,
we dene the energy compaction ability as follows
E
comp
(LL) = E
M
/E
Total
, M = LL (70)
where E
LL
is the energy of the sub-band LL and E
Total
is the
energy of the whole image. We analyse the energy
compaction ability BBW17/11 and CDF9/7 for city,
factory, Toulouse and San Francisco. In Fig. 3, the vertical
axis represents the energy percentage of the lowest-
frequency sub-band. The energy percentage of each level
using BBW17/11 is higher than the corresponding level
using CDF9/7, which means BBW17/11 has better
energy compaction ability as shown in Fig. 3. In wavelet
construct, we hope to construct wavelet bases with bigger
E
comp
(LL).
We explore the applicability of the newly designed
transforms to still images, in particular remote sensing
images (see Fig. 4). The new transforms and CDF9/7 are
Table 2 Best lters from Examples 114
Filters Parameter H

H
BBW (15/13) 1.1071 0.7909514153, 0.4143203796,
20.0628834756, 20.0690533966,
0.0251533902, 0.0082864076,
20.0041922317
0.8505266620, 0.3778139152,
20.0791084712, 20.0275108192,
0.0078159446, 0.0034614712,
20.0004174138, 20.0002111766
BBW (17/7) 1.4363 0.8227982894, 0.4266704415,
20.0578457541, 20.0731170509
0.7769929600, 0.4008823089,
20.0784015690, 20.0651822134,
0.0531282040, 0.0190696179,
20.0112071569, 20.0012163228,
0.0015374324
BBW (17/11) 1.4452 0.7808889544, 0.4266174085,
20.0491881155, 20.0874989399,
0.0122970289, 0.0144349220
0.7980748793, 0.4152788416,
20.0829711757, 20.0723271361,
0.0528941607, 0.0118257160,
20.0168438682, 20.00122403010,
0.0014368342
BBW (17/15) 0.6557 0.786343827, 0.4130474234,
20.0594277847, 20.0667620754,
0.0237711139, 0.0070134514,
20.0039618523, 0.0002545912
0.8551401110, 0.3791884132,
20.0828812880, 20.0296087901,
0.0094685634, 0.0043723636,
20.0005783263, 20.0003985961,
20.0000256140
BBW (25/19) 1.7566 0.7791080241, 0.4354390791,
20.0576009944, 20.1095644608,
0.0288004972, 0.0347566893,
20.0082287135, 20.0079698474,
0.0010285892, 0.0008919304
0.8212708854, 0.3928295002, 20.0770085626,
20.0364590962, 0.0213472550, 20.0019923591,
20.0029960949, 20.0016882230,0.0023670737,
0.0009164388, 20.0008375691,
20.0000528700,0.0000458457
www.ietdl.org
incorporated into context-based entropy coding in order to
compare their performance. Here each image is
decomposed up to six scales with the wavelet transform.
We carry out a series of experiments to evaluate the
suitability of BBW17/7, BBW17/11, BBW17/15 and
BBW25/19 for image compression. Table 3 shows that
PSNR results at the rate of compression is 1:16. PSNR of
reconstructed images has a little increase, and BBW17/11
has the best performance. The detailed comparison of
PSNR is listed in the following Table 3. BBW17/11 and
Fig. 2 CDF9/7 and BBW 15/13 for low-pass lters of analysis
a CDF9/7 and BBW15/13, BBW17/7, BBW17/11, BBW17/15 for low-pass lters of analysis
b CDF9/7 and BBW15/13 for low-pass lters of synthesis
c CDF9/7 and BBW17/7 for low-pass lters of analysis
d CDF9/7 and BBW17/7 for low-pass lters of synthesis
e CDF9/7 and BBW17/11 for low-pass lters of analysis
f CDF9/7 and BBW17/11 for low-pass lters of synthesis
g CDF9/7 and BBW17/15 for low-pass lters of analysis
h CDF9/7 and BBW17/15 for low-pass lters of synthesis
Fig. 3 Energy percentage comparison between CDF9/7 and BBW17/11
a Level 1
b Level 2
c Level 3
d Level 4
www.ietdl.org
CDF9/7 have approximately same time expenditure and
computational complexity for the compression programme
of the image.
Figs. 5 and 6 are reconstructed images of city and Barb by
applying BBW15/13, BBW17/7, BBW17/11, BBW17/15
and BBW25/19, respectively. As can been seen from the
following reconstructed images, the contour on the houses
and edges of the road produced by BBW15/13, BBW17/7,
BBW17/11, BBW17/15, BBW15/13 and BBW25/19 are
less distorted by ringing effects and the abundance in
textures of remote images are restored perfectly.
6 Conclusions and future research directions
The most signicant research in this paper can be concluded
as follows: we present a general framework of construction of
Fig. 4 Original remote-sensing images
a Beijing
b Airport
c Brussels
d Toulouse
e City
f Factory
g San Francisco
Table 3 PSNR of the compressed images
Test images CDF9/7 BBW15/13 BBW17/7 BBW17/11 BBW17/15 BBW25/19
city 23.93 24.07 24.08 24.16 24.07 24.11
factory 21.52 21.65 21.63 21.79 21.66 21.69
Toulouse 26.50 26.52 26.43 26.66 26.54 26.62
airport 23.39 23.42 23.40 23.47 23.42 23.41
San Francisco 24.67 24.68 24.67 24.82 24.68 24.78
Brussels 25.62 25.69 25.62 25.78 25.70 25.69
Beijing 25.86 26.95 26.91 27.01 26.96 26.87
Gold Hill 33.41 33.45 33.38 33.52 33.48 33.40
barb 33.58 34.03 34.29 34.65 34.02 34.46
www.ietdl.org
biorthogonal wavelets based on Bernstein bases along with
theory analysis and application. The presented framework
possesses the largest possible regularities and the required
vanishing moments. We propose an efcient technique that
generates a wide range of new biorthogonal symmetric
wavelet transforms. The realisation of the construction of
arbitrary odd lengths lters is achieved. By this framework,
a new family of parametric biorthogonal wavelet lters with
symmetry are constructed. The parameterisation is a good
strategy to obtain biorthogonal wavelet transforms with
more attractive features. In this paper, an optimal model of
FIR aiming at image compression is brought forward. We
Fig. 5 Reconstructed images of city by applying
a CDF9/7
b BBW15/13
c BBW17/7
d BBW17/11
e BBW17/15
f BBW25/19
Fig. 6 Reconstructed images of BARB by applying
a CDF9/7
b BBW15/13
c BBW17/7
d BBW17/11
e BBW17/15
f BBW25/19
www.ietdl.org
optimise the presented parametric biorthogonal wavelet lters
with the optimal model and obtain BBW17/11 with excellent
compression potential. We demonstrate the performance of
the new family of lters given in this paper for image
compression with very encouraging results.
Motivated by the observed performance improvement, the
following research areas have been identied to be promising.
We will research the construction of contourlet transform
[25], an efcient directional multiresolution image
representation. One of the advantages of the contourlet
transform is that the basis function is anisotropic, which
overcomes the shortcoming of the basis function of wavelet
transform which has vertical and horizontal directions only.
Therefore the contourlet transform can represent 2-D
singular edges of images more efciently. We will present a
new framework of the construction of contourlet transform
by presented Bernstein biorthogonal wavelet lters in the
future. Based on this, we will research remote-sensing
images fusion, compression and feature extraction
techniques based on the new contourlet transform.
7 Acknowledgments
The authors would like to thank the Associate Editor and
anonymous reviewers for their constructive comments and
suggestions, which have lead to a signicantly improved
manuscript. This research was supported by the National
Natural Science Foundation of China under grant 60775018
and National Key Basic Research Program (973) of China
under grant 2009CB724001.
8 References
1 Cohen, A., Daubechies, I., Feauveau, J.C.: Biorthogonal bases of
compactly supported wavelets, Commun. Pure Appl. Math., 1992, 45,
pp. 485560
2 Chui, C.K., Wang, J.: On compactly supported spline wavelets and a
duality principle, Trans. Am. Math. Soc., 1992, 330, pp. 903915
3 Geronimo, J.S., Hardin, D.P., Massopust, P.R.: Fractal
functions analyses and wavelets expansions based on several scaling
functions, J. Approx. Theory, 1994, 78, pp. 373401
4 Shen, H.J.Z.: Compactly supported (bi)orthogonal wavelets generated
by interpolatory renable functions, Adv. Comput. Math., 1999, 11,
pp. 81104
5 Cohen, A., Daubechies, I.: A stablity criterion for biorthogonal wavelet
bases and their related subband coding scheme, Duke Math. J., 1992,
68, pp. 313335
6 Chui, C.K., Li, C.: A gengerl framework of multivariate wavelets with
duals, Appl. Comput. Harmon. Anal., 1994, 1, pp. 368390
7 Ansari, R., Kim, C.W., Dedovic, M.: Structure and design of two-
channel lterbanks derived from a triplet of halfband lters, IEEE
Trans. Circuits Syst. II, 1999, 46, pp. 14871496
8 Chui, C.K., Stockler, J., Ward, J.D.: On compactly supported box-
spline wavelets, Approx. Theory Appl., 1992, 8, pp. 368390
9 Cohen, A., Grochenging, K., Villemoes, L.: Regularity of multivariate
renable function, Constr. Approx., 1999, 15, pp. 241255
10 He, W., Lai, M.J.: Construction of bivariate compactly supported box
spline wavelets with arbitrarily high regularities, Appl. Comput.
Harmon. Anal., 1999, 6, pp. 5374
11 Cooklev, T., Nishihara, A., Sablatash, M.: Regular orthonormal and
biorthogonal wavelets lters, Signal Process., 1997, 57, pp. 121137
12 Antonini, M., Barlaud, M., Mathieu, P., Daubechies, I.: Image coding
using wavelet transform, IEEE. Trans. Image Process., 1992, 2,
pp. 205220
13 Vetterli, M., Herley, C.: Wavelets and lter banks: theory and design,
IEEE Trans. Acoust. Speech Signal Process., 1992, 40, pp. 22072232
14 Daubechies, I.: Ten lectures on wavelets (SIAM, Philadelphia, PA,
1992)
15 He, W.J., Lai, M.J.: Construction of trivariate compactly supported
biorthogonal box spline wavelets, J. Approx. Theory, 2003, 120,
pp. 119
16 Dong, B., Shen, Z.W.: Construction of biorthogonal wavelets from
pseudo-splines, J. Approx. Theory, 2006, 138, pp. 211231
17 Zhang, J.K., Davidson, T.N., Luo, Z.Q., Max Wong, K.: Design of
interpolating biorthogonal multiwavelet systems with compact
support, Appl. Comput. Harmon. Anal., 2001, 11, pp. 420438
18 Averbuch, A.Z., Zheludev, V.A.: Construction of biorthogonal discrete
wavelets transforms using interpolatory spline, Appl. Comput. Harmon.
Anal., 2002, 12, pp. 2556
19 Villasenor, J.D., Belzer, B., Liao, J.: Wavelet lter evaluation for image
compression, IEEE Trans. Image Process., 1995, 4, pp. 10531060
20 Tay, D.B.H.: A novel approach to the design of the class triplet
halfband lter banks, IEEE Trans. Circuits Syst. II, Exp. Briefs, 2004,
51, pp. 378383
21 Boyer, R.P.: Generalized Bernstein polynomials and symmetric
functions, Adv. Appl. Math., 2002, 28, pp. 1739
22 Winger, L.L., Venetsanopoulos, A.N.: Biorthogonal nearly coiet
wavelet for image compression, Signal Process. Image Commun.,
2001, 16, pp. 859869
23 Nocedal, J., Wright, S.J.: Numberical optimization (Springer Science
Business Media, Inc., 1999)
24 Li, M.Q.: Basic theory and application of genetic algorithms (Beijing
Science Press, 2004)
25 Do, N., Vetterli, M.: The contourlet transform: an efcient directional
multiresolution image represent, IEEE Trans. Image Process., 2005,
14, (12), pp. 20912106
www.ietdl.org

Wavelets Based On Bernstein Bases IMAGE COMPRESSION

Transféré par

Informations du document

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Wavelets Based On Bernstein Bases IMAGE COMPRESSION

Transféré par

Droits d'auteur :

Formats disponibles

Published in IET Computer Vision

Received on 3rd September 2009

H(v) + H(v +p)

H(v +p) = 1 (10)

H(v) + H(v +p)

L, respectively (which are determined by

f(v) C(1 + |v|)

f(v) C(1 + |v|)

f(v) C(1 + |v|)

K. Assume that (10)

F(v), F(v) and

c will increase. The optimisation problem can be written as

The following Bernstein coefcients ensure that the function

Restriction (58) assures that the decomposing and reconstructing

d(N + 2K + 1)) (61)

Restriction (62) assures that the decomposing and

IET Comput. Vis., 2011, Vol. 5, Iss. 1, pp. 5067 57

c. If the above constrained optimisation problem (65) is

c dened by (8) and (9) are

c dened by (8) and (9) are

c dened by (8) and (9)

c dened by (8) and (9) are 2

c dened by (8) and (9) are 4

c dened by (8) and (9)

c dened by (8) and (9) are 2

c dened by (8) and (9)

c dened by (8) and (9)

c dened by (8) and (9)

In order to nd out the interval that b belongs to satisfying the

From Fig. 1b, we know b [

(94 517 766/11)b

(12 002 256/11)b

f (b) reaches a minimum. So the best parameter (39) of

f (b) around b 1.2

f (b) + f (b) around b 1.2

Vous aimerez peut-être aussi