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

最大概率匹配的矢量量化编码算法
引用本文:赵乘麟,赵尔敦,李水进,唐小琦,周济. 最大概率匹配的矢量量化编码算法[J]. 计算机工程与应用, 2000, 36(6): 73-74,85
作者姓名:赵乘麟  赵尔敦  李水进  唐小琦  周济
作者单位:1. 湖南邵阳师专物理系,邵阳,422000
2. 华中理工大学电信系,武汉430074
3. 华中理工大学机械学院,武汉,430074
基金项目:国家863高技术攻关项目!863-511-820-004
摘    要:文章提出了一种最大概率匹配的矢量量化编码算法,它为码书中的每一码字增加一个计数器,统计在编码图象时每个码字的出现的频数,并进行排序;在量化矢量时,根据当前码字出现频数大小依次选择侯选码字,即频数大的码字优先选为候选码字。该算法可以和已有的预测法结合,形成预测加最大概率匹配的联合矢量量化编码算法。实验表明,联合算法的效率较高,在最初几次的搜索中就能以较高的命中率命中最佳匹配码字。

关 键 词:最大概率匹配  矢量量化  码字

Maximum Probability Matching Algorithm for Vector Quantization
Zhao Chenglin,Zhao Erdun,Li Shuijin,Tang Xiaoqi,Zhouji. Maximum Probability Matching Algorithm for Vector Quantization[J]. Computer Engineering and Applications, 2000, 36(6): 73-74,85
Authors:Zhao Chenglin  Zhao Erdun  Li Shuijin  Tang Xiaoqi  Zhouji
Abstract:In this paper, a novel maximum probability matching algorithm for vector quantization is presented. In the process of encoding. one counter is added for every codeword in the codebook, it counters the times that the codeword emerged in the encoding image. The most often emerged codeword by now is taken as the first candidate codeword. The second often-emerged codeword is taken as the second candidate codeword. In this way, authors select the rest candidate codewoul if it is necessary. The simulation shows that this algorithm is efficient.
Keywords:maximum probability matching   vector quantization   codeword
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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