首页> 外文OA文献 >An improved search-order coding algorithm for lossless compression of VQ indexes
【2h】

An improved search-order coding algorithm for lossless compression of VQ indexes

机译:一种改进的VQ索引无损压缩搜索顺序编码算法

摘要

[[abstract]]In a fixed-rate vector quantization system, an image is divided into smaller blocks, and each block is usually independently encoded by an index of the same length that points to the closest codevector in the codebook. An algorithm called search-order coding, has been proposed to further reduce the bit rate by encoding the indexes but without introducing any extra encoding distortion. We present an improved algorithm that extends the idea of the search-order coding algorithm by encoding the indexes pair by pair (instead of one by one). With this extension, four types of search results are considered. The simulation results indicate that our algorithm is able to achieve the bit rate up to 5.74% lower than the search-order coding algorithm
机译:[[摘要]]在固定速率矢量量化系统中,将图像划分为较小的块,并且每个块通常由指向代码簿中最接近的代码向量的相同长度的索引独立编码。已经提出了一种称为搜索顺序编码的算法,以通过对索引进行编码来进一步降低比特率,但又不会引入任何额外的编码失真。我们提出了一种改进的算法,该扩展算法通过逐对(而不是一对一)地对索引进行编码,扩展了搜索顺序编码算法的思想。通过此扩展,可以考虑四种类型的搜索结果。仿真结果表明,与搜索顺序编码算法相比,我们的算法能够将比特率降低5.74%。

著录项

  • 作者

    Ting-Chi Wang;

  • 作者单位
  • 年度 2012
  • 总页数
  • 原文格式 PDF
  • 正文语种 [[iso]]en
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号