arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.10649eess.SPcs.SI
收藏

图信号处理中的局部分布

On Local Distributions in Graph Signal Processing

T. Mitchell Roddenberry, Fernando Gama, Richard G. Baraniuk, Santiago Segarra

摘要:

图滤波是图信号处理(GSP)的基础运算。因此,理解它是开发有效的普惠制方法的关键。图过滤器是局部和分布式线性操作,其输出仅取决于每个节点的局部邻域。此外,图过滤器的输出可以在每个节点上通过与直接邻居进行重复交换来单独计算。图过滤器可以被压缩地写为图移位算子的多项式(通常,图的稀疏矩阵描述)。这导致了滤波器的属性与相应矩阵的频谱属性的关联-它编码了图的全局结构。在这项工作中,我们提出了一个框架,仅依赖于一个图的邻域的局部分布。这种方法的关键是描述图形和图形信号的可测量空间的根球。利用这一点,我们能够无缝地比较不同大小和来自不同模型的图,产生关于谱密度收敛、滤波器在任意图上的可转移性以及图信号特性相对于局部子结构分布的连续性的结果。

英文摘要:

Graph filtering is the cornerstone operation in graph signal processing (GSP). Thus, understanding it is key in developing potent GSP methods. Graph filters are local and distributed linear operations, whose output depends only on the local neighborhood of each node. Moreover, a graph filter's output can be computed separately at each node by carrying out repeated exchanges with immediate neighbors. Graph filters can be compactly written as polynomials of a graph shift operator (typically, a sparse matrix description of the graph). This has led to relating the properties of the filters with the spectral properties of the corresponding matrix -- which encodes global structure of the graph. In this work, we propose a framework that relies solely on the local distribution of the neighborhoods of a graph. The crux of this approach is to describe graphs and graph signals in terms of a measurable space of rooted balls. Leveraging this, we are able to seamlessly compare graphs of different sizes and coming from different models, yielding results on the convergence of spectral densities, transferability of filters across arbitrary graphs, and continuity of graph signal properties with respect to the distribution of local substructures.

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

↑