Metraipolis › archive › dc_e7b42dc034f7

Universal Short-Time Fourier Transform: Data-Adaptive Window-Length Selection for Time-Frequency Analysis — arXiv:2610.37795

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.37795
License (as archived)
CC0-1.0
Archived
2026-11-01T02:30:55.146Z
SHA-256 of the archived text
6bfd1e06a677ca9ec41f335d8f9dd0571958f33b0dd1a2b67f910a42d700be10
Stable URL of this page
https://metraipolis.com/documento/dc_e7b42dc034f7

How to cite

Universal Short-Time Fourier Transform: Data-Adaptive Window-Length Selection for Time-Frequency Analysis — arXiv:2610.37795 — arXiv (en), https://arxiv.org/abs/2610.37795 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e7b42dc034f7 (Metraipolis archive dc_e7b42dc034f7, sha256 6bfd1e06a677ca9ec41f335d8f9dd0571958f33b0dd1a2b67f910a42d700be10)
BibTeX
@misc{dce7b42dc034f7,
  title = {Universal Short-Time Fourier Transform: Data-Adaptive Window-Length Selection for Time-Frequency Analysis — arXiv:2610.37795},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.37795},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e7b42dc034f7; sha256 6bfd1e06a677ca9ec41f335d8f9dd0571958f33b0dd1a2b67f910a42d700be10},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.37795. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The short-time Fourier transform (STFT) characterizes the local frequency content of time-varying signals by evaluating the discrete Fourier transform over a sliding analysis window. The STFT is governed by a fundamental resolution trade-off: a short window localizes rapid transients in time at the cost of frequency resolution, whereas a long window resolves closely spaced harmonics at the expense of temporal resolution. The Universal Short-Time Fourier Transform (U-STFT) resolves this trade-off sequentially by modeling the analysis window duration as a data-adaptive state variable that indexes the number of hops included in the current observation interval. At each frame, a bank of candidate window durations is scored using normalized order-three Rényi entropy to quantify joint time-frequency concentration. A window length trellis aggregates the resulting $\mathcal{O}(3^M)$ candidate window schedules with linear complexity per frame, guaranteeing a cumulative mix-loss regret bound of $\mathcal{O}((k+1)\log M)$ relative to any hindsight window schedule with $k$ resolution changes over $M$ frames. By linearity of the Fourier transform, posterior expectation across the candidate bank yields a single spectrum equivalent to an STFT evaluated with a data-adaptive effective window, while an envelope-normalized synthesis stream guarantees exact overlap-add reconstruction. Evaluations on synthetic and marine bioacoustic signals demonstrate adaptive resolution tracking, enhanced spectral concentration, and exact time-domain invertibility.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ML, nuovi lavori del giorno).
Categorie arXiv: Signal Processing (eess.SP) ; Information Theory (cs.IT); Sound (cs.SD); Audio and Speech Processing (eess.AS); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2610.37795 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:13:28.603Z dalla pagina https://arxiv.org/list/stat.ML/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).