arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.04335eess.SPmath.SP
收藏

时间顶点图信号处理中的最优分数阶Fourier滤波

Optimal Fractional Fourier Filtering in Time-vertex Graphs signal processing

Zirui Ge, Haiyan Guo, Tingting Wang, Zhen Yang

摘要:

图形信号处理是处理非规则域数据的有效工具。最优图滤波器能够从失真和噪声中恢复出原始信号,是广义高斯过程中的关键技术之一。然而,目前的研究大多集中在静态图形信号和普通的空间/时间或频率域。时变图形信号具有很强的捕捉真实世界数据特征的能力,而分数阶域可以为信号和噪声的分离提供更合适的空间。在本文中,最佳的时间顶点图滤波器及其Wiener-Hopf方程,开发使用的产品图框架。利用图的分数拉普拉斯算子和图的分数傅里叶变换,得到了分数域上的最优时间-顶点图滤波器。在真实世界数据集上的数值模拟将证明分数域中的最优时间-顶点图滤波器优于普通域中的最优时间-顶点图滤波器和分数域中的最优静态图滤波器。

英文摘要:

Graph signal processing (GSP) is an effective tool in dealing with data residing in irregular domains. In GSP, the optimal graph filter is one of the essential techniques, owing to its ability to recover the original signal from the distorted and noisy version. However, most current research focuses on static graph signals and ordinary space/time or frequency domains. The time-varying graph signals have a strong ability to capture the features of real-world data, and fractional domains can provide a more suitable space to separate the signal and noise. In this paper, the optimal time-vertex graph filter and its Wiener-Hopf equation are developed, using the product graph framework. Furthermore, the optimal time-vertex graph filter in fractional domains is also developed, using the graph fractional Laplacian operator and graph fractional Fourier transform. Numerical simulations on real-world datasets will demonstrate the superiority of the optimal time-vertex graph filter in fractional domains over the optimal time-vertex graph filter in ordinary domains and the optimal static graph filter in fractional domains.

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

↑