MATHICSE Technical Report : Accelerated filtering on graphs using Lanczos method

Sinal-processing on graphs has developed into a very active field of research during the last decade. In particular, the number of applications using frames con-structed 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.


Year:
2015-09
Publisher:
Écublens, MATHICSE
Note:
MATHICSE Technical Report Nr. 24.2015 September 2015
Laboratories:




 Record created 2019-11-29, last modified 2019-12-05

Version 1:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)