Share Email Print

Proceedings Paper

Study on motion estimation using local minima
Author(s): Min-Sup Lee; Shiryong Yu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Block matching algorithm has been widely employed in motion estimation, because of its simplicity of implementation. Among them the full search algorithm gives the optimal solution within the search area except the exhaustive computational cost. On the contrary, other fast search algorithms have the shortcomings of finding the local minimum due to coarse sampling positions. In this paper two issues, speed and local minimum, are dramatically improved by using the line projection and local minima. The proposed algorithm is constructed of two stages. First some candidates, local minima, for global minimum are selected by using the full search on the line projection data. And then these candidates are checked by general block matching algorithm. The performance of the proposed algorithm approaches that of the full search algorithm, but the computational cost is much less than the full search algorithm.

Paper Details

Date Published: 4 November 1993
PDF: 7 pages
Proc. SPIE 1976, High-Definition Video, (4 November 1993); doi: 10.1117/12.161467
Show Author Affiliations
Min-Sup Lee, Daewoo Electronics Co., Ltd. (South Korea)
Shiryong Yu, Daewoo Electronics Co., Ltd. (South Korea)

Published in SPIE Proceedings Vol. 1976:
High-Definition Video
Naohisa Ohta, Editor(s)

© SPIE. Terms of Use
Back to Top