As the latest video coding standard, High Efficiency Video Coding (HEVC) achieves over 50% bit rate reduction with similar video quality compared with previous standards H.264/AVC. However, the higher compression efficiency is attained at the cost of significantly increasing computational load. In order to reduce the complexity, this paper proposes a fast coding unit (CU) partition technique to speed up the process. To detect the edge features of each CU, a more accurate improved Sobel filtering is developed and performed By analyzing the textural features of CU, an early CU splitting termination is proposed to decide whether a CU should be decomposed into four lower-dimensions CUs or not. Compared with the reference software HM16.7, experimental results indicate the proposed algorithm can lessen the encoding time up to 44.09% on average, with a negligible bit rate increase of 0.24%, and quality losses lower 0.03 dB, respectively. In addition, the proposed algorithm gets a better trade-off between complexity and rate-distortion among the other proposed works.
As the newest international video compression standard, high efficiency video coding (HEVC) achieves a higher compression ratio and better video quality, compared with the previous standard, H.264/advanced video coding. However, higher compression efficiency is obtained at the cost of extraordinary computational load, which obstructs the implementation of the HEVC encoder for real-time applications and mobile devices. Intracoding is one of the high computational stages due to the flexible coding unit (CU) sizes and high density of angular prediction modes. This paper presents an intraencoding technique to speed up the process, which is composed of an early coding tree unit (CTU) depth interval prediction and an efficient CU partition method. The encoded CU depth information in the already encoded surrounding CTUs is utilized to predict the encoding CU search depth interval of the current CTU. By analyzing the textural features of CU, an early CU splitting termination is proposed to decide whether a CU should be decomposed into four lower-dimensions CUs or not. The experimental results indicate that the proposed algorithm outperforms the reference software HM16.7 by decreasing the coding time up to 53.67% with a negligible bit rate increase of 0.52%, and peak signal-to-noise ratio losses lower 0.06 dB, respectively.