• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.9
• /
• pp.1336-1339
• /
• 2012

In this paper, we focus on solving the classification problem by using semisupervised learning strategy. Traditional classifiers are constructed based on labeled data in supervised learning. Labeled data, however, are often difficult, expensive or time consuming to obtain, as they require the efforts of experienced human annotators. Unlabeled data are significantly easier to obtain without human efforts. Thus, we use AdaBoost algorithm with SVM-KNN classifier to apply semisupervised learning problem and improve the classifier performance. Experimental results on both artificial and UCI data sets show that the proposed methodology can reduce the error rate.

• Journal of Advanced Navigation Technology
• /
• v.17 no.2
• /
• pp.247-254
• /
• 2013

The task of 3D gesture recognition for controlling equipments is highly challenging due to the propagation of 3D smart TV recently. In this paper, the AdaBoost algorithm is applied to 3D gesture recognition by using Kinect sensor. By tracking time interval trajectory of hand, wrist and arm by Kinect, AdaBoost algorithm is used to train and classify 3D gesture. Experimental results demonstrate that the proposed method can successfully extract trained gestures from continuous hand, wrist and arm motion in real time.

• 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.

• 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.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.2
• /
• pp.143-148
• /
• 2012

This paper proposes a new method to improve performance of AdaBoost by using a distance weight function to increase the accuracy of its machine learning processes. The proposed distance weight algorithm improves classification in areas where the original binary classifier is weak. This paper derives the new algorithm's optimal solution, and it demonstrates how classifier accuracy can be improved using the proposed Distance Sensitive AdaBoost in a simulation experiment of pedestrian detection.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.1
• /
• pp.53-60
• /
• 2014

Redundant handovers cause degraded quality of service to passengers in vehicle. This paper proposes a handover scheme suitable for users traveling in vehicles, which enables continuous learning of the handover process using a discrete-time Markov chain (DTMC). Through AdaBoost machine learning algorithm, the proposed handover scheme avoids unnecessary handover trials when a short dwell time in a target cell is expected or when the target cell is an intermediate cell through which the vehicle quickly passes. Simulation results show that the proposed scheme reduces the number of handover occurrences and maintains adequate throughput.

• Journal of Cadastre & Land InformatiX
• /
• v.49 no.1
• /
• pp.65-84
• /
• 2019

This study attempted to predict citizens' emotions regarding mortgage rates using machine learning algorithms. To accomplish the research purpose, I reviewed the related literature and then set up two research questions. To find the answers to the research questions, I classified emotions according to Akman's classification and then predicted citizens' emotions on mortgage rates using six machine learning algorithms. The results showed that AdaBoost was the best classifier in all evaluation categories. However, the performance level of Naive Bayes was found to be lower than those of other classifiers. Also, this study conducted a ROC analysis to identify which classifier predicts each emotion category well. The results demonstrated that AdaBoost was the best predictor of the residents' emotions on home mortgage rates in all emotion categories. However, in the sadness class, the performance levels of the six algorithms used in this study were much lower than those in the other emotion categories.

• 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.

• Journal of Korea Multimedia Society
• /
• v.15 no.5
• /
• pp.606-614
• /
• 2012

Face detection using AdaBoost algorithm is one of the fastest and the most robust face detection algorithm so many improvements or extensions of this method have been proposed. However, almost all previous approaches deal with only frontal face and suffer from limited discriminant capability for inclined face because these methods apply the same features for both frontal and inclined face. Also conventional approaches for detecting inclined face which apply frontal face detecting method to inclined input image or make different detectors for each angle require heavy computational complexity and show low detection rate. In order to overcome this problem, a method for detecting inclined face using JointBoost is proposed in this paper. The computational and sample complexity is reduced by finding common features that can be shared across the classes. Simulation results show that the detection rate of the proposed method is at least 2% higher than that of the conventional AdaBoost method under the learning condition with the same iteration number. Also the proposed method not only detects the existence of a face but also gives information about the inclined direction of the detected face.