z-logo
open-access-imgOpen Access
Efficient frame‐level bit allocation algorithm for H.265/HEVC
Author(s) -
He Jing,
Yang Fuzheng
Publication year - 2017
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2016.0166
Subject(s) - coding (social sciences) , computer science , algorithm , frame (networking) , bit rate , inter frame , constant bitrate , algorithmic efficiency , real time computing , reference frame , mathematics , statistics , variable bitrate , telecommunications
Rate control (RC) plays a critical role in video coding for regulating the coded bit‐stream to achieve the target bitrate, which involves two basic steps: bit allocation (BA) and quantisation parameter selection. Here, the former is a key element to directly affect the performance of RC. So, in this study, an efficient frame‐level BA algorithm is proposed for the latest video coding standard H.265/high‐efficiency video coding (HEVC). First, by analysing the optimisation problem of the frame‐level BA, two factors have been found to be related to the frame‐level BA, which are inter‐frame dependency and the target bitrate. Then, a measure of inter‐frame dependency is put forward to reflect the correlation among consecutive frames. Finally, according to the results of allocation weights through the dynamic programming method, the relationships among the allocation weights and the two factors are investigated, and based on which the efficient BA model is established. Experimental results show that in comparison with the original RC scheme in HM‐14.0, the proposed frame‐level BA algorithm reduces, on average, BD‐rate by 5.19% with negligible encoding time increase. In addition, the proposed algorithm also achieves higher GOP‐level RC accuracy compared with the original RC scheme in HM.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here