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

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

Buildings become complex and diverse with time. It is difficult to extract individual buildings using only an optical image, because they have similar spectral characteristics to objects such as vegetation and roads. In this study, we propose a method to extract building area and boundary through integrating airborne Light Detection and Ranging(LiDAR) data and aerial images. Firstly, a binary edge map was generated using Edison edge detector after applying Adaptive dynamic range linear stretching radiometric enhancement algorithm to the aerial image. Secondly, building objects on airborne LiDAR data were extracted from normalized Digital Surface Model and aerial image. Then, a temporary building areas were extracted by overlaying the binary edge map and building objects extracted from LiDAR data. Finally, some building boundaries were additionally refined considering positional accuracy between LiDAR data and aerial image. The proposed method was applied to two experimental sites for validation. Through error matrix, F-measure, Jaccard coefficient, Yule coefficient, and Overall accuracy were calculated, and the values had a higher accuracy than 0.85.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.139-150
• /
• 2006

A schematic map is a special purpose map which is generated to recognize it's objects easily and conveniently via simplifying and highlighting logical geometric information of a map. To manufacture the schematic map with road, label and icon, we must generate simplified route map and replace many geometric objects. Performing a give task, however, there are an amount of overlap areas between geometric objects whenever we process the replacement of geometry objects. Therefore we need replacing geometric objects without overlap. But this work requires much computational resources, because of the high complexity of the original geometry map. We propose the schematic map generation system whose map consists of icons and label. The proposed system has following steps: 1) eliminating kinks that are least relevant to the shape of polygonal curve using DCE(Discrete Curve Evolution) method. 2) making an evenly distributed route using CVT(Centroidal Voronoi Tessellation) and Grid snapping method. Therefore we can keep the structural information of the route map from CVT method. 3) replacing an icon and label information with collision avoidance algorithm. As a result, we can replace the vertices with a uniform distance and guarantee the available spaces for the replacement of icons and labels. We can also minimize the overlap between icons and labels and obtain more schematized map.

• Convergence Security Journal
• /
• v.6 no.2
• /
• pp.53-60
• /
• 2006

In the applications such as CAD or image processing, a variety of geometric objects are manipulated. A polygon in which all the edges are parallel to x- or y-axis is decomposed into simple rectangles for efficient handling. But, depending on the partitioning algorithms, the same region can be decomposed into a completely different set of rectangles in the number, size and shape of rectangles. So, it is necessary an algorithm that compares two sets of rectangles extracted from two scenes such as CAD or image to see if they represent the same region. This paper proposes an efficient algorithm that compares two sets of rectangles. The proposed algorithm is not only simpler than the algorithm based on sweeping method, but also reduces the number $O(n^2)$ of overlapped rectangles from the algorithm based on a balanced binary tree to O(nlogn).

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.2
• /
• pp.79-92
• /
• 2000

기업환경에서 정보의 무결성은 중요한 보안 요구사항이다 의무분리 정책의 목적은 정보의 무결성을 필요로 하는 연산들을 여러 역할이나 사용자에게 분산시킴으로써 조직 내에서 관리하는 무결성 침해 가능성을 최소화하는 것이며 이것은 상업적 응용분야에서 중요하다. 전통적인 임의적 접근제어와 강제적 접근제어 정책의 대안인 역할 기반의 접근제어 기법은 응용에 따라 보호 객체들에 대한 접근을 역할들로 분류하여 단순한 권한 관리를 제공하며 의무분리 정책을 시행하기에 적합하다. 본 논문에서는 역할 기반의 접근제어에서 기존의 의무분리 안전성 조건의 취약성을 보완하여 응용 프로그램의 실행단위인 클래스에 기반한 개선된 동적 의무분리 기법을 제안하고 상호 배타적인 부트랜잭션들을 포함하고 있는 중첩-트랜잭션을 대상으로 이를 적용한다. 또한 여러 작업들이 동시에 실행되는 환경에서 감염된 트로이언 목마에 의해 발생될수 있는 정보의 유출 문제를 해결하고자 작업간 정보의 비밀성을 보장하는 동적의무분리 모델을 제시한다. 제안한 모델은 기존의 무결성 보장을 위해 제시되었던 Clark-Wilson 모델과 다른 의무분리 모델에 비해 관리가 용이하며, 동적으로 유지 관리되어야 하는 데이터의 양이 적고 객체 접근 확인 절차가 단순하여 구현방법이 용이한 장점이 있다 그리고 기존 의무분리 모델에서 고려되지 않은 병렬 수행 환경에서 작업 사이의 정보 유출 문제를 해결한다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.2
• /
• pp.163-171
• /
• 2012

High resolution satellite images have been used for building and road system analysis, landscape analysis, and ecological assessment for several years. However, in high resolution satellite images, shadows are necessarily cast by manmade objects such as buildings and over-pass bridges. This paper develops the shadow extraction procedures in urban area including various land-use classes, and the extracted shadow areas are evaluated by a manually digitized shadow map. For the shadow extraction, the Canny edge operator and the dilation filter are applied to make building edge buffer area. Also, the object-based segmentation was performed using Gram-Schmitt fusion image, and spectral and spatial parameters are calculated from the segmentation results. Finally, we proposed appropriate parameters and extraction rules for the shadow extraction. The accuracy of the shadow extraction results from the various assessment indices is 80% to 90%.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.489-498
• /
• 2001

A new method for local control of arbitrary scattered data interpolation in the hyperbolic plane is developed in this paper. The issue associated with local control is very critical in the interactive in the interactive design field. Especially the suggested method in this paper could be effectively applied to the interactive shape modeling of genus-N objects, which are constructed on the hyperbolic plane. Since the effects of the changed data affects only the limited area around itself, it is more convenient for end-users to design a genus-N object interactively. Therefore, by improving the global interpolation on the hyperbolic plane where the genus-N object is constructed, this research is aiming at the development and implementation of the local interpolation on the hyperbolic plane. It is implemented using the following process. First, for localizing the interpolating functions, the hyperbolic domain is tessellated into arbitrary triangle patches and the group of adjacent triangle patches of each data point is defined as a sub-domain. On each sub-domain, a weight function is defined. Last, by blending of three weight functions on the overlapped triangles, local MQ interpolation is completed. Consequently, it is compared with the global MQ interpolation using several sample data and functions.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2010.10a
• /
• pp.10-12
• /
• 2010

환경 민감 지도는 해양 유출유 사고 시 효율적이고 신속한 방제 업무를 위한 유용한 정보이다. 그러나 해상교통 및 안전 분야 종사자는 전통적으로 해도 및 전자해도 사용에 익숙하여 현 환경민감지도의 색상 및 심볼의 낮은 친숙도가 지적된 바 있다. 본 연구에서는 전자해도의 제작 표준에 해당하는 수로데이터 표준모델에 따라 환경민감지도 데이터를 제작하고 전자해도 표현방법에 따라 표시 하였다. 세부 연구 내용으로 환경민감정보에 대한 객체와 속성, 표현 심볼 및 색상에 대해 정의하고, 기존 환경민감정보를 내부 전자해도 포맷으로 변환하였다. 다음으로 내부 전자해도 데이터를 전자해도 표현방법에 따라 전자해도 레이어에 중첩시켜 그 결과를 확인 하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.67-69
• /
• 2002

여러 사이트에서 구축된 공간 데이터를 효율적으로 관리 및 공유하기 위해서는 대용량의 정보를 처리할 수 있는 분산 공간 데이터베이스 시스템의 사용이 필수적이다. 이러한 분산 공간 데이터베이스 시스템상에서의 분산 공간 죠인 질의는 공간 데이터의 대용량성과 그 복잡성으로 인하여 공간 연산의 지펴져 부하와 네트워크상의 전송 부하를 발생시킨다. 이러한 문제를 해결하기 위해 세미죠인 기반의 공간 죠인 기법들이 제안되었으나 공간 죠인 연산을 특정 서버에서만 수행하여 병목현상을 발생시키기 때문에 결국 질의 처리시간이 증가된다. 본 논문은 이러한 분산 공간 데이터베이스 시스템에서 수행 비용이 많이 드는 원격 사이트간의 공간 죠인 연산에 대해 R+-tree 공간 색인을 사용하여 병렬적으로 수행하는 기법을 제안한다. 본 기법은 R+-tree 공간 색인을 이용하여 공간 죠인 연산의 대상이 되는 릴레이션들을 중첩이 없는 두개의 릴레이션들로 분할한 후 질의 수행에 참여하는 두 서버에 죠인 연산을 분배하고 병렬적으로 처리하여 결과들을 병합한 다음 클라이언트에게 전송만다. 본 기법은 릴레이션을 분할하여 각 서버에서 공간 죠인 연산을 병렬적으로 처리하므로 처리 비용을 절반으로 감소시키며. R+-tree의 영역에 해당하는 객체들만 죠인 연산에 참여하게 함으로써 네트워크 전송 비용을 감소시킨다

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.1
• /
• pp.24-32
• /
• 2001

This paper proposes an easy method to develop GUI for the campus facility management. In the developing stage of GUI, the most important thing is to apply effective Windows programming techniques and component software supporting techniques. This study shows a GUI developing method using the OLE automation objects and ADO data control. For a case study, the study constructs its GUI which performs map overlaying referencing attribute tables, retrieving by SQL, mapping/displaying of thematic map, and so on.