arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.04107eess.SP
收藏

相关图信号的子采样

Subsampling of Correlated Graph Signals

Rishabh Ravi, Kaushani Majumder, Kalp Vyas, Satish Mulleti

AI总结:

针对由图生成模型产生的相关图信号,本文提出基于可容忍误差确定采样节点数的方法和基于相关性的快速贪心选择算法,并在确定性与随机图上验证其可实现近乎完美的重构。

摘要:

图信号是底层图上的函数。当一对节点之间的边权重较高时,相应信号通常具有更高的相关性。因此,这些信号可以用基于图的生成模型来表示。随之产生的问题是,能否仅在少数节点上获取测量值,并利用信号之间的相关结构来重构其余节点上的图信号。我们证明,对于通过生成模型获得的图信号,节点子采样始终是可行的。此外,基于可容忍误差,提出了一种确定待选节点数量的方法。开发了一种基于相关性的快速贪心算法来选择节点。最后,我们在不同的确定性图和随机图上验证了所提方法,并表明通过节点子采样可以实现近乎完美的重构。

英文摘要:

Graph signals are functions of the underlying graph. When the edge-weight between a pair of nodes is high, the corresponding signals generally have a higher correlation. As a result, the signals can be represented in terms of a graph-based generative model. The question then arises whether measurements can be obtained on a few nodes and whether the correlation structure between the signals can be used to reconstruct the graph signal on the remaining nodes. We show that node subsampling is always possible for graph signals obtained through a generative model. Further, a method to determine the number of nodes to select is proposed based on the tolerable error. A correlation-based fast greedy algorithm is developed for selecting the nodes. Finally, we verify the proposed method on different deterministic and random graphs, and show that near-perfect reconstruction is possible with node subsampling.

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

↑