DocumentCode :
30057
Title :
Design of Near Orthogonal Graph Filter Banks
Author :
Tay, David B. H. ; Zhiping Lin
Author_Institution :
Dept. of Electron. Eng., LaTrobe Univ., Bundoora, VIC, Australia
Volume :
22
Issue :
6
fYear :
2015
fDate :
Jun-15
Firstpage :
701
Lastpage :
704
Abstract :
The processing of signal on graphs is becoming an important emerging area that has great potential in a wide variety of applications, e.g. social network. The work by Narang and Ortega (2012) laid the framework for critically sampled orthogonal two-channel filter bank for signal on undirected bipartite graphs. The design method presented by Narang and Ortega (2012) does not allow the tailoring of the filters spectral response and the control of the reconstruction error of the filter bank. This work present a method to design spectral filters that is based on Bernstein polynomial approximation and constrained optimization. The method allows the trade-off between transition band sharpness, ripple magnitude and reconstruction error.
Keywords :
channel bank filters; graph theory; polynomial approximation; signal reconstruction; Bernstein polynomial approximation; constrained optimization; filter spectral response; near orthogonal graph filter bank design; orthogonal two-channel filter bank; reconstruction error control; ripple magnitude; signal-on-graph processing; social network; spectral filter design; transition band sharpness; undirected bipartite graphs; Bipartite graph; Chebyshev approximation; Laplace equations; Optimization; Polynomials; Transforms; Filter banks; graph wavelet; spectral graph;
fLanguage :
English
Journal_Title :
Signal Processing Letters, IEEE
Publisher :
ieee
ISSN :
1070-9908
Type :
jour
DOI :
10.1109/LSP.2014.2368128
Filename :
6949094
Link To Document :
بازگشت