Share Email Print
cover

Proceedings Paper

Fast-block-matching motion estimation algorithm using optimal search patterns
Author(s): Dong-Keun Lim; Yo-Sung Ho
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

For video compression, motion estimation is popularly employed to exploit temporal correlation existing in video sequences. If we employ the full search block matching algorithm for estimating motion vectors, it requires very heavy computational complexity. Although several fast block matching algorithms have been proposed to solve this problem, they sacrifice their reconstructed image quality. In this paper, we derive optimal search patterns for fast block matching motion estimation. By analyzing the block matching algorithm as a function of the block size and the shape, we find optimal search patterns for initial motion estimation. The proposed idea can provide an analytical ground for the current MPEG-2 proposals. In addition, we propose a new fast motion estimation algorithm using adaptive search patterns, considering matching criteria and statistical properties of object displacement. In order to select an appropriate search pattern, we exploit the relationship between the motion vector and the frame difference of each block. By changing the search pattern adaptively, we can improve the motion prediction accuracy, while reducing the required computational complexity compared to other fast block matching algorithms.

Paper Details

Date Published: 29 December 2000
PDF: 9 pages
Proc. SPIE 4310, Visual Communications and Image Processing 2001, (29 December 2000); doi: 10.1117/12.411857
Show Author Affiliations
Dong-Keun Lim, Kwangju Institute of Science and Technology (South Korea)
Yo-Sung Ho, Kwangju Institute of Science and Technology (South Korea)


Published in SPIE Proceedings Vol. 4310:
Visual Communications and Image Processing 2001
Bernd Girod; Charles A. Bouman; Eckehard G. Steinbach, Editor(s)

© SPIE. Terms of Use
Back to Top