Research On Complexity Scalable Video Coding Of H.264

The H.264 use a lot of new video encoding technology,significantly improves the efficiency of video coding and reconstruction of video quality.Generally speaking, in the same quality of coding,H.264 can save about 1 / 2 bit rate than MPEG-4. However,coding performance improvements by raising the cost of computational complexity,H.264 encoding complexity is more than ten times than MPEG-4.This method is only applicable to high-end equipment,the energy limited to mobile phones on the low-end devices are not match,it is necessary to make some approach to the computational complexity scalable,by choosing a different comlexity to get the image quality and encoding time.This study focuses on the complexity scalable algorithm.The main purpose is aim at H.264/AVC the two highest computational complexity parts:intra-prediction, inter-frame block-size mode selection,in the full study and understanding of the complexity of scalable video coding technology based on the current situation,based on the H.264 encoding standards has been achived the following two algorithms:1.From the exist of fast 4×4 intra prediction mode selection algorithm,then we proposed a complexity of scalable fast intra mode selection algorithm,experiments show that the method can arbitrary classification the degree of the complexity of intra prediction,The complexity of different grade,they can shorten the encoding time.2.Have been studied the exist complexity of the inter-frame scalability mode selection algorithms in this paper,based on the exist algorithm has made some improvements,and adding a threshold adaptive model selection strategy to stop mode decision earlier,compared with reference documents algorithms,in the case of image quality and bit rate almost the same,can increase some coding speed.