Creating and sharing knowledge for telecommunications

Coding Tree Depth Estimation for Complexity Reduction of HEVC

Corrêa, G. ; Assunção, P.A. ; Agostini, L. ; Cruz, L. A. S. C.

Coding Tree Depth Estimation for Complexity Reduction of HEVC, Proc IEEE Data Compression Conference - DCC, Snowbird, United States, Vol. 1, pp. 43 - 52, March, 2013.

Digital Object Identifier: 10.1109/DCC.2013.12

Download Full text PDF ( 586 KBs)

The emerging HEVC standard introduces a number of tools which
increase compression efficiency in comparison to its predecessors at the cost of
greater computational complexity. This paper proposes a complexity control
method for HEVC encoders based on dynamic adjustment of the newly
proposed coding tree structures. The method improves a previous solution by
adopting a strategy that takes into consideration both spatial and temporal
correlation in order to decide the maximum coding tree depth allowed for each
coding tree block. Complexity control capability is increased in comparison to
a previous work, while compression losses are decreased by 70%.
Experimental results show that the encoder computational complexity can be
downscaled to 60% with an average bit rate increase around 1.3% and a PSNR
decrease under 0.07 dB.