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

基于图对称性和二分性的快速图傅里叶变换

Fast Graph Fourier Transforms Based on Graph Symmetry and Bipartition

Keng-Shih Lu, Antonio Ortega

摘要:

图傅里叶变换(GFT)是图信号处理的重要工具,其应用范围从基于图的图像处理到谱聚类。然而,与离散傅里叶变换不同,GFT通常不具有快速算法。在这项工作中,我们开发了新的方法来加速GFT计算。特别是,我们表明,Haar单位(Givens旋转角度$π/4$)可以用来减少GFT计算成本时,图是二分的或满足一定的对称性的基础上节点配对。我们还提出了一种基于图拓扑对称性的图分解方法,它允许我们分阶段识别和利用蝴蝶结构。这种方法对于几乎规则或具有某些特定结构的图特别有用,例如,线图、循环图、网格图和人体骨骼图。虽然基于图形拓扑对称的蝶形阶段不能用于一般图形,但它们在包括视频压缩和人体动作分析的应用中是有用的,其中使用对称图形,例如对称线图和人体骨架图。我们提出的快速GFT实现显着降低计算成本,在操作和经验运行时间的数量。

英文摘要:

The graph Fourier transform (GFT) is an important tool for graph signal processing, with applications ranging from graph-based image processing to spectral clustering. However, unlike the discrete Fourier transform, the GFT typically does not have a fast algorithm. In this work, we develop new approaches to accelerate the GFT computation. In particular, we show that Haar units (Givens rotations with angle $π/4$) can be used to reduce GFT computation cost when the graph is bipartite or satisfies certain symmetry properties based on node pairing. We also propose a graph decomposition method based on graph topological symmetry, which allows us to identify and exploit butterfly structures in stages. This method is particularly useful for graphs that are nearly regular or have some specific structures, e.g., line graphs, cycle graphs, grid graphs, and human skeletal graphs. Though butterfly stages based on graph topological symmetry cannot be used for general graphs, they are useful in applications, including video compression and human action analysis, where symmetric graphs, such as symmetric line graphs and human skeletal graphs, are used. Our proposed fast GFT implementations are shown to reduce computation costs significantly, in terms of both number of operations and empirical runtimes.

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

↑