Fast CU-splitting decisions based on data mining

The HEVC(H.265) has brought in significant improvements in terms of coding efficiency. However, the reduction in bitrates comes along with an increment in computational complexity. This paper presents a data mining approach to reduce the complexity of inter partition modes in HEVC. Determining the CU-splitting in inter partition modes requires substantial resources, so the goal of the work is to terminate the inter partition mode through CU-splitting decision in advance for reducing encoding complexity. We use a method that employs a set of decision trees based on data mining to achieve the goal instead of searching for the best match mode in all modes. Experiments show that the fast algorithm based on decision trees can efficiently enhance the encoding speed 32.6% at a negligible cost of 0.3% increase in terms of BD-rate.

[1]  Gary J. Sullivan,et al.  Rate-distortion optimization for video compression , 1998, IEEE Signal Process. Mag..

[2]  Christoph H. Lampert Machine Learning for Video Compression: Macroblock Mode Decision , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[3]  Yuan Zhang,et al.  Classification based fast mode decision for stereo video coding , 2013, 2013 IEEE International Conference on Image Processing.

[4]  Gary J. Sullivan,et al.  Comparison of the Coding Efficiency of Video Coding Standards—Including High Efficiency Video Coding (HEVC) , 2012, IEEE Transactions on Circuits and Systems for Video Technology.

[5]  Ian H. Witten,et al.  The WEKA data mining software: an update , 2009, SKDD.

[6]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[7]  Ester Bernadó-Mansilla,et al.  The Class Imbalance Problem in UCS Classifier System: A Preliminary Study , 2005, IWLCS.

[8]  Jeong-Hoon Park,et al.  Block Partitioning Structure in the HEVC Standard , 2012, IEEE Transactions on Circuits and Systems for Video Technology.