Graph Fourier Transform based on Directed Laplacian
arXiv:1601.03204
Abstract
In this paper, we redefine the Graph Fourier Transform (GFT) under the DSP framework. We consider the Jordan eigenvectors of the directed Laplacian as graph harmonics and the corresponding eigenvalues as the graph frequencies. For this purpose, we propose a shift operator based on the directed Laplacian of a graph. Based on our shift operator, we then define total variation of graph signals, which is used in frequency ordering. We achieve natural frequency ordering and interpretation via the proposed definition of GFT. Moreover, we show that our proposed shift operator makes the LSI filters under DSP to become polynomial in the directed Laplacian.
arXiv comment5 pages
References in corpus (6)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Sampling Theory
- Signal Recovery on Graphs: Variation Minimization
- Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds
- Local-set-based Graph Signal Reconstruction