• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.231-234
• /
• 2001

This paper proposes a face recognition technique that effectively combines elastic graph matching (EGM) and Fisherface algorithm. EGM as one of dynamic lint architecture uses not only face-shape but also the gray information of image, and Fisherface algorithm as a class specific method is robust about variations such as lighting direction and facial expression. In the proposed face recognition adopting the above two methods, the linear projection per node of an image graph reduces dimensionality of labeled graph vector and provides a feature space to be used effectively for the classification. In comparison with a conventional method, the proposed approach could obtain satisfactory results in the perspectives of recognition rates and speeds. Especially, we could get maximum recognition rate of 99.3% by leaving-one-out method for the experiments with the Yale Face Databases.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.1
• /
• pp.43-50
• /
• 2016

This paper introduces an appearance-based facial expression recognition method using ASM landmarks which is used to acquire a detailed face region. In particular, EHMM-based algorithm and SVM classifier with histogram feature are employed to appearance-based facial expression recognition, and performance evaluation of proposed method was performed with CK and JAFFE facial expression database. In addition, performance comparison was achieved through comparison with distance-based face normalization method and a geometric feature-based facial expression approach which employed geometrical features of ASM landmarks and SVM algorithm. As a result, the proposed method using ASM-based face normalization showed performance improvements of 6.39% and 7.98% compared to previous distance-based face normalization method for CK database and JAFFE database, respectively. Also, the proposed method showed higher performance compared to geometric feature-based facial expression approach, and we confirmed an effectiveness of proposed method.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.4
• /
• pp.551-558
• /
• 1994

This paper proposes the algorithm of the feature extraction, making polyline- shape according to extracted points and similarity test on the object represented by contour. The control points which can make approximate curve are extracted as features of the object. Experiments show that this algorithm is a effective method for identification between different shapes.

• Proceedings of the KOSOMBE Conference
• /
• v.1998 no.11
• /
• pp.263-264
• /
• 1998

In this paper, we present the result of feature points recognition and classification of radial pulse by the shape of pulse wave. And we analyze radial pulse in frequency domain. The recognition algorithm use the method which runs in parallel with both the data of ECG and differential pulse simultaneously to recognize the feature points. Also fie specified 3-time elements of pulse wave as main parameters for diagnosis and measured them by execution of algorithm, then we classify the shape of radial pulse by existence and position of feature points. lastly we execute frequency analysis on the feature points and get the power spectrum of radial pulse.

• Journal of the Semiconductor & Display Technology
• /
• v.17 no.4
• /
• pp.105-108
• /
• 2018

Face Detection is an essential first step of the face recognition, and this is significant effects on face feature extraction and the effects of face recognition. Face detection has extensive research value and significance. In this paper, we present and analysis the principle, merits and demerits of the classic AdaBoost face detection and ASM algorithm based on point distribution model, which ASM solves the problems of face detection based on AdaBoost. First, the implemented scheme uses AdaBoost algorithm to detect original face from input images or video stream. Then, it uses ASM algorithm converges, which fit face region detected by AdaBoost to detect faces more accurately. Finally, it cuts out the specified size of the facial region on the basis of the positioning coordinates of eyes. The experimental result shows that the method can detect face rapidly and precisely, with a strong robustness.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.7
• /
• pp.1564-1572
• /
• 2011

In this paper, we propose a new histogram based hand recognition algorithm for augmented reality. Hand recognition system makes it possible a useful interaction between an user and computer. However, there is difficulty in vision-based hand gesture recognition with viewing angle dependency due to the complexity of human hand shape. A new hand recognition system proposed in this paper is based on the features from hand geometry. The proposed recognition system consists of two steps. In the first step, hand region is extracted from the image captured by a camera and then hand gestures are recognized in the second step. At first, we extract hand region by deleting background and using skin color information. Then we recognize hand shape by determining hand feature point using histogram of the obtained hand region. Finally, we design a augmented reality system by controlling a 3D object with the recognized hand gesture. Experimental results show that the proposed algorithm gives more than 91% accuracy for the hand recognition with less computational power.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.37-40
• /
• 2001

The most important issues in gesture recognition are the simplification of algorithm and the reduction of processing time. The mathematical morphology based on geometrical set theory is best used to perform the real-time processing. A key idea of the algorithm proposed in this paper is to apply morphological shape decomposition. The primitive elements extracted from a hand gesture have very important information including the directivity of the hand gestures. Based on this algorithm, we proposed the morphological hand-gesture recognition algorithm using feature vectors extracted from lines connecting the center points of a main-primitive element and sub-primitive elements. Through the experiments, we applied to the video contents browsing system with natural interactions and demonstrated the efficiency of this algorithm.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.213-215
• /
• 2009

Using the object recognition processing on the captured images, we can inspect whether a packaging process is performed correctly in real time. So we realized the functions that acquire an image of each state of the packaging process using a camera, extract each object in the image, and inspect the packaging process using the extracted object data. In case an object shape is solid, for object search, a shape-based matching algorithm was used which searches the object utilizing the informations on the shape. In case an object shape is not solid, and Is flexible, gray-level difference of the pixels in the limited image region including the object was used to recognize the object.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.3
• /
• pp.132-140
• /
• 1994

SCRIPT (Symbol/Character Recognition In Pen-based Technology) is an algorithm for on-line recognition of handwriting Hangeul. English upperacase letters, decimal digits, and some keyboard symbols. The shape of handwriting symbols has a large variation even when written by the same person. Though the feature analysis approach using a conventional decision tree is efficient, it is not robust under shape variations and prone to misclassification. Thus, a new method to overcome this shortcoming is necessary. In this paper, a feature analysis algorithm using two fuzzy decision trees which utilize the hierarchical property of the pattern is proposed. The first tree is used to represent the stroke shape, and the other tree is used to represent the relation between the strokes. since this method stores various possibilities. it is robust to shape variations and can readily modify false selections. In addition, there is a large increase in the recognition rate of high-level patterns due to low-level candidated. Experimental results show 91% recognition rate for Hangeul at the recognition speed of 0.33 second per character, and the recognition rate of alphanumerics and some keyboard symbols is 95% at 0.08 second per symbol. This is 8~18% increase in the recognition rate over th method not applying fuzzy decision trees.

• Journal of IKEEE
• /
• v.22 no.1
• /
• pp.46-52
• /
• 2018

The problem of traffic light detection and recognition has recently become one of the most important topics in various researches on autonomous driving. Most algorithms are based on colors to detect and recognize traffic light signals. These methods have disadvantage in that the recognition rate is lowered due to the change of the color of the traffic light, the influence of the angle, distance, and surrounding illumination environment of the image. In this paper, we propose machine learning based detection and recognition algorithm using shape information to solve these problems. Unlike the existing algorithms, the proposed algorithm detects and recognizes the traffic signals based on the morphological characteristics of the traffic lights, which is advantageous in that it is robust against the influence from the surrounding environments. Experimental results show that the recognition rate of the signal is higher than those of other color-based algorithms.