Fast CU Splitting and Pruning for Suboptimal CU Partitioning in HEVC Intra Coding

Citations Over TimeTop 1% of 2013 papers

Abstract

High Efficiency Video Coding (HEVC), a new video coding standard currently being established, adopts a quadtree-based Coding Unit (CU) block partitioning structure that is flexible in adapting various texture characteristics of images. However, this causes a dramatic increase in computational complexity compared to previous video coding standards due to the necessity of finding the best CU partitions. In this paper, a fast CU splitting and pruning method is presented for HEVC intra coding, which allows for significant reduction in computational complexity with small degradations in rate-distortion (RD) performance. The proposed fast splitting and pruning method is performed in two complementary steps: 1) early CU split decision and 2) early CU pruning decision. For CU blocks, the early CU splitting and pruning tests are performed at each CU depth level according to a Bayes decision rule method based on low-complexity RD costs and full RD costs, respectively. The statistical parameters for the early CU split and pruning tests are periodically updated on the fly for each CU depth level to cope with varying signal characteristics. Experimental results show that our proposed fast CU splitting and pruning method reduces the computational complexity of the current HM to about 50% in encoding time with only 0.6% increases in BD rate.

Related Papers

• → An efficient ordering-based ensemble pruning algorithm via dynamic programming(2015)17 cited
• → Language Model Pre-training Method in Machine Translation Based on Named Entity Recognition(2020)14 cited
• → A Pruning Approach for GMM-Based Speaker Verification in Mobile Embedded Systems(2004)7 cited
• → A Pruning Algorithm Based on The Complexity of Functional Network(2012)1 cited
• → A Parallel Data Mining Approach Based on Segmentation and Pruning Optimization(2020)