一种改进的树形矢量量化编码算法  

An Improved TreeStructured Vector Quantization Algorithm

作　　者：梅海泉[1] 郑建宏[1] 

机构地区：[1]重庆邮电学院多媒体通信研究所

出　　处：《重庆邮电学院学报（自然科学版）》1998年第2期6-9,共4页Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition)

摘　　要：矢量量化中的一个最严重的问题是在一本码书中搜索最近码字的高计算复杂度。本文在研究树形矢量量化的基础上提出了一种改进的树形矢量量化编码算法。实验结果表明，本文提出的编码算法相对于树形矢量量化算法可大大改善峰值信噪比（ＰＳＮＲ）．One of the most serious problems of vector quantization is the high computational complexity involving in searching for the closest codeword through a codebook. In this paper,an improved treestructured vector quantization algorithm, based on treestructured quantization is introduced. Experimental results show that this algorithm can improve the PSNR greatly compared to treestructured vector.

关 键 词：矢量量化 量化 图象编码 最小均方误差 峰值信噪比 

分 类 号：TN919.8[电子电信—通信与信息系统] TP391.41[电子电信—信息与通信工程]