A Design of Denser-Graph-Frequency Graph Fourier Frames for Graph Signal Analysis (2503.13164v1)

Abstract: This paper introduces a design method for densergraph-frequency graph Fourier frames (DGFFs) to enhance graph signal processing and analysis. The graph Fourier transform (GFT) enables us to analyze graph signals in the graph spectral domain and facilitates various graph signal processing tasks, such as filtering, sampling and reconstruction, denoising, and so on. However, the conventional GFT faces two significant limitations. First, unlike the discrete Fourier transform and its variants (such as discrete cosine transforms), the graph frequencies of the derived graph Fourier basis (GFB) from a given graph tend to be unevenly distributed or localized, which leads to biased spectral analysis. Second, the GFB used in GFT does not provide an efficient sparse representation of graph signals compared to overcomplete systems like frames. To overcome these challenges, we propose adding oscillating vectors with intermediate graph frequencies between the original vectors in the GFB for both undirected and directed graphs, constructing GFFs with densergraph frequencies. The resulting DGFFs are expected to enable more accurate graph signal analysis. Furthermore, we propose a graph filtering method based on the DGFFs. In experiments, we apply the DGFFs to practical applications such as graph signal recovery, demonstrating superior performance compared to existing GFBs.