28 March 2019 in IEEE Transactions on Signal Processing
10 January 2019 in IEEE Transactions on Signal Processing
We propose two-channel critically-sampled filter banks for signals on undirected graphs that utilize spectral domain sampling. Unlike conventional approaches based on vertex domain sampling, our transforms have the following desirable properties: first, perfect reconstruction regardless of the characteristics of the underlying graphs and graph variation operators; and second, a symmetric structure; i.e., both analysis and synthesis filter banks are built using similar building blocks. Along with the structure of the filter banks, this paper also proves the general criterion for perfect reconstruction and theoretically shows that the vertex and spectral domain sampling coincide for a special case. The effectiveness of our approach is evaluated by comparing its performance in nonlinear approximation and denoising with various conventional graph transforms.
13 July 2017 in IEEE Journal of Selected Topics in Signal Processing
The construction of spectral filters for graph wavelet transforms is addressed in this paper. Both the undecimated and decimated cases will be considered. The filter functions are polynomials and can be implemented efficiently without the need for any eigendecomposition, which is computationally expensive for large graphs. Polynomial filters also have the advantage of the vertex localization property. The construction is achieved by designing suitable transformations that are used on traditional multirate filter banks. It will be shown how the classical quadrature-mirror-filters and linear phase, critically/over- sampled filter banks can be used to construct spectral graph wavelets that are almost tight. A variety of design examples will be given to show the versatility of the design technique.
1 January 2016 in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences