• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1686-1694
• /
• 2014

In this paper, a new scheme to recognize a finger shape in the depth image captured by Kinect is proposed. Rigid transformation of an input finger shape is pre-processed for its robustness against the shape angle of input fingers. After extracting contour map from hand region, observing the change of contour pixel location is performed to calculate rotational compensation angle. For the finger shape recognition, we first acquire three pixel points, the most left, right, and top located pixel points. In the proposed algorithm, we first acquire three pixel points, the most left, right, and top located pixel points for the finger shape recognition, also we use geometrical features of human fingers such as Euclidean distance, the angle of the finger and the pixel area of hand region between each pixel points to recognize the finger shape. Through experimental results, we show that the proposed algorithm performs better than old schemes.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.3
• /
• pp.197-201
• /
• 2011

The use of gestures provides an attractive alternate to cumbersome interfaces for human-computer devices interaction. This has motivated a very active research area concerned with computer vision-based recognition of hand gestures. The most important issues in hand gesture recognition is to recognize the directivity of finger. The primitive elements extracted to a hand gesture include in very important information on the directivity of finger. In this paper, we propose the recognition algorithm of finger directivity by using the cross points of circle and sub-primitive element. The radius of circle is increased from minimum radius including main-primitive element to it including sub-primitive elements. Through the experiment, we demonstrated the efficiency of proposed algorithm.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.17-20
• /
• 2000

This paper describes a shape-based object recognition algorithm using multiple distance images. For the images containing dense edge points and noise, previous Hausdorff distance (HD) measures yield a high ms error for object position and many false matchings for recognition. Extended version of HD measure considering edge position and orientation simultaneously is proposed for accurate matching. Multiple distance images are used to calculate proposed matching measure efficiently. Results are presented for visual images and infrared images.

• Journal of Biomedical Engineering Research
• /
• v.20 no.1
• /
• pp.59-68
• /
• 1999

In this paper, we propose an algorithm to locate the corpus callosum automatically from midsagittal brain MR images using the statistical characteristics and shape information of the corpus callosum. In the proposed algorithm, we first extract regions satisfying the statistical characteristics of the corpus callosum and then find a region matching the shape information. In order to match the shape information, a new directed window region-growing algorithm is proposed instead of using conventional contour matching algorithms. Using the proposed algorithm, we adaptively relax the statistical requirement until we find a region matching the shape information. Experiments show promising results.

• The Journal of Korea Robotics Society
• /
• v.8 no.4
• /
• pp.266-272
• /
• 2013

Facial feature extraction and tracking are essential steps in human-robot-interaction (HRI) field such as face recognition, gaze estimation, and emotion recognition. Active shape model (ASM) is one of the successful generative models that extract the facial features. However, applying only ASM is not adequate for modeling a face in actual applications, because positions of facial features are unstably extracted due to limitation of the number of iterations in the ASM fitting algorithm. The unaccurate positions of facial features decrease the performance of the emotion recognition. In this paper, we propose real-time facial feature extraction and tracking framework using ASM and LK optical flow for emotion recognition. LK optical flow is desirable to estimate time-varying geometric parameters in sequential face images. In addition, we introduce a straightforward method to avoid tracking failure caused by partial occlusions that can be a serious problem for tracking based algorithm. Emotion recognition experiments with k-NN and SVM classifier shows over 95% classification accuracy for three emotions: "joy", "anger", and "disgust".

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.228-246
• /
• 2011

A 3D model based approach for a face representation and recognition algorithm has been investigated as a robust solution for pose and illumination variation. Since a generative 3D face model consists of a large number of vertices, a 3D model based face recognition system is generally inefficient in computation time and complexity. In this paper, we propose a novel 3D face representation algorithm based on a pixel to vertex map (PVM) to optimize the number of vertices. We explore shape and texture coefficient vectors of the 3D model by fitting it to an input face using inverse compositional image alignment (ICIA) to evaluate face recognition performance. Experimental results show that the proposed face representation and recognition algorithm is efficient in computation time while maintaining reasonable accuracy.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.427-430
• /
• 1995

This paper proposes a new image processing algorithm to recognize korean documents. It take out the region of syllable area from input character image, then it makes recognition of a consonant and a vowel in the character. A precision segmentation is very important to recognize the input character. The input image has 8-bit gray scaled resolution. Not only the shape but also vertical and horizontal lines dispersion graph are used for segmentation. Theresult shows a higher accuracy of character segmentation.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.10
• /
• pp.63-71
• /
• 1996

This paper proposes a method which analyzes facial shape and extracts positions of eyes regardless of the tilt and the size of input iamge. With the extracted feature parameters of facial element by the method, full human faces are recognized by a neural network which BP algorithm is applied on. Input image is changed into binary codes, and then labelled. Area, circumference, and circular degree of the labelled binary image are obtained by using chain code and defined as feature parameters of face image. We first extract two eyes from the similarity and distance of feature parameter of each facial element, and then input face image is corrected by standardizing on two extracted eyes. After a mask is genrated line historgram is applied to finding the feature points of facial elements. Distances and angles between the feature points are used as parameters to recognize full face. To show the validity learning algorithm. We confirmed that the proposed algorithm shows 100% recognition rate on both learned and non-learned data for 20 persons.

• Transactions on Electrical and Electronic Materials
• /
• v.17 no.6
• /
• pp.363-368
• /
• 2016

Rectangular shape detection plays an important role in many image recognition systems. However, it requires continued research for its improved performance. In this study, we propose a strong rectangular shape detection algorithm, which combines the canny edge and line detection algorithms based on the perpendicularity and parallelism of a rectangle. First, we use the canny edge detection algorithm in order to obtain an image edge map. We then find the edge of the contour by using the connected component and find each edge contour from the edge map by using a DP (douglas-peucker) algorithm, and convert the contour into a polyline segment by using a DP algorithm. Each of the segments is compared with each other to calculate parallelism, whether or not the segment intersects the perpendicularity intersecting corner necessary to detect the rectangular shape. Using the perpendicularity and the parallelism, the four best line segments are selected and whether a determined the rectangular shape about the combination. According to the result of the experiment, the proposed rectangular shape detection algorithm strongly showed the size, location, direction, and color of the various objects. In addition, the proposed algorithm is applied to the license plate detecting and it wants to show the strength of the results.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.6
• /
• pp.91-98
• /
• 2011

This paper proposes an efficient and accurate vision based recognition and tracking framework for texture free objects. We approached this problem with a two phased algorithm: detection phase and tracking phase. In the detection phase, the algorithm extracts shape context descriptors that used for classifying objects into predetermined interesting targets. Later on, the matching result is further refined by a minimization technique. In the tracking phase, we resorted to meanshift tracking algorithm based on Bhattacharyya coefficient measurement. In summary, the contributions of our methods for the underwater robot vision are four folds: 1) Our method can deal with camera motion and scale changes of objects in underwater environment; 2) It is inexpensive vision based recognition algorithm; 3) The advantage of shape based method compared to a distinct feature point based method (SIFT) in the underwater environment with possible turbidity variation; 4) We made a quantitative comparison of our method with a few other well-known methods. The result is quite promising for the map based underwater SLAM task which is the goal of our research.