• ETRI Journal
• /
• v.32 no.5
• /
• pp.761-765
• /
• 2010

In this paper, we introduce an improved adaptive boosting (AdaBoost) classifier and its application, a disguised-face discriminator that discriminates between bare and disguised faces. The proposed classifier is based on an AdaBoost learning algorithm and regression technique. In the process, the lookup table of AdaBoost learning is utilized. The proposed method is verified on the captured images under several real environments. Experimental results and analysis show the proposed method has a higher and faster performance than other well-known methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.1020-1023
• /
• 2017

Viola와 Jones가 제안한 AdaBoost(Adaptive Boosting) 알고리즘은 기존의 물체 검출기에 비해 속도와 정확도 면에서 우수하여 실시간 물체 검출기로써 좋은 성능을 보인다. 하지만 여전히 많은 계산량 때문에 성능이 낮은 임베디드 환경에서는 실시간 검출에 대한 아쉬움이 있다. 본 논문에서는 계산량을 줄이기 위해 모션 검출을 통해 배경 영역을 제거하고 얼굴 영역을 추정한다. 제거된 배경 영역은 AdaBoost 알고리즘의 검출 과정에서 제외되며 추정된 얼굴 영역에 대해서만 검출을 하게 된다. 모션검출은 ${\Sigma}-{\Delta}$(Sigma-Delta) 배경 추정에 기반한 알고리즘을 사용한다.

• ETRI Journal
• /
• v.31 no.3
• /
• pp.282-291
• /
• 2009

An online mean-shift object tracking algorithm, which consists of a learning stage and an estimation stage, is proposed in this work. The learning stage selects the features for tracking, and the estimation stage composes a likelihood image and applies the mean shift algorithm to it to track an object. The tracking performance depends on the quality of the likelihood image. We propose two schemes to generate and integrate likelihood images: one based on the discrete AdaBoost (DAB) and the other based on the real AdaBoost (RAB). The DAB scheme uses tuned feature values, whereas RAB estimates class probabilities, to select the features and generate the likelihood images. Experiment results show that the proposed algorithm provides more accurate and reliable tracking results than the conventional mean shift tracking algorithms.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.2
• /
• pp.166-171
• /
• 2013

The method proposed in this paper can improve the performance of the Boosting algorithm in machine learning. The proposed Boundary AdaBoost algorithm can make up for the weak points of Normal binary classifier using threshold boundary concepts. The new proposed boundary can be located near the threshold of the binary classifier. The proposed algorithm improves classification in areas where Normal binary classifier is weak. Thus, the optimal boundary final classifier can decrease error rates classified with more reasonable features. Finally, this paper derives the new algorithm's optimal solution, and it demonstrates how classifier accuracy can be improved using the proposed Boundary AdaBoost in a simulation experiment of pedestrian detection using 10-fold cross validation.

• Journal of Intelligence and Information Systems
• /
• v.15 no.3
• /
• pp.1-15
• /
• 2009

In a classification problem, data imbalance occurs when the number of instances in one class greatly outnumbers the number of instances in the other class. Such data sets often cause a default classifier to be built due to skewed boundary and thus the reduction in the classification accuracy of such a classifier. This paper proposes a Geometric Mean-based Boosting (GM-Boost) to resolve the problem of data imbalance. Since GM-Boost introduces the notion of geometric mean, it can perform learning process considering both majority and minority sides, and reinforce the learning on misclassified data. An empirical study with bankruptcy prediction on Korea companies shows that GM-Boost has the higher classification accuracy than previous methods including Under-sampling, Over-Sampling, and AdaBoost, used in imbalanced data and robust learning performance regardless of the degree of data imbalance.

• Journal of KIISE:Software and Applications
• /
• v.29 no.4
• /
• pp.270-277
• /
• 2002

Text filtering is a task of deciding whether a document has relevance to a specified topic. As Internet and Web becomes wide-spread and the number of documents delivered by e-mail explosively grows the importance of text filtering increases as well. The aim of this paper is to improve the accuracy of text filtering systems by using machine learning techniques. We apply AdaBoost algorithms to the filtering task. An AdaBoost algorithm generates and combines a series of simple hypotheses. Each of the hypotheses decides the relevance of a document to a topic on the basis of whether or not the document includes a certain word. We begin with an existing AdaBoost algorithm which uses weak hypotheses with their output of 1 or -1. Then we extend the algorithm to use weak hypotheses with real-valued outputs which was proposed recently to improve error reduction rates and final filtering performance. Next, we attempt to achieve further improvement in the AdaBoost's performance by first setting weights randomly according to the continuous Poisson distribution, executing AdaBoost, repeating these steps several times, and then combining all the hypotheses learned. This has the effect of mitigating the ovefitting problem which may occur when learning from a small number of data. Experiments have been performed on the real document collections used in TREC-8, a well-established text retrieval contest. This dataset includes Financial Times articles from 1992 to 1994. The experimental results show that AdaBoost with real-valued hypotheses outperforms AdaBoost with binary-valued hypotheses, and that AdaBoost iterated with random weights further improves filtering accuracy. Comparison results of all the participants of the TREC-8 filtering task are also provided.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.214-214
• /
• 2004

• Steel and Composite Structures
• /
• v.46 no.2
• /
• pp.153-173
• /
• 2023

Rectangular concrete-filled steel tubular (RCFST) column, a type of concrete-filled steel tubular (CFST), is widely used in compression members of structures because of its advantages. This paper proposes a robust machine learning-based framework for predicting the ultimate compressive strength of RCFST columns under both concentric and eccentric loading. The gradient boosting neural network (GBNN), an efficient and up-to-date ML algorithm, is utilized for developing a predictive model in the proposed framework. A total of 890 experimental data of RCFST columns, which is categorized into two datasets of concentric and eccentric compression, is carefully collected to serve as training and testing purposes. The accuracy of the proposed model is demonstrated by comparing its performance with seven state-of-the-art machine learning methods including decision tree (DT), random forest (RF), support vector machines (SVM), deep learning (DL), adaptive boosting (AdaBoost), extreme gradient boosting (XGBoost), and categorical gradient boosting (CatBoost). Four available design codes, including the European (EC4), American concrete institute (ACI), American institute of steel construction (AISC), and Australian/New Zealand (AS/NZS) are refereed in another comparison. The results demonstrate that the proposed GBNN method is a robust and powerful approach to obtain the ultimate strength of RCFST columns.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.4
• /
• pp.263-269
• /
• 2016

The purpose of this study is to challenge a computational regression-type problem, that is handling large-size data, in which conventional metamodeling techniques often fail in a practical sense. To solve such problems, regression-type boosting, one of ensemble model techniques, together with bootstrapping-based re-sampling is a reasonable choice. This study suggests weight updates by the amount of the residual itself and a new error decision criterion which constructs an ensemble model of models selectively chosen by rejection limits. Through these ideas, we propose AdaBoost.RMU.R as a metamodeling technique suitable for handling large-size data. To assess the performance of the proposed method in comparison to some existing methods, we used 6 mathematical problems. For each problem, we computed the average and the standard deviation of residuals between real response values and predicted response values. Results revealed that the average and the standard deviation of AdaBoost.RMU.R were improved than those of other algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.403-406
• /
• 2009

In this paper, we propose a method for deciding permission from the ATM(Automated Teller Machine) using face detection. First, we extract skin areas and make candidate face images from an input image, and then detect a face using Adaboost(Adaptive Boosting) algorithm. Next, proposed method executes a template matching for making a decision on whether to wear accessories like sunglasses or a mask in detected face image. Finally, this method decides whether to permit ATM service using this result. Experimental results show that proposed method performed well at indoors ATM environment for detecting whether to wear accessories.