首页> 外文学位 >Conditional and unconditional entropy-constrained vector quantization: High-rate theory and design algorithms.
【24h】

Conditional and unconditional entropy-constrained vector quantization: High-rate theory and design algorithms.

机译:有条件和无条件熵约束矢量量化:高速率理论和设计算法。

获取原文
获取原文并翻译 | 示例

摘要

Entropy-constrained vector quantization is one of the most powerful compression techniques available nowadays for source coding designers. In this thesis new algorithms for design of entropy-constrained vector quantizers are presented. The algorithms presented here belong to a family of algorithms called constrained pairwise nearest neighbor (CPNN). These algorithms design codebooks by merging the pair of Voronoi regions which gives the least increase of distortion for a given decrease in entropy. We have developed three different algorithms called: entropy-constrained pairwise nearest neighbor (ECPNN), alphabet- and entropy-constrained pairwise nearest neighbor (AECPNN) and conditional entropy-constrained pairwise nearest neighbor (CECPNN). The first two algorithms AECPNN and ECPNN produce memoryless vector quantizers and the last algorithm CECPNN produces non-memoryless vector quantizers. This CPNN family of algorithms produces vector quantizers that are very competitive with the algorithms that are produced by the Lloyd's method I for vector quantizer design. The advantages that we can cite are: fast design, fast operation and user friendly. The degradation of rate-distortion performance presented by the codebooks developed by our algorithms are very small when compared with the codebooks produced by the Lloyd's method I. We also present a generalization of the high-rate quantization theory. This theory establishes analytically the operational rate-distortion performance of vector quantizers. We have derived new performance bounds for the conditional entropy-constrained vector quantizers that can be designed for example by the CECPNN algorithm. We link the results of the conditional high-rate quantization theory with the results of the conditional rate-distortion theory. Since we also have practical interests, we have used the quantizers developed by our techniques for compression of image subbands for a still image coder. We have also compressed displaced frame differences subband signals using our quantizers for a video coder. The rate-distortion performance results can be considered of high-quality.
机译:熵约束矢量量化是当今源代码设计人员可用的最强大的压缩技术之一。本文提出了一种新的熵约束矢量量化器设计算法。这里介绍的算法属于称为约束成对最近邻居(CPNN)的算法家族。这些算法通过合并一对Voronoi区域来设计码本,对于给定的熵降低,该对区域对失真的增加最小。我们开发了三种不同的算法,称为:熵约束​​的成对最近邻居(ECPNN),字母和熵约束的成对最近邻居(AECPNN)和条件熵约束的成对最近邻居(CECPNN)。前两种算法AECPNN和ECPNN产生无记忆矢量量化器,最后一种算法CECPNN产生非记忆矢量量化器。这个CPNN算法系列产生的矢量量化器与采用劳埃德方法I进行矢量量化器设计的算法非常有竞争力。我们可以列举的优点是:快速设计,快速操作和用户友好。与由劳埃德方法I产生的码本相比,由我们的算法开发的码本所呈现的码率失真性能的降低很小。我们还对高速率量化理论进行了概括。该理论从理论上建立了矢量量化器的工作速率失真性能。我们已经为条件熵约束的矢量量化器导出了新的性能边界,例如可以通过CECPNN算法进行设计。我们将条件高速率量化理论的结果与条件速率失真理论的结果联系起来。由于我们也有实际兴趣,因此我们使用了由我们的技术开发的量化器来压缩静止图像编码器的图像子带。我们还使用视频编码器的量化器压缩了位移帧差异子带信号。速率失真性能结果可以认为是高质量的。

著录项

  • 作者

    Garrido, Diego Pinto de.;

  • 作者单位

    Rensselaer Polytechnic Institute.;

  • 授予单位 Rensselaer Polytechnic Institute.;
  • 学科 Engineering Electronics and Electrical.
  • 学位 Ph.D.
  • 年度 1994
  • 页码 129 p.
  • 总页数 129
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 无线电电子学、电信技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号