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

分布式图过滤的研究进展

Advances in Distributed Graph Filtering

Mario Coutino, Elvin Isufi, Geert Leus

摘要:

图滤波器是图信号处理的核心工具之一。它们的一个核心方面是它们的直接分布式实现。然而,过滤性能通常与分布式通信和计算节省进行交易。为了改善这种权衡,这项工作将最先进的分布式图滤波器推广到每个节点都用不同的值对其邻居的信号进行加权的滤波器,同时保持聚合操作的线性。这种新的实现,标记为边变图过滤器,产生了显着减少的通信轮,同时保持近似精度。此外,我们还刻画了可以用边变递归描述的平移不变图滤波器的子集。通过使用低维参数化,所提出的图滤波器通过局部算子的连续和组合提供了近似线性算子的见解,即,固定的支持矩阵,其跨越图形信号处理领域之外的应用。一组数值结果显示了优势的边变滤波器在当前的方法,并说明了它们的潜力,以更广泛的应用比图过滤。

英文摘要:

Graph filters are one of the core tools in graph signal processing. A central aspect of them is their direct distributed implementation. However, the filtering performance is often traded with distributed communication and computational savings. To improve this tradeoff, this work generalizes state-of-the-art distributed graph filters to filters where every node weights the signal of its neighbors with different values while keeping the aggregation operation linear. This new implementation, labeled as edge-variant graph filter, yields a significant reduction in terms of communication rounds while preserving the approximation accuracy. In addition, we characterize the subset of shift-invariant graph filters that can be described with edge-variant recursions. By using a low-dimensional parametrization the proposed graph filters provide insights in approximating linear operators through the succession and composition of local operators, i.e., fixed support matrices, which span applications beyond the field of graph signal processing. A set of numerical results shows the benefits of the edge-variant filters over current methods and illustrates their potential to a wider range of applications than graph filtering.

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

↑