Research On Video Prediction Based On H.264/AVC

With fast development of Multi-media in recent years, many more strict requirements have been brought forward than before in many application areas. However, most techniques have not been adapted. So many novel fast and efficient innovations would play an important role to solve the dilemma.This paper would depict some leading techniques about the last video compression standard H.264, and analyze the complexity of each encoding process. Then aiming at the most time-consuming steps, including intra prediction and inter prediction, this paper would primarily introduce the details and some classic algorithms about the two, and analyze the advantages and disadvantages.Motion estimation is a significant composition of inter prediction. As to motion estimation, the search pattern is a critical step and the right search pattern would avoid to the optimal result in the local area and accelerate the search speed. Intra prediction has significant meaning to encode latter frames. Therefore, two novel algorithms had been proposed corresponding to inter prediction and intra prediction respective, in this paper.This paper mainly focuses on the following aspects:Almost former motion estimation algorithms usually brought optimal results in the local as confirming the search direction prematurely. Therefore, this paper would propose a new hybrid search strategy to escape the local optimal results. This strategy would adopt quadrangle search pattern as the first step, and the aim is confirming the direction of optimal. Then it would adopt hexagon search pattern as the second step, in another word, the hexagon search is regard as subtle searching process to solute the problem. At same time, search terminates strategy is adopted to increase the efficiency. Most experiments show that this algorithm would reach higher search speed and higher search precision.This paper would propose a new idea to predict the intra frames, which is that it regarded the characteristics of encoded block as standard of block partition. This paper would utilize the comparability of matrix to solute it. Then, some improvements of former algorithms had been adopted to this paper. Most experiments show that though the bit rate would little higher up than before, the time-consuming and encoding complexity would decreased dramatically.