• Journal of Digital Convergence
• /
• v.11 no.2
• /
• pp.243-248
• /
• 2013

This paper proposes an effective method using Adaptive Boosting to track a person's head in complex background. By only one way to feature extraction methods are not sufficient for modeling a person's head. Therefore, the method proposed in this paper, several feature extraction methods for the accuracy of the detection head running at the same time. Feature Extraction for the imaging of the head was extracted using sub-region and Haar wavelet transform. Sub-region represents the local characteristics of the head, Haar wavelet transform can indicate the frequency characteristics of face. Therefore, if we use them to extract the features of face, effective modeling is possible. In the proposed method to track down the man's head from the input video in real time, we ues the results after learning Harr-wavelet characteristics of the three types using AdaBoosting algorithm. Originally the AdaBoosting algorithm, there is a very long learning time, if learning data was changes, and then it is need to be performed learning again. In order to overcome this shortcoming, in this research propose efficient method using cascade AdaBoosting. This method reduces the learning time for the imaging of the head, and can respond effectively to changes in the learning data. The proposed method generated classifier with excellent performance using less learning time and learning data. In addition, this method accurately detect and track head of person from a variety of head data in real-time video images.

• East Asian Economic Review
• /
• v.25 no.4
• /
• pp.403-424
• /
• 2021

AdaBoost tweaks the sample weight for each training set used in the iterative process, however, it is demonstrated that it provides more correlated errors as the boosting iteration proceeds if models' accuracy is high enough. Therefore, in this study, we propose a novel way to improve the performance of the existing AdaBoost algorithm by employing heterogeneous models and a stochastic twist. By employing the heterogeneous ensemble, it ensures different models that have a different initial assumption about the data are used to improve on diversity. Also, by using a stochastic algorithm with a decaying convergence rate, the model is designed to balance out the trade-off between model prediction performance and model convergence. The result showed that the stochastic algorithm with decaying convergence rate's did have a improving effect and outperformed other existing boosting techniques.

• The Korean Journal of Applied Statistics
• /
• v.23 no.1
• /
• pp.197-206
• /
• 2010

In this paper, we propose boosting algorithms when data are very large or coming in batches sequentially over time. In this situation, ordinary boosting algorithm may be inappropriate because it requires the availability of all of the training set at once. To apply to large scale data or data batch stream, we modify the AdaBoost and Arc-x4. These algorithms have good results for both large scale data and data batch stream with or without concept drift on simulated data and real data sets.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.3E
• /
• pp.124-132
• /
• 2003

We propose a new method for speech/non-speech classifiers based on concepts of the adaptive boosting (AdaBoost) algorithm in order to detect speech for robust speech recognition. The method uses a combination of simple base classifiers through the AdaBoost algorithm and a set of optimized speech features combined with spectral subtraction. The key benefits of this method are the simple implementation, low computational complexity and the avoidance of the over-fitting problem. We checked the validity of the method by comparing its performance with the speech/non-speech classifier used in a standard voice activity detector. For speech recognition purpose, additional performance improvements were achieved by the adoption of new features including speech band energies and MFCC-based spectral distortion. For the same false alarm rate, the method reduced 20-50% of miss errors.

• Journal of Korea Multimedia Society
• /
• v.9 no.10
• /
• pp.1266-1275
• /
• 2006

In this paper, we propose a real-lime face detection and tracking algorithm using AdaBoost(Adaptive Boosting) algorithm. The proposed algorithm consists of two levels such as the face detection and the face tracking. First, the face detection used the eight-wavelet feature models which ate very simple. Each feature model applied to variable size and position, and then create initial feature set. The intial feature set and the training images which were consisted of face images, non-face images used the AdaBoost algorithm. The basic principal of the AdaBoost algorithm is to create final strong classifier joining linearly weak classifiers. In the training of the AdaBoost algorithm, we propose SAT(Summed-Area Table) method. Face tracking becomes accomplished at real-time using the position information and the size information of detected face, and it is extended view region dynamically using the fan-Tilt camera. We are setting to move center of the detected face to center of the Image. The experiment results were amply satisfied with the computational efficiency and the detection rates. In real-time application using Pan-Tilt camera, the detecter runs at about 12 frames per second.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.545-550
• /
• 2013

In pattern recognition field, data classification is an essential process for extracting meaningful information from data. Adaptive boosting algorithm, known as AdaBoost algorithm, is a kind of improved boosting algorithm for applying to real data analysis. It consists of weak classifiers, such as random guessing or random forest, which performance is slightly more than 50% and weights for combining the classifiers. And a strong classifier is created with the weak classifiers and the weights. In this paper, a research is performed using AdaBoost algorithm for detecting chaff echo which has similar characteristics to precipitation echo and interrupts weather forecasting. The entire process for implementing chaff echo classifier starts spatial and temporal clustering based on similarity with weather radar data. With them, learning data set is prepared that separated chaff echo and non-chaff echo, and the AdaBoost classifier is generated as a result. For verifying the classifier, actual chaff echo appearance case is applied, and it is confirmed that the classifier can distinguish chaff echo efficiently.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.4
• /
• pp.999-1012
• /
• 2005

We compare two popular algorithms in current machine learning and statistical learning areas, boosting method represented by AdaBoost and kernel based SVM (Support Vector Machine) using 13 real data sets. This comparative study shows that boosting method has smaller prediction error in data with heavy noise, whereas SVM has smaller prediction error in the data with little noise.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.1
• /
• pp.17-21
• /
• 2016

This paper investigates the importance of the computational overhead when machine learning methods, such as SVM, LASSO, AdaBoosting and AdaBagging, are used for automatic security classification.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.966-978
• /
• 2002

There are two important problems in improving text classification systems based on machine learning approach. The first one, called "selection problem", is how to select a minimum number of informative documents from a given document collection. The second one, called "composition problem", is how to reorganize selected training documents so that they can fit an adopted learning method. The former problem is addressed in "active learning" algorithms, and the latter is discussed in "boosting" algorithms. This paper proposes a new learning method, called AdaBUS, which proactively solves the above problems in the context of Naive Bayes classification systems. The proposed method constructs more accurate classification hypothesis by increasing the valiance in "weak" hypotheses that determine the final classification hypothesis. Consequently, the proposed algorithm yields perturbation effect makes the boosting algorithm work properly. Through the empirical experiment using the Routers-21578 document collection, we show that the AdaBUS algorithm more significantly improves the Naive Bayes-based classification system than other conventional learning methodson system than other conventional learning methods

• Communications for Statistical Applications and Methods
• /
• v.13 no.2
• /
• pp.449-466
• /
• 2006

We propose to use variable selection methods based on penalized regression for pruning decision tree ensembles. Pruning methods based on LASSO and SCAD are compared with the cluster pruning method. Comparative studies are performed on some artificial datasets and real datasets. According to the results of comparative studies, the proposed methods based on penalized regression reduce the size of boosting ensembles without decreasing accuracy significantly and have better performance than the cluster pruning method. In terms of classification noise, the proposed pruning methods can mitigate the weakness of AdaBoost to some degree.