Cascaded random forest for fast object detection

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

Research Organisations

View graph of relations

Details

Original languageEnglish
Title of host publicationImage Analysis
Subtitle of host publication18th Scandinavian Conference, SCIA 2013, Proceedings
Pages131-142
Number of pages12
Publication statusPublished - 2013
Event18th Scandinavian Conference on Image Analysis, SCIA 2013 - Espoo, Finland
Duration: 17 Jun 201320 Jun 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7944 LNCS
ISSN (Print)0302-9743
ISSN (electronic)1611-3349

Abstract

A Random Forest consists of several independent decision trees arranged in a forest. A majority vote over all trees leads to the final decision. In this paper we propose a Random Forest framework which incorporates a cascade structure consisting of several stages together with a bootstrap approach. By introducing the cascade, 99% of the test images can be rejected by the first and second stage with minimal computational effort leading to a massively speeded-up detection framework. Three different cascade voting strategies are implemented and evaluated. Additionally, the training and classification speed-up is analyzed. Several experiments on public available datasets for pedestrian detection, lateral car detection and unconstrained face detection demonstrate the benefit of our contribution.

ASJC Scopus subject areas

Cite this

Cascaded random forest for fast object detection. / Baumann, Florian; Ehlers, Arne; Vogt, Karsten et al.
Image Analysis: 18th Scandinavian Conference, SCIA 2013, Proceedings. 2013. p. 131-142 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7944 LNCS).

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Baumann, F, Ehlers, A, Vogt, K & Rosenhahn, B 2013, Cascaded random forest for fast object detection. in Image Analysis: 18th Scandinavian Conference, SCIA 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7944 LNCS, pp. 131-142, 18th Scandinavian Conference on Image Analysis, SCIA 2013, Espoo, Finland, 17 Jun 2013. https://doi.org/10.1007/978-3-642-38886-6_13
Baumann, F., Ehlers, A., Vogt, K., & Rosenhahn, B. (2013). Cascaded random forest for fast object detection. In Image Analysis: 18th Scandinavian Conference, SCIA 2013, Proceedings (pp. 131-142). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7944 LNCS). https://doi.org/10.1007/978-3-642-38886-6_13
Baumann F, Ehlers A, Vogt K, Rosenhahn B. Cascaded random forest for fast object detection. In Image Analysis: 18th Scandinavian Conference, SCIA 2013, Proceedings. 2013. p. 131-142. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-38886-6_13
Baumann, Florian ; Ehlers, Arne ; Vogt, Karsten et al. / Cascaded random forest for fast object detection. Image Analysis: 18th Scandinavian Conference, SCIA 2013, Proceedings. 2013. pp. 131-142 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Download
@inproceedings{9bc2bd7eef9941fea940cb108a13f00b,
title = "Cascaded random forest for fast object detection",
abstract = "A Random Forest consists of several independent decision trees arranged in a forest. A majority vote over all trees leads to the final decision. In this paper we propose a Random Forest framework which incorporates a cascade structure consisting of several stages together with a bootstrap approach. By introducing the cascade, 99% of the test images can be rejected by the first and second stage with minimal computational effort leading to a massively speeded-up detection framework. Three different cascade voting strategies are implemented and evaluated. Additionally, the training and classification speed-up is analyzed. Several experiments on public available datasets for pedestrian detection, lateral car detection and unconstrained face detection demonstrate the benefit of our contribution.",
author = "Florian Baumann and Arne Ehlers and Karsten Vogt and Bodo Rosenhahn",
note = "Funding information: This work has been partially funded by the ERC within the starting grant Dynamic MinVIP.; 18th Scandinavian Conference on Image Analysis, SCIA 2013 ; Conference date: 17-06-2013 Through 20-06-2013",
year = "2013",
doi = "10.1007/978-3-642-38886-6_13",
language = "English",
isbn = "9783642388859",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "131--142",
booktitle = "Image Analysis",

}

Download

TY - GEN

T1 - Cascaded random forest for fast object detection

AU - Baumann, Florian

AU - Ehlers, Arne

AU - Vogt, Karsten

AU - Rosenhahn, Bodo

N1 - Funding information: This work has been partially funded by the ERC within the starting grant Dynamic MinVIP.

PY - 2013

Y1 - 2013

N2 - A Random Forest consists of several independent decision trees arranged in a forest. A majority vote over all trees leads to the final decision. In this paper we propose a Random Forest framework which incorporates a cascade structure consisting of several stages together with a bootstrap approach. By introducing the cascade, 99% of the test images can be rejected by the first and second stage with minimal computational effort leading to a massively speeded-up detection framework. Three different cascade voting strategies are implemented and evaluated. Additionally, the training and classification speed-up is analyzed. Several experiments on public available datasets for pedestrian detection, lateral car detection and unconstrained face detection demonstrate the benefit of our contribution.

AB - A Random Forest consists of several independent decision trees arranged in a forest. A majority vote over all trees leads to the final decision. In this paper we propose a Random Forest framework which incorporates a cascade structure consisting of several stages together with a bootstrap approach. By introducing the cascade, 99% of the test images can be rejected by the first and second stage with minimal computational effort leading to a massively speeded-up detection framework. Three different cascade voting strategies are implemented and evaluated. Additionally, the training and classification speed-up is analyzed. Several experiments on public available datasets for pedestrian detection, lateral car detection and unconstrained face detection demonstrate the benefit of our contribution.

UR - http://www.scopus.com/inward/record.url?scp=84884498174&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-38886-6_13

DO - 10.1007/978-3-642-38886-6_13

M3 - Conference contribution

AN - SCOPUS:84884498174

SN - 9783642388859

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 131

EP - 142

BT - Image Analysis

T2 - 18th Scandinavian Conference on Image Analysis, SCIA 2013

Y2 - 17 June 2013 through 20 June 2013

ER -

By the same author(s)