Subgraph-Based Filterbanks for Graph Signals

From MaRDI portal
Publication:4622071

DOI10.1109/TSP.2016.2544747zbMATH Open1414.94625arXiv1509.05642MaRDI QIDQ4622071FDOQ4622071


Authors: Pierre Borgnat, N. Tremblay Edit this on Wikidata


Publication date: 8 February 2019

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

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.


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







Cited In (11)





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)