Active learned multi-view face detection tree using fuzzy cluster validity analysis

Authors:
Chunna Tian;Xinbo Gao;Jie Li
Affiliations:
School of Electronic Engineering, Xidian University, Xi'an, China;School of Electronic Engineering, Xidian University, Xi'an, China;School of Electronic Engineering, Xidian University, Xi'an, China
Venue:
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Year:
2006

Citing 6
Cited 0

Example-Based Learning for View-Based Human Face Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
Detecting Faces in Images: A Survey

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition with Fuzzy Objective Function Algorithms

Pattern Recognition with Fuzzy Objective Function Algorithms
FloatBoost Learning and Statistical Face Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
A detector tree of boosted classifiers for real-time object detection and tracking

ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1
Unsupervised video-shot segmentation and model-free anchorperson detection for news video story parsing

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

An active learned face detection tree based on FloatBoost method is proposed to accommodate the in-class variability of multi-view faces. To handle the computation resource constraints to the size of training example set, an embedded Bootstrap example selection algorithm is proposed, which leads to a more effective predictor. The tree splitting procedure is realized through dividing face training examples into the optimal sub-clusters using the fuzzy c-means algorithm together with a new cluster validity function based on the modified partition fuzzy degree. Then each sub-cluster of face examples is conquered with the FloatBoost learning to construct branches in the node of the detection tree. During training, the proposed algorithm is much faster than the original detection tree. The experimental results illustrate that the proposed detection tree is more efficient than the original one while keeping its detection speed. And the E-Bootstrap strategy outperforms the Bootstrap one in selecting relevant examples.