反褶积
短时傅里叶变换
时频分析
窗口函数
计算机科学
算法
核(代数)
傅里叶变换
维格纳分布函数
盲反褶积
时频表示法
卷积(计算机科学)
人工智能
数学
光谱密度
人工神经网络
傅里叶分析
滤波器(信号处理)
计算机视觉
电信
数学分析
物理
组合数学
量子力学
量子
作者
Zixin Wang,Lixing Chen,Peng Xiao,Luping Xu,Zhenglin Li
摘要
Abstract The fixed window function used in the short‐time Fourier transform (STFT) does not guarantee both time and frequency resolution, exerting a negative impact on the subsequent study of time‐frequency analysis (TFA). To avoid these limitations, a post‐processing method that enhances the time‐frequency resolution using a deep‐learning (DL) framework is proposed. Initially, the deconvolution theoretical formula is derived and a post‐processing operation is performed on the time‐frequency representation (TFR) of the STFT via deconvolution, a theoretical calculation to obtain the ideal time‐frequency representation (ITFR). Then, aiming at the adverse influence of the window function, a novel fully‐convolutional encoder‐decoder network is trained to preserve effective features and acquire the optimal time‐frequency kernel. In essence, the generation of the optimal time‐frequency kernel can be regarded as a deconvolution process. The authors conducted the qualitative and quantitative analyses of numerical simulations, with experimental results demonstrate that the proposed method achieves satisfactory TFR, possesses strong anti‐noise capabilities, and exhibits high steady‐state generalisation capability. Furthermore, results of a comparative experiment with several TFA methods indicate that the proposed method yields significantly improved performance in terms of time‐frequency resolution, energy concentration, and computational load.
科研通智能强力驱动
Strongly Powered by AbleSci AI