Approximate fast graph Fourier transforms via multi-layer sparse approximations

Luc Le Magoarou 1 Rémi Gribonval 1 Nicolas Tremblay 2, 3
1 PANAMA - Parcimonie et Nouveaux Algorithmes pour le Signal et la Modélisation Audio
Inria Rennes – Bretagne Atlantique , IRISA_D5 - SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE
3 GIPSA-CICS - CICS
GIPSA-DIS - Département Images et Signal
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.
Liste complète des métadonnées

https://hal.inria.fr/hal-01416110
Contributor : Luc Le Magoarou <>
Submitted on : Friday, June 16, 2017 - 11:43:23 AM
Last modification on : Friday, November 16, 2018 - 1:18:25 AM
Document(s) archivé(s) le : Wednesday, December 13, 2017 - 12:49:11 PM

Files

FFT_graph_hal.pdf
Files produced by the author(s)

Licence


Copyright

Identifiers

Citation

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, IEEE, 2018, 4 (2), pp.407--420. ⟨10.1109/TSIPN.2017.2710619⟩. ⟨hal-01416110v3⟩

Share

Metrics

Record views

1541

Files downloads

601