Abstract
High-Efficiency Video Coding (HEVC) is the newest video coding standard and presents improved efficiency. However, the coding computational complexity of this process is significant because of its coding structure called quad-tree structure coding units (CUs) for improving compression efficiency. In this paper, a fast algorithm based on image complexity of current CU is proposed to reduce the computational complexity caused by CU partition. Using the number of colors, entropy, and contrast can distinguish the image complexity of different CUs. Such complexity is related to whether the CU needs to be partitioned or its rate distortion optimization can be skipped. Coding bits of current CU are used as qualifications to determine whether to partition the current CU. Experimental results show that the proposed algorithm can reduce coding time by 35% on average and exhibits an acceptable loss of Bjontegaard delta bit rate of 0.8% compared with the default algorithm in HM-16.11 for encoding natural sequences.
Sign-in/Register to access full text options 
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
