An Adaptive Hexagon Based Search for Fast Motion Estimation 


Vol. 29,  No. 7, pp. 828-835, Jul.  2004


PDF
  Abstract

An adaptive hexagon based search(AHBS) algorithm is proposed in this paper to perform block motion
estimation in video coding. The AHBS evaluates the value of a given objective function starting from a diamond-shaped checking block, and then continues its process using two hexagon-shaped checking blocks until the minimum value is found at the center of checking blocks. Also, the determination of which checking block is used depends on the position of minimum value occurred in previous searching step.
The AHBS is compared with other fast searching algorithms including full search(FS). Experimental results show that the proposed algorithm provides competitive performance with slightly reduced computational complexity.

  Statistics
Cumulative Counts from November, 2022
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]

B. T. Chun and B. C. Kim, "An Adaptive Hexagon Based Search for Fast Motion Estimation," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 7, pp. 828-835, 2004. DOI: .

[ACM Style]

Byung Tae Chun and Byung Cheon Kim. 2004. An Adaptive Hexagon Based Search for Fast Motion Estimation. The Journal of Korean Institute of Communications and Information Sciences, 29, 7, (2004), 828-835. DOI: .

[KICS Style]

Byung Tae Chun and Byung Cheon Kim, "An Adaptive Hexagon Based Search for Fast Motion Estimation," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 7, pp. 828-835, 7. 2004.