arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.04084eess.SP
收藏

顶点-时间图信号处理的不确定性原理

Uncertainty Principle for Vertex-Time Graph Signal Processing

Nanyang Technological University(南洋理工大学);University of Southern California(南加州大学)

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

AI总结:

本文提出顶点-时间域图信号处理的不确定性原理,构建新的字典提升信号重建,并通过实验验证其在噪声鲁棒性和图学习性能上的优势。

摘要:

我们提出了一个顶点-时间域中的图信号不确定性原理,将经典的时频和图不确定性原理统一在一个框架内。通过定义顶点-时间域和谱频域的扩展度,我们量化了信号在这些域中的定位性。我们的框架识别出一类在空间和时间域中均达到最大集中度的信号。这些信号成为新的顶点-时间字典的基本原子,增强了在实际约束下(如传感器和社交网络中常见的间断数据)的信号重建能力。此外,我们引入了一种利用不确定性原理的新型图拓扑推断方法。在合成和真实数据集上的数值实验验证了我们方法的有效性,展示了比现有方法更改进的重建准确性、更强的噪声鲁棒性和更优的图学习性能。

英文摘要:

We present an uncertainty principle for graph signals in the vertex-time domain, unifying the classical time-frequency and graph uncertainty principles within a single framework. By defining vertex-time and spectral-frequency spreads, we quantify signal localization across these domains. Our framework identifies a class of signals that achieve maximum concentration in both the spatial and temporal domains. These signals serve as fundamental atoms for a new vertex-time dictionary, enhancing signal reconstruction under practical constraints, such as intermittent data commonly encountered in sensor and social networks. Furthermore, we introduce a novel graph topology inference method leveraging the uncertainty principle. Numerical experiments on synthetic and real datasets validate the effectiveness of our approach, demonstrating improved reconstruction accuracy, greater robustness to noise, and enhanced graph learning performance compared to existing methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑