arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2308.02421eess.SPcs.LGmath.STstat.MLstat.TH
收藏

关于跳跃长度的可微短时傅里叶变换

Differentiable short-time Fourier transform with respect to the hop length

INRIA(法国国家信息与自动化研究所);PSL Research University(巴黎文理研究大学);Safran Tech(赛峰科技);Univ Lyon(里昂大学);UJM-St-Etienne(圣艾蒂安让·莫内大学)

Maxime Leiber, Yosra Marnissi, Axel Barrau, Mohammed El Badaoui

AI总结:

提出可微STFT方法,通过连续化跳跃长度参数实现梯度优化,提升时间帧定位精度与计算效率,可集成至现有算法与神经网络。

摘要:

本文提出了一种可微版本的短时傅里叶变换(STFT),通过将跳跃长度或帧时间位置参数化为连续变量,实现了基于梯度的优化。该方法提供了对帧时间位置更精细的控制,同时支持梯度下降等优化手段,计算效率优于传统离散优化方法。该可微STFT可便捷地集成至现有算法与神经网络中。我们通过仿真实验验证了方法的有效性。

英文摘要:

In this paper, we propose a differentiable version of the short-time Fourier transform (STFT) that allows for gradient-based optimization of the hop length or the frame temporal position by making these parameters continuous. Our approach provides improved control over the temporal positioning of frames, as the continuous nature of the hop length allows for a more finely-tuned optimization. Furthermore, our contribution enables the use of optimization methods such as gradient descent, which are more computationally efficient than conventional discrete optimization methods. Our differentiable STFT can also be easily integrated into existing algorithms and neural networks. We present a simulated illustration to demonstrate the efficacy of our approach and to garner interest from the research community.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑