Sheaf-theoretic Signal Processing on Graphs: Spectral Theory, Filtering, and Sampling

• URL: http://arxiv.org/abs/2608.01318v1
• Date: Sun, 02 Aug 2026 15:39:26 GMT
• Title: Sheaf-theoretic Signal Processing on Graphs: Spectral Theory, Filtering, and Sampling
• Abstract summary: This paper develops a unified sheaf signal processing framework on network sheaves.<n>It extends the fundamental operations of signal processing, namely spectral analysis, filtering, and sampling.<n>Experiments on synthetic, motion-capture, and financial datasets validate the proposed framework.
• Score: 13.687470962704744
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Modern sensing, communication, and learning systems generate heterogeneous network signals, with local data differing in dimension, modality, and geometric structure. Processing such data requires a mathematical framework capable of simultaneously modeling heterogeneous local signal spaces and the transformations relating them. Network sheaves provide such a framework by associating local vector spaces with network entities and linear restriction maps with their interactions. This is the first paper to develop a unified sheaf signal processing (SSP) framework on network sheaves, extending the fundamental operations of signal processing, namely spectral analysis, filtering, and sampling, to heterogeneous local spaces. Unlike graph and topological signal processing, where signals are modeled over a common vector space, SSP jointly models heterogeneous local signal spaces and the linear transformations relating neighboring spaces through restriction maps. We define the Sheaf Fourier Transform (SFT), whose frequencies quantify signal inconsistency induced by the network topology, the restriction maps, and the local geometry. Building on this representation, we develop polynomial sheaf filters and formulate sampling as the joint selection of network nodes and intra-node components. We derive perfect recovery conditions for bandlimited sheaf signals and propose a greedy sampling-set design algorithm. To incorporate application-dependent signal models, including different bases, dictionaries, and learned embeddings, we introduce representation sheaves and characterize the natural transformations that preserve spectral properties and guarantee interoperability across representations. Experiments on synthetic, motion-capture, and financial datasets validate the proposed framework and demonstrate consistent improvements over canonical graph signal processing baselines.

Related papers

• Generative Diffusion Models of Stochastic Graph Signals [74.4097723209053]
  This paper tackles problems of conditional graph signal generative modeling and tackles them with a single denoising diffusion framework.<n>We learn a reverse diffusion process, parametrized by graph neural networks (GNNs), that draws graph signals conditioned directly on the graph topology and on node-feature side information.<n>We demonstrate our method on two generative tasks: stock price forecasting and optimal wireless resource allocation, with extensive numerical results in both domains.
  arXiv  Detail & Related papers  (2026-07-07T22:02:13Z)
• Topological Signal Processing: An Application-Oriented Tutorial [2.734974690066622]
  Topological Signal Processing (TSP) is an emerging field that generalizes Graph Signal Processing (GSP)<n>We focus on processing techniques based on the Hodge Laplacian, which generalizes the graph Laplacian to simplicial complexes.<n>In particular, we review key TSP concepts, relate them to real-world examples, and discuss how higher-order structures and signals can be derived from datasets.
  arXiv  Detail & Related papers  (2026-05-18T08:21:50Z)
• Implicit Neural Representations: A Signal Processing Perspective [54.57279006229212]
  Implicit neural representations (INRs) mark a fundamental shift in signal modeling, moving from discrete sampled data to continuous functional representations.<n>This article examines the evolution of INRs from a signal processing perspective, emphasizing spectral behavior, sampling theory, and multiscale representation.<n>We highlight the utility of INRs across a broad range of applications, including inverse problems in medical and radar imaging, compression, and 3D scene representation.
  arXiv  Detail & Related papers  (2026-04-16T14:12:06Z)
• RKHS Representation of Algebraic Convolutional Filters with Integral Operators [111.57971404925486]
  In this paper, we develop a theory showing that the range of integral operators naturally induces RKHS convolutional signal models.<n>We show that filtering with integral operators corresponds to iterated box products, giving rise to a unital kernel algebra.<n>Our results establish precise connections between eigendecompositions and RKHS representations in graphon signal processing, extend naturally to directed graphons, and enable novel spatial-spectral localization results.
  arXiv  Detail & Related papers  (2026-02-22T08:28:34Z)
• Data-Driven Graph Filters via Adaptive Spectral Shaping [10.449640808601199]
  We introduce Adaptive Spectral Shaping, a data-driven framework for graph filtering.<n>The framework provides compact spectral modules that plug into graph signal processing pipelines and graph neural networks.
  arXiv  Detail & Related papers  (2026-02-03T16:20:49Z)
• Matched Topological Subspace Detector [16.216899458761773]
  We propose Neyman-Pearson matched topological subspace detectors for signals defined at a single simplicial level (such as edges) or jointly across all levels of a simplicial complex.<n>We demonstrate the effectiveness of the proposed detectors on various real-world data, including foreign currency exchange networks.
  arXiv  Detail & Related papers  (2025-04-08T10:38:30Z)
• ASWT-SGNN: Adaptive Spectral Wavelet Transform-based Self-Supervised Graph Neural Network [20.924559944655392]
  This paper proposes an Adaptive Spectral Wavelet Transform-based Self-Supervised Graph Neural Network (ASWT-SGNN) ASWT-SGNN accurately approximates the filter function in high-density spectral regions, avoiding costly eigen-decomposition. It achieves comparable performance to state-of-the-art models in node classification tasks.
  arXiv  Detail & Related papers  (2023-12-10T03:07:42Z)
• HoloNets: Spectral Convolutions do extend to Directed Graphs [59.851175771106625]
  Conventional wisdom dictates that spectral convolutional networks may only be deployed on undirected graphs. Here we show this traditional reliance on the graph Fourier transform to be superfluous. We provide a frequency-response interpretation of newly developed filters, investigate the influence of the basis used to express filters and discuss the interplay with characteristic operators on which networks are based.
  arXiv  Detail & Related papers  (2023-10-03T17:42:09Z)
• Spectral-Spatial Global Graph Reasoning for Hyperspectral Image Classification [50.899576891296235]
  Convolutional neural networks have been widely applied to hyperspectral image classification. Recent methods attempt to address this issue by performing graph convolutions on spatial topologies.
  arXiv  Detail & Related papers  (2021-06-26T06:24:51Z)
• Quiver Signal Processing (QSP) [145.6921439353007]
  We state the basics for a signal processing framework on quiver representations. We propose a signal processing framework that allows us to handle heterogeneous multidimensional information in networks.
  arXiv  Detail & Related papers  (2020-10-22T08:40:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.