Spectral Folding And Two-Channel Filter-Banks On Arbitrary Graphs

@article{Pavez2021SpectralFA,
  title={Spectral Folding And Two-Channel Filter-Banks On Arbitrary Graphs},
  author={Eduardo Pavez and Benjamin Girault and Antonio Ortega and Philip A. Chou},
  journal={ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
  year={2021},
  pages={5070-5074}
}
  • Eduardo Pavez, Benjamin Girault, +1 author P. Chou
  • Published 23 October 2020
  • Computer Science, Engineering
  • ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
In the past decade, several multi-resolution representation theories for graph signals have been proposed. Bipartite filter-banks stand out as the most natural extension of time domain filter-banks, in part because perfect reconstruction, orthogonality and bi-orthogonality conditions in the graph spectral domain resemble those for traditional filter-banks. Therefore, many of the well known orthogonal and bi-orthogonal designs can be easily adapted for graph signals. A major limitation is that… 

Figures from this paper

Spectral Domain Spline Graph Filter Bank
In this letter, we present a structure for two-channel spline graph filter bank with spectral sampling (SGFBSS) on arbitrary undirected graphs. Our proposed structure has many desirable properties;

References

SHOWING 1-10 OF 32 REFERENCES
Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
TLDR
This work proposes the construction of two-channel wavelet filter banks for analyzing functions defined on the vertices of any arbitrary finite weighted undirected graph, and proposes quadrature mirror filters for bipartite graph which cancel aliasing and lead to perfect reconstruction.
Techniques for Constructing Biorthogonal Bipartite Graph Filter Banks
TLDR
It is shown that filters having virtual spectral symmetry and almost energy preservation can be constructed without any sophisticated optimization, and fine control of the spectral response can also be achieved with ease.
Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
TLDR
This paper relax the condition of orthogonality to design a biorthogonal pair of graph-wavelets that are k-hop localized with compact spectral spread and still satisfy the perfect reconstruction conditions.
Bipartite Graph Filter Banks: Polyphase Analysis and Generalization
TLDR
The proposed polyphase analysis yields filtering structures in the downsampled domain that are equivalent to those before downsampling and, thus, can be exploited for efficient implementation and be exploited in the design of these systems.
Two-Channel Critically Sampled Graph Filter Banks With Spectral Domain Sampling
TLDR
Along with the structure of the filter banks, this paper proves the general criterion for perfect reconstruction and theoretically shows that the vertex and spectral domain sampling coincide for a special case.
ADMM-based Bipartite Graph Approximation
TLDR
A novel bipartite graph approximation algorithm is presented that outperforms the other proposals in terms of approximation accuracy and an alternating direction method of multipliers (ADMM) is further developed to achieve a real adjacency matrix.
Bipartite Approximation for Graph Wavelet Signal Decomposition
TLDR
This paper designs new bipartite approximation strategies for model-based and empirically derived probability distributions and proposes a local heuristic approach for fast implementation with simplifications leading to local metric computation.
Local two-channel critically sampled filter-banks on graphs
TLDR
This paper proposes two-channel filter-bank designs for signals defined on arbitrary graphs that are local, invertible and critically sampled, and proposes general 2-channel transforms, where output signal is downsampled to guarantee invertibility.
Oversampled Graph Laplacian Matrix for Graph Filter Banks
TLDR
This work describes a method of oversampling signals defined on a weighted graph by using an oversampled graph Laplacian matrix that can append nodes and edges to the graph somewhat arbitrarily and makes one Oversampled bipartite graph that includes all edges of the original non-bipartitegraph.
Splines and Wavelets on Circulant Graphs
TLDR
This work leverage the inherent vanishing moment property of the circulant graph Laplacian operator, and by extension, the e-graph LaPLacian, for the design of vertex-localized and critically-sampled higher-order graph (e-)spline wavelet filterbanks, which can reproduce and annihilate classes of (exponential) polynomial signals oncirculant graphs.
...
1
2
3
4
...