A new diamond search algorithm for fast block-matching motion estimation
IEEE Transactions on Image Processing
A novel four-step search algorithm for fast block motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
Simplex minimization for single- and multiple-reference motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
Block motion estimation can be regarded as a function minimization problem in a finite-dimensional space. Therefore, fast block motion estimation can be achieved by using an efficient function minimization algorithm instead of a predefined search pattern, such as diamond search. Downhill simplex search is an efficient derivative-free function minimization algorithm. In this paper, we proposed a fast block motion estimation algorithm based on applying the downhill simplex search for function minimization. Several enhanced schemes are proposed to improve the efficiency and accuracy, including a new initialization process, a special rounding scheme, and an early-stop error function evaluation procedure. We also extend the downhill simplex search for the multi-reference frame motion estimation problem. Experimental results show superior performance of the proposed algorithm over some existing fast block matching methods on several benchmarking video sequences.