摘要
提出了一种矢量量化编码的快速匹配算法。利用码书的拓扑结构和柯西 施瓦兹不等式的性质推导出了消除不必要匹配操作的条件,并根据这个条件提出了快速搜索算法。实验结果表明,该算法不仅明显降低了矢量编码过程的复杂程度,同时也保证了与全搜索编码相同的图像编码质量。与其它搜索方法的操作次数和存储空间进行了比较。
A fast algorithm to speed up the closest codeword search matching process in VQ(vector quantization) encoding is presented. By using pyramid structure of the codebook and CauchySchwarz inequality, a condition of removing unnecessary matching operations from the search procedure was derived, then the fast search arithmetic is proposed based on this removing condition. Experiment results show that the proposed search algorithm significantly reduces the encoding complexity as keeping the same encoding quality as that of full search arithmetic. The comparison of proposed algorithm with existing search algorithm in the number of operation and memory space is given.
出处
《光学技术》
CAS
CSCD
2003年第3期323-326,共4页
Optical Technique
