Abstract
Due to resilience to background noise, stability of sparse reconstruction, and ability to capture local time-frequency information, the frame theory is becoming a dynamic forefront topic in data science. In this study, we overcome the disadvantages in the construction of traditional framelet packets derived by frame multiresolution analysis and square iterative matrices. We propose two novel approaches: One is to directly split known framelets again and again; the other approach is based on a generalized scaling function whose shifts are not a frame of some space. In these two approaches, the iterative matrices used are not square and the number of rows in the iterative matrix can be any integer number.
1. Introduction
The notion of wavelet packets was first introduced by Coifman, Meyer, and Wickerhauser [1]. A wavelet packet is a library from which various orthonormal bases can be picked. Wavelet packets can extract better time-frequency features than wavelets, so wavelet packets play an important role in the application of wavelets. Later, for the high-dimensional case, the tensor product wavelet packets were constructed by Chui and Li [2], whereas the non-tensor product wavelet packets were constructed by Shen [3].
As a generalization of wavelet packets, framelet packets was first constructed from frame multiresolution analyses (FMRA) [4,5,6]. Since generally the scaling function of FMRA is discontinuous in frequency domain, the derived framelet packets cannot possess nice time-domain localization. Moreover, the iterative matrix in the construction of framelet packets is square, and only when the matrix is unitary, the iterative process can be operated up to infinitely many times which can lead to framelet packet with finer and finer frequency bands.
In order to solve the above problems, we propose two approaches. One approach is to abandon multiresolution structure used in traditional construction of framelet packet. Instead, we will directly split framelets by various iterative matrices. The other approach is to remove the use of scaling function in FMRA, i.e., it starts from a generalized scaling function whose shifts are not a frame of some space. In these two approaches, all the iterative matrices are not square and the number of rows in iterative matrix can be any integer number. The framelet packets constructed by us possess fine properties, including short supported, high approximation orders, symmetry, and smoothness.
2. Preliminaries
Denote the space of square-integrable functions on by and the space of periodic bounded function by . Denote the inner product by and the norm by . We define the Fourier transform of by
We denote the set of vertexes of the cube by . The notation is the Kronecker delta symbol, i.e., and .
Let be a sequence in . If there exists a such that
then is called a Bessel sequence for . If there exist such that
then is called a frame for with bounds A and B. If , then it is called a tight frame.
Let and
If the affine system is a frame for , then the set is called a framelet.
3. Splitting of Framelets
Recently, a lot of framelets with short supported, high approximation orders, symmetry, and smoothness were constructed [7,8,9,10,11,12,13]. In this section, we split these nice framelets by non-square iterative matrices to generate new framelets with better time-frequency localization.
Suppose that and the affine system is a frame for with bounds A and B. Let . With the help of these filters , the original functions are split into functions :
We will prove that the affine system is also a frame for .
Theorem 1.
Let and be a frame for with bounds A and B, and be defined in (1). Denote the matrix
The nonzero singular values of the matrix are denoted by
Again denote
and
Then is a frame for with bounds and .
Proof.
For convenience, we use the notation
Hence, for , we have
By the known Parseval Identity of Fourier series [5,14], we get
By (1), we have
Furthermore, we have
From this, we deduce that for any ,
where
Let , by (2), , so the quadratic form in (6) can be written into the matrix version
where the -dimensional column vector .
Noticing that is a positive semi-defined matrix, since are the nonzero singular values of the matrix W, the nonzero eigenvalues of are . Furthermore, there exists a unitary matrix U of order such that , where D is a diagonal matrix whose diagonal elements are . From this and (7), it follows that
We denote the column vector by . So we have . Since U is a unitary matrix, we have . Furthermore,
Again by (3), we get
By (9) and , we have
From this and (8), it follows that
Again by (5), we have
Since is a periodic function and
we have
From this and (10), it follows that
Summing the above inequalities over and , we get
Since is a wavelet frame with bounds A and B, we have
Again by (12), we deduce that for any ,
So is a frame with bounds and . □
In general, we can repeat the above splitting process in Theorem 1. Let
By Theorem 1, we can deduce that
Theorem 2.
If the conditions of Theorem 1 hold, then is a frame for , whose bounds are and .
Generally, when m is large, the obtained frame in Theorem 2 has finer time-frequency localization, but at the same time, the frame bounds become very large. Therefore, only when , the above splitting trick can be operated for infinite many times, i.e., m can trend to infinity and the bounds of the obtained frames are still A and B.
4. Framelet packets
Generally, since the scaling function of FMRA is discontinuous in the frequency domain, the derived framelet packets cannot possess nice time-domain localization [4,5,6]. In order to solve the above problems, we remove the restriction of FMRA and square iterative matrix, i.e., we start from a generalized scaling function whose shifts are not a frame of some space and the number of rows in iterative matrix can be any integer number.
Definition 1
([9,15,16]). If satisfies the following conditions
(i) is continuous at the origin and ,
(ii) there exists a such that ,
(iii) , where is a periodic bounded function,
then we call φ a generalized scaling function.
Denote
Assume that the matrix has nonzero singular values and
In Theorem 1, let and . Again let , by (11), we obtain the following Lemma:
Lemma 1.
Let and be such that . Again let and satisfy . Then, for any and ,
In particular, when , we have
Before we state our results on framelet packets, we need the following notation:
Notation 1.
Let
For each , define , where , where n, j, and k are said to be the oscillation parameter, the scaling parameter, and the location parameter, respectively.
Theorem 3.
Suppose that φ is a generalized scaling function and is such that
where and . Again let the matrix satisfy . Then the sequence is a tight frame for .
Proof.
From the condition , we know that the nonzero singular values of are , so . By Lemma 1, we have
A similar argument shows that
So we have
In general, we have
Similar to (5), we have
Since , for any , there is a such that . If is compactly supported, there exists such that
When , , and , we have . From this and (16), we deduce that
Furthermore, we get
However,
Again, by (17), we deduce that for ,
So we have
By Definition 1 and (15), we have
From this and (18), it follows that if is compactly supported
Noticing that any can be written as the limit of the sequence of functions whose Fourier transforms are compactly supported, (19) holds for all . This implies that the system is a tight frame. □
More generally, we can deduce the following:
Theorem 4.
Under the conditions of Theorem 3, for , define
Then, the sequence
is a tight frame for if the set S of index pair is such that is a partition of positive integers , i.e., is a disjoint union.
Proof.
Similar to the argument of Lemma 1, for , we have
Let
By Definition 1, we have
Furthermore, let , then
So we have
In general,
where . Since
we have
By (20), we get
Since is a disjoint union, we have
Again, by (21),
Finally, by (19), we have
i.e., is a tight frame for . □
Since a lot of frame generated by affine system are constructed in Theorems 3 and 4 the set of these frames is called a framelet packet. Below we give an example.
Example 1.
Let be the cube spline and
Then is a compactly supported generalized scaling function and the corresponding filter satisfies [9]. Again, let
Then, the matrix satisfy [9]. By using Notation 1, we can define . It is clear that each is compactly supported and smooth. By Theorem 4, the sequence
is a tight frame for if the set S of index pair is such that is a partition of positive integers , i.e., is a disjoint union.
5. Conclusions
In this study, the role of frame multiresolution analysis and square iterative matrices in the construction of frame packets is removed. Two novel tricks are proposed to construct framelets with better time-frequency localization features than those of known framelets. One approach is to split known framelets by using various non-square iterative matrices. The other approach is to start from a generalized scaling function. Moreover, the iterative process in these two approaches can be operated an infinite amount of times.
Funding
This research was partially supported by European Commission’s Horizon2020 Framework Program No 861584 and Taishan Distinguished Professor Fund.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The author declares no conflict of interest.
References
- Coifman, R.; Meyer, Y.; Wikerhauser, M.V. Wavelet Analysis and Signal Processing; Jones and Bartilett: Boston, MA, USA, 1992. [Google Scholar]
- Chui, C.K.; Li, C. Non-orthogonal wavelet packets. SIAM J. Math. Anal. 1993, 24, 712–738. [Google Scholar] [CrossRef]
- Shen, Z. Non-tensor product wavelet packets in L2(s). SIAM J. Math. Anal. 1995, 26, 1061–1074. [Google Scholar] [CrossRef]
- Chen, D.R. On the splitting trick and wavelet frame packets. SIAM J. Math. Anal. 2000, 31, 726–739. [Google Scholar] [CrossRef]
- Long, R.L. Higher-Dimensional Wavelet Analysis; International Publishing Co.: Beijing, China, 1995. [Google Scholar]
- Long, R.L.; Chen, W. Wavelet basis packets and wavelet frame packets. J. Fourier Anal. Appl. 1997, 3, 239–256. [Google Scholar] [CrossRef]
- Antolin, A.S.; Zalik, R.A. Compactly supported Parseval framelets with symmetry associated to E(2)d(Z) matrices. Appl. Math. Comput. 2018, 325, 179–190. [Google Scholar]
- Atreasa, N.; Karantzasb, N.; Papadakisb, M.; Stavropoulosc, T. On the design of multi-dimensional compactly supported Parseval framelets with directional characteristics. Linear Algebra Appl. 2019, 582, 1–36. [Google Scholar] [CrossRef]
- Chui, C.K.; He, W. Compactly supported tight frames associated with refinable functions. Appl. Comput. Harmon. Anal. 2000, 8, 293–319. [Google Scholar] [CrossRef]
- Chui, C.K.; He, W.; Stockler, J. Compactly supported tight and sibling frames with maximum vanishing moments. Appl. Comput. Harmon. Anal. 2002, 13, 224–262. [Google Scholar] [CrossRef]
- Han, B.; Mo, Q. Multiwavelet frames from refinable function vectors. Adv. Comput. Math. 2003, 18, 211–245. [Google Scholar] [CrossRef]
- Han, B.; Lu, R. Compactly supported quasi-tight multiframelets with high balancing orders and compact framelet transforms. Appl. Comput. Harmon. Anal. 2021, 51, 295–332. [Google Scholar] [CrossRef]
- Hern, E.; Weiss, G. A First Course on Wavelets; CRC Press: London, UK, 1996. [Google Scholar]
- Zhang, Z.; Jorgenson, P.E.T. Frame Theory in Data Science; Springer: Heidelberg, Germany, 2021. [Google Scholar]
- Daubechies, I.; Han, B.; Ron, A.; Shen, Z. Framelets: MRA-based constructions of wavelet frames. Appl. Comput. Harmon. Anal. 2003, 14, 1–46. [Google Scholar] [CrossRef]
- Ron, A.; Shen, Z.W. Affine systems in L2(d): The analysis of the analysis operator. J. Funct. Anal. 1997, 148, 408–447. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).