Training sequential on-line boosting classifier for visual tracking

On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-line boosting training remain unsolved: (i) classifier evaluation speed optimization and, (ii) automatic classifier complexity estimation. In this paper we show how the on-line boosting can be combined with Wald's sequential decision theory to solve both of the problems. The properties of the proposed on-line WaldBoost algorithm are demonstrated on a visual tracking problem. The complexity of the classifier is changing dynamically depending on the difficulty of the problem. On average, a speedup of a factor of 5-10 is achieved compared to the non-sequential on-line boosting.

• Type: Conference
• Year: 2008
• Where: ICPR
• Authors: Helmut Grabner, Horst Bischof, Jan Sochman, Jiri Matas
• Keywords: Classifier Complexity Estimation, Computer Vision, ICPR 2008, Non-sequential On-line Boosting, On-line Boosting Training