Fast Algorithm Based on Rough LCU Minimum Depth Prediction and Early CU Partition Termination for HEVC Intra Coding

2016 ◽  
Vol E99.A (2) ◽  
pp. 634-638
Author(s):  
Mengmeng ZHANG ◽  
Heng ZHANG ◽  
Zhi LIU
Keyword(s):  
Fast Algorithm ◽  
Intra Coding ◽  
Depth Prediction ◽  
Cu Partition ◽  
Minimum Depth

scholarly journals Fast prediction mode selection and CU partition for HEVC intra coding

2020 ◽  
Vol 14 (9) ◽  
pp. 1892-1900 ◽  
Author(s):  
Bin Fu ◽  
Qiangqing Zhang ◽  
Jianling Hu
Keyword(s):  
Mode Selection ◽  
Intra Coding ◽  
Cu Partition ◽  
Prediction Mode ◽  
Fast Prediction

scholarly journals Bagged Tree And ResNet Based Joint End-to-End Fast CTU Partition Decision Algorithm For Video Intra Coding

2021 ◽  
Author(s):  
Yixiao Li ◽  
Lixiang Li ◽  
Yuan Fang ◽  
Haipeng Peng ◽  
Nam Ling
Keyword(s):  
Video Coding ◽  
High Efficiency ◽  
Fine Tuning ◽  
Tree Model ◽  
Depth Level ◽  
Decision Algorithm ◽  
Intra Coding ◽  
Cu Partition ◽  
Coding Standards ◽  
End To End

Abstract In the development of video coding standards, advanced ones have greatly improved the bit rate compared with those of previous generation, but also brought a huge increase in coding complexity. Coding standards, such as high efficiency video coding (HEVC), versatile video coding (VVC) and AOMedia video 2 (AV2), get the optimal encoding performance by traversing all possible combinations of coding unit (CU) partition and selecting the combination with minimum coding cost. This process of searching for the best makes up a large part of encoding complexity. To reduce the complexity of coding block partition for many video coding standards, this paper proposes an end-to-end fast algorithm for partition structure decision of coding tree unit (CTU) in intra coding. It can be extended to various coding standards with fine tuning, and is applied to the intra coding of HEVC reference software HM16.7 as an example. In the proposed method, the splitting decision of a CTU is made by a well designed bagged tree model firstly. Then, the partition problem of a 32×32 sized CU is modeled as a 17-output classification task and solved by a well trained residual network (ResNet). Jointly using bagged tree and ResNet, the proposed fast CTU partition algorithm is able to generate the partition quad-tree structure of a CTU through an end-to-end prediction process, instead of multiple decision making procedures at depth level. Besides, several effective and representative datasets are also conducted in this paper to lay the foundation of high prediction accuracy. Compared with the original HM16.7 encoder, experimental results show that the proposed algorithm can reduce the encoding time by 59.79% on average, while the BD-rate loss is as less as 2.02%, which outperforms the results of most of state-of-the-art approaches in the fast intra CU partition area.

Random Forest Based Fast CU Partition for VVC Intra Coding

2021 ◽  
Author(s):  
Quan He ◽  
Wenxin Wu ◽  
Lei Luo ◽  
Ce Zhu ◽  
Hongwei Guo
Keyword(s):  
Random Forest ◽  
Intra Coding ◽  
Cu Partition

Fast algorithm of coding unit depth decision for HEVC intra coding

2014 ◽  
Author(s):  
Xiaofeng Huang ◽  
Huizhu Jia ◽  
Kaijin Wei ◽  
Jie Liu ◽  
Chuang Zhu ◽  
...  
Keyword(s):  
Fast Algorithm ◽  
Intra Coding ◽  
Unit Depth ◽  
Coding Unit

scholarly journals Fast CU Partition Decision Algorithm For AVS3 Intra Coding

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Tong Wu ◽  
Shiyi Liu ◽  
Feng Wang ◽  
Zhenyu Wang ◽  
Rongjie Wang ◽  
...  
Keyword(s):  
Decision Algorithm ◽  
Intra Coding ◽  
Cu Partition

Gradient-Based Early Termination of CU Partition in VVC Intra Coding

2020 ◽  
Author(s):  
Jing Cui ◽  
Tao Zhang ◽  
Chenchen Gu ◽  
Xinfeng Zhang ◽  
Siwei Ma
Keyword(s):  
Early Termination ◽  
Intra Coding ◽  
Cu Partition ◽  
Gradient Based
Sign in / Sign up

Export Citation Format

Share Document