Perfect Reconstruction Two-Channel Filter Banks on Arbitrary Graphs Based on an Optimization Model
In this paper, we propose the construction of critically sampled perfect reconstruction two-channel filterbanks on arbitrary undirected graphs.Inspired by the design of graphQMF proposed in the literature, we propose a general ``spectral folding property'' similar to that of bipartite graphs and provide sufficient conditions for constructing perfect reconstruction filterbanks based on a general graph Fourier basis, which is not the eigenvectors of the Laplacian matrix. To obtain the desired graph Fourier basis, we need to solve a series of quadratic equality constrained quadratic optimization problems (QECQPs) which are known to be non-convex and difficult to solve. We develop an algorithm to obtain the global optimal solution within a pre-specified tolerance. Multi-resolution analysis on real-world data and synthetic data are performed to validate the effectiveness of the proposed filterbanks.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Spectral folding and two-channel filter-banks on arbitrary graphs
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 perfe…
Computational EfficiencyVocal Bursts Valence PredictionSpline-Like Wavelet Filterbanks with Perfect Reconstruction on Arbitrary Graphs
In this work, we propose a class of spline-like wavelet filterbanks for graph signals. These filterbanks possess the properties of critical sampling and perfect reconstruction. Besides, the analysis filters are localized…
DenoisingTwo Channel Filter Banks on Arbitrary Graphs with Positive Semi Definite Variation Operators
We propose novel two-channel filter banks for signals on graphs. Our designs can be applied to arbitrary graphs, given a positive semi definite variation operator, while using arbitrary vertex partitions for downsampling…
Learning Filter Bank Sparsifying Transforms
Data is said to follow the transform (or analysis) sparsity model if it becomes sparse when acted on by a linear operator called a sparsifying transform. Several algorithms have been designed to learn such a transform di…
DenoisingImage DenoisingSpectral Domain Spline Graph Filter Bank
In this paper, 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; namely, perfect reconst…
Denoising