Content-Adaptive Feature-Based CU Size Prediction for Fast Low-Delay Video Encoding in HEVC

Determining the best partitioning structure of a coding tree unit is one of the most time-consuming operations in High Efficiency Video Coding (HEVC) encoding. Specifically, it is the evaluation of the quadtree hierarchy using the rate-distortion (RD) optimization that has the most significant impac...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems for video technology 2018-03, Vol.28 (3), p.693-705
Main Authors: Mallikarachchi, Thanuja, Talagala, Dumidu S., Arachchi, Hemantha Kodikara, Fernando, Anil
Format: Article
Language:English
Subjects:
Adaptation models
Algorithms
Coding
Coding unit (CU) size
Computational complexity
Computer architecture
Delay
Encoding
High definition
High Efficiency Video Coding (HEVC)
low delay
motion classification
Motion simulation
Optimization
Prediction algorithms
ratedistortion (RD) optimization
video coding
Video compression
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Determining the best partitioning structure of a coding tree unit is one of the most time-consuming operations in High Efficiency Video Coding (HEVC) encoding. Specifically, it is the evaluation of the quadtree hierarchy using the rate-distortion (RD) optimization that has the most significant impact on the encoding time, especially in the cases of high definition (HD) and ultra HD videos. In order to expedite the encoding for low-delay applications, this paper proposes a coding unit (CU) size selection and encoding algorithm for inter prediction in the HEVC. To this end, it describes: 1) two CU classification models based on Inter N\times N mode motion features and RD cost thresholds to predict the CU split decision; 2) an online training scheme for dynamic content adaptation; 3) a motion vector reuse mechanism to expedite the motion estimation process; and 4) finally introduces a computational complexity to coding efficiency tradeoff process to enable flexible control of the algorithm. The experimental results reveal that the proposed algorithm achieves a consistent average encoding time performance ranging from 55%-58% and 57%-61% with average Bjøntegaard delta bit rate increases of 1.93%-2.26% and 2.14%-2.33% compared with the HEVC 16.0 reference software for the low delay P and low delay B configurations, respectively, across a wide range of content types and bit rates.
ISSN:1051-8215
1558-2205
DOI:10.1109/TCSVT.2016.2619499