- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Mathematical Problems in Engineering

Volume 2012 (2012), Article ID 640789, 37 pages

http://dx.doi.org/10.1155/2012/640789

## Minimum-Energy Multiwavelet Frames with Arbitrary Integer Dilation Factor

^{1}Institute of Information and System Science, Beifang University of Nationalities, Yinchuan 750021, China^{2}School of Information Science & Technology, East China Normal University, Shanghai 200241, China

Received 15 May 2012; Accepted 26 June 2012

Academic Editor: Carlo Cattani

Copyright © 2012 Yongdong Huang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

In order to organically combine the minimum-energy frame with the significant properties of multiwavelets, minimum-energy multiwavelet frames with arbitrary integer dilation factor are studied. Firstly, we define the concept of minimum-energy multiwavelet frame with arbitrary dilation factor and present its equivalent characterizations. Secondly, some necessary conditions and sufficient conditions for minimum-energy multiwavelet frame are given. Thirdly, the decomposition and reconstruction formulas of minimum-energy multiwavelet frame with arbitrary integer dilation factor are deduced. Finally, we give several numerical examples based on B-spline functions.

#### 1. Introduction

Wavelets transform has been widely applied to information processing, image processing, computer science, mathematical physics, engineering, and so on. As you all know, it is not possible for any orthogonal scaling wavelet function with compact support to be symmetric, except for the Haar wavelets. In 1993, Goodman and Lee [1] established the multiwavelet theory by introducing the multiresolution analysis (MRA) with multiplicity , and gave the spline multiwavelet examples. Using the fractal interpolation technology, Geronimo et al. [2] constructed the GHM multiwavelet which have short support, (anti)symmetry, orthogonality and vanishing moment with order 2 in 1994. From then on, multiwavelet has been a hot research area. In 1996, Chui and Lian [3] reconstructed the GHM multiwavelet without using the fractal interpolation technology, and they gave the general method on constructing the multiwavelet with short support, (anti)symmetry, and orthogonality. After that, Plonka and Strela [4] used two-scale similarity transforms (TSTs) to raise the approximation order of multiwavelet and gave the important conclusions of the two-scale matrix symbol's factorizations and so on. And, by Lawton et al. [5], the construction of multiwavelet has been transformed into matrix extension problem in 1996. The construction theory of multiwavelet had a great development after Jiang [6, 7] putting forward a series of effective methods. Whether wavelets or multiwavelet, they require that the integer shifts of the scaling function form Riesz bases, orthogonal basis, or biorthogonal basis for its span space. And this will cause some defects: (1) the computational complexity can be increased during the course of decomposition and reconstruction; (2) the numerical instability can be caused during the procedure of reconstructing original signal (3) in the biorthogonal case, the analysis filter bank can not replaced by the synthetic filter bank, and vice verse.

Fortunately, besides orthogonal wavelets and multiwavelet minimum-energy frames can effectively avoid the difficulty which is caused by different bases functions during the course of decomposition and reconstruction, still use the same wavelets both for analysis and synthesis. The theory of frames comes from signal processing firstly. It was introduced by Duffin and Schaffer to deal with problems in nonharmonic Fourier series. But in a long time after that, people did not pay enough attention to it. After Daubechies et al. [8] defined affine frames (wavelets frames) by combining the theory of continuous wavelets transforms and frames while wavelets theory was booming, people start to research frames and its application again. Benedetto and Li [9] gave the definition of frame multiresolution analysis (FMRA), and their work laid the foundation for other people's further investigation. Frames cannot only overcome the disadvantages of wavelets and multiwavelet, but also increase redundancy properly, then the numerical computation become much more stable using frames to reconstruct signal. With well time-frequency localization and shift invariance, frames can be designed more easily than wavelets or multiwavelet. Nowadays frames have been used widely in theoretical and applied domain [10–22], such as signal analysis, image processing, numerical calculation, Banach space theory, Besov space theory, and so on.

In 2000, Chui and He [11] proposed the concept of minimum-energy wavelets frames. The minimum-energy wavelets frames reduce the computational complexity, maintain the numerical stability, and do not need to search dual frames in the decomposition and reconstruction of functions (or signals). Therefore, many people pay a lot of attention to the study of minimum-energy wavelets frames. Huang and Cheng [15] studied the construction and characterizations of the minimum-energy with arbitrary integer dilation factor. Gao and Cao [18] researched the structure of the minimum-energy wavelets frames on the interval and its application on signal denoising systematically. Liang and Zhao [23] studied the minimum-energy multiwavelet frames with dilation factor 2 and multiplicity 2 and gave a characterization and a necessary condition of minimum-energy multiwavelet frames. Unfortunately, the authors did not give the sufficient conditions of minimum-energy multiwavelet frames. In fact, people need to pay close attention to the existence of sufficient conditions of minimum-energy wavelet frames in most cases. On the other hand B-spline functions which are the convolution of Shannon wavelets [24–26]. It can be seen that also Shannon wavelets are minimum-energy wavelets. In this paper, in order to organically combine the minimum-energy frame with the significant properties of multiwavelet, minimum-energy multiwavelet frames with arbitrary integer dilation factor are studied. Firstly, we define the concept of minimum-energy multiwavelet frame with arbitrary dilation factor and present its equivalent characterizations. Secondly, some necessary conditions and sufficient conditions for minimum-energy multiwavelet frame are given; Thirdly, the decomposition and reconstruction formulas of minimum-energy multiwavelet frame with arbitrary integer dilation factor and the multiplicity are deduced. Finally, we give several numerical examples based on B-spline functions.

Let us now describe the organization of the material that as follows. Section 2 is preliminaries and basic definitions. Section 3 is main result. In Section 4, we give the decomposition and reconstruction formulas of minimum-energy multiwavelet frame. Section 5 is numerical examples.

#### 2. Preliminaries and Basic Definitions

Throughout this paper, let , , and denote the set of integers, real numbers, and complex numbers respectively; with , , .

A multiscaling function vector (refinable function vector) is a vector-valued function: which satisfies a two-scale matrix refinement equation of the form: is called the multiplicity of , the integer is said to be dilation factor. The recursion coefficients are matrices.

The Fourier transform of the formula (2.2) is where is the symbol of the matrix sequence .

The multiresolution analysis (MRA) with multiplicity and dilation factor generated by is defined as where , and the sequence of closed subspace of has the following properties:(1) , .(2) , ;(3) , for all ;(4) , for all ;(5) forms a Riesz basis of ;

*Definition 2.1. *A finite family vector-valued function , generates a multiwavelet frames for , if there exist constants such that for any
where .

*Definition 2.2. *A nested subspace generated by a multiscaling vector-valued function satisfies formula (2.5) and its additional conditions, then finite family vector-valued function generates a frame multiresolution analysis associated the vector-valued function , if the finite family , satisfies the formulation (2.6) with , ; .

*Definition 2.3. *Let , with , , continuous at 0 and , be a multiscaling vector-valued function that generates the nested subspace in the sense of (2.5). Then a finite family vector-valued function is called a minimum-energy multiwavelet frames associated with , if for for all

*Remark 2.4. *By the Parseval identity, minimum-energy multiwavelet frames must be tight frames for with frames bound equal to 1.

*Remark 2.5. * The formula (2.7) is equivalent to the following formulas:
The interpretation of minimum energy will be clarified later.

#### 3. Main Result

In this section, we will give a complete characterization of minimum-energy multiwavelet frames associated with some given multiscaling vector-valued function in term of their two-scale symbols. Let with , , continuous at 0, and be a multiscaling vector-valued function which satisfies (2.2)–(2.5). Consider , then where , are matrices. Using Fourier transform on (3.1), we can get their symbols as follows:

With , , , we formulate the block matrix as follows: and the denotes the complex conjugate of the transpose of .

The following theorem presents the equivalent characterizations of the minimum-energy multiwavelet frames with arbitrary integer dilation factor.

Theorem 3.1. *Suppose that every element of the symbols, , , , in (2.4) and (3.2) is a Laurent polynomial, and the multiscaling vector-valued function associated with generates a nested subspace . Then the following statements are equivalent:*(1)* is a minimum-energy multiwavelet frames associated with :*(2) *(3)**where
*

* Proof. *By using the two-scale relations (2.2) and (3.1) and notation for for all , (2.8) can be written as
On the other hand, (3.4) can be reformulated as
and it is equivalent to
With , and
the formulation (3.9) is equivalent to

Using the properties of roots of unity, the Vandermonde matrix and Cramer's rule, the above equation is equivalent to

We multiply the identities in (3.12) by , , respectively, where , to get
Hence, (3.12) is equivalent to
or
which can be reformulated as
By using the two-scaling relations (2.2) and (3.1), we can rewrite (3.16) as

In conclusion, the proof of Theorem 3.1 reduces to the proof of the equivalence of (3.5), (3.7), and (3.17).

It is obvious that (3.5)*⇒*(3.17)*⇒*(3.7). To show (3.7)*⇒*(3.5), let be any compactly supported function. By using the properties that for every fixed , expect for finitely many , then the functional
just has finite nonzero for , .

Using the property of Fourier transform, we obtain
Since is nontrivial function, then , , , in other words, we have

Then the series in the above equation is a finite sum and hence represents a compactly supported function in . By choosing to be this function, it follows that
which implies that the trigonometric polynomial is identically equal to so that , for all .

We complete the proof of Theorem 3.1 because the set of compactly supported functions is dense in .

Theorem 3.1 characterizes the necessary and sufficient condition for the existence of the minimum-energy multiwavelet frames associated with . However it is not a good choice to use this theorem to construct the minimum-energy multiwavelet frames. For convenience, we need to present some sufficient conditions in terms of the symbols.

In this paper, we just discuss the minimum-energy frames with compact support, that is, every element of symbols is Laurent polynomial.

Theorem 3.2. * A compactly supported refinable vector-valued function , with continuous at 0 and . Let be the minimum-energy multiwavelet frames associated with it, then
*

*Proof. *Using Theorem 3.1, it is clear to show that the -norm of every row vector of the symbol for is less than 1, in other words, (3.22) is valid. In order to prove (3.23), let . First, we set
and the rest of removed as . Then we can reformulate (3.4) as
or equivalently, , which is a nonnegative definite Hermitian matrix for so that
and this gives

In fact, we have
then
and it gives , for all , that is,
The proof of Theorem 3.2 is completed.

*Remark 3.3. *By the proof of Theorem 3.2, we know that the restriction in Theorem 3.2 on the two-scale symbol of a refinable vector-valued function is a necessary condition for the existence of a minimum-energy frames associated with via the rectangular unitary matrix extension approach, even if is not compactly supported.

*Remark 3.4. *For a certain compactly supported refinable vector-valued function, it cannot exist in minimum-energy frames.

We write , , in their polyphase forms:
where , , ; are matrices and their every element is Laurent polynomial. Observe that

Therefore, we have
and it follows from (3.4), that
And it is easy to obtain (3.35) from (3.4).

For convenience, we denote . Next, we present some theorems to give several sufficient conditions for existence of minimum-energy multiwavelet frames.

Theorem 3.5. *A compactly supported vector-valued function with continuous at 0 and , its symbol satisfies
**
Then there exist minimum-energy multiwavelet frames associated with .*

* Proof. *Let be the polynomial components of , that is,

Using (3.34) and (3.35), we can get

Then we can find real numbers , with
By the Riesz lemma [27, Lemma 6.13], we can find Laurent polynomials satisfying

For every , using the method in the reference [15,Theorem 3] on the unit vector
we can get a matrix
which satisfies .

Therefor, the block matrix
satisfies .

We can get matrix which satisfies , after adjusting the rows of and removing the last column of it, and the rows in the front of matrix are the polynomial components of the symbol .

Then we complete proof of Theorem 3.5 using the formulas (3.34), (3.32), and Theorem 3.1.

Theorem 3.5 requests the sum of -norm for every row in the matrix symbol associated with the vector-valued function . Then we can find a minimum-energy multiwavelet frames associated with the function using the theorem. The condition in Theorem 3.5 is too stringent compared with the sufficient conditions in Theorem 3.2. We can get the following theorem by strengthening the structure of the matrix symbol .

Theorem 3.6. *Let with continuous at 0 and a compactly supported multiscaling vector-valued function. If the block matrix
**
satisfies standard orthogonal by row, then there exist a minimum-energy multiwavelet frames associated with the function .*

* Proof. *Let , are the polynomial components of , that is,
with (3.34) and (3.35), we can know that the block matrix
satisfies standard orthogonal by row.

Now, we use the method in the reference [15, Theorem 3] to deal with the first unit row vector in the matrix . And, we can find a paraunitary matrix which satisfies and
with also a matrix standard orthogonal by row.

By mathematical induction, there are paraunitary matrices satisfying
then the matrix is equivalent to the front rows in the paraunitary matrix .

Using the formulation (3.34), (3.35), and Theorem 3.1, we completed the proof of this theorem.

Theorem 3.6 requests that the multiscaling vector-valued function's symbol satisfies standard orthogonal by row. This means the -norm of every row in is 1. If the -norm of every row in is less than 1 strictly, and we can find a matrix to make the block matrix satisfy standard orthogonal by row, then there exist minimum-energy multiwavelet frames associated with the function .

Corollary 3.7. *Let with continuous at 0 and a compactly supported multiscaling vector-valued function. If the -norm of every row in is less than 1 strictly, that is,
**
and there exists a matrix to make (3.49) satisfy standard orthogonal by row, then there exist minimum-energy multiwavelet frames associated with the function .*

By Theorem 3.1, if we can find some row vectors with multiplicity and the matrix in (3.3) formed by the vectors and the symbol of satisfies standard orthogonal by column, there exist a minimum-energy multiwavelet frames associated with , and vice versa. However, the number of columns in the symbol of is so larger, that it is not easy to find the frames using Theorem 3.1. Corollary 3.7 requests some column vectors with multiplicity and the matrix in (3.49) formed by the vectors and the polynomial components of satisfies standard orthogonal by row, then we can find a minimum-energy frames associated with . Obviously, the problem is vastly simplified.

For some multiscaling vector-valued function with small multiplicity which satisfies the conditions in Theorem 3.2, the matrix that makes the block matrix in (3.49) satisfied standard orthogonal by column can be found using the method of undetermined coefficients. We will give some examples later.

#### 4. Decomposition and Reconstruction Formulas of Minimum-Energy Multiwavelet Frames

Suppose the multiscaling vector-valued function has an associated minimum-energy multiwavelet frames . Now, we consider the projection operators of onto the nested subspace defined by Then the formula (2.8) can be rewritten as In other words, the error term between consecutive projections is given by the frame expansion:

Suppose that the error term has other expansion in terms of the frames , that is, Then by using both (4.3) and (4.4), we have and this derives

This inequality means that the coefficients of the error term in (4.3) have minimal -norm among all sequences which satisfy (4.4).

We next discuss minimum-energy multiwavelet frames decomposition and reconstruction. For any , define the vector coefficients as follows: The inner product of with vector-valued , , is a vector, its every component is the inner product of with the corresponding component of , , .

*(1) Decomposition Algorithm*

suppose the vector coefficients are known. By the two-scale relations (2.2) and (3.1), we have
Then, the decomposition algorithm is given as

*(2) Reconstruction Algorithm*

from (3.16), it follow that
Taking the inner products on both sides of this equality, we get

#### 5. Numerical Examples

By Theorem 3.6, the orthogonal multiwavelet always have minimum-energy multiwavelet frames associated with them, for example, DGHM multiwavelet and Chui-Lian multiwavelet. These examples are trivial. In this section, we will construct some minimum-energy multiwavelet frames in general sense.

It is well known that the th-order cardinal B-spline with dilation factor has the two-scale relation as follows:

In addition, if a scale wavelet satisfies the refinable function and let , then the vector-valued function satisfies (2.2) with some matrixes .

Below, upon these conclusions, using Theorem 3.5 and Corollary 3.7 in Section 3, the minimum-energy multiwavelet frames be presented with the dilation factors , , , respectively.

##### 5.1.

*Example 5.1. *With , the symbol of the B-spline is
Take , and the support of this function is . The function satisfies

Let , and
The coefficient matrixes in (5.5) are not unique.

And the symbol of has polyphase components as follows:
Take
which satisfies

Using Theorem 3.5, we can get matrix the following:
which satisfy the formula (3.35). Then we take symbols as

The graphs of and its minimum-energy frames are shown in Figure 1.

We may discover from Figure 1 that every component of minimum-energy frames is (anti)symmetrical.

*Example 5.2. *With , the symbol of the B-spline is
Take , and the support of this function is .(1) Let , and
The symbol of has polyphase components as follows:
Take
which satisfies . Using Theorem 3.5, we can get the following symbols:
Then, we get the minimum-wavelet frames associated with . The graphs of them are shown in Figure 2.

We can discover from Figure 2 that every component of the minimum-energy frames is (anti)symmetrical and smooth.(2) Take , which satisfies
and the symbol of this multiscaling vector-valued function has the following polyphase components:

Let
where denotes , and denotes , which satisfies . Using Theorem 3.5, we can get