实用的对数线性尺度图形信号采样
Practical graph signal sampling with log-linear size scaling
摘要:
图信号采样是选择代表性图顶点的子集的问题,其值可以用于在剩余图顶点上插入缺失值。利用实验设计中的概念来优化采样集的选择,可以帮助最小化输入信号中噪声的影响。虽然许多现有的采样集选择方法是计算密集型的,因为它们需要一个特征分解,现有的特征分解的方法仍然比随机采样算法大图慢得多。在本文中,通过优化采样集的D-最优目标,从实验设计,我们提出了一个采样算法,具有复杂性相媲美的随机采样算法,同时达到类似于现有的特征分解的方法,广泛的图形类型的准确性。
英文摘要:
Graph signal sampling is the problem of selecting a subset of representative graph vertices whose values can be used to interpolate missing values on the remaining graph vertices. Optimizing the choice of sampling set using concepts from experiment design can help minimize the effect of noise in the input signal. While many existing sampling set selection methods are computationally intensive because they require an eigendecomposition, existing eigendecompostion-free methods are still much slower than random sampling algorithms for large graphs. In this paper, through optimizing sampling sets towards the D-optimal objective from experiment design, we propose a sampling algorithm that has complexity comparable to random sampling algorithms, while reaching accuracy similar to existing eigendecomposition-free methods for a broad range of graph types.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。