ETRI-Knowledge Sharing Plaform



논문 검색
구분 SCI
연도 ~ 키워드


학술지 Fast CU Splitting and Pruning for Suboptimal CU Partitioning in HEVC Intra Coding
Cited 268 time in scopus Download 4 time Share share facebook twitter linkedin kakaostory
조승현, Munchurl Kim
IEEE Transactions on Circuits and Systems for Video Technology, v.23 no.9, pp.1555-1564
12VD1100, 초고해상도 비디오 코덱 SoC, 엄낙웅
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. © 1991-2012 IEEE.
Fast encoding algorithm, HEVC, intra prediction, quad-tree coding
KSP 제안 키워드
BD rate, Bayes decision, Block partitioning structure, CU partitioning, Coding unit(CU), Computational complexity, Decision rules, Encoding algorithm, Encoding time, Fast CU Splitting, Fast encoding