• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1705-1720
• /
• 2013

Human face gender recognition requires fast image processing with high accuracy. Existing face gender recognition methods used traditional local features and machine learning methods have shortcomings of low accuracy or slow speed. In this paper, a new framework for face gender recognition to reach fast face gender recognition is proposed, which is based on Local Ternary Pattern (LTP) and Extreme Learning Machine (ELM). LTP is a generalization of Local Binary Pattern (LBP) that is in the presence of monotonic illumination variations on a face image, and has high discriminative power for texture classification. It is also more discriminate and less sensitive to noise in uniform regions. On the other hand, ELM is a new learning algorithm for generalizing single hidden layer feed forward networks without tuning parameters. The main advantages of ELM are the less stringent optimization constraints, faster operations, easy implementation, and usually improved generalization performance. The experimental results on public databases show that, in comparisons with existing algorithms, the proposed method has higher precision and better generalization performance at extremely fast learning speed.

• Journal of Information Processing Systems
• /
• v.16 no.5
• /
• pp.1083-1094
• /
• 2020

Recognizing plant species based on leaf images is challenging because of the large inter-class variation and inter-class similarities among different plant species. The effective extraction of leaf descriptors constitutes the most important problem in plant leaf recognition. In this paper, a multi-scale angular description method is proposed for fast and accurate leaf recognition and retrieval tasks. The proposed method uses a novel scale-generation rule to develop an angular description of leaf contours. It is parameter-free and can capture leaf features from coarse to fine at multiple scales. A fast Fourier transform is used to make the descriptor compact and is effective in matching samples. Both support vector machine and k-nearest neighbors are used to classify leaves. Leaf recognition and retrieval experiments were conducted on three challenging datasets, namely Swedish leaf, Flavia leaf, and ImageCLEF2012 leaf. The results are evaluated with the widely used standard metrics and compared with several state-of-the-art methods. The results and comparisons show that the proposed method not only requires a low computational time, but also achieves good recognition and retrieval accuracies on challenging datasets.

• Journal of Advanced Information Technology and Convergence
• /
• v.10 no.1
• /
• pp.71-83
• /
• 2020

In this paper, we propose a system that can detect the shape of a hand at high speed using an FPGA. The hand-shape detection system is designed using Verilog HDL, a hardware language that can process in parallel instead of sequentially running C++ because real-time processing is important. There are several methods for hand gesture recognition, but the image processing method is used. Since the human eye is sensitive to brightness, the YCbCr color model was selected among various color expression methods to obtain a result that is less affected by lighting. For the CbCr elements, only the components corresponding to the skin color are filtered out from the input image by utilizing the restriction conditions. In order to increase the speed of object recognition, a median filter that removes noise present in the input image is used, and this filter is designed to allow comparison of values and extraction of intermediate values at the same time to reduce the amount of computation. For parallel processing, it is designed to locate the centerline of the hand during scanning and sorting the stored data. The line with the highest count is selected as the center line of the hand, and the size of the hand is determined based on the count, and the hand and arm parts are separated. The designed hardware circuit satisfied the target operating frequency and the number of gates.

• Journal of the Semiconductor & Display Technology
• /
• v.11 no.4
• /
• pp.49-55
• /
• 2012

This paper proposes an efficient method of object identification and localization for image recognition. The new proposed algorithm utilizes correlogram back-projection in the YCbCr chromaticity components to handle the problem of sub-region querying. Utilizing similar spatial color information enables users to detect and locate primary location and candidate regions accurately, without the need for additional information about the number of objects. Comparing this proposed algorithm to existing methods, experimental results show that improvement of 21% was observed. These results reveal that color correlogram is markedly more effective than color histogram for this task. Main contribution of this paper is that a different way of treating color spaces and a histogram measure, which involves information on spatial color, are applied in object localization. This approach opens up new opportunities for object detection for the use in the area of interactive image and 2-D based augmented reality.

• Journal of Information Processing Systems
• /
• v.9 no.1
• /
• pp.173-188
• /
• 2013

In Facial Expression Recognition Systems (FERS), only particular regions of the face are utilized for discrimination. The areas of the eyes, eyebrows, nose, and mouth are the most important features in any FERS. Applying facial features descriptors such as the local binary pattern (LBP) on such areas results in an effective and efficient FERS. In this paper, we propose an automatic facial expression recognition system. Unlike other systems, it detects and extracts the informative and discriminant regions of the face (i.e., eyes, nose, and mouth areas) using Haar-feature based cascade classifiers and these region-based features are stored into separate image files as a preprocessing step. Then, LBP is applied to these image files for facial texture representation and a feature-vector per subject is obtained by concatenating the resulting LBP histograms of the decomposed region-based features. The one-vs.-rest SVM, which is a popular multi-classification method, is employed with the Radial Basis Function (RBF) for facial expression classification. Experimental results show that this approach yields good performance for both frontal and near-frontal facial images in terms of accuracy and time complexity. Cohn-Kanade and JAFFE, which are benchmark facial expression datasets, are used to evaluate this approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.141-144
• /
• 1996

This study deals with the problem of the recognition of the preceding vehicles by image processing. The purpose of this study is the development of the equipment to prevent a collision with preceding vehicles during driving the vehicle. In order to decrease the processing time and increase reliability, at first, the traffic lane is extracted. It is determined by detecting road edges and calculating their tangent. After the traffic lane is gotten, the position of the vehicle is searched inside the lane. The features used to detect the vehicles in the algorithm are shadow of the vehicle, vertical edges, horizontal edges, and symmetrical segment. The preceding vehicles are extracted successfully by this method.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.6
• /
• pp.1139-1145
• /
• 2014

User recognition technology, which identifies or verifies a certain individual is absolutely essential under robotic environments for intelligent services. The conventional face recognition algorithm using single distance face image as training images has a problem that face recognition rate decreases as distance increases. The face recognition algorithm using face images by actual distance as training images shows good performance but this has a problem that it requires user cooperation. This paper proposes the LDA-based long distance face recognition method which uses multiple distance face images from a zoom camera for training face images. The proposed face recognition technique generated better performance by average 7.8% than the technique using the existing single distance face image as training. Compared with the technique that used face images by distance as training, the performance fell average 8.0%. However, the proposed method has a strength that it spends less time and requires less cooperation to users when taking face images.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.4
• /
• pp.1657-1662
• /
• 2017

Facial expression recognition systems using video devices have emerged as an important component of natural human-machine interfaces which contribute to various practical applications such as security systems, behavioral science and clinical practices. In this work, we present a new method to analyze, represent and recognize human facial expressions using a sequence of facial images. Under our proposed facial expression recognition framework, the overall procedure includes: accurate face detection to remove background and noise effects from the raw image sequences and align each image using vertex mask generation. Furthermore, these features are reduced by principal component analysis. Finally, these augmented features are trained and tested using Hidden Markov Model (HMM). The experimental evaluation demonstrated the proposed approach over two public datasets such as Cohn-Kanade and AT&T datasets of facial expression videos that achieved expression recognition results as 96.75% and 96.92%. Besides, the recognition results show the superiority of the proposed approach over the state of the art methods.

• The Journal of Korea Robotics Society
• /
• v.3 no.1
• /
• pp.33-41
• /
• 2008

Based on object recognition technology, we present a new global localization method for robot navigation. For doing this, we model any indoor environment using the following visual cues with a stereo camera; view-based image features for object recognition and those 3D positions for object pose estimation. Also, we use the depth information at the horizontal centerline in image where optical axis passes through, which is similar to the data of the 2D laser range finder. Therefore, we can build a hybrid local node for a topological map that is composed of an indoor environment metric map and an object location map. Based on such modeling, we suggest a coarse-to-fine strategy for estimating the global localization of a mobile robot. The coarse pose is obtained by means of object recognition and SVD based least-squares fitting, and then its refined pose is estimated with a particle filtering algorithm. With real experiments, we show that the proposed method can be an effective vision- based global localization algorithm.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.6
• /
• pp.609-616
• /
• 2017

In this paper, we propose an algorithm to obtain more stable and high recognition rate by using left and right rotation information of input image in order to obtain a stable recognition rate in face recognition. The proposed algorithm uses the facial image as the input information in the web camera environment to reduce the size of the image and normalize the information about the brightness and color to obtain the improved recognition rate. We apply Principal Component Analysis (PCA) to the detected candidate regions to obtain feature vectors and classify faces. Also, In order to reduce the error rate range of the recognition rate, a set of data with the left and right $45^{\circ}$ rotation information is constructed considering the directionality of the input face image, and each feature vector is obtained with PCA. In order to obtain a stable recognition rate with the obtained feature vector, it is after scattered in the eigenspace and the final face is recognized by comparing euclidean distant distances to each feature. The PCA-based feature vector is low-dimensional data, but there is no problem in expressing the face, and the recognition speed can be fast because of the small amount of calculation. The method proposed in this paper can improve the safety and accuracy of recognition and recognition rate faster than other algorithms, and can be used for real-time recognition system.