关键词: 运动估计, 视频压缩, 匹配准则, 块分割

Abstract: Motion estimation is the key to remove the temporal redundancy in video compression, the existing algorithms are mostly SAD matching algorithm based on full search strategy. The compression performance of these algorithms are very good, but the computation is complexity and it has a poor real-time. This paper proposes a new fast motion estimation algorithm. It splites a block into multiple sub-blocks, and calculates every sub-block gray value and the gray value of the sum of squares of every sub-blocks, then as a whole parameter in combination with the three proposed matching criterion, calculates the optimal frame motion estimation between the current frame and candidate. Experimental results show that using this algorithm, the motion estimation significantly reduces the complexity and compression performance is very close to full search strategy based on SAD algorithm.

Key words: motion estimation, video compression, matching criterion, block partition