• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.756-761
• /
• 2021

Dynamic route guidance (DRG) finds the fastest path from a source to a destination location considering the real-time congestion information. In Korea, the traffic state information is available by the public transportation data (PTD) which is indexed on top of the node-link map (NLM). While the NLM is the authoritative low-detailed road network for major roads only, the OpenStreetMap road network (ORN) supports not only a high-detailed road network but also a few open-source routing engines, such as OSRM and Valhalla. In this paper, we propose a DRG framework based on road network matching between the NLM and ORN. This framework regularly retrieves the NLM-indexed PTD to construct a historical speed profile which is then mapped to ORN. Next, we extend the Valhalla routing engine to support dynamic routing based on the historical speed profile. The numerical results at the Yeoui-do island with collected 11-month PTD show that our DRG framework reduces the travel time up to 15.24 % and improves the estimation accuracy of travel time more than 5 times.

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

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.6
• /
• pp.11-20
• /
• 1997

This paper proposes a modified dynamic programming for finding the correspondence between right and left images. A dynamic programming is based on the intensity of images for stereo matching. But htis method is intended to mismatch at uniformed intensity region. To reduce thd mismatching, the stereo images are segmented to various regions with respective uniform intensity, and the different cost function has applied to the segmented region during the dynamci programming. Cost function costains jump cost. And jump cost included two parameter .alpha. and .beta. which have influence on minimum cost path. Experimental results show that the 3D shape of some stereo pairs cna be finely obtained by this proposed algorithm.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.587-589
• /
• 1995

The safe navigation of a mobile robot requires the recognition of the environment in terms of vision processing. To be guided in the given path, the robot should acquire the information about where the wall and corridor are located. Also unexpected obstacles should be detected as rapid as possible for the safe obstacle avoidance. In the paper, we assume that the mobile robot should be navigated in the flat surface. In terms of this assumption we simplify the correspondence problem by the free navigation surface and matching features in that coordinate system. Basically, the vision processing system adopts line segment of edge as the feature. The extracted line segments of edge out of both image are matched in the free nevigation surface. According to the matching result, each line segment is labeled by the attributes regarding obstacle and free surface and the 3D shape of obstacle is interpreted. This proposed vision processing method is verified in terms of various simulations and experimentation using real images.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.11a
• /
• pp.377-380
• /
• 2006

최근 XML(eXtensible Markup language) 사용의 증가로 인해 다량의 대용량 XML 문서가 이용되고 있음에 따라, 효율적인 문서 관리를 위한 XML문서의 데이터 모델과 저장 스키마를 어떻게 구현할 것인가에 대한 연구가 활발히 진행되고 있다. 이에 본 논문에서는 관계형 데이터베이스를 기반으로 한 XML문서에 대한 효율적인 저장, 검색 및 관리 기법으로 노드의 텍스트 값이나 속성 값이 존재하는 경로만을 저장하고, 노드 표현에 따라 고유 노드명 식별자(Node Expression Identifier)를 부여함으로써 부여된 노드 식별자를 매칭하는 숫자 매칭(Number Matching)기법을 제안한다. 그리고 이를 입증하기 위해 WPath 질의들에 대한 처리 성능을 기존 방법과 비교함으로써 제안한 방법의 효율성을 제시한다.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.59 no.4
• /
• pp.401-404
• /
• 2010

In multibit Sigma-Delta Modulator, DWA(Data Weighted Averaging) among the DEM(Dynamic Element Matching) techniques was widely used to get rid of non-linearity that caused by mismatching of unit capacitor in feedback DAC path. this paper proposed the improved DWA architecture by adjusting clock timing of the existing DWA architecture. 2n Register block used for output was replaced with 2n S-R latch block. As a result of this, MOS Tr. can be reduced and extra clock can also be removed. Moreover, two n-bit Register block used to delay n-bit data code is decreased to one n-bit Register. In order to confirm characteristics, DWA for the 3-bit output with the proposed DWA architecture was designed on 0.18um process under 1.8V supply. Compared with the existing architecture. It was able to reduce the number of 222 MOS Tr.

• Proceedings of the KSME Conference
• /
• 2001.06d
• /
• pp.771-776
• /
• 2001

By matching a well established fast throughflow code, with standard loss correlations, and an efficient optimization algorithm, a new design system has been developed, which optimizes inlet and exit flow-field parameters for each blade row of a multistage axial flow turbine. The compressible steady state inviscid throughflow code based on streamline curvature method is suitable for fast and accurate flow calculation and performance prediction of a multistage axial flow turbine. A general purpose hybrid constrained optimization package, iSIGHT has been used, which includes the following modules: genetic algorithm, simulated annealing, modified method of feasible directions. The design system has been demonstrated using an example of a 5-stage low pressure steam turbine for 800MW thermal power plant previously designed by HANJUNG. The comparison of computed performance of initial and optimized design shows significant improvement in the turbine efficiency.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.37-40
• /
• 2000

A fast method of Hangul address word verification is presented in this Paper. Pre-segmentation and recognition by DP matching is adopted in this paper. An address line image is over-segmented by analyzing the topology of connected components and the projection profile. A fast individual Hangul character verifier was developed by applying SVM (Support Vector Machine). The segmentation hypothesis was represented by lattice structure, and a best path search by dynamic programming generates the most probable segmentation path and the final verification score. The word verifier was tested on 310 address image DB, and it show the possibility of improvements of this method.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.7
• /
• pp.47-52
• /
• 2016

This paper introduces an algorithm to construct an Eulerian cycle for Chinese postman problem. The Eulerian cycle is formed only when all vertices in the graph have an even degree. Among available algorithms to the Eulerian cycle problem, Edmonds-Johnson's stands out as the most efficient of its kind. This algorithm constructs a complete graph composed of shortest path between odd-degree vertices and derives the Eulerian cycle through minimum-weight complete matching method, thus running in $O({\mid}V{\mid}^3)$. On the contrary, the algorithm proposed in this paper selects minimum weight edge from edges incidental to each vertex and derives the minimum spanning tree (MST) so as to finally obtain the shortest-path edge of odd-degree vertices. The algorithm not only runs in simple linear time complexity $O({\mid}V{\mid}log{\mid}V{\mid})$ but also obtains the optimal Eulerian cycle, as the implementation results on 4 different graphs concur.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.554-557
• /
• 2002

This paper describes power potential field method for the collision-free path planning of stereo-vision based mobile robot. Area based stereo matching is performed for obstacle detection in uncertain environment. The repulsive potential is constructed by distributing source points discretely and evenly on the boundaries of obstacles and superposing the power potential which is defined so that the source potential will have more influence on the robot than the sink potential when the robot is near to source point. The mobile robot approaches the goal point by moving the robot directly in negative gradient direction of the main potential. We have investigated the possibility of power potential method for the collision-free path planning of mobile robot through various experiments.