Subgraph-Based Filterbanks for Graph Signals
From MaRDI portal
Abstract: We design a critically-sampled compact-support biorthogonal transform for graph signals, via graph filterbanks. Instead of partitioning the nodes in two sets so as to remove one every two nodes in the filterbank downsampling operations, the design is based on a partition of the graph in connected subgraphs. Coarsening is achieved by defining one "supernode" for each subgraph and the edges for this coarsened graph derives from the connectivity between the subgraphs. Unlike the "one every two nodes" downsampling on bipartite graphs, this coarsening operation does not have an exact formulation in the graph Fourier domain. Instead, we rely on the local Fourier bases of each subgraph to define filtering operations. We apply successfully this method to decompose graph signals, and show promising performance on compression and denoising.
Cited in
(12)- Random sampling of bandlimited signals on graphs
- Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
- eGHWT: the extended generalized Haar-Walsh transform
- Intertwining wavelets or multiresolution analysis on graphs through random forests
- Graph Fourier transform based on \(\ell_1\) norm variation minimization
- Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
- A Multiscale Pyramid Transform for Graph Signals
- Sampling by averages and average splines on Dirichlet spaces and on combinatorial graphs
- Data Analytics on Graphs Part II: Signals on Graphs
- Exact positive quadrature formulas on combinatorial graphs via local average sampling
- Approximation theorems on graphs
- Graph signal sampling and interpolation based on clusters and averages
This page was built for publication: Subgraph-Based Filterbanks for Graph Signals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622071)
