Lossless computational reduction of full search algorithm in motion estimation using appropriate matching unit from image localization

摘要

To reduce an amount of computation of full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without any degradation of predicted images like the conventional FS. The computational reduction without any degradation in predicted image comes from fast kick-off of impossible motion vectors. We obtain faster kick-off of inappropriate motion vectors using efficient matching units from localization of complex area in image data. In this paper, we show three properties in block matching of motion estimation. Experimentally, we remove the unnecessary computations by about 30 % with our proposing algorithm compared with the conventional fast matching scan algorithm.