Abstract
To satisfy the rapidly increasing demands for high resolution video, the Joint Collaborative Team on Video Coding (JCT-VC) developed a new video coding standard, i.e. High-efficiency Video Coding (HEVC). With the same perceptual video quality as H.264, HEVC can achieve a bit rate reduction of approximately 50%. However, the quad tree structured coding units (CUs) cause high computational complexity. In this paper, a novel algorithm is proposed to decrease the computational complexity of HEVC intra coding. We mainly use the total coding bits of CUs as threshold to terminate CUs' partition. Furthermore, we also consider the spatial correlation between the current LCU and its neighbor LCUs to predict the current largest CU minimum depth so that we can skip some certain CUs' rate distortion cost checking.
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
