arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.04019eess.SPcs.ITmath.IT
收藏

图上的Wiener滤波器和分布式多项式逼近算法

Wiener filters on graphs and distributed polynomial approximation algorithms

Cong Zheng, Cheng Cheng, Qiyu Sun

摘要:

在本文中,我们考虑维纳滤波器重建确定性和(宽带)固定图信号从他们的观察破坏随机噪声,我们提出了分布式算法来实现维纳滤波器和逆滤波器的网络中,代理配备了有限的数据存储和计算能力的数据处理子系统,并且具有一跳通信子系统,用于仅与它们的相邻代理进行直接数据交换。提出的分布式多项式逼近算法是一种基于Jacobi多项式逼近和Chebyshev插值多项式逼近立方上解析函数的指数收敛拟牛顿方法。我们的数值模拟结果表明,维纳滤波过程中去噪(宽带)平稳信号比Tikhonov正则化方法做得更好,和建议的多项式逼近算法收敛速度比Chebyshev多项式逼近算法和梯度下降算法做的实施与多项式滤波器的交换图移位的逆滤波过程。

英文摘要:

In this paper, we consider Wiener filters to reconstruct deterministic and (wide-band) stationary graph signals from their observations corrupted by random noises, and we propose distributed algorithms to implement Wiener filters and inverse filters on networks in which agents are equipped with a data processing subsystem for limited data storage and computation power, and with a one-hop communication subsystem for direct data exchange only with their adjacent agents. The proposed distributed polynomial approximation algorithm is an exponential convergent quasi-Newton method based on Jacobi polynomial approximation and Chebyshev interpolation polynomial approximation to analytic functions on a cube. Our numerical simulations show that Wiener filtering procedure performs better on denoising (wide-band) stationary signals than the Tikhonov regularization approach does, and that the proposed polynomial approximation algorithms converge faster than the Chebyshev polynomial approximation algorithm and gradient decent algorithm do in the implementation of an inverse filtering procedure associated with a polynomial filter of commutative graph shifts.

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

↑