Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
arXiv:1210.8129 · doi:10.1109/TSP.2013.2273197
Abstract
In our recent work, we proposed the design of perfect reconstruction orthogonal wavelet filterbanks, called graph- QMF, for arbitrary undirected weighted graphs. In that formulation we first designed "one-dimensional" two-channel filterbanks on bipartite graphs, and then extended them to "multi-dimensional" separable two-channel filterbanks for arbitrary graphs via a bipartite subgraph decomposition. We specifically designed wavelet filters based on the spectral decomposition of the graph, and stated necessary and sufficient conditions for a two-channel graph filter-bank on bipartite graphs to provide aliasing-cancellation, perfect reconstruction and orthogonal set of basis (orthogonality). While, the exact graph-QMF designs satisfy all the above conditions, they are not exactly k-hop localized on the graph. In this paper, we relax the condition of orthogonality to design a biorthogonal pair of graph-wavelets that can have compact spatial spread and still satisfy the perfect reconstruction conditions. The design is analogous to the standard Cohen-Daubechies-Feauveau's (CDF) construction of factorizing a maximally-flat Daubechies half-band filter. Preliminary results demonstrate that the proposed filterbanks can be useful for both standard signal processing applications as well as for signals defined on arbitrary graphs. Note: Code examples from this paper are available at http://biron.usc.edu/wiki/index.php/Graph Filterbanks
Submitted for review in IEEE TSP
References in corpus (1)
Cited by in corpus (39)
- Discrete Signal Processing on Graphs: Sampling Theory
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Signal Recovery on Graphs: Variation Minimization
- Sampling Signals on Graphs: From Theory to Applications
- On the Graph Fourier Transform for Directed Graphs
- Adaptive Least Mean Squares Estimation of Graph Signals
- Adaptive Graph Signal Processing: Algorithms and Optimal Sampling Strategies
- Subgraph-based filterbanks for graph signals
- Irregularity-Aware Graph Fourier Transforms
- Spectral Domain Sampling of Graph Signals
- Distributed Adaptive Learning of Graph Signals
- Spectral Projector-Based Graph Fourier Transforms
- Two-Channel Critically-Sampled Graph Filter Banks With Spectral Domain Sampling
- Generalized Sampling on Graphs With Subspace and Smoothness Priors
- Splines and Wavelets on Circulant Graphs
- Graph Signal Sampling Under Stochastic Priors
- Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI
- Two Channel Filter Banks on Arbitrary Graphs with Positive Semi Definite Variation Operators
- Multiresolution Representations for Piecewise-Smooth Signals on Graphs
- M-Channel Critically Sampled Spectral Graph Filter Banks With Symmetric Structure
- Spectral Domain Spline Graph Filter Bank
- Detecting Localized Categorical Attributes on Graphs
- Localization, Decomposition, and Dictionary Learning of Piecewise-Constant Signals on Graphs
- Signal Recovery on Graphs: Fundamental Limits of Sampling Strategies
- Hilbert Transform, Analytic Signal, and Modulation Analysis for Graph Signal Processing
- Dynamic Polygon Clouds: Representation and Compression for VR/AR
- Scalable -Channel Critically Sampled Filter Banks for Graph Signals
- Message Passing in Graph Convolution Networks via Adaptive Filter Banks
- Learning Optimal Graph Filters for Clustering of Attributed Graphs
- Analysis vs Synthesis with Structure - An Investigation of Union of Subspace Models on Graphs
- Nonsubsampled Graph Filter Banks and Distributed Implementation
- Graph Blind Deconvolution with Sparseness Constraint
- Perfect Reconstruction Two-Channel Filter Banks on Arbitrary Graphs
- Spline-Like Wavelet Filterbanks with Perfect Reconstruction on Arbitrary Graphs
- Design of Sampling Set for Bandlimited Graph Signal Estimation
- Constructing Frequency Domains on Graphs in Near-Linear Time
- Data-Driven Tree Transforms and Metrics
- Recursive Prediction of Graph Signals with Incoming Nodes
- Graph Neural Net using Analytical Graph Filters and Topology Optimization for Image Denoising