Helgason Gabor Fourier transform and uncertainty principles
Mohammed El Kassimi, Mustapha Boujeddaine, Said Fahlaoui

TL;DR
This paper generalizes the classical Gabor-Fourier transform to Riemannian symmetric spaces, introduces the Helgason Gabor Fourier transform, and proves key properties and an uncertainty principle for it.
Contribution
It introduces the Helgason Gabor Fourier transform on symmetric spaces and establishes its fundamental properties and uncertainty principles, extending classical Fourier analysis.
Findings
Established the reconstruction formula for HGFT
Proved the Plancherel and Parseval formulas for HGFT
Derived a local uncertainty principle similar to Benedicks' principle
Abstract
Windowing a Fourier transform is a useful tool, which gives us the similarity between the signal and time frequency signal, and it allows to get sense when/where ceratin frequencies occur in the input signal, this method is introduced by Dennis Gabor. In this paper, we generalize the classical Gabor-Fourier transform(GFT) to the Riemannian symmetric space called the Helgason Gabor Fourier transform (HGFT). We continue with proving several important properties of HGFT, like the reconstruction formula, the Plancherel formula, and Parseval formula. Finally we establish some local uncertainty principle such as Benedicks-type uncertainty principle
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 · Fractal and DNA sequence analysis · Image and Signal Denoising Methods
Helgason-Gabor Fourier Transform and Uncertainty Principles
M. El kassimi, M.Boujeddaine and S. Fahlaoui
Mohammed El kassimi
Mustapha Boujeddaine
Saïd Fahlaoui
Abstract.
Windowing a Fourier transform is a useful tool, which gives us the similarity between the signal and time frequency signal, and it allows to get sense when/where ceratin frequencies occur in the input signal, this method is introduced by Dennis Gabor. In this paper, we generalize the classical Gabor-Fourier transform(GFT) to the Riemannian symmetric space called the Helgason Gabor Fourier transform (HGFT). We continue with proving several important properties of HGFT, like the reconstruction formula, the Plancherel formula, and Parseval formula. Finally we establish some local uncertainty principle such as Benedicks-type uncertainty principle.
Introduction
The Fourier transform has been a useful tool for analyzing frequency properties of a signal, but this transform still insufficient to represent and compute location information for a given signal. To solve this problem, in [5] Gabor formulated a fundamental method by multiplying the function to be transformed by a Gaussian function. This transform becomes a powerful method for determining the sinusoidal frequency and phase content of signal local sections considering its changes over time. In addition, it used for filtering and modifying the signal in the limited region.
In classical case, the Gabor transform is given by ([5])
[TABLE]
In the general case, we take the windowed function as square integral function. The Gabor Fourier transform has other names used in the literature, like as short-time Fourier transform and windowed Fourier transform. Motivated by this concept, in this paper we study a generalization of the classical Gabor Fourier transform to the Riemannian Symmetric spaces see [9, 11], which we call the Helgason Gabor Fourier transform(HGFT).Then, we derive important harmonic analysis properties of HGFT.
This paper is organized as follows, in the first section we remind some results about the classical Helgason-Fourier transform, in the second we define the HGFT, and we establish for it a several harmonic analysis properties, such as the inversion formula, Plancherel and Parseval formulas, in the last one we demonstrate some local uncertainty principles for HGFT like Benedick’s theorem.
1. Helgason Transform
1.1. Helgason Transform
In this section we describe the necessary preliminaries regarding semi-simple Lie groups and harmonic analysis on associated Riemannian symmetric spaces.
If is a Riemannian symmetric space of noncompact type then can be viewed as a quotient space where is a connected, noncompact, semi-simple Lie group with finite center and a maximal compact subgroup of .
Let be an Iwasawa decomposition of and let be the Lie algebra of . Denoting by the centralizer of in and putting . By writing ,, where , , and for and , we write . Let be a -invariant measure on , and let and be the respective normed -invariant measures on and .
Let be the origin in and denote the action of on by for . The Lie algebras of and are respectively denoted by and .
We denote by the set of infinity differentiable compactly-supported functions on . Let be the element of the Haar measure on G.
We assume that the Haar measure on is normed, so that
[TABLE]
Let be the real dual of and be its complexification ; the finite Weyl group acts on . Suppose that is the set of bounded roots , is the set of positive bounded roots, and is the positive Weyl chamber so that
[TABLE]
Denote by the half-sum of the positive bounded roots (counted with their multiplicities) ; then . Let be the Killing form on the Lie algebra . For , let be the vector in such that for all . Given , we set . The correspondence enables us to identify with . Using this identification, we can translate the action of the Weyl group to . Let
[TABLE]
The Helgason Fourier transform is a powerful tool in harmonic analysis on noncompact Riemannian symmetric spaces ([11]). This transform associates to any smooth compactly supported right -invariant function on .
For integrable functions on and , Helgason-Fourier transform is defined as in ([9])by:
[TABLE]
We will assume throughout this paper is of rank 1, and hence dim = 1. In this case we identify with by identifying with . Under this identification, by means of the correspondence .
We norm the measure on and we conclude this section with the following properties, due to Helgason.
The original function can then be reconstructed from by means of the inversion formula
[TABLE]
where is the order of the Weyl group of , is the element of the Euclidean measure on and is the Harish-Chandra function.
We also state the Plancherel formula for the Fourier transform:
Theorem 1.1**.**
The Fourier transform defined on by (1) extends to an isometry of onto (with the measure on ). Moreover,
[TABLE]
for all .
Proof. See [10, Theorem 2, page 227].
It follows from the above arguments that for , we have
[TABLE]
where .
Given . For a function , the translation operator is given by the formula
[TABLE]
We remind that a function is called a spherical function if is -invariant, , and for each , there exists such that .
We now list down some well known properties of the elementary spherical functions on based on the Harish-Chandras result [9, Chapitre 4, Theorem 4.3].
First, we give the following lemma proved in [9, Lemma 3].
Lemma 1.2**.**
For , we have
[TABLE]
where is the Fourier transform of
2. Gabor-Helgason transform
The classical Gabor transform of a function cannot possess a support of finite Lebesgue measure. In [15] the author showed that the portion of this transform lying outside some set of finite Lebesgue measure cannot be arbitrarily small, either. For sufficiently small , this can be seen immediately by estimating the Hilbert-Schmidt norm of a suitably defined operator. In this section, we try to give some new harmonic analysis results related to Gabor transform in the case of Riemannian symmetric space .
We define first the Gabor-Helgason transform by:
[TABLE]
with ,
2.1. Inversion formula
Before to give the reconstruction formula for the HGFT, we need the following lemma, which proves that, the translation is an isometric operator for the norm of the space .
Lemma 2.1**.**
For every function and : We have
[TABLE]
Proof.
Applying the relation (1.1), we get,
[TABLE]
∎
Theorem 2.2**.**
Let be a window function. Then every function , can be reconstructed by
[TABLE]
Proof.
We can obtain the inversion formula by using the fact that:
[TABLE]
So,
[TABLE]
We multiply the both sides of (2.1) by , we obtain
[TABLE]
on integer the inequality (2.2) with respect the measure , w get
[TABLE]
by using the first lemma 2.1, we obtain,
[TABLE]
Now, simplifying both sides of 2.3 by , we get our result.
[TABLE]
∎
Theorem 2.3** (Plancherel formula).**
For and a windowed function, we have
[TABLE]
Proof.
We have,
[TABLE]
using the equation (1.1), lemma 2.1 and the Fubini’s theorem, we have,
[TABLE]
using the invariance of the Haar measure by K, we get
[TABLE]
∎
Theorem 2.4** (Parseval’s identity ).**
Let be a window function and arbitrary. Then we have
[TABLE]
Proof.
we have by the lemma 2.1
[TABLE]
[TABLE]
Such as the proof of the Plancherel’s theorem 2.3, Applying the equation (1.1), lemma 2.1 and the Fubini’s theorem, we get,
[TABLE]
using the invariance of the Haar measure by K, we obtain
[TABLE]
∎
We shall now discuss the validity of some uncertainty principles in the case of Gabor-Helgason transform.
3. Uncertainty principle
In quantum physics, the uncertainty principles state that, we cannot give simultaneously the position and moment time of particle with high precision. The formulation mathematics of this concept is that, the function and its Fourier transform cannot both be sharply localized. Many formulations are given, the first one is proved by Heinseberg in 1927 [8], after, many authors give some generations, such as, Hardy’s theorem [7], Morgan’s theorem [12]. Years after, the locally uncertainty principles arise, those theorems asset that, when the uncertainty of the momentum is small, the probability of being localized at any point is very small [2, 3, 14].
Our first result will be the following local uncertainty principle,
Lemma 3.1**.**
Let , we have
[TABLE]
Proof.
We have
[TABLE]
Using Hölder inequality we get our result
[TABLE]
∎
Theorem 3.2**.**
Let a windowed function and let a subset of such that , for all we have,
[TABLE]
Proof.
For every ; we have
[TABLE]
Applying the (3.1) and the Plancherel formula 2.3, we get
[TABLE]
Thus, by the equation (3.3)
[TABLE]
[TABLE]
∎
Theorem 3.3** (Concentration of in small sets ).**
*Let be a window function and with .
Then, for we have*
[TABLE]
Proof.
We have
[TABLE]
From theorem 2.3
[TABLE]
Hence,
[TABLE]
∎
Theorem 3.4**.**
Let . Then there exists a constant such that, for all
[TABLE]
Proof.
Let be a real number and the ball of center 0 and radius in . Fix small enough such that .
Therefore, by inequality (3.2) we obtain
[TABLE]
then,
[TABLE]
we take the square of both sides of inequality (3.8), we get,
[TABLE]
We obtain the desired result by taking . ∎
Now, before to give a version of Benedicks-type theorem for the Gabor Helgason Fourier transform, we start by giving the following notations and definition.
Let be orthogonal projection of on the space .
Let be a measurable subset of such that , where is the Haar measure of , we consider the operator defined on by where
The usual norm of the operator is defined by
[TABLE]
Definition 3.5**.**
Let a measurable subset of and a nonzero window function. We say that is weakly annihilating, if any function vanishes when its Helgason Gabor Fourier transform with respect to the window is supported in .
Theorem 3.6** (Benedicks-type uncertainty principle for ).**
Let . Let be a non zero window function such that and let , be a subset of finite measure. Then
[TABLE]
i.e, is weakly annihilating.
Proof.
Let , then, there exists a function such that, and .
Then for all
[TABLE]
Thus , with . On other hand , we have
Hence, by the Benedicks theorem of the Helgason transform(see theorem 6.1 in [11]).
We deduce that then . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M.J. Bastiaans, Gabor’s expansion of a signal into Gaussian elementary signals .Proc. IEEE, 68 (1980), 594-598
- 2[2] M. Benedicks, On Fourier transforms of function supported on sets of finite Lebesgue measure , J. Math. Anal. Appl., 106 (1985), 180-183.
- 3[3] D.L. Donoho and P.B. Stark, Uncertainty principles and signal recovery , SIAM J. Appl. Math., 49 (1989), 906-931.
- 4[4] H. Feichtinger and T. Srohmer, Gabor Analysis and Algorithms .(1998) Birkhauser, Boston, MA.
- 5[5] D. Gabor, Theory of communications , J. Inst. Electr. Eng. London (1946), 93, 429-457.
- 6[6] K. Gröchenig, Foundations of Time-Frequency Analysis. (2001) Birkhäuser, Boston, MA.
- 7[7] G.H. Hardy, A theorem concerning Fourier transform , J. London Math. Soc., 8 (1933), 227-231.
- 8[8] W. Heisenberg, Über den anschaulichen Inhalt der quantentheoretischen Kinematic und Mechanik , Zeit. Physik. 43 (1927), p. 172; The Physical Principles of the Quantum Theory , Dover, New York, 1949 (The University of Chicago Press, 1930).
