Are There Approximate Fast Fourier Transforms On Graphs? - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Are There Approximate Fast Fourier Transforms On Graphs?

Abstract

Signal processing on graphs is a recent research domain that seeks to extend classical signal processing tools such as the Fourier transform to irregular domains given by a graph. In such a graph setting, a way to rapidly apply the Fourier transform, i.e. a Fast Fourier Transform (FFT), is lacking. In this paper, we propose to leverage the recently introduced Flexible Approximate MUlti-layer Sparse Transforms (FAµST) in order to compute approximate FFTs on graphs. The approach is first described, then validated on several types of classical graphs and finally used for fast filtering, showing good potential .
Fichier principal
Vignette du fichier
ICASSP2016.pdf (1.72 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01254108 , version 1 (11-01-2016)
hal-01254108 , version 2 (20-01-2016)

Identifiers

  • HAL Id : hal-01254108 , version 2

Cite

Luc Le Magoarou, Rémi Gribonval. Are There Approximate Fast Fourier Transforms On Graphs? . International Conference on Acoustics, Speech and Signal Processing (ICASSP), Mar 2016, Shanghai, China. ⟨hal-01254108v2⟩
586 View
1342 Download

Share

Gmail Facebook X LinkedIn More