Size-Variable Block Matching for Extracting Motion Information 


Vol. 10,  No. 3, pp. 321-328, Jun.  2003
10.3745/KIPSTB.2003.10.3.321


PDF
  Abstract

This paper proposes a size-variable block matching algorithm for motion vector extraction. The proposed algorithm dynamically determines the search area and the size of a block. We exploit the constraint of small velocity changes of a block along the time to determine the origin of the search area. The range of the search area is adjusted according to the motion coherency of spatially neighboring blocks. The process of determining the size of a block begins matching with a small block. If the matching degree is not good enough, we expand the size of a block a little bit and then repeat the matching process until our matching criterion is satisfied. The experimental results show that the proposed algorithm can yield very accurate block motion vectors. Our algorithm outperforms other algorithms in terms of the estimated motion vectors, though our algorithm requires some computational overhead.

  Statistics
  Cite this article

[IEEE Style]

S. W. Jang, B. K. Kim, G. Y. Kim, H. I. Choi, "Size-Variable Block Matching for Extracting Motion Information," The KIPS Transactions:PartB , vol. 10, no. 3, pp. 321-328, 2003. DOI: 10.3745/KIPSTB.2003.10.3.321.

[ACM Style]

Seok Woo Jang, Bong Keun Kim, Gye Young Kim, and Hyung Il Choi. 2003. Size-Variable Block Matching for Extracting Motion Information. The KIPS Transactions:PartB , 10, 3, (2003), 321-328. DOI: 10.3745/KIPSTB.2003.10.3.321.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals