Papers
Topics
Authors
Recent
Search
2000 character limit reached

Non-uniqueness theory in sampled STFT phase retrieval

Published 12 Jul 2022 in math.FA | (2207.05628v2)

Abstract: The reconstruction of a function from its spectrogram (i.e., the absolute value of its short-time Fourier transform (STFT)) arises as a key problem in several important applications, including coherent diffraction imaging and audio processing. It is a classical result that for suitable windows any function can, in principle, be uniquely recovered up to a global phase factor from its spectrogram. However, for most practical applications only discrete samples - typically from a lattice - of the spectrogram are available. This raises the question of whether lattice samples of the spectrogram contain sufficient information for determining a function $f\in L2(\mathbb{R}d)$ up to a global phase factor. In the present paper, we answer this question in the negative by providing general non-identifiability results which lead to a non-uniqueness theory for the sampled STFT phase retrieval problem. Precisely, given any dimension $d$, any window function $g$ and any (symplectic or separable) lattice $\mathcal{L} \subseteq \mathbb{R}d$, we construct pairs of functions $f,h\in L2(\mathbb{R}d)$ that do not agree up to a global phase factor, but whose spectrograms agree on $\mathcal{L}$. Our techniques are sufficiently flexible to produce counterexamples to unique recoverability under even more stringent assumptions; for example, if the window function is real-valued, the functions $f,h$ can even be chosen to satisfy $|f|=|h|$. Our results thus reveal the non-existence of a critical sampling density in the absence of phase information, a property which is in stark contrast to uniqueness results in time-frequency analysis.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.