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

Graphon滤波器:极限下的图形信号处理

Graphon Filters: Graph Signal Processing in the Limit

Matthew W. Morency, Geert Leus

摘要:

图信号处理是一个新兴的领域,其目的是对存在于网络节点上的过程进行建模,并通过在该结构上的扩散来解释。迄今为止,图形信号处理工作已经假定了图形移位算子的知识。我们的方法是调查图过滤的问题,我们只知道一个模型的图。为此,我们利用L. Lovasz和B.塞格迪我们对图形信号处理这一新兴领域做出了三个重要贡献。我们首先证明,过滤器定义的缩放邻接矩阵的随机图从一个graphon收敛到过滤器定义的Fredholm积分算子的graphon作为其内核。其次,利用Fredholm积分方程数值解理论的经典发现,我们定义了Fourier-Galerkin移位算子。最后,使用傅里叶-伽辽金移位算子,我们推导出一个图滤波器的设计算法,它只依赖于图子,因此只依赖于图的概率结构,而不是特定的图本身。通过对各种随机图模型的仿真,验证了所推导的图子滤波算法。

英文摘要:

Graph signal processing is an emerging field which aims to model processes that exist on the nodes of a network and are explained through diffusion over this structure. Graph signal processing works have heretofore assumed knowledge of the graph shift operator. Our approach is to investigate the question of graph filtering on a graph about which we only know a model. To do this we leverage the theory of graphons proposed by L. Lovasz and B. Szegedy. We make three key contributions to the emerging field of graph signal processing. We show first that filters defined over the scaled adjacency matrix of a random graph drawn from a graphon converge to filters defined over the Fredholm integral operator with the graphon as its kernel. Second, leveraging classical findings from the theory of the numerical solution of Fredholm integral equations, we define the Fourier-Galerkin shift operator. Lastly, using the Fourier-Galerkin shift operator, we derive a graph filter design algorithm which only depends on the graphon, and thus depends only on the probabilistic structure of the graph instead of the particular graph itself. The derived graphon filtering algorithm is verified through simulations on a variety of random graph models.

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

↑