CORTEXA
← Browse
arxiveess.SP2026-07-17

Optimal Sampling and Reconstruction of Graph Signals in the Fractional Fourier Domain

Xiaopeng Cheng, Zhichao Zhang, Yangfan He

Graph signal sampling and reconstruction are commonly formulated in the graph Fourier transform (GFT) domain. However, the reconstruction performance may be limited when practical graph signals are not sufficiently concentrated in the GFT spectrum. To address this issue, this paper proposes a graph signal sampling and reconstruction framework based on the graph fractional Fourier transform (GFRFT) domain. The fractional order is introduced as an adjustable spectral domain parameter, and the optimal order is selected to provide a more suitable representation domain for a given graph signal and sampling model. Under a unified sampling reconstruction formulation, subspace, smoothness, and stochastic priors are incorporated, and both unconstrained and predefined reconstruction mechanisms are considered, leading to several fractional domain sampling and reconstruction methods. Furthermore, the theoretical analysis shows that the optimal GFRFT domain can provide a more suitable low-dimensional spectral representation by improving energy concentration and reducing projection residual. The effects of residual leakage and noise amplification are further considered to explain how this representation advantage is translated into reconstruction error reduction. Experimental results show that, GFRFT domain sampling and reconstruction generally achieve better recovery performance than GFT domain methods.

View free PDFSource page

Related papers

arxivcs.LGeess.SP2026-07-07

Generative Diffusion Models of Stochastic Graph Signals

Yiğit Berkay Uslu, Samar Hadou, Sergio Rozada, Shirin Saeedi Bidokhti, Alejandro Ribeiro

Sampling stochastic signals supported on a graph underlies many graph machine learning tasks, including recommender systems, forecasting in financial markets, and wireless network optimization. In these settings, the target signals are realizations of unknown conditional distribu…

View free PDFSource page
arxiveess.SP2026-07-14

Harmonic Analysis on Graphs via Isometric Group Embedding: A Canonical Fourier Transform, Shift, and Convolution for Network Signals

Rigobert Fokam Souop, Laurent Bitjoka

Graph signal processing built on the eigenvectors of a Laplacian or adjacency shift inherits three structural compromises: the eigenbasis is fixed only up to rotation within degenerate eigenspaces, the shift is not an isometry, and there is no genuine translation under which filt…

View free PDFSource page
arxiveess.SP2026-07-22

Graph Distribution-valued Signals in Wasserstein Spaces: Theory and Applications

Yanan Zhao, Feng Ji, Xingchao Jian, Wee Peng Tay

We introduce a framework for graph signal processing (GSP) in which signals are represented as graph distribution-valued signals (GDSs), i.e., probability measures in a Wasserstein space. This perspective addresses fundamental limitations of classical vector-based GSP, including…

View free PDFSource page