Optimization Design of M-Channel Oversampled Graph Filter Banks via Successive Convex Approximation
- 20 Downloads
This letter presents an efficient algorithm to design an M-channel oversampled graph filter bank, whose overall performance is governed by the spectral characteristic of the filters and the reconstruction error. The design of the filters is formulated into a constrained optimization problem that minimizes the stopband energy of the filters subject to the reconstruction error constraint. The problem is a non-convex quadratically constrained quadratic program (QCQP), which is typically NP-hard. In order to overcome this challenge, we apply the successive convex approximation to successively solve it. At each iteration, the non-convex QCQP is approximately transformed into the convex one by linearizing the constraint. Numerical examples and comparison are included to show that the proposed approach can lead to the oversampled graph filter banks with satisfactory overall performance, particularly good spectral selectivity.
KeywordsGraph filter bank Non-convex QCQP SCA
This work is supported in part by National Natural Science Foundation of China (No. 61761011) and Guangxi Natural Science Foundation (Nos. 2017GXNSFAA198173, 2017GXNSFBA198137).
- 3.M. Crovella, E. Kolaczyk, Graph wavelets for spatial traffic analysis, in IEEE INFCOM, vol. 3 (2003), pp. 1848–1857Google Scholar
- 9.G. Shen, A. Ortega, Optimized distributed 2D transforms for irregularly sampled sensor network grids using wavelet lifting, in IEEE International Conference on Acoustics, Speech and Signal Process (2008), pp. 2513–2516Google Scholar
- 12.D.B.H. Tay, Y. Tanaka, A. Sakiyama, Near orthogonal oversampled graph filter banks. IEEE Signal Process. Lett. 23(2), 277–281 (2016)Google Scholar