Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs

DOI10.1109/TSP.2013.2273197MaRDI QIDQ4578743zbMATH OpenOpenAlexFDO

Authors Sunil K. Narang, Antonio Ortega

Publication date 22 August 2018

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

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

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Applications of graph theory to circuits and networks (94C15)

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

Cited in

(13)

• Random sampling of bandlimited signals on graphs
• Analysis vs synthesis with structure -- an investigation of union of subspace models on graphs
• 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
• Dual wavelet frame transforms on manifolds and graphs
• Half sampling on bipartite graphs
• Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
• Techniques for Constructing Biorthogonal Bipartite Graph Filter Banks
• Perfect reconstruction two-channel filter banks on arbitrary graphs
• Iterative alternating optimization of bi-orthogonal two-channel graph filter bank
• TFA-CLSTMNN: Novel convolutional network for sound-based diagnosis of COVID-19

This page was built for publication: Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs

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