A New Cross and Hexagonal Search Algorithm for Fast Block Matching Motion Estimation


The KIPS Transactions:PartB , Vol. 10, No. 7, pp. 811-814, Dec. 2003
10.3745/KIPSTB.2003.10.7.811,   PDF Download:

Abstract

In this paper, we propose a fast block-matching motion estimation method using the cross pattern and the hexagonal pattern. For the block-matching motion estimation method, full search finds the best motion estimation, but it requires huge search time because it has to check every search point within the search window. The proposed method makes use of the fact that most of motion vectors lie near the center of block. The proposed method first uses the cross pattern to search near the center of block, and then uses the hexagonal pattern to search larger motion vectors. Experimental results show that our method is better than recently proposed search algorithms in terms of mean-square error performance and required search time.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
P. I. Yeong, N. H. U, W. Y. Cheol, K. H. Jin, "A New Cross and Hexagonal Search Algorithm for Fast Block Matching Motion Estimation," The KIPS Transactions:PartB , vol. 10, no. 7, pp. 811-814, 2003. DOI: 10.3745/KIPSTB.2003.10.7.811.

[ACM Style]
Park In Yeong, Nam Hyeon U, Wi Yeong Cheol, and Kim Ha Jin. 2003. A New Cross and Hexagonal Search Algorithm for Fast Block Matching Motion Estimation. The KIPS Transactions:PartB , 10, 7, (2003), 811-814. DOI: 10.3745/KIPSTB.2003.10.7.811.