A planar large sieve and sparsity of time-frequency representations
Luis Daniel Abreu, Michael Speckbacher

TL;DR
This paper extends the large sieve principle to time-frequency representations using a planar maximum Nyquist density, enabling perfect recovery and approximation of sparse signals in the modulation space via $L_1$-minimization.
Contribution
It introduces the planar maximum Nyquist density and establishes a large sieve principle for time-frequency distributions with Gaussian windows, facilitating sparse signal recovery.
Findings
Allows perfect recovery of the short-Fourier transform in $M_1$.
Enables approximation of missing STFT data in $M_1$.
Applies to signals corrupted by sparse noise.
Abstract
With the aim of measuring the sparsity of a real signal, Donoho and Logan introduced the concept of maximum Nyquist density, and used it to extend Bombieri's principle of the large sieve to bandlimited functions. This led to several recovery algorithms based on the minimization of the -norm. In this paper we introduce the concept of {\ planar maximum} Nyquist density, which measures the sparsity of the time-frequency distribution of a function. We obtain a planar large sieve principle which applies to time-frequency representations with a gaussian window, or equivalently, to Fock spaces, , allowing for perfect recovery of the short-Fourier transform (STFT) of functions in the modulation space (also known as Feichtinger's algebra ) corrupted by sparse noise and for approximation of missing STFT data in , by…
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
TopicsImage and Signal Denoising Methods · Mathematical Analysis and Transform Methods · Sparse and Compressive Sensing Techniques
A planar large sieve and sparsity of time-frequency representations
Luís Daniel Abreu
Acoustics Research Institute,
Wohllebengasse 12-14, Vienna A-1040, Austria.
Email: [email protected]
Michael Speckbacher
Acoustics Research Institute,
Wohllebengasse 12-14, Vienna A-1040, Austria.
Email: [email protected]
**Abstract – With the aim of measuring the sparsity of a real signal, Donoho and Logan introduced the concept of maximum Nyquist density, and used it to extend Bombieri’s principle of the large sieve to bandlimited functions. This led to several recovery algorithms based on the minimization of the -norm. In this paper we introduce the concept of planar maximum Nyquist density, which measures the sparsity of the time-frequency distribution of a function. We obtain a planar large sieve principle which applies to time-frequency representations with a gaussian window, or equivalently, to Fock spaces, allowing for perfect recovery of the short-Fourier transform (STFT) of functions in the modulation space (also known as Feichtinger’s algebra ) corrupted by sparse noise and for approximation of missing STFT data in , by -minimization. **
I Introduction
With the aim of measuring the sparsity of a real signal, Donoho and Logan introduced the concept of maximum Nyquist density, defined in [12] as
[TABLE]
where and is the band-size in the space of band-limited functions
[TABLE]
If the set is sparse in terms of low Lebesgue measure (small concentration in any interval of length ), then can be considerably small compared to the natural Nyquist density . We will write for the multiplication by the indicator function of . In [12, Theorem 7], Donoho and Logan proved that, if and , the inequality
[TABLE]
holds. In particular, if denotes the norm of the projection operator and , then . Note that the inequality (1) falls within the realm of quantitative uncertainty principles [11, 20, 21, 23, 36], which paved the way to the modern theory of compressed sensing (see [9, Section 1.6] or [10, 25]).
Donoho and Logan’s interest in such inequalities, in particular in obtaining good constants depending on the sparsity of the set , was motivated by signal recovery problems [11]. As an application, they derived the following results, which allows to perfectly reconstruct a bandlimited signal corrupted by sparse noise using -norm minimization.
Corollary: ([12, Corolllary 1]) Suppose that is observed, , , and that the unknown support of the noise satisfies
[TABLE]
Then the solution of the minimization problem
[TABLE]
is unique and recovers the signal perfectly ().
This extends the so-called Logan’s phenomenon ([28], see also the discussion in [11, Section 6.2]). The following recovery result for missing data extends the results from [11] from the to the setting. We will give a proof in the STFT context in Corollary 2.
Corollary: Suppose that we observe , where , and
[TABLE]
Then, any solution of the minimization problem
[TABLE]
satisfies
[TABLE]
Let be the normalized gaussian. The short-time Fourier transform (STFT) is defined as follows
[TABLE]
Moreover, define the modulation spaces
[TABLE]
Modulation spaces are ubiquitous in time-frequency analysis [16, 26]. They were introduced in [14]. It is the purpose of this paper to obtain a planar version of (1) and apply it to recovery problems for the short-time Fourier transform of functions in using -minimization. The space is also known as Feichtinger’s algebra and it can be identified with the Bargmann-Fock space of entire functions.
As a planar analogue of , we introduce the following concept. Let . The planar maximum Nyquist density is defined as
[TABLE]
where is the disc of radius centered in the origin. If the set is sparse in the sense of Lesbegue measure (small concentration in any disc of radius ) then can be considerably smaller than the natural Nyquist density (see [3, 13, 17, 22, 31, 33] for natural Nyquist densities in the context of Fock and modulation spaces and [18] for a survey on the current state of the art of the topic). Our main result is the following.
Theorem 1
Consider and let , then, for every , it holds
[TABLE]
Set
[TABLE]
By Theorem 1,
[TABLE]
Moreover, if then every satisfies . Combined with the argument in [11, Section 6.2], this implies the following result, which allows to perfectly reconstruct the STFT of a signal in corrupted by sparse noise, using -norm minimization.
Corollary 1
Suppose that is observed, where , and that the unknown support of satisfies
[TABLE]
for some . Then and the solution of the minimization problem
[TABLE]
is unique and recovers the signal perfectly ().
One can also derive an analogue for the recovery of missing data.
Corollary 2
Let and suppose that one observes , where and that the domain of missing data satisfies
[TABLE]
for some . Then any solution of
[TABLE]
satisfies
[TABLE]
Proof: First, observe that
[TABLE]
Hence,
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
which concludes the proof using (6) and (8).
There are other approaches to the recovery of sparse time-frequency representations which concentrate on the set-up of finite sparse time-frequency representations [29, 30].
Another consequence of Theorem 1 is the following refined uncertainty principle for the STFT (see [26, Proposition 3.3.1] and [7, 19, 32] for other uncertainty principles for the STFT).
Corollary 3
Suppose that satisfies and that and are such that
[TABLE]
then
[TABLE]
In particular, Corollary 3 shows that the mass of the STFT of a function cannot be concentrated on sets that are locally small over the whole time-frequency plane.
Our arguments to prove Theorem 1 are an adaptation of Selberg’s argument for the large sieve (see [6, 8, 24]), along the lines of [12]. The analysis reveals that, at least in the continuous case, dealing with joint time-frequency representations leads to considerable simplifications, due to the existence of local reproducing formulas [33]. This is not surprising since, as observed earlier by Daubechies [13] and Seip [33], the study of joint time-frequency restriction operators with a gaussian window tends to be simplified. In particular, the functions best concentrated in a disc have a simple explicit formula when written in the phase space. This is in contrast with the classical time and band-limiting problem which has been studied in detail by Landau [27] (see also [4] for an alternative approach).
II Modulation and Fock spaces
We will follow notations and definitions from [26]. The Bargmann transform on is defined by
[TABLE]
Writing , a simple calculation shows that
[TABLE]
Let be the space of entire functions equipped with the norm
[TABLE]
if and
[TABLE]
if . The Bargmann transform is a unitary operator from to and extends to a bijective operator from to , for (see [35], or [1] for a proof that extends to polyanalytic Fock spaces). As in [34], we define the translation operator on as follows:
[TABLE]
It acts isometrically on every , . The corresponding convolution is
[TABLE]
III Proof sketch of main results
III-A Concentration estimates
We say that a function is concentrated on if . Our main results will follow from the following statement which corresponds to (1). We will give a full proof and more general results in [5].
Proposition 1
Suppose that there exists which is concentrated on , such that , is bounded and boundedly invertible. Then
[TABLE]
where and
[TABLE]
Proof sketch: For , there exists unique such that . Hence, replacing by and using, one after another, , Fubini’s theorem, and Hölder’s inequality () yields
[TABLE]
The observation that thus implies our statement.
III-B Proof of Theorem 1
Define
[TABLE]
with some subset of nonzero measure. Consequently, and setting yields
[TABLE]
Let be entire and , then for any , the following local reproducing formula holds [34]:
[TABLE]
Now, let , choosing yields that convolution with gives a bounded and invertible operator on . Then ,
[TABLE]
and Proposition 1 yields
[TABLE]
This proves the result for . Since the Bargmann transform extends to a bijective operator from to , there exists f\in$$M^{1} such that
[TABLE]
This completes the proof.
Acknowledgement
L.D. Abreu and M. Speckbacker were supported by the Austrian Science Foundation (FWF) START-project FLAME (“Frames and Linear Operators for Acoustical Modeling and Parameter Estimation”, Y 551-N13)
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] L. D. Abreu, K. Gröchenig. Banach Gabor frames with Hermite functions: polyanalytic spaces from the Heisenberg group. Appl. Anal. , 91: 1981-1997, 2012.
- 2[2] L. D. Abreu, M. Dörfler. An inverse problem for localization operators. Inverse Problems , 28: 115001, 2012.
- 3[3] L. D. Abreu, K. Gröchenig, J. L. Romero. On accumulated spectrograms. Trans. Amer. Math. Soc. , 368: 3629-3649, 2016.
- 4[4] L. D. Abreu, J. M. Pereira. Measures of localization and quantitative Nyquist densities. Appl. Comput. Harmon. Anal. , 38 (3): 524-534, 2015
- 5[5] L. D. Abreu, M. Speckbacher. In preparation.
- 6[6] C. Aubel, H. Bölcskei. Vandermonde matrices with nodes in the unit disk and the large sieve. ar Xiv:1701.02538 preprint , 2017.
- 7[7] A. Bonami, B. Demange, P. Jaming. Hermite functions and uncertainty principles for the Fourier and the windowed Fourier transforms. Rev. Math. Iberoamericana , 19: 23-55, 2003.
- 8[8] E. Bombieri. Le grand crible dans la théorie analytique des nombres . Société Mathémathique de France, 1974.
