Adaptive motion tracking block matching algorithms for video coding

In most block-based video coding systems, the fast block matching algorithms (BMAs) use the origin as the initial search center, which may not track the motion very well. To improve the accuracy of the fast BMAs, a new adaptive motion tracking search algorithm is proposed. Based on the spatial corre...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on circuits and systems for video technology Vol. 9; no. 7; pp. 1025 - 1029
Main Authors XU, J.-B, PO, L.-M, CHEUNG, C.-K
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 1999
Institute of Electrical and Electronics Engineers
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:In most block-based video coding systems, the fast block matching algorithms (BMAs) use the origin as the initial search center, which may not track the motion very well. To improve the accuracy of the fast BMAs, a new adaptive motion tracking search algorithm is proposed. Based on the spatial correlation of motion blocks, a predicted starting search point, which reflects the motion trend of the current block, is adaptively chosen. This predicted search center is found closer to the global minimum, and thus the center-biased BMAs can be used to find the motion vector more efficiently. Experimental results show that the proposed algorithm enhances the accuracy of the fast center-biased BMAs, such as the new three-step search, the four-step search, and the block-based gradient descent search, as well as reduces their computational requirement.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1051-8215
1558-2205
DOI:10.1109/76.795056