首页> 外文会议>ISCAS 2012;IEEE International Symposium on Circuits and Systems >Complexity-reduced geometry partition search and high efficiency prediction for video coding
【24h】

Complexity-reduced geometry partition search and high efficiency prediction for video coding

机译:降低复杂度的几何分区搜索和视频编码的高效预测

获取原文

摘要

To reduce the complexity of searching for wedge-based geometry partitions in video coding, we propose a texture-difference based partition line selection approach with a skipping strategy. Applying this approach can reduce the encoding time by 90% while retaining the similar rate-distortion performance to that of exhaustive searching. We also propose a background-compensated prediction scheme to improve the rate-distortion performance of the geometry partitioning prediction by reducing its motion vector overhead. Incorporating our proposed approach into object-boundary-based geometry partitioning can achieve about 10% bit-rate savings relative to the full-search approach while keeping the complexity at about the same level as our proposed complexity-reduced wedge-based geometry partitioning.
机译:为了降低视频编码中搜索基于楔形的几何分区的复杂性,我们提出了一种具有跳过策略的基于纹理差异的分区线选择方法。应用此方法可以将编码时间减少90%,同时保持与穷举搜索相似的速率失真性能。我们还提出了一种背景补偿的预测方案,以通过减少几何矢量预测的运动矢量开销来提高其速率失真性能。相对于全搜索方法,将我们提出的方法结合到基于对象边界的几何分区中可以节省大约10%的比特率,同时将复杂度保持在与我们提出的减少复杂度的楔子几何分区大致相同的水平上。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号