Efficient search algorithm for block motion estimation

Jae Yong Kim, Sung-Bong Yang

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Many suboptimal motion vector search algorithms have been proposed because the full search algorithm, which is an optimal method, requires huge computational cost. Most of these algorithms find motion vectors simply from the center of the search window. In this paper, we propose an efficient motion vector search algorithm which, in order to predict the initial search point, exploits the global motion information obtained from the previous three frames and the local motion information regarding the motion vectors of the neighboring blocks of the current block. Our proposed algorithm searches for a motion vector from this initial search point, instead of from the center of the search window, using either the diamond search algorithm [J. Y. Tham, S. Ranganath, M. Ranganath, and A. A. Kassim, "A novel unrestricted center-biased diamond search algorithm for block motion estimation," IEEE Trans. Circuits Syst. Video Technol. 8(4), 369-377 (1998) and S. Zhu and K. Ma, "A new diamond search algorithm for fast block matching motion estimation," in ICICS'97, pp. 9-12, Singapore (Sept. 1997)] or the unrestricted small diamond search algorithm which performs its search always with a smaller diamond search pattern. Experimental results show that our proposed algorithm is faster than other suboptimal block matching algorithms while it maintains lower average block distortion.

Original languageEnglish
Pages (from-to)69-74
Number of pages6
JournalJournal of Electronic Imaging
Volume11
Issue number1
DOIs
Publication statusPublished - 2002 Jan 1

Fingerprint

Motion estimation
Diamonds
diamonds
Singapore
costs

All Science Journal Classification (ASJC) codes

  • Atomic and Molecular Physics, and Optics
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

@article{96aa157b865644858f12fac45a255882,
title = "Efficient search algorithm for block motion estimation",
abstract = "Many suboptimal motion vector search algorithms have been proposed because the full search algorithm, which is an optimal method, requires huge computational cost. Most of these algorithms find motion vectors simply from the center of the search window. In this paper, we propose an efficient motion vector search algorithm which, in order to predict the initial search point, exploits the global motion information obtained from the previous three frames and the local motion information regarding the motion vectors of the neighboring blocks of the current block. Our proposed algorithm searches for a motion vector from this initial search point, instead of from the center of the search window, using either the diamond search algorithm [J. Y. Tham, S. Ranganath, M. Ranganath, and A. A. Kassim, {"}A novel unrestricted center-biased diamond search algorithm for block motion estimation,{"} IEEE Trans. Circuits Syst. Video Technol. 8(4), 369-377 (1998) and S. Zhu and K. Ma, {"}A new diamond search algorithm for fast block matching motion estimation,{"} in ICICS'97, pp. 9-12, Singapore (Sept. 1997)] or the unrestricted small diamond search algorithm which performs its search always with a smaller diamond search pattern. Experimental results show that our proposed algorithm is faster than other suboptimal block matching algorithms while it maintains lower average block distortion.",
author = "Kim, {Jae Yong} and Sung-Bong Yang",
year = "2002",
month = "1",
day = "1",
doi = "10.1117/1.1426079",
language = "English",
volume = "11",
pages = "69--74",
journal = "Journal of Electronic Imaging",
issn = "1017-9909",
publisher = "SPIE",
number = "1",

}

Efficient search algorithm for block motion estimation. / Kim, Jae Yong; Yang, Sung-Bong.

In: Journal of Electronic Imaging, Vol. 11, No. 1, 01.01.2002, p. 69-74.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient search algorithm for block motion estimation

AU - Kim, Jae Yong

AU - Yang, Sung-Bong

PY - 2002/1/1

Y1 - 2002/1/1

N2 - Many suboptimal motion vector search algorithms have been proposed because the full search algorithm, which is an optimal method, requires huge computational cost. Most of these algorithms find motion vectors simply from the center of the search window. In this paper, we propose an efficient motion vector search algorithm which, in order to predict the initial search point, exploits the global motion information obtained from the previous three frames and the local motion information regarding the motion vectors of the neighboring blocks of the current block. Our proposed algorithm searches for a motion vector from this initial search point, instead of from the center of the search window, using either the diamond search algorithm [J. Y. Tham, S. Ranganath, M. Ranganath, and A. A. Kassim, "A novel unrestricted center-biased diamond search algorithm for block motion estimation," IEEE Trans. Circuits Syst. Video Technol. 8(4), 369-377 (1998) and S. Zhu and K. Ma, "A new diamond search algorithm for fast block matching motion estimation," in ICICS'97, pp. 9-12, Singapore (Sept. 1997)] or the unrestricted small diamond search algorithm which performs its search always with a smaller diamond search pattern. Experimental results show that our proposed algorithm is faster than other suboptimal block matching algorithms while it maintains lower average block distortion.

AB - Many suboptimal motion vector search algorithms have been proposed because the full search algorithm, which is an optimal method, requires huge computational cost. Most of these algorithms find motion vectors simply from the center of the search window. In this paper, we propose an efficient motion vector search algorithm which, in order to predict the initial search point, exploits the global motion information obtained from the previous three frames and the local motion information regarding the motion vectors of the neighboring blocks of the current block. Our proposed algorithm searches for a motion vector from this initial search point, instead of from the center of the search window, using either the diamond search algorithm [J. Y. Tham, S. Ranganath, M. Ranganath, and A. A. Kassim, "A novel unrestricted center-biased diamond search algorithm for block motion estimation," IEEE Trans. Circuits Syst. Video Technol. 8(4), 369-377 (1998) and S. Zhu and K. Ma, "A new diamond search algorithm for fast block matching motion estimation," in ICICS'97, pp. 9-12, Singapore (Sept. 1997)] or the unrestricted small diamond search algorithm which performs its search always with a smaller diamond search pattern. Experimental results show that our proposed algorithm is faster than other suboptimal block matching algorithms while it maintains lower average block distortion.

UR - http://www.scopus.com/inward/record.url?scp=0036208661&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036208661&partnerID=8YFLogxK

U2 - 10.1117/1.1426079

DO - 10.1117/1.1426079

M3 - Article

VL - 11

SP - 69

EP - 74

JO - Journal of Electronic Imaging

JF - Journal of Electronic Imaging

SN - 1017-9909

IS - 1

ER -