Fast CTU Partition Decision Algorithm for VVC Intra and Inter Coding
Na Tang, Jian Cao, Fan Liang, Jun Wang, Hongmei Liu, Xiaoyang Wang, Xiaorong Du
Abstract
Na Tang, Jian Cao, Fan Liang, Jun Wang, Hongmei Liu, Xiaoyang Wang, Xiaorong Du
Abstract
Versatile Video Coding (VVC) is a new video compression standard. Compared to the quadtree structure in HEVC, VVC introduces a quadtree with nested multi-type tree (QTMT) by adding binary and ternary tree partition structure, which achieves great coding performance at the expense of obviously increased computational complexity. In order to make a better trade-off between encoder complexity and coding efficiency, we propose a fast block partition algorithm for both intra coding and inter coding. For intra coding, the block-level based Canny edge detector is applied to extract edge features to skip vertical or horizonal partition modes and carry out early termination. For inter coding, the three frame difference method is used to determine whether the current block is a moving object and partition can be early terminated. Simulation results show that the proposed algorithm reduces about 36% and 31% encoding time on average for intra and inter coding respectively with an ignorable increase in BD-rate.
OpenAlex reports 86 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Versatile Video Coding (VVC) is a new video compression standard. Compared to the quadtree structure in HEVC, VVC introduces a quadtree with nested multi-type tree (QTMT) by adding binary and ternary tree partition structure, which achieves great coding performance at the expense of obviously increased computational complexity. In order to make a better trade-off between encoder complexity and coding efficiency, we propose a fast block partition algorithm for both intra coding and inter coding. For intra coding, the block-level based Canny edge detector is applied to extract edge features to skip vertical or horizonal partition modes and carry out early termination. For inter coding, the three frame difference method is used to determine whether the current block is a moving object and partition can be early terminated. Simulation results show that the proposed algorithm reduces about 36% and 31% encoding time on average for intra and inter coding respectively with an ignorable increase in BD-rate.
Key concepts: Quadtree, Coding tree unit, Computer science, Context-adaptive binary arithmetic coding, Coding (social sciences), Algorithm, Encoder, Variable-length code