• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.6
• /
• pp.486-491
• /
• 2013

This paper proposes a fast and efficient Haar-like feature selection algorithm for training classifier used in object detection. Many features selected by Haar-like feature selection algorithm and existing AdaBoost algorithm are either similar in shape or overlapping due to considering only feature's error rate. The proposed algorithm calculates similarity of features by their shape and distance between features. Fast and efficient feature selection is made possible by removing selected features and features with high similarity from feature set. FERET face database is used to compare performance of classifiers trained by previous algorithm and proposed algorithm. Experimental results show improved performance comparing classifier trained by proposed method to classifier trained by previous method. When classifier is trained to show same performance, proposed method shows 20% reduction of features used in classification.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.3
• /
• pp.18-29
• /
• 2012

Viola-Jones algorithm, a very effective real-time object detection method, uses Haar-like features to constitute weak classifiers. A Haar-like feature is made up of at least two rectangles each of which corresponds to either positive or negative areas and the feature value is computed by subtracting the sum of pixel values in the negative area from that of pixel values in the positive area. Compared to the conventional Haar-like feature which is made up of more than one rectangle, in this paper, we present a couple of new rectangular features whose feature values are computed either by the sum or by the variance of pixel values in a rectangle. By the use of these rectangular features in combination with the conventional Haar-like features, we can select additional features which have been excluded in the conventional Viola-Jones algorithm where every features are the combination of contiguous bright and dark areas of an object. In doing so, we can enhance the performance of object detection without any computational overhead.

• Journal of the Korea Convergence Society
• /
• v.10 no.6
• /
• pp.7-14
• /
• 2019

In this paper, we propose a Cascade Classifier face detection method using the Haar-like feature, which is complemented by the Flood Fill algorithm for lossy areas due to illumination and shadow in YCbCr color space extraction. The Cascade Classifier using Haar-like features can generate noise and loss regions due to lighting, shadow, etc. because skin color extraction using existing YCbCr color space in image only uses threshold value. In order to solve this problem, noise is removed by erosion and expansion calculation, and the loss region is estimated by using the Flood Fill algorithm to estimate the loss region. A threshold value of the YCbCr color space was further allowed for the estimated area. For the remaining loss area, the color was filled in as the average value of the additional allowed areas among the areas estimated above. We extracted faces using Haar-like Cascade Classifier. The accuracy of the proposed method is improved by about 4% and the detection rate of the proposed method is improved by about 2% than that of the Haar-like Cascade Classifier by using only the YCbCr color space.

• Journal of Broadcast Engineering
• /
• v.13 no.6
• /
• pp.875-882
• /
• 2008

Ear detection in an image processing is the one of the important area in biometrics. In this paper we propose a human ear detection algorithm with side face images. First, we search a face candidate area in an input image by using skin-color model and try to find an ear area based on Haar-like feature. Then, to verity whether it is the ear area or not, we use the template which is excellent object classification compare to recognize the characters in the plate. In this experiment, the proposed method showed that the processing speed is improved by 60% than previous works and the detection success rate is 92%.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.29-36
• /
• 2015

In this paper, we propose the horizontal line detection using the Haar-like features and linear regression in infrared images. In the marine environment horizon image is very useful information on a variety of systems. In the proposed method Haar-like features it was noted that the standard deviation be calculated in real time on a static area. Based on the pixel position, calculating the standard deviation of the around area in real time and, if the reaction is to filter out the largest pixel can get the energy map of the area containing the straight horizontal line. In order to select a horizontal line of pixels from the energy map, we applied the linear regression, calculating a linear fit to the transverse horizontal line across the image to select the candidate optimal horizontal. The proposed method was carried out in a horizontal line detecting real infrared image experiment for day and night, it was confirmed the excellent detection results than the legacy methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.372-373
• /
• 2011

인터넷 매체가 급증함에 따라 많은 이들에게 쉽게 노출 되어 유포되고 있는 유해 영상을 검출하기 위해 다양한 분류 방법에 대한 연구들이 이루어지고 있다. 본 논문에서 유해 영상 내의 피부색 영역에서의 Haar-like 특징을 추출하여 유해 영상을 분류하는 방법을 제안한다. 이를 위해, 첫 번째 단계에는 샘플 영상에 대하여 기존에 제안된 피부색 검출 방법을 적용하고, 두 번째 단계에는 검출된 피부색 영역 내의 Haar-like 특징을 추출한다. 각 샘플 영상에서 추출한 특징들은 SVM(Support Vector Machine)을 이용하여 각각 2000 장의 유해, 무해 영상을 학습한다. 학습된 모델은 유해 및 무해 영상이 혼합되어 있는 영상 집합들을 분류하는데 사용한다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.113-121
• /
• 2005

Face detection in real-time video constitutes one of the major trend in face recognition. In this paper, we propose a face detection algorithm using the skin color and Haar-like feature in real-time video. The proposed algorithm is followed by three sequences; First, moving objects are detected by difference-method in YCbCr coordinates, and then by using Haar-like features, face candidate regions of the moving objects is selected. Finally we extract the most possible face candidates by comparing the pixel values of face candidates with the skin color. In order to prevent a mistake. we use similar features or skin color to detect a face by selecting a adaptive ROI and improve the processing speed in real-time video. The computer simulation shows the validity of the proposed method that the processing speed is improved by 30% than previous works and the detection success rate is 96.8%.

• Journal of Digital Convergence
• /
• v.11 no.9
• /
• pp.311-318
• /
• 2013

For face detection techniques, the correctness of detection decreases with different lightings and backgrounds so such requires new methods and techniques. This study has aimed to obtain data for reasoning human emotional information by analyzing the components of the eyes and mouth that are critical in expressing emotions. To do this, existing problems in detecting face are addressed and a detection method that has a high detection rate and fast processing speed good at detecting environmental elements is proposed. This method must detect a specific part (eyes and a mouth) by using Haar-like Feature technique with the application of an integral image. After which, binaries detect elements based on color information, dividing the face zone and skin zone. To generate correct shape, the shape of detected elements is generated by using a bezier curve-a curve generation algorithm. To evaluate the performance of the proposed method, an experiment was conducted by using data in the Face Recognition Homepage. The result showed that Haar-like technique and bezier curve method were able to detect face elements more elaborately.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.113-127
• /
• 2012

Face detection methods using image processing have been proposed in many different ways. Generally, the most widely used method for face detection is an Adaboost that is proposed by Viola and Jones. This method uses Haar-like feature for image learning, and the detection performance depends on the learned images. It is well performed to detect face images within a certain distance range, but if the image is far away from the camera, face images become so small that may not detect them with the pre-learned Haar-like feature of the face image. In this paper, we propose the far distance face detection method that combine the Aadaboost of Viola-Jones with a saliency map and user's attention information. Saliency Map is used to select the candidate face images in the input image, face images are finally detected among the candidated regions using the Adaboost with Haar-like feature learned in advance. And the user's eye-tracking information is used to select the interest regions. When a subject is so far away from the camera that it is difficult to detect the face image, we expand the small eye gaze spot region using linear interpolation method and reuse that as input image and can increase the face image detection performance. We confirmed the proposed model has better results than the conventional Adaboost in terms of face image detection performance and computational time.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.8
• /
• pp.1129-1135
• /
• 2013

A new vehicle detection algorithm based on the multiple optimal Adaboost classifiers with optimal feature selection is proposed. It consists of two major modules: 1) Theoretical DDISF(Distance Dependent Image Scaling Factor) based image scaling by site modeling of the installed cameras. and 2) optimal features selection by Haar-like feature analysis depending on the distance of the vehicles. The experimental results of the proposed algorithm shows improved recognition rate compare to the previous methods for vehicles and non-vehicles. The proposed algorithm shows about 96.43% detection rate and about 3.77% false alarm rate. These are 3.69% and 1.28% improvement compared to the standard Adaboost algorithmt.