Fast Coding Unit Encoding Mechanism for Low Complexity Video Coding.

Article English OPEN
Yuan Gao ; Pengyu Liu ; Yueying Wu ; Kebin Jia ; Guandong Gao
  • Publisher: Public Library of Science (PLoS)
  • Journal: PLoS ONE, volume 11, issue 3 (issn: 1932-6203, eissn: 1932-6203)
  • Related identifiers: doi: 10.1371/journal.pone.0151689, pmc: PMC4801171
  • Subject: Computational Biology | Probability Theory | Research Article | Mathematics | Signal Processing | Decision Analysis | Engineering and Technology | Computational Neuroscience | Management Engineering | Statistical Distributions | Coding Mechanisms | Physical Sciences | Leaves | Physics | Acoustics | Probability Distribution | Plant Science | Information Theory | Quiet | Biology and Life Sciences | Computer and Information Sciences | Neuroscience | Research and Analysis Methods | Plant Anatomy | Medicine | Q | R | Decision Trees | Science | Signal to Noise Ratio

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.
Share - Bookmark