Fast HEVC Encoding Decisions Using Data Mining
; Agostini, L.
Cruz, L. A. S. C.
IEEE Transactions on Circuits and Systems for Video Technology Vol. 25, Nº 4, pp. 660 - 673, April, 2015.
ISSN (print): 1051-8215
Journal Impact Factor: 2,951 (in 2008)
Digital Object Identifier: 10.1109/TCSVT.2014.2363753
The High Efficiency Video Coding (HEVC) standard provides improved compression ratio in comparison to its predecessors at the cost of large increases in the encoding computational complexity. An important share of this increase is due to the new flexible partitioning structures, namely the Coding Trees, the Prediction Units and the Residual Quadtrees, with the best configurations decided through an exhaustive Rate-Distortion Optimization (RDO) process. In this article we propose a set of procedures for deciding whether the partition structure optimization algorithm should be terminated early or run to the end of an exhaustive search for the best configuration. The proposed schemes are based on decision trees obtained through data mining techniques. By extracting intermediate data, such as encoding variables from a training set of video sequences, three sets of decision trees are built and implemented to avoid running the RDO algorithm to its full extent. When separately implemented, these schemes achieve average computational complexity reductions of up to 50% at a negligible cost of 0.56% in terms of Bjontegaard Delta (BD)-rate increase. When the schemes are jointly implemented, an average computational complexity reduction of up to 65% is achieved, with a small BD-rate increase of 1.36%. Extensive experiments and comparisons with similar works demonstrate that the proposed early termination schemes achieve the best Rate-Distortion-Complexity trade-offs among all the compared works.