Irregularity-Aware Graph Fourier Transforms
arXiv:1802.10220 · doi:10.1109/TSP.2018.2870386
Abstract
In this paper, we present a novel generalization of the graph Fourier transform (GFT). Our approach is based on separately considering the definitions of signal energy and signal variation, leading to several possible orthonormal GFTs. Our approach includes traditional definitions of the GFT as special cases, while also leading to new GFT designs that are better at taking into account the irregular nature of the graph. As an illustration, in the context of sensor networks we use the Voronoi cell area of vertices in our GFT definition, showing that it leads to a more sensible definition of graph signal energy even when sampling is highly irregular.
arXiv commentThis article has been published in IEEE Transactions on Signal Processing
References in corpus (7)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Discrete Signal Processing on Graphs
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
- Signal Processing on Graphs: Causal Modeling of Unstructured Data
- On the Graph Fourier Transform for Directed Graphs
- Random Walk Graph Laplacian based Smoothness Prior for Soft Decoding of JPEG Images
Cited by in corpus (24)
- Learning graphs from data: A signal representation perspective
- Revisiting Graph Neural Networks: All We Have is Low-Pass Filters
- 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
- Low-complexity Graph Sampling with Noise and Signal Reconstruction via Neumann Series
- A Hilbert Space Theory of Generalized Graph Signal Processing
- Fast Graph Fourier Transforms Based on Graph Symmetry and Bipartition
- Two Channel Filter Banks on Arbitrary Graphs with Positive Semi Definite Variation Operators
- Localized Fourier Analysis for Graph Signal Processing
- Graph Vertex Sampling with Arbitrary Graph Signal Hilbert Spaces
- Graph Signal Processing for Geometric Data and Beyond: Theory and Applications
- Human Action Recognition with Multi-Laplacian Graph Convolutional Networks
- Perceptually inspired weighted MSE optimization using irregularity-aware graph Fourier transform
- Large Graph Signal Denoising with Application to Differential Privacy
- What's in a frequency: new tools for graph Fourier Transform visualization
- Haar-Laplacian for directed graphs
- Graph Signal Processing over a Probability Space of Shift Operators
- Orthogonal Transforms for Signals on Directed Graphs
- Subgraph Signal Processing
- Sampling Theory of Bandlimited Continuous-Time Graph Signals
- Signal processing with a distribution of graph operators