Abstract

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 Bjontegaard 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.

Highlights

  • T HE recent developments in the Consumer Electronic (CE) technologies, and the content capturing capabilities of these devices have made multimedia the most frequently exchanged type of content over the modern communication networks

  • This paper proposes a Coding Unit (CU) size prediction mechanism for fast low-delay High Efficiency Video Coding (HEVC) video encoding based on the following contributions

  • The following section presents the experimental results of the proposed content-adaptive fast CU size selection and encoding algorithm for low delay HEVC video encoding

Read more

Summary

INTRODUCTION

T HE recent developments in the Consumer Electronic (CE) technologies, and the content capturing capabilities of these devices have made multimedia the most frequently exchanged type of content over the modern communication networks. The recent literature has predominantly proposed mechanisms to reduce the complexity of the RD optimization that selects the best coding structure In this context, the state-of-the-art fast encoding solutions generally utilize the depth correlation of spatial and temporal blocks, RD cost statistics of the CUs and the Inter 2N×2N prediction mode, feature-based offline and online training approaches, etc. The potential exists to develop implementation-friendly encoding algorithms that can effectively trade-off the coding efficiency in order to gain a reduction of the computational complexity To this end, this paper proposes a CU size prediction mechanism for fast low-delay HEVC video encoding based on the following contributions.

Background
Related Work
CU CLASSIFICATION FOR SPLIT LIKELIHOOD MODELLING
Motion Feature-Based CU Classification
RD Cost Threshold-Based CU Classification
FAST CU SIZE SELECTION
Generic split threshold
RD Cost Threshold-Based CU Size Selection
PROPOSED FAST ENCODING FRAMEWORK
Joint CU Split Decision Prediction
Model Adaptation and Training
Motion Vector Reuse in Motion Estimation
The Overall Fast Encoding Algorithm
EXPERIMENTAL RESULTS AND DISCUSSION
Simulation Configurations and Performance Metrics
Results and Performance Analysis
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call