首页 | 本学科首页   官方微博 | 高级检索  
     


Construction of parametric biorthogonal wavelet filter banks with two parameters for image coding
Authors:Zaide Liu  Chengxiu Gao
Affiliation:(1) Department of Computer Science and Engineering, Changshu Institute of Technology, 215500 Changshu, China;(2) Department of Mechanical Engineering, Lanzhou Polytechnic College, 730050 Lanzhou, China
Abstract:We had presented a simple technique, which is based on the theory of Diophantine equation, for parametrization of popular biorthogonal wavelet filter banks (BWFBs) having the linear phase and arbitrary multiplicity of vanishing moments (VMs), and constructed a type of parametric BWFBs with one free parameter [15]. Here we generalize this technique to the case of two parameters, and construct a type of parametric BWFBs with two free parameters. The closed-form parameter expressions of the BWFBs are derived, with which any two-parameter family of BWFBs having preassigned VMs can be constructed, and six families, i.e., 9/11, 10/10, 13/11, 10/14, 17/11, and 10/18 families, are considered here. Two parameters provide two degrees of freedom to optimize the resulting BWFBs with respect to other criteria. In particular, in each family, three specific rational-coefficient BWFBs with attractive features are obtained by adjusting the parameters: the first is not only very close to a quadrature mirror filter (QMF) bank, but has optimum coding gain; the second possesses characteristics that are close to the irrational BWFB with maximum VMs by Cohen et al.; and the last which has binary coefficients can realize a multiplication-free discrete wavelet transform. In addition, two BWFBs are systematically verified to exhibit performance competitive to several state-of-the-art BWFBs for image compression, and yet require lower computational costs. This work was supported by the Natural Science Foundation of Jiangsu province, China under Grant 07KJD520005.
Keywords:Biorthogonal wavelets  Filter bank  Discrete wavelet transform (DWT)  Diophantine equation  Coding gain  Compression performance  Computational complexity
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号