Feature-based fast coding unit partition algorithm for high efficiency video coding

• Published in: Journal of applied research and technology Vol. 13; no. 2; pp. 205 - 219
• Main Authors: Lin, Yih-Chuan, Lai, Jian-Cheng
• Format: Journal Article
• Language: English
• Published: Elsevier España, S.L.U 01.04.2015
• Subjects: Coding unit; CTB; Fast algorithm; Feature-based approach; HEVC; Quad-tree partition; Sobel edge; CTB; Quad-tree partition; Sobel edge; HEVC; Feature-based approach; Fast algorithm; Coding unit
• ISSN: 1665-6423
• DOI: 10.1016/j.jart.2015.06.019

High Efficiency Video Coding (HEVC), which is the newest video coding standard, has been developed for the efficient compression of ultra high definition videos. One of the important features in HEVC is the adoption of a quad-tree based video coding structure, in which each incoming frame is represented as a set of non-overlapped coding tree blocks (CTB) by variable-block sized prediction and coding process. To do this, each CTB needs to be recursively partitioned into coding unit (CU), predict unit (PU) and transform unit (TU) during the coding process, leading to a huge computational load in the coding of each video frame. This paper proposes to extract visual features in a CTB and uses them to simplify the coding procedure by reducing the depth of quad-tree partition for each CTB in HEVC intra coding mode. A measure for the edge strength in a CTB, which is defined with simple Sobel edge detection, is used to constrain the possible maximum depth of quad-tree partition of the CTB. With the constrained partition depth, the proposed method can reduce a lot of encoding time. Experimental results by HM10.1 show that the average time-savings is about 13.4% under the increase of encoded BD-Rate by only 0.02%, which is a less performance degradation in comparison to other similar methods.