Skip to Main Content
The weak classifier of AdaBoost algorithm is a central classification element that uses a single criterion separating positive and negative learning candidates. Finding the best criterion to separate two feature distributions influences learning capacity of the algorithm. A common way to classify the distributions is to use the mean value of the features. However, positive and negative distributions of Haar-like feature as an image descriptor are hard to classify by a single threshold. The poor classification ability of the single threshold also increases the number of boosting operations, and finally results in a poor classifier. This paper propose the probability AdaBoost Algorithm that is made the Gaussian probability distribution of feature value and evaluate the probability value as how to close the mean of the Gaussian probability distribution. In the learning procedure, the weak classifier is selected by the evaluation that is how positive distribution to become independent negative distribution and how positive distribution to close. The weight is updated to exponential dasia0psila or dasia1psila in conventional AdaBoost but the proposal method is updated to exponential the real value between dasia0psila and dasia1psila by the Gaussian distribution. Hence, the selection of weak classifier is reflected more preciously to weight update. It is no specific threshold to study the proposed method using the Gaussian probability distribution of positive feature value. It is learned by 2 distribution of positive and negative date; therefore, The modeling for to classify the positive is more natural. and we prove more previously detection in experiment.