The new generation of high efficiency video coding standard (HEVC), although remarkably improves the compression performance, it increases the computational complexity of coding for Screen Content Coding (SCC). Theref...
详细信息
ISBN:
(数字)9781510622005
ISBN:
(纸本)9781510622005
The new generation of high efficiency video coding standard (HEVC), although remarkably improves the compression performance, it increases the computational complexity of coding for Screen Content Coding (SCC). Therefore, how to reduce the coding complexity becomes an important task in HEVC optimization. In this work, the process of quad-tree recursive partitioning has been studied, and the relationship between the coding cost and the mother block and child block has been found in statistics way, and an improved fast early termination coding unit partition based on the cost of the coding unit has been proposed. The experiment results show that the fastalgorithm proposed in this paper can save 31.37% of the encoding time at the cost of reduces the coding performance by about 1.02 %.
The latest video standard -Versatile Video Coding Standard (VVC/H.266) has been standardized and officially entered into force. Compared with the High Efficiency Video Coding (HEVC/H.265), owing to the introduction of...
详细信息
The latest video standard -Versatile Video Coding Standard (VVC/H.266) has been standardized and officially entered into force. Compared with the High Efficiency Video Coding (HEVC/H.265), owing to the introduction of the Quad-tree with Nested Multi-type Tree (QTMT) division mode, the encoder can choose a more detailed division type when dividing the Coding unit (cu), thereby improving the coding performance. However, when the cu selects the division type, it needs to traverse all possible division types and compute the Rate-distortion (RD) cost, which greatly enhances the coding complexity. Therefore, this paper designs a Joint Random Forest Classifier (JRFC) to make decisions on cupartition types, and proposes fast adaptive cupartition decision algorithm for VVC intra coding combined with our previous work. The algorithm has the capability to make partition decisions for cus of diverse sizes (smaller than 32 x 32) and completely bypass the intricate process of Rate-distortion Optimization (RDO), resulting in a significant reduction in encoding time. The experimental results demonstrate that, in comparison to the basic approach utilized in VTM10.0, the algorithm proposed in this paper reduces the encoding time by 57.27% on average, with only a marginal increase of 1.53% in Bjontegaard delta bit rate (BDBR).
暂无评论