Approximate fast graph Fourier transforms via multi-layer sparse approximations - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Signal and Information Processing over Networks Year : 2018

Approximate fast graph Fourier transforms via multi-layer sparse approximations

Abstract

The Fast Fourier Transform (FFT) is an algorithm of paramount importance in signal processing as it allows to apply the Fourier transform in O(n log n) instead of O(n 2) arithmetic operations. Graph Signal Processing (GSP) is a recent research domain that generalizes classical signal processing tools, such as the Fourier transform, to situations where the signal domain is given by any arbitrary graph instead of a regular grid. Today, there is no method to rapidly apply graph Fourier transforms. We propose in this paper a method to obtain approximate graph Fourier transforms that can be applied rapidly and stored efficiently. It is based on a greedy approximate diagonalization of the graph Laplacian matrix, carried out using a modified version of the famous Jacobi eigenvalues algorithm. The method is described and analyzed in detail, and then applied to both synthetic and real graphs, showing its potential.
Fichier principal
Vignette du fichier
FFT_graph_hal.pdf (1.95 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01416110 , version 1 (14-12-2016)
hal-01416110 , version 2 (06-04-2017)
hal-01416110 , version 3 (16-06-2017)

Licence

Copyright

Identifiers

Cite

Luc Le Magoarou, Rémi Gribonval, Nicolas Tremblay. Approximate fast graph Fourier transforms via multi-layer sparse approximations. IEEE Transactions on Signal and Information Processing over Networks, 2018, 4 (2), pp.407--420. ⟨10.1109/TSIPN.2017.2710619⟩. ⟨hal-01416110v3⟩
1240 View
1311 Download

Altmetric

Share

Gmail Facebook X LinkedIn More