Open AccessFast Coding Unit Encoding Mechanism for Low Complexity Video Coding
Author(s) -
Yuan Gao,
Pengyu Liu,
Yueying Wu,
Kebin Jia,
Guandong Gao
Publication year - 2016
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0151689
Subject(s) - context adaptive binary arithmetic coding , tunstall coding , coding tree unit , context adaptive variable length coding , variable length code , computer science , coding (social sciences) , shannon–fano coding , algorithm , probabilistic logic , theoretical computer science , data compression , decoding methods , mathematics , artificial intelligence , statistics
In high efficiency video coding (HEVC), coding tree contributes to excellent compression performance. However, coding tree brings extremely high computational complexity. Innovative works for improving coding tree to further reduce encoding time are stated in this paper. A novel low complexity coding tree mechanism is proposed for HEVC fast coding unit (CU) encoding. Firstly, this paper makes an in-depth study of the relationship among CU distribution, quantization parameter (QP) and content change (CC). Secondly, a CU coding tree probability model is proposed for modeling and predicting CU distribution. Eventually, a CU coding tree probability update is proposed, aiming to address probabilistic model distortion problems caused by CC. Experimental results show that the proposed low complexity CU coding tree mechanism significantly reduces encoding time by 27% for lossy coding and 42% for visually lossless coding and lossless coding. The proposed low complexity CU coding tree mechanism devotes to improving coding performance under various application conditions.