首页> 外文会议>IEEE International Conference on Multimedia and Expo >Fast CU Partitioning Algorithm for H.266/VVC Intra-Frame Coding
【24h】

Fast CU Partitioning Algorithm for H.266/VVC Intra-Frame Coding

机译:H.266 / VVC帧内编码的快速CU分区算法

获取原文

摘要

Recently, the Joint Video Exploration Team (JVET) has established the latest video coding standard, Versatile Video Coding (H.266/VVC). The H.266/VVC adopts the quadtree with nested multi-type tree coding block structure which brings huge computational burden that limits the development, adoption and application of the future video coding standard. To encounter this problem, we propose a novel fast block partition algorithm through Bayesian decision rule. The proposed method fully explored the information of the horizontal binary splitting which is newly introduced because of the adoption of the novel coding block structure. Experimental results demonstrate that the proposed algorithm achieves about 45% encoding time saving on average with negligible quality loss under all-intra configuration.
机译:最近,联合视频探索小组(JVET)建立了最新的视频编码标准,即通用视频编码(H.266 / VVC)。 H.266 / VVC采用四叉树和嵌套的多类型树编码块结构,带来了巨大的计算负担,从而限制了未来视频编码标准的开发,采用和应用。为了解决这个问题,我们提出了一种新的基于贝叶斯决策规则的快速块划分算法。由于采用了新颖的编码块结构,因此该方法充分探索了新引入的水平二进制分割信息。实验结果表明,该算法在全帧内配置下平均可节省编码时间约45%,质量损失可忽略不计。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号