Efficient three-step search algorithm for block motion estimation in video coding
Lists
Only you see this
Abstract
The three-step search algorithm has been widely used in block matching motion estimation due to its simplicity and effectiveness. The sparsely distributed checking points pattern in the first step is very suitable for searching large motion. However, for quasi-stationary blocks it will easily lead the search to be trapped into a local minimum. In this paper we propose a modification on the three-step search algorithm which employs a small diamond pattern in the first step, and the unrestricted search step is used to search the center area. Experimental results show that the proposed algorithm performs better than new three-step search in terms of MSE and requires less computation by up to 15% on average.
BibTeX
@inproceedings{chau2003efficient,
author = {Lap-Pui Chau and Xuan Jing},
title = {{Efficient three-step search algorithm for block motion estimation in video coding}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2003},
url = {https://openreview.net/forum?id=jI5psWB0st},
}Loading related content...