A Binary Decision Tree Implementation of a Boosted Strong Classifier

@inproceedings{Zhou2005ABD,
  title={A Binary Decision Tree Implementation of a Boosted Strong Classifier},
  author={Shaohua Kevin Zhou},
  booktitle={AMFG},
  year={2005}
}
Viola and Jones [1] proposed the influential rapid object detection algorithm. They used AdaBoost to select from a large pool a set of simple features and constructed a strong classifier of the form{j αjhj(x) ≥ θ} where eachhj(x) is a binary weak classifier based on a simple feature. In this paper, we construct, using statistical detection theory, a binary decision tree from the strong classifier of the above form. Each node of the decision tree is just a weak classifier and the knowledge of… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-6 OF 6 CITATIONS

Multiple Classifier Boosting and Tree-Structured Classifiers

  • Machine Learning for Computer Vision
  • 2013
VIEW 6 EXCERPTS
CITES METHODS, RESULTS & BACKGROUND
HIGHLY INFLUENCED

Making a Shallow Network Deep: Conversion of a Boosting Classifier into a Decision Tree by Boolean Optimisation

  • International Journal of Computer Vision
  • 2011
VIEW 6 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

A new ensemble learning with support vector machines

  • 2010 International Conference on Computer and Information Application
  • 2010
VIEW 1 EXCERPT
CITES BACKGROUND

Fast Human Detection Using a Novel Boosted Cascading Structure With Meta Stages

  • IEEE Transactions on Image Processing
  • 2008
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…