A Flat Hexagon-based Search Algorithm for Fast Block Matching Motion Estimation
Nam Hyeon-Woo · Journal of the Korea Society of Computer and Information · 2007
In the fast block matching algorithm. search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image qualify. In this paper, we propose a new fast block matching algorithm using the flat-hexagon search pattern that ate solved disadvantages of the diamond pattern search algorithm(DS) and the hexagon-based search algorithm(HEXBS). Our proposed algorithm finds mainly the motion vectors that not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the DS and HEXBS, the proposed f)at-hexagon search algorithm(FHS) improves about in terms of average number of search point per motion vector estimation and improves about in terms of PSNR(Peak Signal to Noise Ratio).