Heuristic algorithm for computing fast template motion in video streams

Abstract

Many vision problems require computing fast template motion in dynamic scenes. These problems can be formulated as exploration problems and thus can be expressed as a search into a state space based representation approach. However, these problems are hard to solve because they involve search through a high dimensional space. In this paper, we propose a heuristic algorithm through the space of transformations for computing target 2D motion. Three features are combined in order to compute efficient motion: (1) a quality of function match based on a holistic similarity measurement, (2) Kullback-Leibler measure as heuristic to guide the search process and (3) incorporation of target dynamics into the search process for computing the most promising search alternatives. The paper includes experimental evaluations that illustrate the efficiency and suitability for real-time vision based tasks.