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

Similar Papers

Loading similar papers…