• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.1
• /
• pp.45-52
• /
• 2015

The interoperability of multi-source data has become more important due to various digital maps, produced from public institutions and enterprises. In this study, the automatic matching algorithm of multi-source building data using hierarchical matching was proposed. At first, we divide digital maps into blocks and perform the primary geometric registration of buildings with the ICP algorithm. Then, corresponding building pairs were determined by evaluating the similarity of overlap area, and the matching threshold value of similarity was automatically derived by the Otsu binary thresholding. After the first matching, we extracted error matching candidates buildings which are similar with threshold value to conduct the secondary ICP matching and to make a matching decision using turning angle function analysis. For the evaluation, the proposed method was applied to representative public digital maps, road name address map and digital topographic map 2.0. As a result, the F measures of matching and non-matching buildings increased by 2% and 17%, respectively. Therefore, the proposed method is efficient for the matching of building polygons from multi-source digital maps.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2000.11a
• /
• pp.439-445
• /
• 2000

다차원의 속성들을 포함한 대용량의 데이터베이스 또는 점보 저장소의 데이터로부터 지식을 추출하고 이를 활용하기 위해서는 데이터 마이닝의 인공지능 기법 중 기계학습을 활용할 수 있다. 본 논문은 질의어를 바탕으로 각 작성들에 가중치를 적용하여 사용자가 원하는 데이터 집합을 분류하고, 사용자 피드백을 통하여 속성 가중치를 동적으로 변화시킴으로써 검색결과를 향상시키는 방법을 제안한다. 본 논문에서는 데이터 집합을 분류해내기 위해서 각 속성간의 거리에 가중치를 적용하는 k-nearest neighbor 분류법을 사용하였고, 속성 가중치를 동적으로 변화시키는 규칙을 추출하기 위한 방법으로는 결정 트리 생성에 의한 규칙(decision rule) 생성 방법을 적용하였다. 검색결과 향상을 \ulcorner이기 위한 실험으로써 온라인 커플매칭(online couple-matching) 시스템의 핵심부문을 구현하고 이를 적용하였다.

• KIISE Transactions on Computing Practices
• /
• v.23 no.2
• /
• pp.97-103
• /
• 2017

Many hardware-based regular expression matching architectures have been proposed for high-performance matching. In particular, regular expression processors, which perform pattern matching by treating the regular expressions as the instruction sequence like general purpose processors, have been proposed. After instruction sequence and data are provided in the instruction memory and data memory, respectively, a regular expression processor can perform pattern matching. To use a regular expression processor as a coprocessor, we need the host interface to transfer the instruction and data into the memory of a regular expression processor. In this paper, we design and implement the host interface between a host and a regular expression processor in the DE1-SoC board and the application program interface. We verify the operations of the host interface and a regular expression processor by executing the application programs which perform pattern matching using the application program interface.

• Journal of the Korea Convergence Society
• /
• v.11 no.10
• /
• pp.97-106
• /
• 2020

The factory information provided by the Industrial Location Information System (ILIS) is provided as raw data by the Korea Industrial Complex Corporation and registered after a filtering process, so the new factory information update is slow. In this study, to solve the problem of updating factory information of industrial location information system, using building data of road name address with relatively fast renewal cycle and building data of real estate, we compared the factory information of existing ILIS and extracted new factory information. In the process of comparison, a method was proposed to compare spatial objects of different types with point data and polygon data. Attribute information matching and object matching were performed, and attribute values of new factory information were extracted. The accuracy evaluation of the proposed spatial analysis method showed 79% accuracy, and the above matching technique was used to confirm the possibility of convergence of road name address data, real estate data and factory information of ILIS.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.290-297
• /
• 2003

A time-series database is a set of data sequences, each of which is a list of changing values corresponding to an object. Subsequence matching under time warping is defined as an operation that finds such subsequences whose time warping distance to a given query sequence are below a tolerance from a time-series database. In this paper, we first point out the characteristics of the previous methods for time-series sequence matching under time warping, and then discuss the approaches for applying them to whole matching as well as subsequence matching. Also, we perform quantitative performance evaluation via a series of experiments with real-life data. There have not been such researches in the literature that compare the performances of all the previous methods of subsequence matching under time warping. Thus, our results would be used as a good reference for showing their relative performances.

• The Journal of the Korea Contents Association
• /
• v.6 no.10
• /
• pp.25-33
• /
• 2006

For semantic retrieval in semantic web environment, it is an important factor to manage and manipulate distributed resources. Ontology is essential for efficient search in distributed resources, but it is almost impossible to construct an unified ontology for all distributed resources in the web. In this paper, we assumed that most information in the web environment exist in the form of RDBMS, and propose a matching method between domain ontology and the existing RDBMS tables for semantic retrieval. Most previous studies about matching between RDBMS tables and domain ontology have extracted a local ontology from RDBMS tables at first, and conducted the matching between the local ontology and domain ontology. However in the processing of extracting a local ontology, some problems such as losing domain information can be occurred since its correlation with domain ontology has not been considered at all. In this paper, we propose a methods to prevent the loss of domain information through the similarity measure between instances of RDBMS tables and instances of ontology. And using the relational information between RDBMS tables and the relational information between classes in domain ontology, more efficient instance-based matching becomes possible.

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

The matching process is not simple, since the identified features from different sources do not always match in their location, extent, and description. We present a new approach to matching GIS features from disparate sources. A graph theoretic approach is used to model the geographic context and to determine the matching features from multiple sources.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.89-98
• /
• 2016

In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.990-991
• /
• 2013

본 연구에서는 모바일 환경에서 장시간 심전도 계측 시 발생하는 무선 및 배터리의 제한적인 자원의 문제점을 해결하기 위하여 낮은 연산량과 높은 압축률을 가지는 템플릿 매칭 기반의 압축 알고리즘을 구현하였다. 템플릿 매칭 기법을 이용한 심전도 데이터 압축은 심전도의 특징점인 R-peak를 검출하여 템플릿을 생성하고 이후 입력되는 심전도 신호와 유사성을 판단하여 해당되는 템플릿의 정보만 저장하고 전송하는 방법이다. 구현된 알고리즘의 성능평가를 위하여 MIT-BIH Normal Sinus Rhythm Database의 10개 레코드에서 각각 10분간 데이터를 추출하여 성능평가를 수행하였으며, 이때, 압축률과 복원율 오차의 평균이 각각 7.94% 와 5.33%의 성능을 나타내었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10c
• /
• pp.119-124
• /
• 2007

인터넷 웹사이트의 급격한 증가와 함께 이용자도 증가하고 있으며, 이용 목적은 주로 자료검색과 조회서비스 이다. 조회 요청이 많을수록 질의의 증가를 야기하며, 데이터베이스 서버의 질의 분석(Parse), 질의 실행 계획(Query Execution Plan)을 과도하게 발생시킨다. 즉 데이터베이스 서버에서 처리하는 작업량의 과부하로 인하여 병목현상을 초래한다. 데이터베이스 서버의 조회를 위한 질의처리량을 감소시키는 작업이 필요하다. 그리고 조회 대상이 데이터는 웹사이트에서 자주 갱신되지 않거나, 데이터가 주기적으로 갱신되는 특징이 있다. 이 데이터를 대상으로 데이터베이스 캐쉬 엔진을 구성하면 데이터베이스 서버의 과부하률 해소 할 수 있다. 본 논문에서는 유사 질의 매칭 기반 데이터베이스 캐친 엔진을 설계하고 구현한다. 유사 질의 매칭 기반으로 하여 적중률을 높여 데이터베이스 병목현상을 해결하여, 검색서비스에 더욱 효과적일 것으로 사료되며, 웹사이트의 성능 향상을 기대한다.