Are There Approximate Fast Fourier Transforms On Graphs?

Luc Le Magoarou 1 Rémi Gribonval 1
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
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 .
Type de document :
Communication dans un congrès
International Conference on Acoustics, Speech and Signal Processing (ICASSP), Mar 2016, Shanghai, China. Proceedings of the 41st IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2016)
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01254108
Contributeur : Luc Le Magoarou <>
Soumis le : mercredi 20 janvier 2016 - 09:20:22
Dernière modification le : mercredi 16 mai 2018 - 11:24:07
Document(s) archivé(s) le : jeudi 21 avril 2016 - 11:14:58

Fichier

ICASSP2016.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01254108, version 2

Citation

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. Proceedings of the 41st IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2016). 〈hal-01254108v2〉

Partager

Métriques

Consultations de la notice

1404

Téléchargements de fichiers

710