TY - GEN
T1 - Fast Coding Unit Partition Decision for Intra Prediction in Versatile Video Coding
AU - Zhang, Menglu
AU - Chen, Yushi
AU - Lu, Xin
AU - Chen, Hao
AU - Zhang, Ye
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - In recent years, the state-of-the-art video coding standard – Versatile Video Coding (VVC) has been widely investigated. VVC achieves impressive performance by adopting more flexible partitioning method compared to its predecessor High Efficiency Video Coding (HEVC). However, the superior performance is realized at the expense of huge time consumption and increasing hardware costs, which obstructs its applications in real-time scenarios. To address this problem, we present a fast implementation for the decision process of the nested multi-type tree (QTMT) partitioning, and it significantly reduces the run-time of encoder while maintaining almost the same coding performance. Firstly, the inherent texture property of source frame is utilized to identify the prediction depth for Coding Tree Unit (CTU). Then, the spatial correlation is used to further narrow the depth range down. Finally, we skip unnecessary partition types according to the predicted Coding Unit (CU) depth, which is determined by the above predicted CTU depth and adjacent CU’s depth together. Experimental results demonstrate the effectiveness of our proposed method in VVC Test Model (VTM). Compared with the original implementation of the VTM4.0 anchor, the proposed algorithm achieves an average of 49.01% encoding time savings, accompanied by only an increase of 2.18% in Bj ϕ ntegaard delta Bitrate (BDBR) and a loss of 0.138 dB in Bj ϕ ntegaard delta PSNR (BDPSNR).
AB - In recent years, the state-of-the-art video coding standard – Versatile Video Coding (VVC) has been widely investigated. VVC achieves impressive performance by adopting more flexible partitioning method compared to its predecessor High Efficiency Video Coding (HEVC). However, the superior performance is realized at the expense of huge time consumption and increasing hardware costs, which obstructs its applications in real-time scenarios. To address this problem, we present a fast implementation for the decision process of the nested multi-type tree (QTMT) partitioning, and it significantly reduces the run-time of encoder while maintaining almost the same coding performance. Firstly, the inherent texture property of source frame is utilized to identify the prediction depth for Coding Tree Unit (CTU). Then, the spatial correlation is used to further narrow the depth range down. Finally, we skip unnecessary partition types according to the predicted Coding Unit (CU) depth, which is determined by the above predicted CTU depth and adjacent CU’s depth together. Experimental results demonstrate the effectiveness of our proposed method in VVC Test Model (VTM). Compared with the original implementation of the VTM4.0 anchor, the proposed algorithm achieves an average of 49.01% encoding time savings, accompanied by only an increase of 2.18% in Bj ϕ ntegaard delta Bitrate (BDBR) and a loss of 0.138 dB in Bj ϕ ntegaard delta PSNR (BDPSNR).
KW - Partition decision
KW - Spatial correlation
KW - Texture property
KW - Versatile Video Coding
UR - https://www.scopus.com/pages/publications/85116865853
U2 - 10.1007/978-3-030-87355-4_58
DO - 10.1007/978-3-030-87355-4_58
M3 - 会议稿件
AN - SCOPUS:85116865853
SN - 9783030873547
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 700
EP - 711
BT - Image and Graphics - 11th International Conference, ICIG 2021, Proceedings
A2 - Peng, Yuxin
A2 - Hu, Shi-Min
A2 - Gabbouj, Moncef
A2 - Zhou, Kun
A2 - Elad, Michael
A2 - Xu, Kun
PB - Springer Science and Business Media Deutschland GmbH
T2 - 11th International Conference on Image and Graphics, ICIG 2021
Y2 - 6 August 2021 through 8 August 2021
ER -