arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.04537math.NAcs.NA
收藏

利用Lanczos方法加速图上的过滤

Accelerated filtering on graphs using Lanczos method

Ecole Polytechnique Fédérale de Lausanne EPFL(洛桑联邦理工学院)

Ana Susnjara, Nathanael Perraudin, Daniel Kressner, Pierre Vandergheynst

AI总结:

本文提出基于Lanczos方法的加速算法,无需显式计算图拉普拉斯谱即可实现高效准确的图信号过滤,相比切比雪夫多项式方法在精度和可扩展性上更具优势。

摘要:

图上的信号处理在过去十年中已成为非常活跃的研究领域。特别是,利用图构造的框架(如图小波)的应用数量显著增加。为了实现大规模图的可扩展性,需要快速的图信号过滤技术。本文提出了一种基于Lanczos方法的加速算法,该算法能够适应图的拉普拉斯谱而无需显式计算它。结果是一个准确、稳健、可扩展且高效的算法。与基于切比雪夫多项式的现有方法相比,我们的解决方案在不显著增加整体复杂度的情况下实现了更高的精度。此外,它特别适用于具有大谱间隙的图。

英文摘要:

Signal-processing on graphs has developed into a very active field of research during the last decade. In particular, the number of applications using frames constructed from graphs, like wavelets on graphs, has substantially increased. To attain scalability for large graphs, fast graph-signal filtering techniques are needed. In this contribution, we propose an accelerated algorithm based on the Lanczos method that adapts to the Laplacian spectrum without explicitly computing it. The result is an accurate, robust, scalable and efficient algorithm. Compared to existing methods based on Chebyshev polynomials, our solution achieves higher accuracy without increasing the overall complexity significantly. Furthermore, it is particularly well suited for graphs with large spectral gaps.

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

↑