arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.06182cs.ITmath.IT
收藏

通过随机局部聚集对图信号进行采样

Sampling of graph signals via randomized local aggregations

Diego Valsesia, Giulia Fracastoro, Enrico Magli

摘要:

图的节点上信号的采样是图信号处理中的关键问题之一。虽然在经典信号处理中采样是一个定义良好的操作,但当我们考虑图形信号时,出现了许多新的挑战,并且定义有效的采样策略并不简单。最近,一些作品已经解决了这个问题。最常见的技术选择节点的子集来重建整个信号。然而,这样的方法往往需要的知识的信号支持和计算的稀疏基础之前,采样。相反,在本文中,我们提出了一个新的方法来解决这个问题。我们介绍了一种新的技术,结合本地化采样与压缩感知。我们首先选择一个子集的节点,然后,对于每个节点的子集,我们计算随机线性组合的信号系数本地化在节点本身及其邻域。所提出的方法提供了理论上的保证,重建和稳定性的噪音的任何图形和任何正交基,即使是在支持是未知的。

英文摘要:

Sampling of signals defined over the nodes of a graph is one of the crucial problems in graph signal processing. While in classical signal processing sampling is a well defined operation, when we consider a graph signal many new challenges arise and defining an efficient sampling strategy is not straightforward. Recently, several works have addressed this problem. The most common techniques select a subset of nodes to reconstruct the entire signal. However, such methods often require the knowledge of the signal support and the computation of the sparsity basis before sampling. Instead, in this paper we propose a new approach to this issue. We introduce a novel technique that combines localized sampling with compressed sensing. We first choose a subset of nodes and then, for each node of the subset, we compute random linear combinations of signal coefficients localized at the node itself and its neighborhood. The proposed method provides theoretical guarantees in terms of reconstruction and stability to noise for any graph and any orthonormal basis, even when the support is not known.

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

↑