Open AccessEarly Coding Unit–Splitting Termination Algorithm for High Efficiency Video Coding (HEVC)
Author(s) -
Goswami Kalyan,
Kim ByungGyu,
Jun Dongsan,
Jung SoonHeung,
Choi Jin Soo
Publication year - 2014
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.14.0113.0458
Subject(s) - quadtree , computer science , coding (social sciences) , reference software , coding tree unit , algorithm , computational complexity theory , decoding methods , algorithmic efficiency , context adaptive binary arithmetic coding , multiview video coding , real time computing , software , computer vision , data compression , video processing , mathematics , video tracking , statistics , programming language
A new‐generation video coding standard, named High Efficiency Video Coding (HEVC), has recently been developed by JCT‐VC. This new standard provides a significant improvement in picture quality, especially for high‐resolution videos. However, one the most important challenges in HEVC is time complexity. A quadtree‐based structure is created for the encoding and decoding processes and the rate‐distortion (RD) cost is calculated for all possible dimensions of coding units in the quadtree. This provides a high encoding quality, but also causes computational complexity. We focus on a reduction scheme of the computational complexity and propose a new approach that can terminate the quadtree‐based structure early, based on the RD costs of the parent and current levels. Our proposed algorithm is compared with HEVC Test Model version 10.0 software and a previously proposed algorithm. Experimental results show that our algorithm provides a significant time reduction for encoding, with only a small loss in video quality.