On robustness of on-line boosting - a competitive study
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
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 loss-functions into the on-line learner. Hence, we can easily study the importance and the behavior of different loss-functions. We evaluate various on-line boosting algorithms in form of a competitive 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884 · cited 6×
“[10] showed the connection of boosting algorithms to the stage-wise additive logistic regression methods from the applied statistics domain.”
BackgroundMethodInfluential
Cited by
Robust object tracking with online multiple instance learning
Babenko, B., Yang, M.-H., & Belongie, S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.226 · Cited by 2,007
“We also experimented with the LogitBoost loss function (as in [41], which penalizes noisy examples less harshly, and although it worked better than OAB, it did not outperform MILTrack.”
Struck: Structured output tracking with kernels
Hare, S., Saffari, A., & Torr, P. H. S. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126251 · Cited by 1,831
Self-citationStruck: Structured Output Tracking with Kernels
Hare, S., Golodetz, S., Saffari, A., Vineet, V., Cheng, M.-M., Hicks, S. L., & Torr, P. H. S. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2509974 · Cited by 994
Self-citationA survey of appearance models in visual object tracking
Li, X., Hu, W., Shen, C., Zhang, Z., Dick, A., & Hengel, A. V. D. (2013) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2508037.2508039 · Cited by 705
Real-time visual tracking via online weighted multiple instance learning
Zhang, K., & Song, H. (2013) · Pattern Recognition · doi:10.1016/j.patcog.2012.07.013 · Cited by 259
Metadata
- Authors
- Leistner, C., Saffari, A., Roth, P. M., & Bischof, H.
- Venue
- 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops
- Publisher
- IEEE
- Published
- 2009-09
- Pages
- 1362-1369
- OpenAlex
- W2049963988
- Cited by
- 79
- References
- 1
- FWCI
- 4.70
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On robustness of on-line boosting - a competitive study. https://app.cochat.ai/papers/10.1109/iccvw.2009.5457451
- The paper
- Leistner, C., Saffari, A., Roth, P. M., & Bischof, H. (2009). On robustness of on-line boosting - a competitive study. 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops. https://doi.org/10.1109/iccvw.2009.5457451
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.