• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.05a
• /
• pp.58-58
• /
• 2004

현재 금속 성형공정에 대한 해석법으로 강소성 유한요소법이 널리 이용되고 있다. 강소성 유한요소법에서는 주어진 시간에서 속도장을 얻고 가공물 형상을 시간증분 만큼 갱신하는 과정을 반복하여 비정상상태 금속성형공정의 해석한다. 일반적인 강소성 유한요소법은 형상갱신(Geometry update) 과정에서 오일러법(Euler method)을 이용한다. 오일러법에서는 시간증분의 크기가 해의 정밀도에 중요한 인자이다. 충분히 정밀한 해를 얻기 위해, 작은 시간증분을 이용하여 비정상상태 금속성형공정을 해석함으로써 해석시간이 많이 걸리는 단점이 있으며 형상갱신에 따른 가공물 체적손실(Volume loss)이 발생한다.(중략)

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.1
• /
• pp.59-65
• /
• 2012

In this paper, we proposed a method for automatic detection of a updating object from spatial data sets of different scale and updating cycle by using areal feature matching based on shape similarity. For this, we defined a updating object by analysing matching relationships between two different spatial data sets. Next, we firstly eliminated systematic errors in different scale by using affine transformation. Secondly, if any object is overlaid with several areal features of other data sets, we changed several areal features into a single areal feature. Finally, we detected the updating objects by applying areal feature matching based on shape similarity into the changed spatial data sets. After applying the proposed method into digital topographic map and a base map of Korean Address Information System in South Korea, we confirmed that F-measure is highly 0.958 in a statistical evaluation and that significant updating objects are detected from a visual evaluation.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.11
• /
• pp.155-162
• /
• 2004

The volume of the metal is not changed for the plastic deformation. For metal forming simulation, rigid-plastic FEM codes are widely used. Updating geometry using Euler method in the simulation, the volume loss is occurred. In this paper, hybrid method is introduced to perform a more accurate simulation reducing computation time. In the proposed hybrid method, RK2 method is used for geometry updating at first time step and after the boundary condition of the node is changed. At the others, Adams-Bashforth or theta method is applied to update geometry. The results show that the simulations of upsetting and side-pressing can be performed within 0.02％.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2009.04a
• /
• pp.15-17
• /
• 2009

The line simplification method based on the turning function is studied in this paper for conversion of ground plan data to geospatial data to update the digital map. This method eliminate vertices effectively by estimating the length and the angle between the vertices based on the turning function which is useful to express the shape of linear feature. As the result, this method shows high shape similarity, high elimination rate of vertices and 100% of satisfaction degree to the drawing rules. Thus this line simplification method is judged to be effective in updating the digital map with ground plans.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.4_1
• /
• pp.311-318
• /
• 2014

The data of buildings and structures take over large portions of the mapping database with large numbers. Furthermore, those shapes and attributes of building data continuously change over time. Due to those factors, the efficient methodology of updating database for following the most recent data become necessarily. This study has purposed on extracting needed data, which has been changed, by using overlaying analysis of new and old dataset, during updating processes. Following to procedures, we firstly searched for matching pairs of objects from each dataset, and defined the classification algorithm for building updating cases by comparing; those of shape updating cases are divided into 8 cases, while those of attribute updating cases are divided into 4 cases. Also, two updated dataset are set to be automatically saved. For the study, we selected few guidelines; the layer of digital topographic map 1:5000 for the targeted updating data, the building layer of Korea Address Information System map for the reference data, as well as build-up areas in Gwanak-gu, Seoul for the test area. The result of study updated 82.1% in shape and 34.5% in attribute building objects among all.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.577-581
• /
• 2000

폭우선생성트리 등의 문제를 해결하는데 필요한 정보가 네트워크상의 프로세서에 분산되어 있는 상황에서, 그들 정보를 교환하면서 그 문제를 해결하는 알고리즘을 분산알고리즘(Distributed Algorithm)이라고 한다. 폭우선생성트리가 이미 구성되어 있는 비동기식 네트워크상에서 네트워크 형상이 변할 경우, 이로인해 구성되어 있던 폭우선생성트리를 갱신해야 하는 경우가 발생한다. 본 논문에서는 이러한 경우 폭우선생성트리를 효율적으로 갱신하는 메시지 복잡도와 이상시간복잡도 모두 O($p{\surd}q$ + q + a + n')인 분산알고리즘을 제안한다. 여기서, a는 추가 링크의 수, n'는 네트워크의 토폴로지가 변한후의 네트워크상에 존재하는 노드수를 각각 나타낸다. 그리고, p는 삭제 또는 추가 링크를 가진 이중연결성분에 속하는 전체 노드 수를 나타내며, q는 삭제 또는 추가 링크를 가진 이중연결성분에 속하는 전체 링크수를 나타낸다.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.12
• /
• pp.1079-1088
• /
• 2015

Parallelism and performance enhancement of calculating view factors in KSDS developed by KARI is introduced in this paper. View factor is an essential parameters of radiation thermal analysis for a spacecraft, and the amount of computation of them is not negligible. Especially, independent integration of view factors at each position of the orbit because the relative displace between solar panel and main body of a satellite varies with the position on the orbit. This paper introduces a range of parallelism of computing view factor and their performance, detection of obstructions by spatial search algorithm based on KD-Tree, and the reduction of the calculation of view factors of a satellite with relative motion between solar panel and main body, called updating fractional view factor matrix, for satellite thermal analysis.

• Journal of Software Assessment and Valuation
• /
• v.16 no.2
• /
• pp.99-107
• /
• 2020

An underground integrated map is being built for underground safety management and is being updated periodically. The map update proceeds with the procedure of deleting all previously stored objects and saving newly entered objects. However, even unchanged objects are repeatedly stored, deleted, and stored. That causes the delay of the update time. In this study, in order to shorten the update time of the integrated map, an updated object and an unupdated object are separated, and only updated objects are reflected in the underground integrated map, and a system implementing this technology is described. For the updated object, an object comparison method using the center point of the object is used, and a quad tree is used to improve the search speed. The types of updated objects are classified into addition and deletion using the shape of the object, and change using its attributes. The proposed system consists of update object detection, extraction, conversion, storage, and history management modules. This system has the advantage of being able to update the integrated map about four times faster than the existing method based on the data used in the experiment, and has the advantage that it can be applied to both ground and underground facilities.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.6_1
• /
• pp.483-491
• /
• 2013

By a development of car navigation systems and mobile or positioning technology, it increases interest in location based services, especially pedestrian navigation systems. Updating of digital maps is important because digital maps are mass data and required to short updating cycle. In this paper, we proposed change detection for different network data-sets based on areal feature matching. Prior to change detection, we defined type of updating between different network data-sets. Next, we transformed road lines into areal features(block) that are surrounded by them and calculated a shape similarity between blocks in different data-sets. Blocks that a shape similarity is more than 0.6 are selected candidate block pairs. Secondly, we detected changed-block pairs by bipartite graph clustering or properties of a concave polygon according to types of updating, and calculated Fr$\acute{e}$chet distance between segments within the block or forming it. At this time, road segments of KAIS map that Fr$\acute{e}$chet distance is more than 50 are extracted as updating road features. As a result of accuracy evaluation, a value of detection rate appears high at 0.965. We could thus identify that a proposed method is able to apply to change detection between different network data-sets.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.1027-1030
• /
• 2013

For the detection of objects in the videos, there are various ways that use the frequency transformation. In the videos, the images of objects could be changed slightly. Object detection methods using frequency transformation such as ASEF and MOSSE have the ability to renew the detection filter in order to deal with the change of object images. But these approaches are likely to fail the detection because the image changes often occur when they come out again after being hidden by other objects. What is worse, when they show up again, they appear in another place, not the original one. In this paper, a new proposal is present so that the detection can be carried out efficiently even when the images come out in other place, and the failure of the detection can be reduced.