Abstract
In time–frequency analysis, an increasing interest is to develop various tools to split a signal into a set of non-overlapping frequency regions without the influence of their adjacent regions. Although the framelet is an ideal tool for time–frequency analysis, most of the framelets only give an overlapping partition of the frequency domain. In order to obtain a non-overlapping partition of the frequency domain, framelet sets and associated scaling sets are introduced. In this study, we will investigate the relation between framelet (or scaling) sets and the frequency domain of framelets (or frame scaling functions). We find that the frequency domain of any frame scaling function always contains a scaling set and the frequency domain of any FMRA framelet always contains a framelet set. Moreover, we give a simple approach to construct various framelet/scaling sets from band-limited framelets and frame scaling functions.
1. Introduction
Frames are an overcomplete version of bases [1,2,3,4,5,6,7]. Compared with bases, the redundant representation offered by frames often demonstrates superior performances in time–frequency analysis, feature extraction, data compression and compressed sensing [8,9].
Let be a sequence in . If there exist such that
then is called a frame for with bounds A and B [1,8]. Let and
If the affine system is a frame for , then the set is called a framelet [9,10]. Framelets are a natural extension of known wavelets. Similar to the construction of wavelets, due to the existence of fast implementation algorithms, a general approach to construct framelets is through frame multiresolution analysis (FMRA) [4,5,6,10]:
Let be a sequence of subspaces of such that
(i) ;
(ii) if and only if ;
(iii) there exists a such that is a frame for .
Then, is called a frame multiresolution analysis (FMRA) and is called a frame scaling function.
It is well-known [5,10] that the above condition (iii) can be replaced by two conditions: and
Furthermore, for any , we have
Since the suitable frequency domain of band-limited FMRAs can mitigate the effects of narrow-band noises well, the perfect reconstruction filter bank associated with a band-limited FMRA can achieve quantization noise reduction simultaneously with reconstruction of a given narrow-band signal [4]. The frequency domain of band-limited frame scaling functions can be characterized as:
Proposition 1
([6]). Let G be a bounded closed set in . Then, there is a frame scaling function φ with if and only if
(a) , (b) , and (c)
By the bi-scale equation of FMRA [4,5,6], it follows that
Let be -periodic bounded functions such that
where and . Let be such that
By (1) and the matrix extension principle of FMRA [6,11], we know that is a framelet for . Since is generated from an FMRA, is often called an FMRA framelet. By (2) and (3), the FMRA framelet satisfies [9]
In time–frequency analysis, there is an increasing interest in developing various tools to split a signal into a set of non-overlapping time/frequency regions without the influence of their adjacent regions: Saito and Remy [11] proposed a new sine transform without overlaps: the polyharmonic local sine transform (PHLST). The core idea of PHLST is to segment any signal into local pieces using the characteristic functions, decompose each block into a polyharmonic component and a residual, and finally expand the residual into a sine series. Yamatani and Saito [12] used a similar approach to improve discrete cosine transform and proposed the polyharmonic local cosine transform (PHLCT). Zhang and Saito [13] improved overlapped discrete wavelet transform and proposed the polyharmonic wavelet transform. Weiss [14] first proposed the concept of the minimally supported frequency (MSF) wavelets which can split a signal into a set of non-overlapping frequency regions. The construction of MSF wavelets has been widely applied [15].
Due to their resilience to background noise, stability of sparse reconstruction, and ability to capture local time–frequency information, the framelet is a better tool for time–frequency analysis than the wavelet. Unfortunately, most of framelets only give an overlapping partition of the frequency domain [1,9,10]. In order to obtain a non-overlapping partition of the frequency domain, we introduce the concepts of framelet sets and associated scaling sets: (a) if the Fourier transform of a framelet is the characteristic function of the point sets , then the point set is called a framelet set of order r; (b) if a band-limited frame scaling function whose Fourier transform is a characteristic function of some point set M, we call M a scaling set. By using (2), (3) and the splitting trick in [6,11], it is easy to construct framelet sets from scaling sets and these framelet sets can provide an overlapping partition of the frequency domain for any signal.
In this study, we will investigate the relation between framelet (or scaling) sets and the frequency domain of framelets (or frame scaling functions). In Theorems 1 and 2, we find that the frequency domain of any frame scaling function always contains a scaling set and the frequency domain of any FMRA framelet always contains a framelet set. Moreover, we give a simple approach to construct various framelet sets and scaling sets from band-limited framelets and frame scaling functions in the proof of Theorems 1 and 2.
2. Scaling Sets
In this section, we will show that for a band-limited frame scaling function , there exists a scaling set M such that . For this purpose, we introduce the concept of -translation kernels:
Definition 1.
Let E be a set of . If a set satisfies the conditions and , then the set is called a -translation kernel of E.
We give a partition of the frequency domain as follows. Since G is bounded, there is a such that
Let . By , we have
By Proposition 1(iii), we have . Taking , we have . By , we further obtain that
From this and , we have
By the bi-scale equation of FMRA [4,5,6], it follows that
where the filter in (10) is not unique. By , it follows that for , so in (10), one can take
Lemma 1.
Let . Then, , where is the characteristic function of .
Proof.
By , (1) and (10), we obtain
Since is -periodic, we deduce that
By (10), we obtain , i.e.,
From this and the periodicity of , we have . Noticing that , by (11), it follows that , furthermore, we have . Again by (12), we deduce that
□
Theorem 1.
Let φ be a band-limited frame scaling function with . Let
where is a -translation kernel of the set . Denote
Then, M is a scaling set and .
Remark 1.
Theorem 1 not only shows that the frequency domain of any band-limited frame scaling function must contain a scaling set, but also indicates how to construct a scaling set from a given band-limited frame scaling function.
Lemma 2.
Let be stated in (13). Then,
(i) and (ii) .
Proof.
By (13), we have
Continuing this procedure, we obtain . Again, by Proposition 1(iii), we deduce that for ,
□
Lemma 3.
The sets are pairwise disjoint for .
Proof.
For , by definition,
First we prove that
Let . Since , we have . From this and Lemma 1, we deduce that . By periodicity, for , , and so . Again by , we have
Since , we obtain
By (6) and (7), it follows that ; furthermore, . So, (16) holds.
Next, we prove that
By (6) and (7), it follows that and ; furthermore, . It means that . By , we have . By (17), it follows that
From these, we obtain (19).
By (15), (16), (19) and Definition 1, we deduce that Lemma 3 holds for .
Now, we use the idea of mathematical induction to prove Lemma 3, i.e., assuming that are pairwise disjoint, we will prove that are pairwise disjoint.
Noticing that
we only need prove that
(i) are pairwise disjoint;
(ii) .
Since and , an argument similar to (18) shows that
Since and are pairwise disjoint, we deduce that are pairwise disjoint. So . Again by (21), we have and (i) follows.
Since , we have
By , we have
Since and , an argument similar to (20) shows that
From this and (22), we obtain . Again, by , we obtain (ii). Finally, by mathematical induction, we obtain Lemma 3. □
Proof of Theorem 1
By the construction of M, we have
By Lemmas 1 and 2, the sets are pairwise disjoint. By and (8),
Again, by (6), we have . From this, we deduce that are pairwise disjoint.
By Proposition 1.1(ii), we have . Again, by , we deduce that
i.e., .
Finally, by (13), we have
Again, by (14) and , we deduce that
Define a function such that its Fourier transform is . By using all the above properties on M, it is easy to check that is a frame scaling function and M is a scaling set.
Noticing that , by (13) and (14), we have
Theorem 1 is proved. □
Example 1.
For a region
we construct a frame scaling function φ whose Fourier transform is
Taking , it is clear that M is a scaling set and
3. Framelet Sets
In this study, we will show that the frequency domain of any FMRA framelets always contains a framelet set. At first, we need some lemmas.
Lemma 4.
Assume that the framelet is generated from the frame scaling function φ. Denote and . Then, if and only if .
Proof.
Denote
Then,
If , by , we have , and so . This implies that . On the other hand, for , we have and so , i.e., . Hence, . Again, by (3.1), we obtain
This means that .
From , it follows that . From this and , we obtain
and so . Lemma 4 holds. □
Lemma 5.
Under the conditions of Theorem 1, we have for , where is the characteristic function of M.
Proof.
First, we compute .
By and (14), we deduce that
We compute the first term on the right-hand side of (24): for , we have and . By the bi-scale equation, we have , and so . This implies that . Again, by , we deduce that
We compute the last term on the right-hand side of (24):
By (8), we have . By (6), we have
Again, by (7), we deduce that for ,
By and (1.1), we have
where . By (27), we deduce that for and . Furthermore,
Again, by , we obtain . By the bi-scale equation , we obtain , and so . From this and (26), the last term on the right-hand side of (24) becomes
By (24), (25) and (29), we know that
By (13), it follows that
From these and , we see that
By , we obtain . Finally, by (30),
By , we know that for , we have , i.e.,
From this and (31), we obtain . Lemma 5 is proved. □
Theorem 2.
Let be a band-limited FMRA framelet corresponding to a frame scaling function φ. Then, there exists a framelet set W such that , where Ω is the whole frequency domain of Ψ: .
Proof.
Since is band-limited, by (5), we know that is band-limited. Let and the point sets D and M be stated in Theorem 1. It is clear that . Let be such that its Fourier transform satisfies . Since M is a scaling set, is a frame scaling function. By Lemma 5, it follows that
By (4) and ,
and so , i.e., is a framelet set. So, we have
Since , it follows that
By (32), , and so
By Lemma 4 and (4), it follows that if and only if . Again, by (34), we obtain that if , then
i.e.,
Theorem 2 is proved. □
Funding
This research was partially supported by the European Commission 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
- Mallat, S. A Wavelet Tour of Signal Processing; Academic Press: San Diego, CA, USA, 2008. [Google Scholar]
- 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]
- Atreas, N.; Karantzas, N.; Papadakis, M.; Stavropoulos, T. On the design of multi-dimensional compactly supported Parseval framelets with directional characteristics. Linear Algebra Appl. 2019, 582, 1–36. [Google Scholar] [CrossRef]
- Benedetto, J.J.; Li, S. The theory of multiresolution analysis frames and applications to filter banks. Appl. Comp. Harmon. Anal. 1998, 5, 389–427. [Google Scholar] [CrossRef]
- Mu, L.; Zhang, Z.; Zhang, P. On the Higher-dimensional Wavelet Frames. Appl. Comput. Harmon. Anal. 2004, 16, 1. [Google Scholar]
- Zhang, Z. Characterization of Frequency Domains of Bandlimited Frame Multiresolution Analysis. Mathematics 2021, 9, 1050. [Google Scholar] [CrossRef]
- Chui, C.K.; He, W. Compactly supported tight frames associated with refinable function. Appl. Comput. Harmon. Anal. 2000, 8, 293–319. [Google Scholar] [CrossRef]
- Li, T. Time Series with Mixed Spectra; Chapman and Hall/CRC: Boca Raton, FL, USA, 2019. [Google Scholar]
- Zhang, Z.; Jorgenson, P.E.T. Frame Theory in Data Science; Springer: Heidelberg, Germany, 2022; in press. [Google Scholar]
- Walter, G.G. Wavelet and Other Orthogonal Systems with Applications; CRC Press: Boca Raton, FL, USA, 2018. [Google Scholar]
- Saito, N.; Remy, J.F. The polyharmonic local sine transform: A new tool for local image analysis and synthesis without edge effect. Appl. Comput. Harmon. Anal. 2006, 20, 41–73. [Google Scholar] [CrossRef][Green Version]
- Yamatani, K.; Saito, N. Improvement of DCT-based compression algorithms using Poisson’s equation. IEEE Trans. Image Process. 2006, 15, 672–3689. [Google Scholar] [CrossRef] [PubMed]
- Zhang, Z.; Saito, N. Harmonic wavelet transform and image approximation. J. Math. Imaging Vis. 2010, 38, 14–34. [Google Scholar] [CrossRef]
- Hernandez, E.; Weiss, G. A First Course on Wavelets; CRC Press: Boca Raton, FL, USA, 1996. [Google Scholar]
- Vyas, A.; Kim, G. Minimally Supported Frequency (MSF) d-Dilation Wavelets. Mathematics 2021, 9, 1284. [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 (https://creativecommons.org/licenses/by/4.0/).