用层论框架处理异构图信号,实现更精准的频谱分析与采样。
Sheaf-theoretic Signal Processing on Graphs: Spectral Theory, Filtering, and Sampling

- 基于层结构建模异构局部信号空间及其转换关系。
- 提出层傅里叶变换,频率反映拓扑与局部几何引起的信号不一致。
- 支持多模态信号融合,适合运动捕捉、金融等复杂网络场景。
现代传感、通信和学习系统生成异构网络信号,其局部数据在维度、模态和几何结构上各不相同。处理此类数据需要能同时建模异构局部信号空间及其转换关系的数学框架。网络层(network sheaves)通过将局部向量空间关联到网络节点,并用线性限制映射描述其交互,提供了这样的框架。本文首次构建了统一的层信号处理(SSP)框架,将信号处理的基本操作——频谱分析、滤波和采样——推广至异构局部空间。与图信号处理或拓扑信号处理中假设信号定义于同一向量空间不同,SSP 联合建模异构局部空间及邻近空间间的线性变换关系。本文定义了层傅里叶变换(SFT),其频率量化由网络拓扑、限制映射和局部几何引发的信号不一致性。基于此表示,我们设计了多项式层滤波器,并将采样建模为节点与节点内组件的联合选择。推导出带限层信号的完美恢复条件,并提出一种贪心采样集设计算法。为融入应用相关的信号模型(如不同基、字典或学习嵌入),引入表示层并刻画保持频谱特性且保证跨表示互操作性的自然变换。在合成数据、动作捕捉和金融数据上的实验验证了该框架的有效性,结果持续优于经典图信号处理基线。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。