A Fast Full Search Motion Estimation Algorithm using Partitioned Search Window 


Vol. 32,  No. 1, pp. 9-15, Jan.  2007


PDF
  Abstract

We propose the fast full search algorithm that reduces the computation of the block matching algorithm which is used for motion estimation of the video coding. Since the conventional spiral search method starts searching at the center of the search window and then moves search point to estimate the motion vectorpixel by pixel, it is goodfor the slow motion pictures. However the proposed method is good for the fast and slow motion because it estimates the motion in the new search order after partitioning the search window. Also, when finding the motion vector, this paper presents the method that reduces the complexity by computing the matching error in the order which is determined by local image complexity. The proposed algorithm reduces the computation up to 99% for block matching error compared with the conventional spiral full search algorithm without any loss of image quality.

  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]

S. Park, S. Jin, J. Jeong, "A Fast Full Search Motion Estimation Algorithm using Partitioned Search Window," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 1, pp. 9-15, 2007. DOI: .

[ACM Style]

Sang-Jun Park, Soonjong Jin, and Jechang Jeong. 2007. A Fast Full Search Motion Estimation Algorithm using Partitioned Search Window. The Journal of Korean Institute of Communications and Information Sciences, 32, 1, (2007), 9-15. DOI: .

[KICS Style]

Sang-Jun Park, Soonjong Jin, Jechang Jeong, "A Fast Full Search Motion Estimation Algorithm using Partitioned Search Window," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 1, pp. 9-15, 1. 2007.