Recent work has drawn attention to the valuable information contained in the set of zeros of the short Fourier transform (STFT) of a noisy signal. We contribute to study of the statistics of STFT zeros, the development of numerical algorithms to compute them from finite data, and investigate the extent to which such computations reflect underlying analog models. Special emphasis is put on applications to signal processing.
In addition to writing research articles, we also publish open-source implementations of the proposed algorithms, and of the various numerical experiments that validate theoretical statistics.
The computation of STFT zeros finds applications in signal estimation, for example in filtering procedures that exploit theoretical knowledge of the statistics of zeros. Our recent research supports such practices by showing that empirically computed statistics are faithful.
Figure: Spectrogram of a signal contaminated with noise, and algorithmically computed zeros. Even though the spectrogram is only given on a finite grid, the algorithm succeeds in computing an approximation of the zeros of the underlying analog signal, up to the resolution of the data.
Antti Haimi, University of Vienna
This is a subproject of the project "Time-Frequency Analysis, Randomness and Sampling", funded by the FWF START award Y 1199 (Austrian Science Fund).