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

图分数阶傅里叶域中的框架与顶点-频率表示

Frames and vertex-frequency representations in graph fractional Fourier domain

Linbo Shang, Zhichao Zhang

AI总结:

本文在图分数阶傅里叶域中提出多窗图分数阶傅里叶框架与变换,并设计快速算法及移位版本,以提升顶点-频率特征提取和异常检测性能。

摘要:

顶点-频率分析,尤其是加窗图傅里叶变换(WGFT),是图信号处理中的一个重要挑战。紧框架理论以信号重构中较低的计算复杂度而著称,而分数阶方法则在揭示图信号更细致的结构特征方面表现出色。在图分数阶傅里叶域中,我们引入了多窗图分数阶傅里叶框架(MWGFRFF),以促进紧框架的构造。由此发展了多窗图分数阶傅里叶变换(MWGFRFT),实现了新的顶点-频率分析方法。我们推导了重构公式,并给出了关于对偶框架和紧框架的结果。为了提高计算效率,提出了一种快速MWGFRFT(FMWGFRFT)算法。此外,我们定义了移位多窗图分数阶傅里叶框架(SMWGFRFF)及其相关变换(SMWGFRFT),并探讨了它们的对偶框架和紧框架。实验结果表明,FMWGFRFT和SMWGFRFT在图分数阶傅里叶域中提取顶点-频率特征方面表现优异,二者结合使用可优化分析性能。在信号异常检测中的应用展示了FMWGFRFT的优势。

英文摘要:

Vertex-frequency analysis, particularly the windowed graph Fourier transform (WGFT), is a significant challenge in graph signal processing. Tight frame theories is known for its low computational complexity in signal reconstruction, while fractional order methods shine at unveil more detailed structural characteristics of graph signals. In the graph fractional Fourier domain, we introduce multi-windowed graph fractional Fourier frames (MWGFRFF) to facilitate the construction of tight frames. This leads to developing the multi-windowed graph fractional Fourier transform (MWGFRFT), enabling novel vertex-frequency analysis methods. A reconstruction formula is derived, along with results concerning dual and tight frames. To enhance computational efficiency, a fast MWGFRFT (FMWGFRFT) algorithm is proposed. Furthermore, we define shift multi-windowed graph fractional Fourier frames (SMWGFRFF) and their associated transform (SMWGFRFT), exploring their dual and tight frames. Experimental results indicate that FMWGFRFT and SMWGFRFT excel in extracting vertex-frequency features in the graph fractional Fourier domain, with their combined use optimizing analytical performance. Applications in signal anomaly detection demonstrate the advantages of FMWGFRFT.

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

↑