Design of orthogonal graph filter bank with known eigenvalues of Laplacian matrix

Abstract

In the conventional designs of orthogonal graph filter bank, both eigenvalues and eigenvectors of Laplacian matrix are assumed to be unknown such that graph filter bank can be efficiently implemented by using polynomial graph filters; that is, the output signal at each vertex is computed only from the signal at that vertex and its K -hop neighbourhoods. However, the disadvantage of these methods is that the designed orthogonal filter bank does not have the exact perfect reconstruction (PR). In this study, the authors first assume that the eigenvalues of Laplacian matrix are known but eigenvectors are still unknown. Then, the orthogonal graph filter bank is designed by solving the simultaneous equation or Lagrange multiplier method such that the PR condition at all eigenvalues can be achieved for a given graph structure. Although the proposed filter bank is a graph-structure-dependent design, it can be efficiently implemented by using polynomial graph filters. Finally, experimental results are shown to demonstrate the effectiveness of the proposed design method.