Frames and vertex-frequency representations in graph fractional Fourier domain
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Anomaly DetectionComputational EfficiencySimilar Papers 제목 키워드 기반
Optimal Fractional Fourier Filtering in Time-vertex Graphs signal processing
Graph signal processing (GSP) is an effective tool in dealing with data residing in irregular domains. In GSP, the optimal graph filter is one of the essential techniques, owing to its ability to recover the original sig…
Graph Chirp Signal and Graph Fractional Vertex-Frequency Energy Distribution
Graph signal processing (GSP) has emerged as a powerful framework for analyzing data on irregular domains. In recent years, many classical techniques in signal processing (SP) have been successfully extended to GSP. Amon…
DenoisingJoint Time-Vertex Fractional Fourier Transform
Graph signal processing (GSP) facilitates the analysis of high-dimensional data on non-Euclidean domains by utilizing graph signals defined on graph vertices. In addition to static data, each vertex can provide continuou…
DenoisingTime SeriesTime Series AnalysisVertex-Frequency Graph Signal Processing: A review
Graph signal processing deals with signals which are observed on an irregular graph domain. While many approaches have been developed in classical graph theory to cluster vertices and segment large graphs in a signal ind…
SVD-Based Graph Fractional Fourier Transform on Directed Graphs and Its Application
Graph fractional Fourier transform (GFRFT) is an extension of graph Fourier transform (GFT) that provides an additional fractional analysis tool for graph signal processing (GSP) by generalizing temporal-vertex domain Fo…
Denoising