Simplex minimisation for fast block matching motion estimation

摘要

The authors formulate block matching motion estimation as a two-dimensional constrained minimisation problem and then solve this problem using simplex minimisation (SM). To achieve this, a suitable initialisation procedure is proposed, in addition to a termination criterion and constraints on the independent variables of the search. The proposed algorithm is demonstrated to outperform other fast block matching motion estimation techniques.