• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.628-631
• /
• 2009

In this paper, we proposed a new authentication method using video that was taken during moving a hand-held camera in front of the face. The proposed method extracted individuality from the obtained image sequences using the parametric eigenspace scheme. Changes of facial appearance through authentication trials draw continuous tracks in the low dimensional igenspace. The similarity between their continuous tracks are calculated by DP-matching to verify their identities. Experimental results confirmed that different motions and persons change the shapes of continuous tracks, so the proposed method could identify the person.

• The Journal of the Acoustical Society of Korea
• /
• v.3 no.1
• /
• pp.25-35
• /
• 1984

This paper analysis the Dynamic Time Warping algorithms for time normalization of speech pattern and discusses the Dynamic Programming algorithm for spoken Korean isolated digits recognition. In the DP matching, feature vectors of the reference and test pattern are consisted of first three formant frequencies extracted by power spectrum density estimation algorithm of the ARMA model. The major differences in the various DTW algorithms include the global path constrains, the local continuity constraints on the path, and the distance weighting/normalization used to give the overall minimum distance. The performance criterias to evaluate these DP algorithms are memory requirement, speed of implementation, and recognition accuracy.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.2E
• /
• pp.41-50
• /
• 1994

This paper proposes a DMS(Dynamic Multi-Section) model based on the information of the similar features in word pattern. This model represents each word as a time series of several sections and each section implies duration time information and typical feature vectors. The procedure to make a model in the word pattern is that typical feature vector and duration time information are reflected in the distance, when matching between word pattern and model is repeated. As the result of it, the accumulated distance by matching is to be minimized.

• The KIPS Transactions:PartB
• /
• v.8B no.1
• /
• pp.1-9
• /
• 2001

본 논문에서는 서식 문서를 짧은 처리 시간에 정확히 분류함으로써 실제 환경에서 응용할 수 있는 서식 분류 방법을 제안한다. 제안하는 방법은 서식 문서 이미지 전체를 다루기보다는 처리하고자 하는 서식 문서에서 서식 구조가 많이 다른 곳을 찾아서 매칭 영역으로 결정하고, 그 영역들에 대해서만 비교를 수행함으로써 계산 시간을 줄이고 인식률을 높인다. 선분 추출 시 오류를 고려하기 위하여 기존 인쇄 문자와 채워진 데이터, 그리고 매칭 영역의 크기 정보를 페널티 함수로 반영하여 매칭 영역 선택 시 고려한다. 본 방법은 구조적으로 많이 다르고, 양질의 특징을 포함하는 적은 수의 매칭 영역을 선택함으로써 처리 시간을 줄일 수 있음은 물론 높은 서식 분류율을 얻을 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.443-445
• /
• 1999

여러 가지 유형의 서식 문서를 자동으로 처리하려면 서식을 이해하는데 필요한 항목 영상을 추출하기에 앞서 서식을 분류(classification)해야 한다. 서식을 분류함에 있어서 서식 영상 전체를 다룰 경우 상당한 시간이 걸릴 수 있다. 왜냐하면 일반적으로 서식 문서 영상의 크기는 일반 문자 영상에 비해 상당히 클 뿐만 아니라 대상 서식 문서의 유형도 많아질 수 있기 때문이다. 본 연구에서는 이러한 문제를 해결하기 위한 방법으로서 DP 매칭에 의한 부분 매칭 방법을 제안하고자 한다. 실험 결과, 제안하는 방법은 서식 문서의 전체가 아닌 일부 영역만을 비교함으로써 인식 시간과 인식률 면에서 서식 문서를 효과적으로 처리할 수 있었다.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.10
• /
• pp.497-502
• /
• 2016

Shape Contexts Recognition(SCR) is a technology recognizing shapes such as figures and objects, greatly supporting technologies such as character recognition, motion recognition, facial recognition, and situational recognition. However, generally SCR makes histograms for all contours and maps the extracted contours one to one to compare Shape A and B, which leads to slow progress speed. Thus, this paper has made simple yet more effective algorithm with optimized contour, finding the outlines according to shape figures and using the improved Douglas-Peucker algorithm and Harris corner detector. With this improved method, progress speed is recognized as faster.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1126-1139
• /
• 1994

This paper proposes an effective recognition system which recognizes the mixed document consisting of handwritten korean/alphanumeric texts and graphic images. In the preprocessing step, an input image is binarized by the proposed thresholding scheme, then graphic and character regions are separated by using connected components and chain codes. Separated Korean characters are merged based on partial recognition and their character types and sized. In the character recognition step, we use the branch and bound algorithm based on DP matching costs to recognize Korean characters. Also we recognize alphanumeric characters using several robust features. Finally we use a dictionary and information of a recognition step to correct wrong recognition results. Computer simulation with several test documents shows what the proposed algorithm recognized effectively handwritten mixed texts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.1
• /
• pp.20-28
• /
• 1992

Co-articulation is one of major factors that make connected word recognition difficult. This Study Considers the fact that the head Part Of the following word is changed by the Preceding word in a connection point, by applying the co-articulation model, and adj usting the following word .We choose a critical damping second order linear system for the co-articulation model, combining a one-stage DP matching recognition algorithm with this model, and Investigating the effects. The recognition experiment is carried out for 35 Korean 4 connected digits spoken by 5 male speakers, and recognition rate Is upgraded by 4.7 percent.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.1-7
• /
• 2003

This study is a research on character recognition based on image processing, using only color tape to mark guidelines instead of magnetic tape or electric wire used by existing AGV. AGV must follow given courses, and stop recognizing signs such as marks and numbers that indicate destinations. In this study. marks to stop AGV employed blue characters of the same font and size as those of number plates. Yellow driving lines and blue numeric characters were marked in corridors. AGV ran ing the characteristics of colors and detecting lines, and temporarily stopped recognizing numbers of 100％ through DP pattern matching. This study presented the image processing technique and the result of operating AGV.