SVD-based ugmt-gft on directed product graphs (2510.10532v1)

Abstract: Traditional directed graph signal processing generally depends on fixed representation matrices, whose rigid structures limit the model's ability to adapt to complex graph topologies. To address this issue, this study employed the unified graph representation matrix (UGRM) to propose a generalized graph Fourier transform (UGRM-GFT) method based on singular value decomposition (SVD) for signal analysis on directed graphs and Cartesian product graphs. We defined UGRM-GFT for general directed graphs by introducing a parameterized UGRM that incorporates traditional representations such as the Laplacian matrix and adjacency matrix. The SVD is used to construct spectral transform pairs with both left and right singular vectors. We extended this approach to two types of UGRM-GFTs applied to directed Cartesian product graphs. UGRM-GFT-I performs SVD directly on the composite UGRM matrix of the two-dimensional graph structure, suitable for globally coupled graph signals. UGRM-GFT-II separately applies SVD to the UGRMs of the two-factor graphs and then combines the results, significantly reducing computational complexity while preserving spectral expressiveness. Theoretical analysis confirmed the monotonicity of the proposed method with respect to the parameters alpha and k embedded in the UGRM. Experimental results on real-world datasets demonstrated that the proposed method significantly outperforms traditional fixed-matrix approaches in denoising tasks, with a particular emphasis on signal-to-noise ratio and bandwidth efficiency.