Irregularity-Aware Graph Fourier Transforms

DOI10.1109/TSP.2018.2870386MaRDI QIDQ4622455zbMATH OpenOpenAlexWikidataFDO

Authors Benjamin Girault, Antonio Ortega, Shrikanth S. Narayanan

Publication date 12 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1802.10220

Mathematics Subject Classification ID

Application of orthogonal and other special functions (94A11) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

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.

Cited in

(6)

• Localized Fourier analysis for graph signal processing
• Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
• Graph-Based Transform for 2D Piecewise Smooth Signals With Random Discontinuity Locations
• A Multiscale Pyramid Transform for Graph Signals
• A graph Fourier transform and proportional graphs
• Graph Fourier transform based on singular value decomposition of the directed Laplacian

This page was built for publication: Irregularity-Aware Graph Fourier Transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622455)