1-2hit |
Zaide LIU Nanning ZHENG Yuehu LIU Huub VAN DE WETERING
We present here a simple technique for parametrization of popular biorthogonal wavelet filter banks (BWFBs) having vanishing moments (VMs) of arbitrary multiplicity. Given a prime wavelet filter with VMs of arbitrary multiplicity, after formulating it as a trigonometric polynomial depending on two free parameters, we prove the existence of its dual filter based on the theory of Diophantine equation. The dual filter permits perfect reconstruction (PR) and also has VMs of arbitrary multiplicity. We then give the complete construction of two-parameter families of 17/11 and 10/18 BWFBs, from which any linear-phase 17/11 and 10/18 BWFB possessing desired features could be derived with ease by adjusting the free parameters. In particular, two previously unpublished BWFBs for embedded image coding are constructed, both have optimum coding gains and rational coef ficients. Extensive experiments show that our new BWFBs exhibit performance equal to Winger's W-17/11 and Villasenor's V-10/18 (superior to CDF-9/7 by Cohen et al. and Villasenor's V-6/10) for image compression, and yet require slightly lower computational costs.
Guoan YANG Huub VAN DE WETERING Ming HOU Chihiro IKUTA Yuehu LIU
This letter proposes a novel design approach for optimal contourlet filter banks based on the parametric 9/7 filter family. The Laplacian pyramid decomposition is replaced by optimal 9/7 filter banks with rational coefficients, and directional filter banks are activated using a pkva 12 filter in the contourlets. Moreover, based on this optimal 9/7 filter, we present an image denoising approach using a contourlet domain hidden Markov tree model. Finally, experimental results show that our approach in denoising images with texture detail is only 0.20 dB less compared to the method of Po and Do, and the visual quality is as good as for their method. Compared with the method of Po and Do, our approach has lower computational complexity and is more suitable for VLSI hardware implementation.