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

基于局部集的图信号重构

Local-set-based Graph Signal Reconstruction

Xiaohan Wang, Pengfei Liu, Yuantao Gu

摘要:

基于图的信号处理正受到越来越多的关注。对于低频子空间中的图形信号,可以通过利用图形信号的平滑度来通过采样数据重建与未采样顶点相关联的缺失数据。本文引入局部集的概念,提出了两种基于局部集的迭代法,用于由采样数据重构带限图信号。在每次迭代中,所提出的方法之一重新加权不同顶点的采样残差,而另一个传播的采样残差在各自的本地集。这些算法是建立在框架理论和局部集的概念,在此基础上提出了几个框架和收缩算子。然后,我们证明了重建方法在一定条件下收敛到原始信号,并证明了新方法导致比基线方法更快的收敛速度。此外,本文还全面分析了图形信号采样与时域不规则采样的对应关系,为图形信号的进一步研究提供了参考。进行了计算机模拟。实验结果表明,在不同的采样几何形状,不精确的先验知识的截止频率,和噪声的情况下的重建方法的有效性。

英文摘要:

Signal processing on graph is attracting more and more attentions. For a graph signal in the low-frequency subspace, the missing data associated with unsampled vertices can be reconstructed through the sampled data by exploiting the smoothness of the graph signal. In this paper, the concept of local set is introduced and two local-set-based iterative methods are proposed to reconstruct bandlimited graph signal from sampled data. In each iteration, one of the proposed methods reweights the sampled residuals for different vertices, while the other propagates the sampled residuals in their respective local sets. These algorithms are built on frame theory and the concept of local sets, based on which several frames and contraction operators are proposed. We then prove that the reconstruction methods converge to the original signal under certain conditions and demonstrate the new methods lead to a significantly faster convergence compared with the baseline method. Furthermore, the correspondence between graph signal sampling and time-domain irregular sampling is analyzed comprehensively, which may be helpful to future works on graph signals. Computer simulations are conducted. The experimental results demonstrate the effectiveness of the reconstruction methods in various sampling geometries, imprecise priori knowledge of cutoff frequency, and noisy scenarios.

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

↑