On Robustness of On-line Boosting- A Competitive Study
| Citations: | 7 - 5 self |
BibTeX
@MISC{Leistner_onrobustness,
author = {Christian Leistner and Amir Saffari and Peter M. Roth and Horst Bischof},
title = {On Robustness of On-line Boosting- A Competitive Study},
year = {}
}
OpenURL
Abstract
On-line boosting is one of the most successful on-line algorithms and thus applied in many computer vision applications. However, even though boosting, in general, is well known to be susceptible to class-label noise, on-line boosting is mostly applied to self-learning applications such as visual object tracking, where label-noise is an inherent problem. This paper studies the robustness of on-line boosting. Since mainly the applied loss function determines the behavior of boosting, we propose an on-line version of GradientBoost, which allows us to plug in arbitrary lossfunctions into our on-line learner. Hence, we can easily study the importance and the behavior of different lossfunctions. We evaluate various on-line boosting algorithms in form of a competative study on standard machine learning problems as well as on common computer vision applications such as tracking and autonomous training of object detectors. Our results show that using on-line Gradient-Boost with robust loss functions leads to superior results in all our experiments. 1.







