Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Point Processes and spatial statistics in time-frequency analysis (2402.19172v1)

Published 29 Feb 2024 in eess.SP, cs.SD, eess.AS, and math.PR

Abstract: A finite-energy signal is represented by a square-integrable, complex-valued function $t\mapsto s(t)$ of a real variable $t$, interpreted as time. Similarly, a noisy signal is represented by a random process. Time-frequency analysis, a subfield of signal processing, amounts to describing the temporal evolution of the frequency content of a signal. Loosely speaking, if $s$ is the audio recording of a musical piece, time-frequency analysis somehow consists in writing the musical score of the piece. Mathematically, the operation is performed through a transform $\mathcal{V}$, mapping $s \in L2(\mathbb{R})$ onto a complex-valued function $\mathcal{V}s \in L2(\mathbb{R}2)$ of time $t$ and angular frequency $\omega$. The squared modulus $(t, \omega) \mapsto \vert\mathcal{V}s(t,\omega)\vert2$ of the time-frequency representation is known as the spectrogram of $s$; in the musical score analogy, a peaked spectrogram at $(t_0,\omega_0)$ corresponds to a musical note at angular frequency $\omega_0$ localized at time $t_0$. More generally, the intuition is that upper level sets of the spectrogram contain relevant information about in the original signal. Hence, many signal processing algorithms revolve around identifying maxima of the spectrogram. In contrast, zeros of the spectrogram indicate perfect silence, that is, a time at which a particular frequency is absent. Assimilating $\mathbb{R}2$ to $\mathbb{C}$ through $z = \omega + \mathrm{i}t$, this chapter focuses on time-frequency transforms $\mathcal{V}$ that map signals to analytic functions. The zeros of the spectrogram of a noisy signal are then the zeros of a random analytic function, hence forming a Point Process in $\mathbb{C}$. This chapter is devoted to the study of these Point Processes, to their links with zeros of Gaussian Analytic Functions, and to designing signal detection and denoising algorithms using spatial statistics.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (51)
  1. L. D. Abreu. Local maxima of white noise spectrograms and Gaussian Entire Functions. Journal of Fourier Analysis and Applications, 28(6):88, 2022.
  2. Filtering with wavelet zeros and Gaussian analytic functions. Preprint arXiv:1807.03183v3, 2020.
  3. Coherent states, wavelets and their generalizations, volume 3. Springer, 2000.
  4. R. A. Altes. Detection, estimation, and classification with spectrograms. The Journal of the Acoustical Society of America, 67(4):1232–1246, 1980.
  5. G. Ascensi and J. Bruna. Model space results for the Gabor and wavelet transforms. IEEE Trans. Inf. Theory, 55(5):2250–2259, 2009.
  6. J.-M. Azaïs and M. Wschebor. Level sets and extrema of random processes and fields. John Wiley & Sons, 2009.
  7. Spatial Point Patterns: Methodology and Applications with R. Chapman and Hall/CRC Press, 2015.
  8. On the zeros of the spectrogram of white noise. Appl. Comput. Harmon. Anal., 48(2):682–705, 2020.
  9. R. Bardenet and A. Hardy. Time-frequency transforms of white noises and Gaussian analytic functions. Appl. Comput. Harmon. Anal., 50:73–104, 2021.
  10. S. Cohen and J. Istas. Fractional fields and applications, volume 2. Springer, 2013.
  11. S. Coste. Order, fluctuations, rigidities.
  12. D. J. Daley and D. Vere-Jones. An introduction to the theory of point processes: volume I: elementary theory and methods. Springer, 2003.
  13. Efficient computation of the zeros of the Bargmann transform under additive white noise. Preprint arXiv:2108.12921, 2021.
  14. P. Flandrin. Time-frequency/time-scale analysis. Academic press, 1998.
  15. P. Flandrin. A note on reassigned Gabor spectrograms of Hermite functions. Journal of Fourier Analysis and Applications, 19:285–295, 2013.
  16. P. Flandrin. Time–frequency filtering based on spectrogram zeros. IEEE Signal Process. Lett., 22(11):2137–2141, 2015.
  17. P. Flandrin. Explorations in time-frequency analysis. Cambridge University Press, 2018.
  18. Gerald B. Folland. Harmonic Analysis in Phase Space. (AM-122). Princeton University Press, 2016.
  19. P. J. Forrester and G. Honner. Exact statistical properties of the zeros of complex random polynomials. Journal of Physics A: Mathematical and General, 32(16):2961, 1999.
  20. Sparse time-frequency representations. Proc. Natl. Acad. Sci. U.S.A., 103(16):6094–6099, 2006.
  21. S. Ghosh and M. Krishnapur. Rigidity hierarchy in random point fields: random polynomials and determinantal processes. Communications in Mathematical Physics, 388(3):1205–1234, 2021.
  22. S. Ghosh and J. L. Lebowitz. Fluctuations, large deviations and rigidity in hyperuniform systems: a brief survey. Indian Journal of Pure and Applied Mathematics, 48:609–631, 2017.
  23. Estimation and inference of signals via the stochastic geometry of spectrogram level sets. Preprint arXiv:2105.02471v2, 2022.
  24. S. Ghosh and Y. Peres. Rigidity and tolerance in point processes: Gaussian zeros and ginibre eigenvalues. Duke Mathematical Journal, 166(10):1789–1858, 2017.
  25. Signal detection and classification using matched filtering and higher order statistics. IEEE Transactions on Acoustics, Speech, and Signal Processing, 38(7):1284–1296, 1990.
  26. D. Griffin and J. Lim. Signal estimation from modified short-time Fourier transform. IEEE Transactions on acoustics, speech, and signal processing, 32(2):236–243, 1984.
  27. K. Gröchenig. Foundations of time-frequency analysis. Springer Science & Business Media, 2001.
  28. L. Gross. Abstract Wiener Spaces. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Volume 2: Contributions to Probability Theory, Part 1, volume 5, pages 31–43. University of California Press, 1967.
  29. Zeros of Gaussian Weyl-Heisenberg functions and hyperuniformity of charge. Preprint arXiv:2012.12298v2, 2022.
  30. On estimating the structure factor of a point process, with applications to hyperuniformity. Statistics and Computing, 33, 2023.
  31. A. Holroyd and T. Soo. Insertion and deletion tolerance of point processes. Electronic Journal of Probability, 18:1–24, 2013.
  32. Zeros of Gaussian analytic functions and determinantal point processes, volume 51. American Mathematical Soc., 2009.
  33. E. Jacobsen and R. Lyons. The sliding DFT. IEEE Signal Processing Magazine, 20(2):74–80, 2003.
  34. O. Kallenberg. Foundations of modern probability. Springer, second edition, 2001.
  35. Thomson’s multitaper method revisited. IEEE Transactions on Information Theory, 68(7):4864–4891, 2022.
  36. A genuine test for hyperuniformity. arXiv preprint arXiv:2210.12790, 2022.
  37. Filtering the Continuous Wavelet Transform Using Hyperbolic Triangulations. In 2019 13th International conference on Sampling Theory and Applications (SampTA), pages 1–4. IEEE, 2019.
  38. On demodulation, ridge detection, and synchrosqueezing for multicomponent signals. IEEE Trans. Signal Process., 65(8):2093–2103, 2017.
  39. Unsupervised classification of the spectrogram zeros with an application to signal detection and denoising. Signal Processing, 214:109250, 2024.
  40. A public benchmark for denoising and detection methods. GRETSI’22 XXVIIIème Colloque Francophone de Traitement du Signal et des Images, Sept. 6 - 9 2022.
  41. J. Møller and R. P. Waagepetersen. Statistical inference and simulation for spatial point processes. CRC Press, 2003.
  42. A. Nishry. Asymptotics of the hole probability for zeros of random entire functions. International Mathematics Research Notices, 2010(15):2925–2946, 2010.
  43. Joachim Ohser. On estimators for the reduced second moment measure of point processes. Statistics: A Journal of Theoretical and Applied Statistics, 14(1):63–71, 1983.
  44. A. V. Oppenheim. Discrete-Time Signal Processing. Pearson Education India, 1999.
  45. B. Pascal and R. Bardenet. A covariant, discrete time-frequency representation tailored for zero-based signal detection. IEEE Transactions on Signal Processing, 70:2950–2961, 2022.
  46. B. Pascal and R. Bardenet. Une famille de représentations covariantes de signaux discrets et son application à la détection de signaux à partir de leurs zéros. In GRETSI’22 XXVIIIème Colloque Francophone de Traitement du Signal et des Images, Nancy, France, Sept. 6 - 9 2022.
  47. Mathematical problems of relativistic physics, volume 2. American Mathematical Soc., 1963.
  48. M. Sodin. Zeros of Gaussian analytic functions. Mathematical Research Letters, 7:371–381, 2000.
  49. D. W. Stroock. Probability theory: an analytic view. Cambridge University Press, 2010.
  50. Foundations of Signal Processing. Cambridge University Press, 2014.
  51. L. Wasserman. All of statistics: a concise course in statistical inference, volume 26. Springer, 2004.

Summary

  • The paper introduces a novel framework analyzing spectrogram zeros in Gaussian white noise to enhance signal detection and reconstruction.
  • It employs Gaussian analytic functions to reveal non-random zero distributions, enabling statistically robust signal processing algorithms.
  • The study provides numerical methods, such as the Minimal Grid Neighbor approach, offering practical tools for precise zero localization in discretized spectrograms.

Investigating the Zeros of Spectrogram Representations of White Noise

Introduction to Spectrogram Zeros in Signal Processing

The analysis of zeros in spectrograms generated from white noise provides an intriguing avenue of research within the field of signal processing. Traditionally, signal processing techniques have focused on the manipulation and analysis of signal amplitude and frequency components. However, recent studies suggest that examining the locations and patterns of zeros in time-frequency representations, such as spectrograms, of white noise signals can offer novel insights and methodologies for signal detection and reconstruction tasks.

The Mathematical Framework of Spectrogram Zeros

The paper of spectrogram zeros intersects areas of complex analysis, stochastic processes, and signal processing. Specifically, the representation of a finite-energy signal via the Short-Time Fourier Transform (STFT) under a Gaussian window is pivotal. This transformation maps a signal to a complex-valued function in the time-frequency plane, whose zeros signify points of silence or frequency absence in the signal. Crucially, for Gaussian white noise, these zeros do not distribute randomly but follow distinct spatial statistics governed by the underlying properties of the Gaussian Analytic Functions (GAFs).

Connection between Gaussian Analytic Functions and Time-Frequency Analysis

Gaussian Analytic Functions serve as a mathematical model to describe the distribution of zeros in the complex plane for specific analytic processes. Their relevance in signal processing emerges through the link between the STFT of white noise and particular types of GAFs. Such connections have been established, showing that for Gaussian windows, zeros of the Gaussian white noise spectrogram match those of the planar GAF. This relationship underscores the analytical tractability and statistical predictability of zeros in spectrograms, which are pivotal for algorithmic developments in signal processing.

Spatial Statistics and Signal Processing Applications

Spatial statistics of zeros, including their intensity functions and pair correlation functions, provide a quantitative measure to assess the regularity and repulsiveness among zeros. These properties are instrumental in designing signal processing algorithms. For instance, zero-based Monte Carlo envelope tests leverage the spatial distribution of zeros to distinguish between pure noise and signals corrupted by noise. These tests utilize computationally efficient estimations of spatial statistics, avoiding user-defined thresholds and offering robust detection capabilities even in low signal-to-noise ratio conditions.

Numerical Algorithms for Zero Identification

Practical application of zero-based signal processing techniques necessitates effective numerical algorithms to locate zeros in discretized spectrograms. Approaches such as the Minimal Grid Neighbor method, dealing with discretized data, have shown promise. Recent advancements propose algorithms with theoretical guarantees for precise zero detection, which are crucial for implementing zero-based signal processing methods in real-world scenarios.

Future Directions and Extensions

The investigation into spectrogram zeros is expanding into non-Gaussian windows and generalized signal representations, broadening the applicability and understanding of zero-based methodologies in signal processing. Efforts to characterize the zeros of non-Gaussian spectrogram representations through extended Weyl-Heisenberg groups illustrate the field's growth beyond its initial scope. Moreover, public benchmarks and contributions from the signal processing community further accelerate the development and evaluation of innovative zero-based approaches.

Conclusion

The zeros of time-frequency representations, particularly those arising from white noise signals, offer a rich mathematical structure and practical utility in signal processing. The intersectionality of complex analysis, probability theory, and algorithmic design in this research area not only enriches the theoretical foundation of signal processing but also propels the development of novel methods for signal analysis, detection, and reconstruction tasks. As the field progresses, exploring new mathematical models, extending applicability to various signal types, and enhancing computational methodologies will continue to drive innovation in signal processing research.

X Twitter Logo Streamline Icon: https://streamlinehq.com