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.
School of Mathematics and Statistics, Nanjing University of Information Science and Technology(南京信息工程大学数学与统计学院);Hubei Key Laboratory of Applied Mathematics, Hubei University(湖北大学应用数学湖北省重点实验室)
Optimal Sampling and Reconstruction of Graph Signals in the Fractional Fourier Domain
Nanjing University of Information Science and Technology(南京信息工程大学);Hubei University(湖北大学);Shanghai Jiao Tong University(上海交通大学);Nanjing Institute of Technology(南京工程学院)
A Unified Framework for 2D Nonseparable Fractional Fourier Transform: From Geometric Completeness to Applications
Nanjing University of Information Science and Technology(南京信息工程大学);Hubei University(湖北大学);Shanghai Jiao Tong University(上海交通大学);Hainan Normal University(海南师范大学)