On-line Random Forests
The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
Random Forests (RFs) are frequently used in many computer vision and machine learning applications. Their popularity is mainly driven by their high computational efficiency during both training and evaluation while achieving state-of-the-art results. However, in most applications RFs are used off-line. This limits their usability for many practical problems, for instance, when training data arrives sequentially or the underlying distribution is continuously changing. In this paper, we propose a novel on-line random forest algorithm. We combine ideas from on-line bagging, extremely randomized forests and propose an on-line decision tree growing procedure. Additionally, we add a temporal weighting scheme for adaptively discarding some trees based on their out-of-bag-error in given time intervals and consequently growing of new trees. The experiments on common machine learning data sets show that our algorithm converges to the performance of the off-line RF. Additionally, we conduct experiments for visual tracking, where we demonstrate real-time state-of-the-art performance on well-known scenarios and show good performance in case of occlusions and appearance changes where we outperform trackers based on on-line boosting. Finally, we demonstrate the usability of on-line RFs on the task of interactive real-time segmentation.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538 · cited 1×
“There has been a recent interest in using Random Forests (RFs) [6] for computer vision problems.”
BackgroundLIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Libsvm : A library for support vector machines
Ferrari, V. (2008) · Medical Entomology and Zoology · Cited by 10,122
Geurts, P., Ernst, D., & Wehenkel, L. (2006) · Machine Learning · doi:10.1007/s10994-006-6226-1 · Cited by 9,300
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Mining high-speed data streams
Domingos, P., & Hulten, G. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347107 · Cited by 2,185
Competitive learning: From interactive activation to adaptive resonance
Grossberg, S. (1987) · Cognitive Science · doi:10.1111/j.1551-6708.1987.tb00862.x · Cited by 1,471 · cited 1×
“Third, tracking typically suffers from the stability-plasticity-dilemma [12] which means a stable model should be learned while still being highly adaptive.”
BackgroundRepresenting shape with a spatial pyramid kernel
Bosch, A., Zisserman, A., & Munoz, X. (2007) · Proceedings of the 6th ACM international conference on Image and video retrieval · doi:10.1145/1282280.1282340 · Cited by 1,399
Robust Fragments-based Tracking using the Integral Histogram
Adam, A., Rivlin, E., & Shimshoni, I. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.256 · Cited by 1,397
Semantic texton forests for image categorization and segmentation
Shotton, J., Johnson, M., & Cipolla, R. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587503 · Cited by 1,014
Grabner, H., & Bischof, H. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.215 · Cited by 979
Self-citationElliptical head tracking using intensity gradients and color histograms
Birchfield, S. (2002) · Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231) · doi:10.1109/cvpr.1998.698614 · Cited by 743
Fast Discriminative Visual Codebooks using Randomized Clustering Forests
Moosmann, F., Triggs, B., & Jurie, F. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0128 · Cited by 467
Oza, N. C., & Russell, S. (2001) · NASA Technical Reports Server (NASA) · Cited by 436
Randomized Trees for Real-Time Keypoint Recognition
Lepetit, V., Lagger, P., & Fua, P. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.288 · Cited by 415
Decision Tree Induction Based on Efficient Tree Restructuring
Utgoff, P. E., Berkman, N. C., & Clouse, J. A. (1997) · Machine Learning · doi:10.1023/a:1007413323501 · Cited by 359
Implementing Decision Trees and Forests on a GPU
Sharp, T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88693-8_44 · Cited by 170
Interactive Texture Segmentation using Random Forests and Total Variation
Santner, J., Unger, M., Pock, T., Leistner, C., Saffari, A., & Bischof, H. (2009) · Procedings of the British Machine Vision Conference 2009 · doi:10.5244/c.23.66 · Cited by 35
Self-citation
Cited by
High-Speed Tracking with Kernelized Correlation Filters
Henriques, J. F., Caseiro, R., Martins, P., & Batista, J. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2345390 · Cited by 5,753
Biau, G., & Scornet, E. (2016) · Test · doi:10.1007/s11749-016-0481-7 · Cited by 4,149
Kalal, Z., Mikolajczyk, K., & Matas, J. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.239 · Cited by 3,285
Sagi, O., & Rokach, L. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1249 · Cited by 3,103
Exploiting the Circulant Structure of Tracking-by-Detection with Kernels
Henriques, J. F., Caseiro, R., Martins, P., & Batista, J. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33765-9_50 · Cited by 2,310
“Many use established learning algorithms such as Boosting [6] [3], Support Vector Machines (SVM) [5], or Random Forests [7], and adapt them to online training.”
Method
Metadata
- Authors
- Saffari, A., Leistner, C., Santner, J., Godec, M., & Bischof, H.
- Venue
- 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops
- Publisher
- IEEE
- Published
- 2009-09
- Pages
- 1393-1400
- OpenAlex
- W2162152641
- Cited by
- 481
- References
- 18
- FWCI
- 12.22
- 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
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.