• Corpus ID: 84844909

What's in a frequency: new tools for graph Fourier Transform visualization

  title={What's in a frequency: new tools for graph Fourier Transform visualization},
  author={Benjamin Girault and Antonio Ortega},
  journal={arXiv: Signal Processing},
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… 

Figures from this paper

Sampling on Graphs: From Theory to Applications

Current progress on sampling over graphs focusing on theory and potential applications is reviewed, including similarities and differences between standard and graph sampling and open problems and challenges.

Sampling Signals on Graphs: From Theory to Applications

The study of sampling signals on graphs with the goal of building an analog of sampling for standard signals in the time and spatial domains is reviewed, focusing on theory and potential applications.

Natural Graph Wavelet Packet Dictionaries

We introduce a set of novel multiscale basis transforms for signals on graphs that utilize their "dual" domains by incorporating the "natural" distances between graph Laplacian eigenvectors, rather



The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains

This tutorial overview outlines the main challenges of the emerging field of signal processing on graphs, discusses different ways to define graph spectral domains, which are the analogs to the classical frequency domain, and highlights the importance of incorporating the irregular structures of graph data domains when processing signals on graphs.

Graph Signal Processing: Overview, Challenges, and Applications

An overview of core ideas in GSP and their connection to conventional digital signal processing are provided, along with a brief historical perspective to highlight how concepts recently developed build on top of prior research in other areas.

Towards a characterization of the uncertainty curve for graphs

This paper proposes a characterization of the signals achieving this curve, for a larger class of graphs than the one studied by Agaskar and Lu, which consists in determining a curve that represents a lower bound on the compromise between Precision in the graph domain and precision in the spectral domain.

Wavelets on Graphs via Spectral Graph Theory

Global and Local Uncertainty Principles for Signals on Graphs

A new way to incorporate a notion of locality is suggested, and local uncertainty principles that bound the concentration of the analysis coefficients of each atom of a localized graph spectral filter frame in terms of quantities that depend on the local structure of the graph around the center vertex of the given atom are developed.

Discrete Signal Processing on Graphs

This paper extends to signals on graphs DSP and its basic tenets, including filters, convolution, z-transform, impulse response, spectral representation, Fourier transform, frequency response, and illustrates DSP on graphs by classifying blogs, linear predicting and compressing data from irregularly located weather stations, or predicting behavior of customers of a mobile service provider.

Signals on Graphs: Uncertainty Principle and Sampling

An uncertainty principle for graph signals is derived and the conditions for the recovery of band-limited signals from a subset of samples are illustrated and shown, showing an interesting link between uncertainty principle and sampling and proposing alternative signal recovery algorithms.

How Can We Naturally Order and Organize Graph Laplacian Eigenvectors?

  • N. Saito
  • Computer Science
    2018 IEEE Statistical Signal Processing Workshop (SSP)
  • 2018
A new method to organize eigenvectors using the Ramified Optimal Transport Theory followed by embedding them into a low-dimensional Euclidean domain is proposed.

Irregularity-Aware Graph Fourier Transforms

A novel generalization of the graph Fourier transform (GFT) is presented, using the Voronoi cell area of vertices in the authors' GFT definition, showing that it leads to a more sensible definition of graph signal energy even when sampling is highly irregular.

A Directed Graph Fourier Transform With Spread Frequency Components

It is shown that the spectral-dispersion minimization problem can be cast as supermodular optimization over the set of candidate frequency components, whose orthonormality can be enforced via a matroid basis constraint.