Accelerated filtering on graphs using Lanczos method

Abstract

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.

Cited by in corpus (10)

• Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering
• Graph Neural Networks with convolutional ARMA filters
• Stationary signal processing on graphs
• Gated Graph Recurrent Neural Networks
• RGCNN: Regularized Graph CNN for Point Cloud Segmentation
• Optimized Skeleton-based Action Recognition via Sparsified Graph Regression
• Localized Fourier Analysis for Graph Signal Processing
• Exploring Structure-Adaptive Graph Learning for Robust Semi-Supervised Classification
• Compressive PCA for Low-Rank Matrices on Graphs
• Fast Haar Transforms for Graph Neural Networks