• Title/Summary/Keyword: Shape Recognition Algorithm

Search Result 233, Processing Time 0.029 seconds

Separation of Subpatern and Recognition of Hanguel Patterns by Analysis of Feature of Contacting Phonemes (자소 접촉특성 분석에 의한 한글패턴의 부분분리 및 인식)

  • Koh, Chan;Chin, Yong-Ohk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.7
    • /
    • pp.618-627
    • /
    • 1990
  • In this paper a new algorithm for separation of contacting subpattern and connective feature extraction of strokes is proposed. This algorithm is able to classification of the type of contacting parts, connective feature extreaction of strokes, separate the phoneme of contacting parts between strokes, classify the character types by feature classification of connecting parts and analysis of connecting attribute. Also, shape normalize into formal patterns and decide on the input pattern from position value of bending feature of this normalized shape and make an recognition experiment by neural network using BEP learining algorithm. This algorithm represents the good achievement ratio by separation of phoneme, classification of character type, connective feature extraction of stroke and recognition experiment.

  • PDF

ACMs-based Human Shape Extraction and Tracking System for Human Identification (개인 인증을 위한 활성 윤곽선 모델 기반의 사람 외형 추출 및 추적 시스템)

  • Park, Se-Hyun;Kwon, Kyung-Su;Kim, Eun-Yi;Kim, Hang-Joon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.12 no.5
    • /
    • pp.39-46
    • /
    • 2007
  • Research on human identification in ubiquitous environment has recently attracted a lot of attention. As one of those research, gait recognition is an efficient method of human identification using physical features of a walking person at a distance. In this paper, we present a human shape extraction and tracking for gait recognition using geodesic active contour models(GACMs) combined with mean shift algorithm The active contour models (ACMs) are very effective to deal with the non-rigid object because of its elastic property. However, they have the limitation that their performance is mainly dependent on the initial curve. To overcome this problem, we combine the mean shift algorithm with the traditional GACMs. The main idea is very simple. Before evolving using level set method, the initial curve in each frame is re-localized near the human region and is resized enough to include the targe region. This mechanism allows for reducing the number of iterations and for handling the large object motion. The proposed system is composed of human region detection and human shape tracking modules. In the human region detection module, the silhouette of a walking person is extracted by background subtraction and morphologic operation. Then human shape are correctly obtained by the GACMs with mean shift algorithm. In experimental results, the proposed method show that it is extracted and tracked efficiently accurate shape for gait recognition.

  • PDF

FIGURE ALPHABET HYPOTHESIS INSPIRED NEURAL NETWORK RECOGNITION MODEL

  • Ohira, Ryoji;Saiki, Kenji;Nagao, Tomoharu
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.547-550
    • /
    • 2009
  • The object recognition mechanism of human being is not well understood yet. On research of animal experiment using an ape, however, neurons that respond to simple shape (e.g. circle, triangle, square and so on) were found. And Hypothesis has been set up as human being may recognize object as combination of such simple shapes. That mechanism is called Figure Alphabet Hypothesis, and those simple shapes are called Figure Alphabet. As one way to research object recognition algorithm, we focused attention to this Figure Alphabet Hypothesis. Getting idea from it, we proposed the feature extraction algorithm for object recognition. In this paper, we described recognition of binarized images of multifont alphabet characters by the recognition model which combined three-layered neural network in the feature extraction algorithm. First of all, we calculated the difference between the learning image data set and the template by the feature extraction algorithm. The computed finite difference is a feature quantity of the feature extraction algorithm. We had it input the feature quantity to the neural network model and learn by backpropagation (BP method). We had the recognition model recognize the unknown image data set and found the correct answer rate. To estimate the performance of the contriving recognition model, we had the unknown image data set recognized by a conventional neural network. As a result, the contriving recognition model showed a higher correct answer rate than a conventional neural network model. Therefore the validity of the contriving recognition model could be proved. We'll plan the research a recognition of natural image by the contriving recognition model in the future.

  • PDF

Gait Recognition Using Multiple Feature detection (다중 특징점 검출을 이용한 보행인식)

  • Cho, Woon;Kim, Dong-Hyeon;Paik, Joon-Ki
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.6
    • /
    • pp.84-92
    • /
    • 2007
  • The gait recognition is presented for human identification from a sequence of noisy silhouettes segmented from video by capturing at a distance. The proposed gait recognition algorithm gives better performance than the baseline algorithm because of segmentation of the object by using multiple modules; i) motion detection, ii) object region detection, iii) head detection, and iv) active shape models, which solve the baseline algorithm#s problems to make background, to remove shadow, and to be better recognition rates. For the experiment, we used the HumanID Gait Challenge data set, which is the largest gait benchmarking data set with 122 objects, For realistic simulation we use various values for the following parameters; i) viewpoint, ii) shoe, iii) surface, iv) carrying condition, and v) time.

A study on the lip shape recognition algorithm using 3-D Model (3차원 모델을 이용한 입모양 인식 알고리즘에 관한 연구)

  • 김동수;남기환;한준희;배철수;나상동
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1998.11a
    • /
    • pp.181-185
    • /
    • 1998
  • Recently, research and developmental direction of communication system is concurrent adopting voice data and face image in speaking to provide more higher recognition rate then in the case of only voice data. Therefore, we present a method of lipreading in speech image sequence by using the 3-D facial shape model. The method use a feature information of the face image such as the opening-level of lip, the movement of jaw, and the projection height of lip. At first, we adjust the 3-D face model to speeching face image sequence. Then, to get a feature information we compute variance quantity from adjusted 3-D shape model of image sequence and use the variance quality of the adjusted 3-D model as recognition parameters. We use the intensity inclination values which obtaining from the variance in 3-D feature points as the separation of recognition units from the sequential image. After then, we use discrete HMM algorithm at recognition process, depending on multiple observation sequence which considers the variance of 3-D feature point fully. As a result of recognition experiment with the 8 Korean vowels and 2 Korean consonants, we have about 80% of recognition rate for the plosives and vowels.

  • PDF

A study on the lip shape recognition algorithm using 3-D Model (3차원 모델을 이용한 입모양 인식 알고리즘에 관한 연구)

  • 남기환;배철수
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.5
    • /
    • pp.783-788
    • /
    • 2002
  • Recently, research and developmental direction of communication system is concurrent adopting voice data and face image in speaking to provide more higher recognition rate then in the case of only voice data. Therefore, we present a method of lipreading in speech image sequence by using the 3-D facial shape model. The method use a feature information of the face image such as the opening-level of lip, the movement of jaw, and the projection height of lip. At first, we adjust the 3-D face model to speeching face Image sequence. Then, to get a feature information we compute variance quantity from adjusted 3-D shape model of image sequence and use the variance quality of the adjusted 3-D model as recognition parameters. We use the intensity inclination values which obtaining from the variance in 3-D feature points as the separation of recognition units from the sequential image. After then, we use discrete HMM algorithm at recognition process, depending on multiple observation sequence which considers the variance of 3-D feature point fully. As a result of recognition experiment with the 8 Korean vowels and 2 Korean consonants, we have about 80% of recognition rate for the plosives md vowels.

Development of Facial Emotion Recognition System Based on Optimization of HMM Structure by using Harmony Search Algorithm (Harmony Search 알고리즘 기반 HMM 구조 최적화에 의한 얼굴 정서 인식 시스템 개발)

  • Ko, Kwang-Eun;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.3
    • /
    • pp.395-400
    • /
    • 2011
  • In this paper, we propose an study of the facial emotion recognition considering the dynamical variation of emotional state in facial image sequences. The proposed system consists of two main step: facial image based emotional feature extraction and emotional state classification/recognition. At first, we propose a method for extracting and analyzing the emotional feature region using a combination of Active Shape Model (ASM) and Facial Action Units (FAUs). And then, it is proposed that emotional state classification and recognition method based on Hidden Markov Model (HMM) type of dynamic Bayesian network. Also, we adopt a Harmony Search (HS) algorithm based heuristic optimization procedure in a parameter learning of HMM in order to classify the emotional state more accurately. By using all these methods, we construct the emotion recognition system based on variations of the dynamic facial image sequence and make an attempt at improvement of the recognition performance.

A study on object recognition using morphological shape decomposition

  • Ahn, Chang-Sun;Eum, Kyoung-Bae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.05a
    • /
    • pp.185-191
    • /
    • 1999
  • Mathematical morphology based on set theory has been applied to various areas in image processing. Pitas proposed a object recognition algorithm using Morphological Shape Decomposition(MSD), and a new representation scheme called Morphological Shape Representation(MSR). The Pitas's algorithm is a simple and adequate approach to recognize objects that are rotated 45 degree-units with respect to the model object. However, this recognition scheme fails in case of random rotation. This disadvantage may be compensated by defining small angle increments. However, this solution may greatly increase computational complexity because the smaller the step makes more number of rotations to be necessary. In this paper, we propose a new method for object recognition based on MSD. The first step of our method decomposes a binary shape into a union of simple binary shapes, and then a new tree structure is constructed which ran represent the relations of binary shapes in an object. finally, we obtain the feature informations invariant to the rotation, translation, and scaling from the tree and calculate matching scores using efficient matching measure. Because our method does not need to rotate the object to be tested, it could be more efficient than Pitas's one. MSR has an intricate structure so that it might be difficult to calculate matching scores even for a little complex object. But our tree has simpler structure than MSR, and easier to calculated the matchng score. We experimented 20 test images scaled, rotated, and translated versions of five kinds of automobile images. The simulation result using octagonal structure elements shows 95% correct recognition rate. The experimental results using approximated circular structure elements are examined. Also, the effect of noise on MSR scheme is considered.

  • PDF

Recognition and positioning of occuluded objects using polygon segments (다각형 세그먼트를 이용한 겹쳐진 물체의 인식 및 위치 추정)

  • 정종면;문영식
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.5
    • /
    • pp.73-82
    • /
    • 1996
  • In this paper, an efficient algorithm for recognizing and positioning occuluded objects in a two-dimensional plane is presented. Model objects and unknown input image are approximated by polygonal boundaries, which are compactly represented by shape functions of the polygons. The input image is partitioned into measningful segments whose end points are at the locations of possible occlusion - i.e. at concave vertices. Each segment is matched against known model objects by calculating a matching measure, which is defined as the minimum euclidean distance between the shape functions. An O(mm(n+m) algorithm for computing the measure is presentd, where n and m are the number of veritces for a model and an unknown object, respectively. Match results from aprtial segments are combined based on mutual compatibility, then are verified using distance transformation and translation vector to produce the final recognition. The proposed algorithm is invariant under translation and rotation of objects, which has been shown by experimental results.

  • PDF