Journal of Computational Information Systems 11: 15 (2015) 53475352

Available at http://www.Jofcis.com

Decomposition and Reconstruction Algorithms for

Framelet Packets
Dayong LU ,

Meiyu XU

Institute of Applied Mathematics, College of Mathematics and Information Science, Henan University,
Kaifeng 475001, China

Abstract
Wavelet packets based on orthonormal wavelet bases have been well studied in theory and applications,
since they can provide adaptive choice from a library of wavelet bases for a wide range of practically
oriented tasks. But the study of wavelet frame packet have been less involved. In this paper, we give the
decomposition and reconstruction algorithms for framelet packets constructed from the unitary extension
given by Ron and Shen.
Keywords: Framelet Packets; Extension Principles; Fast Algorithms; Wavelet Frames

Introduction

Wavelet frames are nowadays indispensabel as a multiscale system in the applications of redundant
dyadic wavelet systems, since they provide the same decomposition and reconstruction formula as
orthonormal wavelet bases. Of all the wavelet frames, tight wavelet frames are the easiest to use.
Tight wavelet frames are dierent from orthonormal wavelet bases in one important respect; they
are (in general) redundant systems but with the same fundamental structure as wavelet systems.
To mention only a few references on tight wavelet frames, the reader is referred to [1-3].
However, wavelet frames provide poor frequency localization in applications. To overcome this
disadvantage, the concept of wavelet frames must be generalized to include a library of wavelet
frames, called framelet packets or wavelet frame packets.
The original idea of wavelet packets were introduced by Coifman, Meyer, and Wickerhauser in
[4, 5]. But the theory itself is worthy of further study. Some developments in the wavelet packets
theory should be mentioned, such as multiwavelet packets [6] on Rd , the non-tensor-product
version [7] of wavelet packets on Rd , the nonorthogonal version of wavelet packets [8] on R1 ,
the wavelet frame packets [9] on R1 and the higher dimensional version of wavelet frame packets

The work is supported by the Natural Science Foundation for the Education Department of Henan Province
of China (No. 13A110072), the Natural Science Foundation of Henan Province (No. 122300410381), and Henan
University Natural Science Foundation (No. 2011YBZR001).

Corresponding author.
Email address: dayonglu@163.com (Dayong LU).

15539105 / Copyright 2015 Binary Information Press

DOI: 10.12733/jcis11919
August 1, 2015

5348

D. Lu et al. /Journal of Computational Information Systems 11: 15 (2015) 53475352

[10] on Rd . Recently, using the so-called splitting trick given by Daubechies [11], Lu and Fan
in [1] constructed a class of tight framelet packets with 2Id -dilation for L2 (Rd ) from the unitary
extension principles given by Ron and Shen in [2]. In this paper, we consider the decomposition
and reconstruction algorithms for framelet packets constructed in [1].

Preliminaries

We begin by introducing some notation and denitions we shall use.

1

H denotes a separable Hilbert space with inner product , and norm x = x, x 2 for each
x H. Let J be a numerable index set. A countable system {j }jJ in H is called a frame for H
if there exist constants A and B, 0 < A B < , such that

Ax2
|x, j |2 Bx2
(2.1)
jJ

holds for all x H. The greatest possible such A is the lower frame bound and the least possible
such B is the upper frame bound. If A = B, then the frame is called a tight frame.

Dene the Fourier transform f of f L1 (R) L2 (R) by f() = f (x)eix dx.

R

Translation by y R is denoted by Ty , i.e., if f : R C is a function, then Ty f : R C is

the function dened by (Ty f )(t) = f (t y). Further, f L2 (R), the unitary dyadic dilation

j
operator D id dened on L2 (R) as (Df )(x) = 2f (2x), and, hence, (Dj f )(x) = 2 2 f (2j x) for all
j Z.
In the following we shall briey describe how to construct multiresolution analysis (MRA)based tight wavelet frames through so-called extension principles, see [3, 4]. We refer the reader
to [3] for a more detailed discussion of MRA-based wavelet frames.
Let = {0 , 1 , . . . , L } be a sequence of 2Z-periodic essentially bounded functions. Assume

that 0 generates the renable function (2)

= 0 ()()
satisfying

+ 2k)|2 B 2 for some B.

= 1 and
|(
(2.2)
lim ()
0

kZ

We associate the wavelets to as follows

bl (2) = l ()(),

l = 1, 2, . . . , L.

(2.3)

We often write = { 1 , 2 , . . . , L }. The spectrum () associated to is dened as

+ 2k) = 0,
() = { [, ] : (

for some k Z}.

(2.4)

Let be a nite subset of L2 (R). The dyadic wavelet system generated by is the family
X() = {Dj Tk : ; j, k Z}.

(2.5)

The following theorem proved in [3] is the main tool to create tight wavelet systems, the theorem
is called the Unitary Extension Principle (UEP).

D. Lu et al. /Journal of Computational Information Systems 11: 15 (2015) 53475352

5349

Proposition 2.1 (UEP) Let be the combined mask of an MRA that satises the above
assumptions. If (), and if {0, } is such that + (), then

L
1, if = 0,

l ()l ( + ) =
0 ()0 ( + ) +

l=1
0, otherwise.
Then the wavelet system X() dened by is a tight wavelet frame.
Remark 2.2 In many (most) interesting cases the spectrum () is equal to [, ]. For
example, if the integer translates of the scaling functions generates a Riesz sequence, this is the
case.
A wavelet system X() is said to be MRA-based if it is generated by OEP or UEP. The
elements in X() are called framelets. The collection is called the mother wavelet set, and
the elements in are called mother wavelets. We call 0 the renement mask and functions l ,
l = 1, 2, . . . , L, wavelet masks. We call the sequence = {0 , 1 , . . . , L } the combined mask of
the MRA.

Basic Framelet Packets and Their Fast Algorithms

Suppose = { 1 , 2 , . . . , L } is a tight frame generated by UEP associated with the renable

function and the combined mask = {0 , 1 , . . . , L }.
Let 0 = . The basic framelet packets n (x), n = 0, 1, . . ., associated with the renable
function are dened recursively by
n(L+1)+l
\ (2) = l ()c
n (),

l = 0, 1, . . . , L.

(3.1)

When n = 0 and l = 0 in (3.1) we obtain the renable function by its Fourier transform

c0 (2) = 0 ()c
0 ().

(3.2)

When n = 0 and l {1, 2, . . . , L} we deduce that

bl (2) = l ()c
0 (),

(3.3)

which shows that l = l , l = 1, 2, . . . , L.

An important dierence between wavelet frames and framelet packets is the decomposition
structure. We can depict these wavelet frame decompositions when L = 2 as given in Fig. 1, but
framelet packets decompositions with compactly supported tight wavelet frames when L = 2 as
given in Fig. 2.
Dene the subspaces of L2 (R) by
Ujn := span{Dj Tk n : k Z},

j Z, n = 0, 1, 2, . . . .

(3.4)

We have the following relationships about the subspaces Ujn , j Z and n = 0, 1, 2, . . ..

Theorem 3.1 [1] For n = 0, 1, 2, . . . we have
n(L+1)

n
= Uj
Uj+1

n(L+1)+1

+ Uj

n(L+1)+L

+ + Uj

j Z,

(3.5)

5350

D. Lu et al. /Journal of Computational Information Systems 11: 15 (2015) 53475352

=


===


==



=




1
2
0=


===


==



=


j 0 TTTTT
TTTT
jjjj
j
j
j
TTTT
jj
j
j
TTTT
j
jj
j
TTTT
j

j
j
j
)
0 =uj
1=
2=


=


=


==
==
==












==


==


==








==


=


=















Fig. 2: Framelet packet decomposition

Fig. 1: Wavelet frame decomposition

where Ujn is dened by (3.4).

Associated with the sequence of subspaces {Ujn } we have the projections of L2 (R) onto Ujn
given by

f, Dj Tk n Dj Tk n f L2 (R).
Pjn f =
kZ

We can easily get

n(L+1)+l

Pj

n
f = Pj+1
f

f L2 (R).

(3.6)

l=0

From Theorem 3.1, we know that f L2 (R) can be written as

f, Dj Tk n Dj Tk n .
f=

(3.7)

kZ

Thus, we have the coecients

j
cn,j
k = f, D Tk n ,

j, k Z, n = 0, 1, 2, . . . ,

(3.8)

and what we want to do is to decompose the sequence

cn,j = {cn,j
k : k Z}

(3.9)

which belongs to l2 (Z).

We now continue with the decomposition algorithm. This is achieved by the combined mask
= {0 , 1 , . . . , L } and (3.1). For convenience, we write l as

l im
e , l = 0, 1, 2, . . . , L
(3.10)
l () =
m
mZ

So we have

x
1
l
n(L+1)+l ( ) =
m
n (x + m),
2
2
mZ

l = 0, 1, 2, . . . , L.

Hence, for l = 0, 1, 2, . . . , L,
j1
2

n(L+1)+l (2j1 x k)
j+1
l
= 2 2
n (2j x 2k + m).
m

Dj1 Tk n(L+1)+l (x) = 2

mZ

(3.11)

D. Lu et al. /Journal of Computational Information Systems 11: 15 (2015) 53475352

5351

That is,
Dj1 Tk n(L+1)+l (x) =

l j
2
m D T2km n (x),

j, k Z, l {0, 1, 2, . . . , L}.

(3.12)

mZ

It follows that, for all l = 0, 1, 2, , L,

n(L+1)+l,j1

ck

l j
= f, Dj1 Tk n(L+1)+l = f, 2
m D T2km n

mZ
j
l
l cn,j
= 2
m f, D T2km n = 2
m
2km .
mZ

(3.13)

mZ
n(L+1)+l

This shows that the coecients cn(L+1)+l,j1 of the lowest resolution Uj1
can be obtained
n,j
n
from the coecients c of the Uj and the lter coecients. For n and j xed, the right-hand
side of (3.11) is the convolution of the sequences

l } and

l = { 2m
cn,j = {cn,j
m },
followed by retaining only the convolution entries that appear in the even places. The process to
obtain the decomposition algorithm when L = 2 is given in Fig. 3.
cn,j NN

c3n,j1

rr
rrr
r
r

rx rr

NNN
NNN
NNN
&

c3n+1,j1

c3n+2,j1

Fig. 3: Decomposition algorithm for framelet packets

In the above we get the fast framelet packet decomposition algorithm, and we now treat the
problem of reconstruction cn,j from the sequences cn(L+1)+l,j1 , l = 0, 1, . . . , L.
Let us denote by
C n,j () =

ik
cn,j
k e

kZ

the fourier series of cn,j for all j Z and n = 0, 1, 2, . . .. With some (but not much) eort, one
shows that (3.13) can be written on the frequency domain as
n(L+1)+l,j1

2C
() = l ( )C n,j ( ) + l ( + )C n,j ( + ).
2
2
2
2

(3.14)

Now substitute 2 for , and then multiply each side of the Eq. (3.14) by l (), and sum over all
l. Then
L
L
L

n(L+1)+l,j1
2 n,j
2
l ()C
(2) =
|l ()| C () +
l ()l ( + )C n,j ( + ).
l=0

l=0

(3.15)

l=0

By the lter conditions we have

L

2
l ()C n(L+1)+l,j1 (2) = C n,j (),
l=0

(3.16)

5352

D. Lu et al. /Journal of Computational Information Systems 11: 15 (2015) 53475352

which implies that

cn,j
k

L

l
= 2
k2m
cn(L+1)+l,j1

(3.17)

l=0 mZ

hold for all j, k Z and n = 0, 1, 2, . . .. Then Eq. (3.17) is the so-called fast framelet packet
reconstruction algorithms.
Eq. (3.17) allows us to add the sequences cn(L+1)+l,j1 to obtain cn,j , and the reconstruction
algorithm when L = 2 given in Fig. 4.
c3n,j1LL

c3n+1,j1

LLL
LLL
LLL
&

cn,j

c3n+2,j1

p
ppp
p
p
ppp
px pp

Fig. 4: Reconstruction algorithm for framelet packets

Acknowledgement
We would like to thank the referees for their helpful comments and suggestions.

References
[1]

D.Y. Lu, Q.B. Fan, A class of tight framelet packets, Czechoslovak Mathematical Journal 61(3)
(2011) 623639.
[2] A. Ron, Z. Shen, Ane systems in L2 (Rd ): the analysis of the analysis operator, J. Functional
Anal. Appl. 148 (1997) 408447.
[3] O. Christensen, An Introduction to Frames and Riesz Bases, Birkhauser, Boston, 2003.
[4] R.R. Coifman, Y. Meyer, M.V. Wickerhauser, Wavelet analysis and signal processing. In: M.B.
Ruskai et al., eds., Wavelets and Their Applications. Jones and Bartlett, Boston, 1992, 153178.
[5] R.R. Coifman, Y. Meyer, M.V. Wickerhauser, Size properties of wavelet packets. In: M.B. Ruskai
et al. eds., Wavelets and Their Applications. Jones and Bartlett, Boston, 1992, 453470.
[6] B. Behera, Multiwavelet packets and frame packets of L2 (Rd ), Proc. Indian Acad. Sci. (Math. Sci.)
111 (2001) 439463.
[7] Z. Shen, Non-tensor product wavelet packets in L2 (Rs ), SIAM J. Math. Anal. 26(4) (1995) 1061
1074.
[8] C. Chui, C. Li, Non-orthogonal wavelet packets, SIAM J. Math. Anal. 24(3) (1993) 712738.
[9] D. Chen, On splitting trick and wavelet frame packets, SIAM Math. Anal. 31 (2000) 726-739.
[10] R. Long, W. Chen, Wavelet basis packets and wavelet frame packets, J. Fourier Anal. Appl. 3(3)
(1997) 239256.
[11] I. Daubechies, Ten Lectures on Wavelets, CBMS-NSF, SIAM, 1992.
[12] X.Y. Yang, D.Y. Lu, Frames and Their Applications in Signal Denoising, Journal of Computational
Information Systems, 10(7) (2014) 28592864.