arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1704.01223cs.ITcs.SImath.ITstat.ML
收藏

图信号的贪婪采样

Greedy Sampling of Graph Signals

Luiz F. O. Chamon, Alejandro Ribeiro

摘要:

采样是图形信号处理中的一个基本主题,在估计、聚类和视频压缩中有应用。与传统的信号处理相比,信号域的不规则性使得采样集的选择变得不平凡并且难以分析。实际上,尽管存在从无噪声样本的图形信号插值的条件,但它们不会导致唯一的采样集。噪声的存在使得在这些采样集之间进行选择成为一个困难的组合问题。虽然贪婪采样方案在实践中被广泛使用,但它们没有性能保证。这项工作采取了双重办法来解决这个问题。首先,从噪声样本的图形信号的贝叶斯估计的通用性能界。与当前可用的界限相比,它们不限于特定的采样方案,并且适用于任何采样集。其次,本文通过引入近似子模度的概念和更新经典的贪婪界,为贪婪采样提供了近最优的保证。然后,它提供了明确的界限上的近似supermodularity的插值均方误差表明,它可以优化与最坏情况下的保证,使用贪婪搜索,即使它不是supermodular的。仿真说明了不同的图形模型的推导范围,并显示了图形信号采样的应用,以减少核主成分分析的复杂性。

英文摘要:

Sampling is a fundamental topic in graph signal processing, having found applications in estimation, clustering, and video compression. In contrast to traditional signal processing, the irregularity of the signal domain makes selecting a sampling set non-trivial and hard to analyze. Indeed, though conditions for graph signal interpolation from noiseless samples exist, they do not lead to a unique sampling set. The presence of noise makes choosing among these sampling sets a hard combinatorial problem. Although greedy sampling schemes are commonly used in practice, they have no performance guarantee. This work takes a twofold approach to address this issue. First, universal performance bounds are derived for the Bayesian estimation of graph signals from noisy samples. In contrast to currently available bounds, they are not restricted to specific sampling schemes and hold for any sampling sets. Second, this paper provides near-optimal guarantees for greedy sampling by introducing the concept of approximate submodularity and updating the classical greedy bound. It then provides explicit bounds on the approximate supermodularity of the interpolation mean-square error showing that it can be optimized with worst-case guarantees using greedy search even though it is not supermodular. Simulations illustrate the derived bound for different graph models and show an application of graph signal sampling to reduce the complexity of kernel principal component analysis.

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

↑