Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs

From MaRDI portal
Publication:4578743

DOI10.1109/TSP.2013.2273197zbMATH Open1393.94978arXiv1210.8129OpenAlexW2024496749MaRDI QIDQ4578743FDOQ4578743


Authors: Sunil K. Narang, Antonio Ortega Edit this on Wikidata


Publication date: 22 August 2018

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

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


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







Cited In (13)





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)