An efficient multiframe dynamic search range motion estimation for H.264 H.264AVC achieves higher compression efficiency than previous video coding standards. However, this comes at the cost of increased complexity due to the use of variable block size motion estimation and longterm memory motion compensated prediction (LTMCP). In this paper, an efficient multiframe dynamic search range motion estimation algorithm is proposed. This algorithm can adjust the spatial search range and temporal search range according to the video content dynamically. This algorithm can be on the top of many other fast motion estimation (Fast ME) algorithms. Compared with the constant search range scheme used by multiframe UMHexagonS algorithm, the proposed algorithm can be 4.86 time faster, with negligible degradation of video quality.

Enhanced SAD reuse fast motion estimation H.264 is a new video coding standard which outperforms the previous video coding standards. It uses many advanced video coding techniques to improve the coding performance. Variable block size motion estimation (ME) is one of the techniques that contributes to the excellent performance of H.264 but it is computational intensive. In this paper, a fast SAD reuse ME algorithm is proposed which reuses SAD within the same macroblock and uses patternbased ME and refinement search to reduce the computational complexity of variable block size ME with a little degradation of coding performance in terms of PSNR and bitrate. Experimental results show that the proposed algorithm reduces the ME time by more than 90% on average with only a little degradation of coding performance when comparing with that of the Fast Full Search (FFS).