基于平稳信号观测的图扩散过程的刻画与推断
Characterization and Inference of Graph Diffusion Processes from Observations of Stationary Signals
摘要:
来自图形信号处理领域的许多工具利用底层图形的结构的知识(例如,如在拉普拉斯矩阵中编码的)来处理图上的信号。因此,在没有图形可用的情况下,不能再使用图形信号处理工具。研究人员已经提出了从节点上的信号观察来推断图拓扑的方法。由于问题是不适定的,这些方法会做出假设,例如图上信号的平滑性或稀疏性先验。在本文中,我们提出了一个有效的图形空间的特征,在这个意义上,他们可以解释平稳信号。为了简化本文的论述,我们在这里集中在信号是独立同分布的情况下。在时间上的某个点,并且在扩散后在图上观察到。我们证明了验证这一假设的一组图与协方差矩阵的特征向量有很强的联系,并形成一个凸集。随着理论研究,这些特征向量被假定为已知的,我们考虑的实际情况下,当观察是嘈杂的,并通过实验观察如何快速收敛到一组有效的图形时,确切的特征向量是已知的,作为观察的数量增长。为了说明如何将此特征可用于图恢复,我们提出了两种方法,选择一个特定的点在这一组选定的标准下,即图的简单性和稀疏性。此外,我们引入了一个措施来评估有多少图是适应信号下的平稳性假设。最后,我们评估如何通过对温度数据集的实验,最先进的方法与这个框架。
英文摘要:
Many tools from the field of graph signal processing exploit knowledge of the underlying graph's structure (e.g., as encoded in the Laplacian matrix) to process signals on the graph. Therefore, in the case when no graph is available, graph signal processing tools cannot be used anymore. Researchers have proposed approaches to infer a graph topology from observations of signals on its nodes. Since the problem is ill-posed, these approaches make assumptions, such as smoothness of the signals on the graph, or sparsity priors. In this paper, we propose a characterization of the space of valid graphs, in the sense that they can explain stationary signals. To simplify the exposition in this paper, we focus here on the case where signals were i.i.d. at some point back in time and were observed after diffusion on a graph. We show that the set of graphs verifying this assumption has a strong connection with the eigenvectors of the covariance matrix, and forms a convex set. Along with a theoretical study in which these eigenvectors are assumed to be known, we consider the practical case when the observations are noisy, and experimentally observe how fast the set of valid graphs converges to the set obtained when the exact eigenvectors are known, as the number of observations grows. To illustrate how this characterization can be used for graph recovery, we present two methods for selecting a particular point in this set under chosen criteria, namely graph simplicity and sparsity. Additionally, we introduce a measure to evaluate how much a graph is adapted to signals under a stationarity assumption. Finally, we evaluate how state-of-the-art methods relate to this framework through experiments on a dataset of temperatures.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。