Daubechies' Time-Frequency Localization Operator on Cantor Type Sets
Helge Knutsen

TL;DR
This paper analyzes Daubechies' time-frequency localization operator with a Gaussian window on Cantor-type fractal sets, providing explicit eigenvalue formulas and asymptotic estimates for the operator norm.
Contribution
It introduces a framework for studying the operator on fractal sets, deriving explicit eigenvalues and asymptotic bounds for the operator norm on Cantor sets.
Findings
Eigenvalues are explicitly computed for the Gaussian window case.
Asymptotic estimates for the operator norm on Cantor sets are established.
The results connect fractal geometry with time-frequency analysis.
Abstract
We study Daubechies' time-frequency localization operator, which is characterized by a window and weight function. We consider a Gaussian window and a spherically symmetric weight as this choice yields explicit formulas for the eigenvalues, with the Hermite functions as the associated eigenfunctions. Inspired by the fractal uncertainty principle in the separate time-frequency representation, we define the -iterate spherically symmetric Cantor set in the joint representation. For the -iterate Cantor set, precise asymptotic estimates for the operator norm are then derived up to a multiplicative constant.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Analysis and Transform Methods · Image and Signal Denoising Methods · Underwater Acoustics Research
Daubechies’ Time-Frequency Localization Operator on Cantor Type Sets
Helge Knutsen
Department of Mathematical Sciences, Norwegian University of Science and Technology,
7034 Trondheim, Norway
(Date: July 2019)
Abstract.
We study Daubechies’ time-frequency localization operator, which is characterized by a window and weight function. We consider a Gaussian window and a spherically symmetric weight as this choice yields explicit formulas for the eigenvalues, with the Hermite functions as the associated eigenfunctions. Inspired by the fractal uncertainty principle in the separate time-frequency representation, we define the -iterate spherically symmetric Cantor set in the joint representation. For the -iterate Cantor set, precise asymptotic estimates for the operator norm are then derived up to a multiplicative constant.
Key words and phrases:
Fractal Uncertainty Principle, Daubechies’ localization operator, Cantor set
2010 Mathematics Subject Classification:
47A30, 47A75
1. Introduction
The problem of localizing signals in time and frequency is an old and important one in signal analysis. In applications, we often wish to analyze signals on different time-frequency domains, and we would therefore attempt to concentrate signals on said domains. Different approaches for how to construct such time-frequency localization operators have been suggested, either based on a separate or joint time-frequency representation of the signal (see [1], [2]). The localization operators, regardless of which we choose to work with, will however be limited by the fundamental barrier of time-frequency analysis, namely the uncertainty principles, which state that a signal cannot be highly localized simultaneously in both time and frequency. With regard to the localization operator, the limits posed by the uncertainty principles translate into the associated operator norm, as it measures the optimal efficiency of any given localization operator.
Many versions of the uncertainty principles exist (see [3]), and more recent versions start to take into account the geometry of the time-frequency domains. In particular, in [4], Dyatlov describes the development and applications of a fractal uncertainty principle (FUP) for the separate time-frequency representation. The relevant localization operator is the standard composition of projections , where and projects onto the sets in time and in frequency, respectively. In the context of the FUP, the sets and take the form of fractal sets or exhibit a regularity close to it. This regularity is, in part, represented as a sequence of sets , where as . However, this sequence is constructed such that .
An illustrative example featured in [4] is a sequence based on the -iterate mid-third Cantor set, defined in an ever increasing interval. More precisely, if denotes the -iterate defined in the interval , then the interval length satisfies
[TABLE]
which means as . Further, by Theorem 2.13 in [4], there exist constants such that
[TABLE]
Extending to the joint time-frequency representation we should expect some analogous result to the FUP (see Itinerary page 1 in [5]). Inspired by the model example, we search for similar results in the joint representation. In particular, we consider Daubechies’ localization operator, first introduced in [2], based on the Short-Time Fourier tranform, with a spherically symmetric weight function and a Gaussian window. The reason for these restrictions is, as was shown in the aforementioned paper, that we obtain explicit expressions for the eigenvalues of the localization operator, with the Hermite functions as the associated eigenfunctions.
The remainder of the paper is organized as follows: In section 2 we provide a more detailed introduction to the Daubechies operator (section 2.1-2.2), in addition to some necessary results in the spherically symmetric context (section 2.3). We also make clear what we mean by a spherically symmetric Cantor set (section 2.4). New results are found in section 3, which contains several estimates for the operator norm of Daubechies’ localization operator.
After some preliminary examples, in section 3.1-3.2, we finally consider the -iterate spherically symmetric Cantor set in section 2.4. Here we derive precise asymptotic estimates (up to a multiplicative constant) for the operator norm of the associated Daubechies’ operator. A particular case of this two-parameter result, in terms of the radius and iterate , can be formulated as an estimate solely in terms of the parameter . In the spherically symmetric context, we consider the condition
[TABLE]
similar to condition (1.1). Hence, under the above condition, let denote the Daubechies operator localizing on the -iterate spherically symmetric Cantor set defined in the disk of radius . Then for some positive constants the operator norm satisfies
[TABLE]
This result is analogous to knowing the exponential in (1.2) precisely.
2. Preliminaries
2.1. Fourier and Short-Time Fourier Transform
For a function the Fourier transform evaluated at point is given by
[TABLE]
If we interpret as an amplitude signal depending on time, then its Fourier transform corresponds to a frequency representation of the signal. The pair does not, however, offer a joint description with respect to both frequency and time. For this purpose, we consider the Short-Time Fourier transform (STFT) (see Chapter 3 in [5]).
The STFT is often referred to as the ”windowed Fourier transform” as this transform relies on an additional fixed, non-zero function, , known as a window function. At point the STFT of with respect to the window is then defined as
[TABLE]
The transformed signal now depends on both time and frequency , and we refer to the -domain as the phase space or the time-frequency plane.
We will restrict our attention to signals and windows in , which, by Cauchy-Schwarz’ inequality, ensures to be well-defined for all points . Such restrictions also produce the following orthogonality relation
[TABLE]
Equipped with the standard -norms, we deduce that the STFT is a bounded linear map onto the target space . If the window is normalized, i.e. , then the STFT becomes, in fact, an isometry onto some subspace of .
Further, by identity (2.1), the original signal can be recovered from its phase space representation. Take any such that , then the orthogonal projection of onto any is given by
[TABLE]
A canonical choice for is to set it equal to . Assuming is normalized, these projections then read
[TABLE]
Since any signal is entirely determined by such inner products, the right-hand side of formula (2.2) provides a complete recovery from the STFT.
2.2. Daubechies’ Localization Operator
One approach for how to construct operators that localize a signal in both time and frequency was suggested by Daubechies in [2]. These operators can be summarized as modifying the STFT of by multiplication of a weight function, say , before recovering a time-dependent signal. The weight function aims at enhancing certain features of the phase space while diminishing others. Based on formula (2.2), we consider the sesquilinear functional on the product , defined by
[TABLE]
Assuming is a bounded functional, Riesz’ representation theorem ensures the existence of a bounded, linear operator such that
[TABLE]
The operator is our sought after time-frequency localization operator, which we will refer to as Daubechies’ localization operator. From the above defninition, is characterized by the choice of weight and window function .
In particular, any real-valued, integrable weight will produce self-adjoint, compact operators whose eigenfunctions form a complete basis for the space . Furthermore, the eigenvalues satisfies , in addition to for all .
2.3. Spherically Symmetric Weight
For an arbitrary weight and window it remains a challenge to determine the eigenvalues of Daubechies’ localization operator . However, in [2], Daubechies narrows in her focus to operators with a normalized Gaussian window
[TABLE]
and a spherically symmetric weight
[TABLE]
where . For such operators, the Hermite functions111Due to the choice of normalization for the Fourier transform, both the Gaussian and the Hermite functions are normalized differently than in [2]. The normalization is chosen in accordance with Folland[6]. If denotes the -th Hermite function in [2], this relates to in (2.5) by .
[TABLE]
are shown to constitute the eigenfunctions. Further, explicit expressions for the associated eigenvalues are derived.
Theorem 2.1**.**
(Daubechies)* Let denote the localization operator with weight and window equal to the normalized Gaussian in (2.3). Then the eigenvalues of are given by*
[TABLE]
such that
[TABLE]
where denotes the -th Hermite function.
Observe that the normalized Gaussian in (2.3) coincides with in (2.5). It was shown recently in [7] that (for each ) the Hermite functions are also eigenfunctions of any localization operator with window and a spherically symmetric weight. Nevertheless, we will always presume the window to be the normalized Gaussian.
We will consider the case when equals the characteristic function of some subset , i.e., . Note that by definition (2.4), the set is identified with the subset of the plane. As a matter of convenience, we will denote the associated Daubechies operator simply by . By Theorem 2.1, the eigenvalue corresponding to the -th Hermite function is then given by
[TABLE]
where . Since the above integrands will appear frequently, we define, for simplicity, the functions
[TABLE]
In section 3.3 we require two results regarding the integrands (for additional details, see Chapter 4.2 in [8]), namely
[TABLE]
and
[TABLE]
where is some measurable subset of .
2.4. Cantor Set
The mid-third Cantor set based in the interval is constructed as follows: Start with the interval . Each -iterate is the union of disjoint, closed intervals . To obtain the next iterate remove the open middle-third interval in every interval . Such iterations yield a nested sequence The mid-third Cantor set on the interval is then defined as the intersection of all the -iterates, i.e.,
[TABLE]
For each -iterate, we define a corresponding map by
[TABLE]
which we refer to as the -iterate Cantor function. These functions will come into play in the latter part of section 3.3, where we will utilize the fact that are all subadditive, i.e.,
[TABLE]
which was shown by induction by Josef Doboš in [9].
In the spherically symmetric context, we consider the following Cantor set construction: For the disk of radius centered at the orgin, we identify the -iterate with the subset
[TABLE]
This means we consider weights of the form
[TABLE]
Based on formula (2.6), the eigenvalues of can then be expressed as
[TABLE]
3. Main Results
In this section we present estimates for the operator norm of Daubechies’ operator localizing on different spherically symmetric sets. For this purpose, it would be sufficient to determine the largest eigenvalue of the operator and estimate said eigenvalue. Nonetheless, even with identity (2.6), it may prove difficult to determine which eigenvalue is the largest. Under such circumstances, we will instead attempt to derive a common upper bound for the eigenvalues.
3.1. Localization on a Ring: Asymptotic Estimate
The first example we consider shows that any eigenvalue of Daubechies’ localization operator can, in principle, be the largest eigenvalue. Consider localization on a ring of inner radius in phase space of measure , that is, the subset with the associated localization operator . By (2.6), the eigenvalues of become
[TABLE]
Now, assume that for some . Since the difference is negative precisely when , we obtain the ordering
[TABLE]
Under these conditions, either or must be the largest eigenvalue. In particular, if , then becomes the largest eigenvalue. In the next proposition we provide an asymptotic estimate of the operator norm of as .
Proposition 3.1**.**
The operator norm of satisfies
[TABLE]
Proof.
Assume and let , where denotes the floor function, rounding down to the nearest integer. Apply a zero-order approximation (i.e., max-min) of the integrands for . In particular, serves as an upper bound and, by inequality (2.7), serves as a lower bound for the operator norm. That is,
[TABLE]
Combine this with Stirling’s asymptotic formula for the factorial
[TABLE]
to obtain
[TABLE]
Expressing the above identity in terms of as yields the desired result.
∎
3.2. Localization on Set of Infinite Measure
Next, we consider a non-trivial example of localization on a spherically symmetric set of infinite measure (see [10] for a similar example in the separate time-frequency representation). Take the set of equidistant intervals
[TABLE]
Although the above set has infinite measure, we maintain good control over the operator norm of and can produce precise estimates in terms of the parameter .
Theorem 3.1**.**
Let be as in (3.1) with . Then the operator norm of satisfies the bounds
[TABLE]
Further, there exists such that
[TABLE]
Proof.
By formula (2.6), the eigenvalues read
[TABLE]
For each integral over apply a zero-order approximation for the integrands , i.e., consider the maximum of for such that
[TABLE]
We now claim that the following inequality holds
[TABLE]
For , inequality (3.6) is verified by computing the series explicitly. While for , compare the series with the integral over , that is
[TABLE]
Thus,
[TABLE]
Since , claim (3.6) follows. Combining results (3.4)-(3.6) yields the upper bound in (3.2). In the lower bound case of (3.2), it is sufficient to observe
[TABLE]
For the equality case (3.3), note that inequlity (3.6) ensures that there exists a constant such that for any . Since as , it follows that some with property (3.3) exists.
∎
3.3. Localization on Spherically Symmetric Cantor Set
In this section we consider localization on the -iterate spherically symmetric Cantor set, i.e., the set in (2.11). Hence, we consider the localization operator , and below two theorems for the operator norm are presented.
The first theorem shows to what extent the operator norm is bounded by the first eigenvalue .
Theorem 3.2**.**
The operator norm of is bounded from above by
[TABLE]
The second theorem is a precise asymptotic estimate of the operator norm of (up to a multiplicative constant) based on the same asymptotic estimate for .
Theorem 3.3**.**
There exist positive, finite constants such that for each
[TABLE]
Observe that once we enforce condition (1.3), namely , result (1.4) presented in the introduction follows as a corollary. Both theorems are attained from the integral formula (2.12) for the eigenvalues . However, as the number of intervals in grows as , it soon becomes rather impractical to evaluate these integrals directly.
Instead we consider the effect on the integrals locally of increasing from one iterate to the next. In particular, this means we initially consider the integral of over a single interval, say for and . Then we attempt to determine the relative area left under the curve once the mid-third of the interval is removed, i.e., we wish to understand the function
[TABLE]
Computing the above integrals, can alternatively be expressed
[TABLE]
Observe that is independent of the starting point precisely when . In particular,
[TABLE]
For this reason, calculations with regard to are significantly simpler than for the remaining eigenvalues.
We begin by computing asymptotic estimates for the eigenvalue in section 3.3.1. In section 3.3.2 we utilize the relative areas to determine a common upper bound for the eigenvalues. Here, Lemma 3.5 is noteworthy as it relies on the subadditivity of the Cantor function.
3.3.1. Estimates for the First Eigenvalue
Due to the fact that the relative area is independent of the starting point , we obtain the recursive relation
[TABLE]
which in return means
[TABLE]
From here we are able to formulate a precise asymptotic estimate for the first eigenvalue.
Proposition 3.2**.**
There exist positive, finite constants such that for each
[TABLE]
Proof.
Combine the two identities (3.9), (3.10) to obtain
[TABLE]
By the latest result, it is sufficient to show that
[TABLE]
Exchange the product for a sum, and the above inequality is equivalent to
[TABLE]
The last inequality relies on two claims
- (i)
, and 2. (ii)
there exist finite constants such that
[TABLE]
Although each claim is not difficult to verify, precise arguments are somewhat technical (see Appendix B in [8] for details).
∎
3.3.2. Common Upper Bound for the Eigenvalues
Next, we search for a common upper bound for the eigenvalues expressed in terms of the first eigenvalue. Note that if all the relative areas were bounded by regardless of starting point and interval length , we would conclude that is always the largest eigenvalue. As it turns out, this is not the case, e.g.,
[TABLE]
Instead, we compare the relative areas and when .
Lemma 3.4**.**
Let be given by (3.7). Then
[TABLE]
Proof.
Consider the derivative of with respect to , which yields
[TABLE]
for some function
[TABLE]
By identity (3.8), it is clear that for all . Thus, it suffices to show that for all and for Introduce the function
[TABLE]
Then we may express as a single integral over such that
[TABLE]
Hence, the function is positive for all if the derivative of with respect to is negative. Consider each of the square bracket terms in definition (3.11) separately, that is
[TABLE]
such that . For each the desired derivative properties of are easy to determine. This is partly due the fact that the arguments of in each term of add to a fixed value. Computations then yield
[TABLE]
(see Appendix C in [8] for details).
∎
Thus, for any shifted -iterate Cantor set for , we obtain the recursice inequality
[TABLE]
Furthermore, by result (2.8) and (3.10),
[TABLE]
In the next lemma we relate the integrals of over the shifted -iterate Cantor sets to the non-shifted iterates.
Lemma 3.5**.**
Let . Then for every fixed , we have
- (A)
\int_{C_{n}(L)\cap[k,\infty[}f_{k}(r)\mathrm{d}r\leq\int_{C_{n}(L)+k}f_{k}(r)\mathrm{d}r\* and* 2. (B)
.
Proof.
For case (A), since is monotonically decreasing for , it suffices to verify
[TABLE]
In terms of the Cantor function in (2.9), the above claim reads
[TABLE]
which is the same subadditivity property as in (2.10).
For case (B), consider the reflection of elements about the point , that is, consider the subset
[TABLE]
By result (2.7), we have that
[TABLE]
Similarly to (A), it suffices to show that
[TABLE]
By definition (3.13), the set satisfies
[TABLE]
Apply subadditivity of to , from which claim (3.14) follows.
∎
Now, combine inequality (3.12) with Lemma 3.5, to conclude
[TABLE]
which is a restatement of Theorem 3.2. Theorem 3.3 follows by applying the estimates in Proposition 3.2 to Theorem 3.2.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] David Slepian and Henry O. Pollak. Prolate spheroidal wave functions, Fourier analysis and uncertainty - I. Bell System Technical Journal , 40:43–63, 1961.
- 2[2] Ingrid Daubechies. Time-frequency localization operators: A geometric phase space approach. IEEE Transactions on Information Theory , 34(4):605–612, 1988.
- 3[3] Gerald Folland and Alladi Sitaram. The uncertainty principle: A mathematical survey. Journal of Fourier Analysis and Applications , 3(3):207–238, 1997.
- 4[4] Semyon Dyatlov. An introduction to fractal uncertainty principle. https://arxiv.org/pdf/1903.02599.pdf , 2019.
- 5[5] Karlheinz Gröchenig. Foundations of time-frequency analysis . Applied and numerical harmonic analysis. Birkhäuser, Boston, 2001.
- 6[6] Gerald B. Folland. Harmonic analysis in phase space , volume 122 of Annals of mathematics studies . Princeton University Press, Princeton, N.J, 1989.
- 7[7] Luís Daniel Abreu, Karlheinz Gröchenig, and José Luis Romero. Harmonic analysis in phase space and finite Weyl-Heisenberg ensembles. https://arxiv.org/abs/1704.03042 , 2017.
- 8[8] Helge Knutsen. Norms and Eigenvalues of Time-Frequency Localization Operators. https://brage.bibsys.no/xmlui/handle/11250/2561829 , 2018.
