A Multiscale Pyramid Transform for Graph Signals
Authors:
- 25 December 2015
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 64 (8) , 2119-2134
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 topology of the 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.Keywords
All Related Versions
Funding Information
- European Research Council (FET-Open grant number 255931 UNLocX)
This publication has 52 references indexed in Scilit:
- Downsampling of Signals on Graphs Via Maximum Spanning TreesIEEE Transactions on Signal Processing, 2014
- Coarsening graph signal with spectral invariance2014
- Discrete Signal Processing on GraphsIEEE Transactions on Signal Processing, 2013
- Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear SolverSIAM Journal on Scientific Computing, 2012
- Graph Sparsification by Effective ResistancesSIAM Journal on Computing, 2011
- Functions of Matrices2008
- Weighted Graph Cuts without Eigenvectors A Multilevel ApproachIEEE Transactions on Pattern Analysis and Machine Intelligence, 2007
- Diffusion maps and coarse-graining: a unified framework for dimensionality reduction, graph partitioning, and data set parameterizationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2006
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- Resistance distanceJournal of Mathematical Chemistry, 1993