Perfect Reconstruction Two-Channel Filter Banks on Arbitrary Graphs

10/05/2022
by   Junxia You, et al.
0

This paper extends the existing theory of perfect reconstruction two-channel filter banks from bipartite graphs to non-bipartite graphs. By generalizing the concept of downsampling/upsampling we establish the frame of two-channel filter bank on arbitrary connected, undirected and weighted graphs. Then the equations for perfect reconstruction of the filter banks are presented and solved under proper conditions. Algorithms for designing orthogonal and biorthogonal banks are given and two typical orthogonal two-channel filter banks are calculated. The locality and approximation properties of such filter banks are discussed theoretically and experimentally.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2020

An Extension of the Birkhoff-von Neumann Theorem to Non-Bipartite Graphs

We prove that a fractional perfect matching in a non-bipartite graph can...
research
01/19/2018

Quasimonotone graphs

For any class C of bipartite graphs, we define quasi-C to be the class o...
research
10/26/2022

Counting Perfect Matchings in Dense Graphs Is Hard

We show that the problem of counting perfect matchings remains #P-comple...
research
01/18/2021

Revisiting the Auction Algorithm for Weighted Bipartite Perfect Matchings

We study the classical weighted perfect matchings problem for bipartite ...
research
11/07/2022

On Fork-free T-perfect Graphs

In an attempt to understanding the complexity of the independent set pro...
research
02/24/2019

Factoring Perfect Reconstruction Filter Banks into Causal Lifting Matrices: A Diophantine Approach

The theory of linear Diophantine equations in two unknowns over polynomi...
research
04/07/2022

On the Price of Locality in Static Fast Rerouting

Modern communication networks feature fully decentralized flow rerouting...

Please sign up or login with your details

Forgot password? Click here to reset