首页> 外文期刊>IEEE Transactions on Circuits and Systems for Video Technology >Rate-Distortion-Complexity Optimized Coding Mode Decision for HEVC
【24h】

Rate-Distortion-Complexity Optimized Coding Mode Decision for HEVC

机译:HEVC的速率失真 - 复杂性优化编码模式决策

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

摘要

The newest generation of video coding standard, high efficiency video coding (HEVC), significantly improves the video compression efficiency by introducing more flexible block partitioning structures and richer coding modes than those of the previous coding standards; however, the encoders suffer from high-computational complexity, which greatly hinders their extensive application. Extensive studies on optimizing the complexity of the HEVC encoders have been conducted. However, most studies do not effectively achieve a trade-off between the rate-distortion (RD) performance loss and complexity during the rate-distortion optimization (RDO). In this paper, we mathematically define the complexity-constrained RDO problem as a constrained optimization problem of subset selection. Next, based on the classification methodology, the derivation process for this optimization problem is simplified to find the adaptive threshold function in the feature space with extremely low complexity. The proposed method is also highly general and is applicable to algorithm design for various coding mode decisions, such as coding unit splitting, prediction unit partitioning and transform unit tree decision, and the global optimum can be achieved. Compared with existing methods, the experimental results show that the proposed method can reduce the coding time by 2-16% with the same RD performance loss and can decrease the BD rate by 0.1-1.2% under the same complexity. In addition, this method is capable of flexibly adjusting the complexity under different rate-distortion complexity trade-off requirements.
机译:最新一代视频编码标准,高效视频编码(HEVC),通过引入比以前编码标准的更灵活的块分区结构和更丰富的编码模式来显着提高视频压缩效率;然而,编码器遭受高计算复杂性,这极大地阻碍了他们广泛的应用。已经进行了关于优化HEVC编码器的复杂性的广泛研究。然而,大多数研究在速率失真优化期间,在速率 - 失真(RD)性能损失和复杂性之间没有有效地实现权衡。在本文中,我们数学地将复杂性受约束的RDO问题定义为子集选择的约束优化问题。接下来,基于分类方法,简化了该优化问题的推导过程,以找到具有极低复杂度的特征空间中的自适应阈值函数。所提出的方法也是高度通用的,并且适用于各种编码模式决策的算法设计,例如编码单元分割,预测单元分区和变换单元树决定,并且可以实现全局最佳。与现有方法相比,实验结果表明,该方法可以通过相同的RD性能损失将编码时间降低2-16%,并且在相同的复杂性下可以将BD速率降低0.1-1.2%。此外,该方法能够在不同的速率失真复杂性权衡要求下灵活地调整复杂性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号