Home/The Template Update Problem

The Template Update Problem

Iain Matthews, Takahiro Ishikawa and Simon Baker
Conference Paper, Proceedings of the British Machine Vision Conference, September, 2003

View Publication

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


Template tracking is a well studied problem in computer vision which dates back to the Lucas-Kanade algorithm of 1981. Since then the paradigm has been extended in a variety of ways including: arbitrary parametric transformations of the template, and linear appearance variation. These extensions have been combined, culminating in non-rigid appearance models such as Active Appearance Models (AAMs) and Active Blobs. One question that has received very little attention is how to update the template over time so that it remains a good model of the object being tracked. This paper proposes an algorithm to update the template that avoids the “drifting” problem of the naive update algorithm. Our algorithm can be interpreted as a heuristic to avoid local minima. It can also be extended to templates with linear appearance variation. This extension can be used to convert (update) a generic, person-independent AAM into a person specific AAM.

author = {Iain Matthews and Takahiro Ishikawa and Simon Baker},
title = {The Template Update Problem},
booktitle = {Proceedings of the British Machine Vision Conference},
year = {2003},
month = {September},
} 2017-09-13T10:44:32-04:00