• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.1
• /
• pp.29-37
• /
• 1989

This paper presents an application of the extended DP matching method to the on-line recognition of cursive Hangeul (Korean characters). We decrease the number of matching's objects by performing rough classification matching which makes the best use of features in the first and the last segment of Hangeul. By adding the extraction function of the basic character patterns to DP matching method, we try to calculate precisely the difference among Hangeul. The extraction of the basic character patterns is done by examining the features of segments in character. Applying the extended DP matching method to the on-line recognition of cursive Hangeul, absorption of writing motion and stable separation of strokes can be performed with flexibility.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8C
• /
• pp.680-688
• /
• 2010

In this paper, we present a dynamic programming(DP)-based stereo matching method using image segmentation algorithm. DP has been a classical and popular optimization method for various computer vision problems including stereo matching. However, the performance of conventional DP has not been satisfactory when it is applied to the stereo matching since the vertical correlation between scanned lines has not been properly considered. In the proposed algorithm, accurate edge information is first obtained from segmented image information then we considers the discontinuity of disparity and occlusions region based on the obtained edge information. The experimental results applied to the Middlebury stereo images demonstrate that the proposed algorithm has better performances in stereo matching than the previous DP based algorithms.

• Journal of the Semiconductor & Display Technology
• /
• v.8 no.4
• /
• pp.95-100
• /
• 2009

This paper presents an efficient disparity matching, using sum of absolute difference (SAD) and dynamic programming (DP) algorithm. This algorithm makes use of one of area-based algorithm which is the absolute sum of the pixel difference corresponding to the window size. We use the information of the right eye brightness (B) and the left eye brightness to get an best matching results and apply the results to the left eye image using the window go by the brightness of the right eye image. This is that we can control the brightness. The major feature of this algorithm called SAD+DP+B is that although Root Mean Square (RMS) performance is slightly less than SAD+DP, due to comparing original image, its visual performance is increased drastically for matching the disparity map on account of its matching compared to SAD+DP. The simulation results demonstrate that the visual performance can be increased and the RMS is competitive with or slightly higher than SAD+DP.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.116-129
• /
• 1993

This paper proposes an on-line Recognition scheme of cursive Korean characters based on the DP matching and fuzzy concept. The proposed algorithm, invariant to rotation and size, reduces greatly the computational requirement of dynamic programming by matching phonemes rather than character patterns, where the angle difference and the ration of lengths between input and reference patterns are adopted as matching features. The correct matching of poorly written cursive characters becomes possible by introducing the fuzzy concept in representing the features of phonemes and the ralative position between adjacent phonemes. Computer simulation results are observed to show the effectiveness of the proposed algorithm.

• Journal of Industrial Technology
• /
• v.29 no.A
• /
• pp.47-54
• /
• 2009

In this paper, we proposed hand detection and hand gesture recognition from USB camera video. Firstly, we extract hand region extraction using skin color information from a difference images. Background image is initially stored and extracted from the input images in order to reduce problems from complex backgrounds. After that, 16-directional chain code sequence is computed from the tracking of hand motion. These chain code sequences are compared with pre-trained models using DP matching. Our hand gesture recognition system can be used to control PowerPoint slides or applied to multimedia education systems. We got 92% hand region extraction accuracy and 82.5% gesture recognition accuracy, respectively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.129-137
• /
• 2004

This paper presents a signature verification method that uses Gabor filter in computing similarity between signatures. In computing similarity to compare two on-line signatures, the temporal relationship between two signatures should be computed in advance. However, conventional point matching method using DP(dynamic programming) matching consumes much computation. In this paper, we propose a fast method for computing the temporal relationship between two on-line signatures by using the phase output of Gabor Inter applied on the on-line signature signals. Two similarity measures are defined in the method: Temporal Similarity and Temporally Arranged Feature Profile Similarity. With the proposed method, Ive could compare signatures 30 times faster than conventional method using DP matching.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.311-311
• /
• 2000

We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.166-174
• /
• 1994

This paper presents the algorithm of an on-line cursive Hangeul recognition by means of the DP matching with structural information. In the proposed method, the penalty represents the similarity between input character and reference character. The penalty is dynamically computed with types of strokes, directions of strokes, and the length rations of fragment during the process that searchs for an optimal path using 3$\times$3 matrix. As the result, this method can be exactly matched for even greatly deformed characters. The computer simulation shows that the proposed algorithm can be utilized in recognizing cursive Hangeul as well as correct Hangeul.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.285-288
• /
• 2004

온라인 필기체 한자는 동일인의 동일 문자조차도 회수, 획순 및 형태의 변화가 다양할 뿐만 아니라 인식 대상이 방대하여 인식이 매우 어렵다. 또한 한자는 기본 자소의 조합에 의한 글자가 아닌 각각의 글자가 독립적으로 이루어져 있어 연속된 획들 간의 관련도를 파악하기 어렵고 획수도 1획에서 28획까지 다양하게 분포를 한다. 따라서 본 연구에서는 대분류 단계로 시작획 비교를 하고 이어진 세분류 단계에서 문자의 특징으로 방향코드와 특이점을 추출해내고 획수를 고려하여 DP 정합을 하는 2단계 인식 시스템을 제안하였다. 이로써 최적의 속도로 입력한 문자를 찾아낼 수 있도록 하였다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.8
• /
• pp.744-750
• /
• 2010

To segment instances of vehicle classes in a sparse stereo-matching data set, this paper presents an algorithm for clustering based on DP (Dynamic Programming). The algorithm is agglomerative: it begins with each element in the set as a separate cluster and merges them into successively larger clusters according to similarity of two clusters. Here, similarity is formulated as a cost function of DP. The proposed algorithm is proven to be effective by experiments performed on various images acquired by a moving vehicle.