论文部分内容阅读
矢量量化用于图象编码的计算复杂度是矢量量化器设计的一个关键问题。本文针对搜索复杂度提出了两种新的快速算法。在保证不降低编码性能的前提下实现所求码矢是码书中的最佳匹配并大大提高了编码速度。计算机模拟结果表明:这两种算法无论在加法、乘法、还是比较操作上均比Gray的改进型算法节省许多。
Vector Quantization Computation complexity for image coding is a key issue in vector quantizer design. In this paper, two new fast algorithms are proposed for search complexity. It is the best match in the code book and the coding speed is greatly improved if the code quality is guaranteed without reducing the coding performance. Computer simulation results show that these two algorithms save much more than Gray ’s improved algorithm in terms of addition, multiplication and comparison.