What's in a frequency: new tools for graph Fourier Transform visualization
arXiv:1903.08827
Abstract
Recent progress in graph signal processing (GSP) has addressed a number of problems, including sampling and filtering. Proposed methods have focused on generic graphs and defined signals with certain characteristics, e.g., bandlimited signals, based on t he graph Fourier transform (GFT). However, the effect of GFT properties (e.g., vertex localization) on the behavior of such methods is not as well understood. In this paper, we propose novel GFT visualization tools and provide some examples to illustrate certain GFT properties and their impact on sampling or wavelet transforms.
Paper presented at 2019 Information Theory and Applications Workshop
References in corpus (9)
- Discrete Signal Processing on Graphs
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Signals on Graphs: Uncertainty Principle and Sampling
- A Spectral Graph Uncertainty Principle
- Irregularity-Aware Graph Fourier Transforms
- A Directed Graph Fourier Transform with Spread Frequency Components
- Toward An Uncertainty Principle For Weighted Graphs
- How can we naturally order and organize graph Laplacian eigenvectors?
- Towards a characterization of the uncertainty curve for graphs