Fast and Robust Face Detection Using Evolutionary Pruning

Cited 21 time in webofscience Cited 26 time in scopus
  • Hit : 467
  • Download : 577
Face detection task can be considered as a classifier training problem. Finding the parameters of the classifier model by using training data is a complex process. To solve such a complex problem, evolutionary algorithms can be employed in cascade structure of classifiers. This paper proposes evolutionary pruning to reduce the number of weak classifiers in AdaBoost-based cascade detector, while maintaining the detection accuracy. The computation time is proportional to the number of weak classifiers and, therefore, a reduction in the number of weak classifiers results in an increased detection speed. Three kinds of cascade structures are compared by the number of weak classifiers. The efficiency in computation time of the proposed cascade structure is shown experimentally. It is also compared with the state-of-the-art face detectors, and the results show that the proposed method outperforms the previous studies. A multiview face detector is constructed by incorporating the three face detectors: frontal, left profile, and right profile.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2008-10
Language
English
Article Type
Article
Keywords

IMAGES

Citation

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, v.12, pp.562 - 571

ISSN
1089-778X
DOI
10.1109/TEVC.2007.910140
URI
http://hdl.handle.net/10203/12317
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 21 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0