A fast block matching motion estimation algorithm based on simplex minimisation

Abstract

A fast block matching motion estimation algorithm is presented. The algorithm is based on a generic unconstrained optimisation technique called simplex minimisation (SM). In order to apply this method to the constrained minimisation problem of block matching motion estimation, a suitable initialisation procedure, termination criterion, and constraints on the independent variables of the search, are proposed. The algorithm is demonstrated to outperform other fast block matching motion estimation techniques providing better reconstruction quality, a smoother motion field and reduced computational complexity.