Rate control for screen content coding in HEVC

Optimized Rate Control Algorithm of High-Efficiency Video Coding Based on Region of Interest

“…(1) In the implementation process of target bits, the relationship between rate and distortion is shown in equation (3). According to equation (3), the distortion value D 1 estimated from the target bit rate and the actual coding distortion value D 2 are as follows: where C 1 and k 1 represent parameters related to the characteristics of video content before the parametric model is updated; C 2 and k 2 represent parameters related to the characteristics of video content after the parametric model is updated; R 1 and R 2 represent target bit rate and actual bit rate, respectively.…”

“…Aiming at the shortcomings of K0103 rate control algorithm, many scholars have done a lot of research at home and abroad, which appears in the aspects of the complexity measurement of CTU and the computational load of parametric model. In the aspect of the complexity measurement of CTU, Guo et al [3] proposes a method which calculates the complexity of CTU based on the pixel statistical methods, but the bits allocated will have a large error of video sequences with severe local motion. In [4], SATD is taken as the measurement of complexity, which ignores the relevant characteristics of video content.…”

Improved hierarchical quantisation parameter setting method for screen content coding in high efficiency video coding

“… Translational region : if current region can find its matching [matching: the MAD values is smaller than threshold .] region in the next picture by motion estimation, the current region is translational. Content complexity : measured by MAD [28]. Region : each region denotes one coding tree unit (CTU) in this paper.…”

Rate Control for Predictive Transform Screen Content Video Coding Based on RANSAC

“…These methods account for the characteristics of these sequences and update the model parameters accordingly. For example, in [34], the authors propose to account for any significant motion and abrupt changes between consecutive frames to distribute the bit budget. Specifically, their method assigns a bit budget to each frame based on its complexity as measured by the prediction error within a sliding window.…”