By Topic

Face detection using boosted tree classifier stages

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
C. Demirkir ; Elektron. Muhendisligi Bolumu, Istanbul, Turkey ; B. Sankur

A classifier structure is described to construct boosted tree classifier stages for detecting dynamic objects such as human faces. It is based on using simple and weak classifiers based on Haar-like features which are easily computed by integral image representation values (Viola, P. et al., IEEE CVPR, 2001) and putting these weak classifiers into the nodes of a binary tree structure by performing the AdaBoost algorithm. Each classifier stage consists of decision trees containing simple classifiers at their nodes. Each node classifier is constructed using only one simple feature and is divided into sub nodes if the decision tree error on the training set is greater than a predetermined threshold. This division process continues until the error is lower than the threshold and a maximum tree depth is not exceeded. By this approach, it is tried to obtain a faster convergence to a certain classifier performance value.

Published in:

Signal Processing and Communications Applications Conference, 2004. Proceedings of the IEEE 12th

Date of Conference:

28-30 April 2004