Probabilistic Approach for Predicting the Size of Coding Units in the Quad-Tree Structure of the Quality and Spatial Scalable HEVC
Probabilistic Approach for Predicting the Size of Coding Units in the Quad-Tree Structure of the Quality and Spatial Scalable HEVC
复制标题
DOI：
10.1109/tmm.2015.2510332
复制
发表时间：
2016-02
影响因子：
7.3
通讯作者：
H. R. Tohidypour;M. Pourazad;P. Nasiopoulos
中科院分区：
文献类型：
--
作者：
H. R. Tohidypour;M. Pourazad;P. Nasiopoulos
最近的可扩展视频编码标准的HEVC（称为SHVC）的可扩展扩展可导致压缩性能改善，以显着增加计算编码复杂性的成本。有助于SHVC编码器复杂性的主要因素之一是为编码树单元（CTU）选择最佳的分配结构。我们的研究重点是开发一种预测HEVC质量和空间可扩展扩展的CTU结构的方案。所提出的方案使用在增强层（ELS）和基础层（BL）中已经编码的CTU的CTU分区结构来预测EL中要编码的CTU的编码单元大小。绩效评估证实，我们提出的降低降低方案大大减少了SHVC编码器的执行时间，同时保持编码流的整体质量。
The scalable extension of HEVC (known as SHVC), the recent scalable video coding standard, results in an improved compression performance at the cost of significant increase in computational coding complexity. One of the main factors that contribute to the SHVC encoder complexity is choosing the best partitioning structure for the coding tree units (CTUs). Our study focuses on developing a scheme for predicting the CTU structure in the quality and spatial scalable extension of HEVC. The proposed scheme uses the CTU partitioning structure of the already encoded CTUs in the enhancement layers (ELs) and base layer (BL) to predict the coding unit sizes of the to-be-encoded CTUs in the EL. Performance evaluations confirm that our proposed complexity reduction scheme significantly reduces the execution time of the SHVC encoder, while maintaining the overall quality of the coded streams.