A Multiscale Pyramid Transform for Graph Signals

DOI10.1109/TSP.2015.2512529MaRDI QIDQ4622036zbMATH OpenFDO

Authors David I. Shuman, Mohammadjavad Faraji, P. Vandergheynst

Publication date 8 February 2019

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

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

Mathematics Subject Classification ID

Applications of graph theory (05C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Multiscale transforms designed to process analog and discrete-time signals and images cannot be directly applied to analyze high-dimensional data residing on the vertices of a weighted graph, as they do not capture the intrinsic geometric structure of the underlying graph data domain. In this paper, we adapt the Laplacian pyramid transform for signals on Euclidean domains so that it can be used to analyze high-dimensional data residing on the vertices of a weighted graph. Our approach is to study existing methods and develop new methods for the four fundamental operations of graph downsampling, graph reduction, and filtering and interpolation of signals on graphs. Equipped with appropriate notions of these operations, we leverage the basic multiscale constructs and intuitions from classical signal processing to generate a transform that yields both a multiresolution of graphs and an associated multiresolution of a graph signal on the underlying sequence of graphs.

Recommendations

• Multiscale discrete framelet transform for graph-structured signals
• Signals on graphs: transforms and tomograms
• Introduction to graph signal processing
• Generalizing Graph Signal Processing: High Dimensional Spaces, Models and Structures
• Irregularity-Aware Graph Fourier Transforms
• A Framework of Adaptive Multiscale Wavelet Decomposition for Signals on Undirected Graphs
• Scalable M-Channel Critically Sampled Filter Banks for Graph Signals
• Subgraph-Based Filterbanks for Graph Signals
• Graphon Filters: Graph Signal Processing in the Limit
• Localized Fourier analysis for graph signal processing

Cited in

(18)

• Random sampling of bandlimited signals on graphs
• Random forests and networks analysis
• Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
• Graph coarsening: from scientific computing to machine learning
• Fractional spectral graph wavelets and their applications
• Intertwining wavelets or multiresolution analysis on graphs through random forests
• Splines and wavelets on circulant graphs
• Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
• Three-dimensional steerable discrete cosine transform with application to 3D image compression
• Effective Resistance Preserving Directed Graph Symmetrization
• On the dual geometry of Laplacian eigenfunctions
• Graph reduction with spectral and cut guarantees
• Perfect reconstruction two-channel filter banks on arbitrary graphs
• Mathematical properties of pyramid-transform-based resolution conversion and its applications
• Locally supported, quasi-interpolatory bases for the approximation of functions on graphs
• Extreme values of the Fiedler vector on trees
• Approximation theorems on graphs
• Graph signal sampling and interpolation based on clusters and averages

This page was built for publication: A Multiscale Pyramid Transform for Graph Signals

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