【24h】

Binary-tree recursive motion estimation for video coding

机译:用于视频编码的二叉树递归运动估计

获取原文

摘要

Binary tree predictive coding (BTPC) is an efficient general-purpose still-image compression scheme, competitive with JPEG for natural image coding and with GIF for graphics. We report the extension of BTPC to video compression using motion estimation and compensation techniques which are simple, efficient, non-linear and predictive. The new method, binary tree recursive motion estimation and coding (BTRMEC), exploits the hierarchical structure of BTPC to give progressively refined motion estimates for increasing numbers of pels. Compression results for BTRMEC are compared against conventional block-based motion compensated coding as used in MPEG (i.e. with variable-length coding of motion vectors, and DCT/runlength coding of residues). They show that both BTRMEC and BTPC adapted to video coding are efficient methods to code video sequences.
机译:二叉树预测编码(BTPC)是一种有效的通用静止图像压缩方案,与用于自然图像编码的JPEG和用于图形的GIF竞争。我们报告了使用简单,有效,非线性和预测性的运动估计和补偿技术将BTPC扩展到视频压缩。新方法,二叉树递归运动估计和编码(BTRMEC),利用BTPC的层次结构来为逐渐增加的像素数提供渐进的运动估计。将BTRMEC的压缩结果与MPEG中使用的传统的基于块的运动补偿编码(即运动矢量的变长编码和残差的DCT /行程编码)进行比较。他们表明,适用于视频编码的BTRMEC和BTPC都是对视频序列进行编码的有效方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号