A Windowed Graph Fourier Transform

The prevalence of signals on weighted graphs is increasing; however, because of the irregular structure of weighted graphs, classical signal processing techniques cannot be directly applied to signals on graphs. In this paper, we define generalized translation and modulation operators for signals on graphs, and use these operators to adapt the classical windowed Fourier transform to the graph setting, enabling vertex-frequency analysis. When we apply this transform to a signal with frequency components that vary along a path graph, the resulting spectrogram matches our intuition from classical discrete-time signal processing. Yet, our construction is fully generalized and can be applied to analyze signals on any undirected, connected, weighted graph.


Publié dans:
2012 Ieee Statistical Signal Processing Workshop (Ssp), 133-136
Présenté à:
Statistical Signal Processing Workshop, Ann Arbor, Michigan, USA, August 5-8, 2012
Année
2012
Publisher:
New York, Ieee
ISBN:
978-1-4673-0183-1
Mots-clefs:
Laboratoires:


Note: Le statut de ce fichier est: Seulement EPFL


 Notice créée le 2012-03-01, modifiée le 2019-03-16

Preprint:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)