New Block Matching Full Search Algorithm using Variable Block Size based on Image Property

摘要

This paper presents new efficient method for motion estimation algorithm based on variable block size. The schemes allow the size of blocks to adapt to local activity within the block, and the number of blocks in any frame can be varied while still accurately representing true motion. This permits adaptive bit allocation between the representation of displacement and residual data, and also the variation of overall bit rate on a frame-by-frame basis. Especially, this paper approachs in direction of supplementing drawback of previous representative quad tree block matching algorithm and adds new method in order to improve the performance. Instead of the usual quad-tree segmentation, frame difference is computed for quad section and then homogeneity test is carried out for the largest block. Also, putting together of segmentation and re-merging strategy is employed which provides large computation reduction with little transmission overhead and raise higher image quality. Naturally, results are come into view as image quality is improved largely and computation load is decreased to 50-70 percent approximately.