arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1705.02202cs.SIcs.ITmath.IT
收藏

光滑图形信号的结构化采样与快速重构

Structured sampling and fast reconstruction of smooth graph signals

Gilles Puy, Patrick Pérez

摘要:

这项工作涉及采样的光滑信号的任意图。我们首先研究了结构化的采样策略,这样的光滑的图形信号,包括随机选择的几个预定义的节点组。通过称为\emph{group}图累积相干性的量来驱动要采样以稳定地嵌入$k$带限信号集合的组的数量。对于一些优化的采样分布,我们表明,采样$O(k\log(k))$组总是足以稳定地嵌入一组$k$ -带限信号,但这个数字可以更小-下降到$O(\log(k))$ -取决于节点组的结构。快速的方法来近似这些抽样分布的详细说明。其次,我们考虑$k$ -带限信号,几乎是分段恒定的预定义组的节点。我们表明,这是可能的,以加快重建这样的信号,通过大幅减少的向量的维数进行重建。当结合所提出的结构化采样过程中,我们证明了该方法提供了稳定和准确的原始信号的重建。最后,我们提出了数值实验来说明我们的理论结果,并作为一个例子,展示了如何结合这些方法在图像中使用超像素的交互式对象分割。

英文摘要:

This work concerns sampling of smooth signals on arbitrary graphs. We first study a structured sampling strategy for such smooth graph signals that consists of a random selection of few pre-defined groups of nodes. The number of groups to sample to stably embed the set of $k$-bandlimited signals is driven by a quantity called the \emph{group} graph cumulative coherence. For some optimised sampling distributions, we show that sampling $O(k\log(k))$ groups is always sufficient to stably embed the set of $k$-bandlimited signals but that this number can be smaller -- down to $O(\log(k))$ -- depending on the structure of the groups of nodes. Fast methods to approximate these sampling distributions are detailed. Second, we consider $k$-bandlimited signals that are nearly piecewise constant over pre-defined groups of nodes. We show that it is possible to speed up the reconstruction of such signals by reducing drastically the dimension of the vectors to reconstruct. When combined with the proposed structured sampling procedure, we prove that the method provides stable and accurate reconstruction of the original signal. Finally, we present numerical experiments that illustrate our theoretical results and, as an example, show how to combine these methods for interactive object segmentation in an image using superpixels.

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

↑