首页> 外文会议>IEEE International Conference on Image Processing >Real-time complexity constrained encoding
【24h】

Real-time complexity constrained encoding

机译:实时复杂度受限编码

获取原文

摘要

Complex software appliances can be deployed on hardware with limited available computational resources. This computational boundary puts an additional constraint on software applications. This can be an issue for real-time applications with a fixed time constraint such as low delay video encoding. In the context of High Efficiency Video Coding (HEVC), a limited number of publications have focused on controlling the complexity of an HEVC video encoder. In this paper, a technique is proposed to control complexity by deciding between 2N×2N merge mode and full encoding, at different Coding Unit (CU) depths. The technique is demonstrated in two encoders. The results demonstrate fast convergence to a given complexity threshold, and a limited loss in rate-distortion performance (on average 2.84% Bj⊘ntegaard delta rate for 40% complexity reduction).
机译:复杂的软件设备可以在可用计算资源有限的情况下部署在硬件上。这种计算边界对软件应用程序施加了额外的约束。对于具有固定时间限制的实时应用程序(例如低延迟视频编码),这可能是一个问题。在高效视频编码(HEVC)的背景下,有限的出版物集中在控制HEVC视频编码器的复杂性上。本文提出了一种在2N×2N合并模式和完全编码之间进行决定以控制不同编码单元(CU)深度的复杂度的技术。在两个编码器中演示了该技术。结果表明,该算法可以快速收敛到给定的复杂度阈值,并且速率失真性能的损失也有限(平均Bj⊘ntegaard三角洲速率为2.84%,降低了40%的复杂度)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号