arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.19934cs.ITeess.SPmath.IT
收藏

通过包络扩展增强图傅里叶变换

Graph Fourier Transform Enhancement through Envelope Extensions

Ali Bagheri Bardi, Taher Yazdanpanah, Milos Dakovic, Ljubisa Stankovic

AI总结:

针对有向图缺乏合适傅里叶基的问题,提出将有向图嵌入Cayley有向图并选择最优包络扩展,以增强图傅里叶变换的数值稳定性并支持卷积定理,从而实现信号分析。

摘要:

许多现实世界的网络具有方向性特征;然而,缺乏合适的傅里叶基阻碍了图信号处理技术的有效实施。受离散信号处理的启发——其中将线有向图嵌入到环有向图中能促进强大的离散傅里叶变换用于信号分析——解决一般有向图的结构复杂性有助于克服图傅里叶变换(GFT)的局限性并释放其潜力。离散傅里叶变换(DFT)在有限循环群 $\mathbb{Z}_N$ 上既作为环图的图傅里叶变换,也作为 Cayley 有向图的图傅里叶变换。我们提出了一种系统方法来识别一类能够包含给定有向图的此类 Cayley 有向图。通过将给定有向图嵌入这些 Cayley 有向图,并选择自然支持图傅里叶变换的包络扩展,可以利用这些扩展的 GFT 功能进行信号分析。在潜在的包络中,通过选择满足关键特性的包络可实现最佳性能。该包络的结构与原始有向图的特征紧密对齐。该包络的图傅里叶变换在数值稳定性方面是可靠的,且其列近似构成与原始有向图相关联的邻接矩阵的特征基。结果表明,包络扩展具有卷积积,且其 GFT 满足卷积定理。此外,移不变图滤波器(系统)被描述为卷积算子,类似于经典情况。这使得能够利用系统进行信号分析。

英文摘要:

Many real-world networks are characterized by directionality; however, the absence of an appropriate Fourier basis hinders the effective implementation of graph signal processing techniques. Inspired by discrete signal processing, where embedding a line digraph into a cycle digraph facilitates the powerful Discrete Fourier Transform for signal analysis, addressing the structural complexities of general digraphs can help overcome the limitations of the Graph Fourier Transform (GFT) and unlock its potential. The Discrete Fourier Transform (DFT) serves as a Graph Fourier Transform for both cycle graphs and Cayley digraphs on the finite cyclic groups $\mathbb{Z}_N$. We propose a systematic method to identify a class of such Cayley digraphs that can encompass a given directed graph. By embedding the directed graph into these Cayley digraphs and opting for envelope extensions that naturally support the Graph Fourier Transform, the GFT functionalities of these extensions can be harnessed for signal analysis. Among the potential envelopes, optimal performance is achieved by selecting one that meets key properties. This envelope's structure closely aligns with the characteristics of the original digraph. The Graph Fourier Transform of this envelope is reliable in terms of numerical stability, and its columns approximately form an eigenbasis for the adjacency matrix associated with the original digraph. It is shown that the envelope extensions possess a convolution product, with their GFT fulfilling the convolution theorem. Additionally, shift-invariant graph filters (systems) are described as the convolution operator, analogous to the classical case. This allows the utilization of systems for signal analysis.

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

↑