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.


Editor(s):
Shuman, David
Ricaud, Benjamin
Vandergheynst, Pierre
Presented at:
IEEE Statistical Signal Processing Workshop, Ann Arbor, Michigan, USA, August 5-8, 2012
Publisher:
IEEE
Keywords:
Laboratories:


Note: The status of this file is: EPFL only


 Record created 2012-05-07, last modified 2018-01-28

External link:
Download fulltext
Preprint
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)