A New Fast Block Matching Algorithm for Video Files with Much Inter-frame Difference

For video coding, we have to consider two performance factors, i.e., the search speed and coded video’s quality. Since there is often a trade-off between those performance factors, it is not easy to develop an efficient algorithm in all these aspects. As two feasible video coding algorithms based on the block matching motion estimation, the CDS and HEXBS have been proposed. Although the algorithms have better performance advantages than a naive full search algorithm, they cannot provide the best coding speed and image quality for video files with less inter-frame redundancy. Against this, we propose a new block matching algorithm that works with the small cross and flat hexagon search patterns. From extensive performance evaluations, we can see that our algorithm outperforms both CDS and HEXBS algorithms in terms of the search speed and the coded video’s quality. Using our algorithm, we can improve the search speed by up to 51%, and also diminish the PSNR (Peak Signal Noise Ratio) by at most 0.7 dB, thereby improving the video quality. Key-Words: Motion estimation, Fast block matching algorithm, Video coding, Video compression