Spectral Projector-Based Graph Fourier Transforms
arXiv:1701.02690 · doi:10.1109/JSTSP.2017.2731599
Abstract
The paper presents the graph Fourier transform (GFT) of a signal in terms of its spectral decomposition over the Jordan subspaces of the graph adjacency matrix . This representation is unique and coordinate free, and it leads to unambiguous definition of the spectral components ("harmonics") of a graph signal. This is particularly meaningful when has repeated eigenvalues, and it is very useful when is defective or not diagonalizable (as it may be the case with directed graphs). Many real world large sparse graphs have defective adjacency matrices. We present properties of the GFT and show it to satisfy a generalized Parseval inequality and to admit a total variation ordering of the spectral components. We express the GFT in terms of spectral projectors and present an illustrative example for a real world large urban traffic dataset.
References in corpus (15)
- 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
- Perfect Reconstruction Two-Channel Wavelet Filter-Banks for Graph Structured Data
- Signal Recovery on Graphs: Variation Minimization
- Sampling of graph signals with successive local aggregations
- Autoregressive Moving Average Graph Filtering
- Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
- Signal Processing on Graphs: Causal Modeling of Unstructured Data
- A Spectral Graph Uncertainty Principle
- Learning parametric dictionaries for graph signals
- Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
- Blind Identification of Graph Filters
- Agile Inexact Methods for Spectral Projector-Based Graph Fourier Transforms
- Graph Equivalence Classes for Spectral Projector-Based Graph Fourier Transforms
Cited by in corpus (17)
- Topology Adaptive Graph Convolutional Networks
- Sampling Signals on Graphs: From Theory to Applications
- Spectral Domain Sampling of Graph Signals
- Two-Channel Critically-Sampled Graph Filter Banks With Spectral Domain Sampling
- A Directed Graph Fourier Transform with Spread Frequency Components
- Generalized Sampling on Graphs With Subspace and Smoothness Priors
- Graph Fourier Transform: A Stable Approximation
- Digraph Signal Processing with Generalized Boundary Conditions
- Graph Signal Processing: Dualizing GSP Sampling in the Vertex and Spectral Domains
- Graph Signal Processing: Modulation, Convolution, and Sampling
- Graph Signal Processing for Geometric Data and Beyond: Theory and Applications
- Graph Signal Processing: Overview, Challenges and Applications
- Signal Processing on Directed Graphs
- Extending the Davis-Kahan theorem for comparing eigenvectors of two symmetric matrices I: Theory
- Perfect Reconstruction Two-Channel Filter Banks on Arbitrary Graphs
- Orthogonal Transforms for Signals on Directed Graphs
- A Novel Scheme for Support Identification and Iterative Sampling of Bandlimited Graph Signals