Distributed Signal Processing via Chebyshev Polynomial Approximation

IEEE Trans. Signal and Information Processing over Networks(2018)

引用 91|浏览41
暂无评分
摘要
Unions of graph multiplier operators are an important class of linear operators for processing signals defined on graphs. We present a novel method to efficiently distribute the application of these operators. The proposed method features approximations of the graph multipliers by shifted Chebyshev polynomials, whose recurrence relations make them readily amenable to distributed computation. We demonstrate how the proposed method can be applied to distributed processing tasks such as smoothing, denoising, inverse filtering, and semi-supervised classification, and show that the communication requirements of the method scale gracefully with the size of the network.
更多
查看译文
关键词
Symmetric matrices,Signal processing,Task analysis,Chebyshev approximation,Noise reduction,Information processing,Graph theory
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要