Please use this identifier to cite or link to this item:
|Title:||Using machine learning for fast intra MB coding in H.264||Authors:||Kalva, Hari
|Keywords:||Image processing;Visual communication;Machine learning;Computational complexity;Computer simulation||Issue Date:||2007||Publisher:||Spie||Source:||Proceedings of SPIE, Visual communications and image processing, January 29, 2007, San Jose, CA||Abstract:||H.264 is a highly efficient and complex video codec. The complexity of the codec makes it difficult to use all its features in resource constrained mobile devices. This paper presents a machine learning approach to reducing the complexity of Intra encoding in H.264. Determining the macro block coding mode requires substantial computational resources in H.264 video encoding. The goal of this work to reduce MB mode computation from a search operation, as is done in the encoders today, to a computation. We have developed a methodology based on machine learning that computes the MB coding mode instead of searching for the best match thus reducing the complexity of Intra 16x16 coding by 17 times and Intra 4x4 MB coding by 12.5 times. The proposed approach uses simple mean value metrics at the block level to characterize the coding complexity of a macro block. A generic J4.8 classifier is used to build the decision trees to quickly determine the mode. We present a methodology for Intra MB coding. The results show that intra MB mode can be determined with over 90% accuracy. The proposed can also be used for determining MB prediction modes with an accuracy varying between 70% and 80%||URI:||http://ktisis.cut.ac.cy/handle/10488/7301||DOI:||10.1117/12.706024||Rights:||© 2007 SPIE-IS&T||Type:||Conference Papers|
|Appears in Collections:||Δημοσιεύσεις σε συνέδρια/Conference papers|
Show full item record
checked on Dec 17, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.