• The KIPS Transactions:PartD
• /
• v.14D no.7
• /
• pp.819-828
• /
• 2007

In this paper, we propose a topic maps matching and merging approach based on the syntactic or semantic characteristics and constraints of the topic maps. Previous schema matching approaches have been developed to enhance effectiveness and generality of matching techniques. However they are inefficient because the approaches should transform input ontologies into graphs and take into account all the nodes and edges of the graphs, which ended up requiring a great amount of processing time. Now, standard languages for developing ontologies are RDF/OWL and Topic Maps. In this paper, we propose an enhanced version of matching and merging technique based on topic partitioning, several matching operations and merging conflict detection.

• The Korean Journal of Archival Studies
• /
• no.19
• /
• pp.57-102
• /
• 2009

Recently, distribution of record via web and coefficient of utilization are increase. so, Archival information service using website becomes essential part of record center. The main point of archival information service by website is making record information retrieval easy. It has need of matching user's request and representation of record resources correctly to making archival information retrieval easy. Archivist and record manager have used various information representation tools from taxonomy to recent thesaurus, still, the accuracy of information retrieval has not solved. This study constructed record retrieval system based on Topic Map by modeling record resources which focusing on description metadata of the records to improve this problem. The target user of the system is general web users and its range is limited to the president related sources in the National Archives Portal Service. The procedure is as follows; 1) Design an ontology model for archival information service based on topic map which focusing on description metadata of the records. 2) Buildpractical record retrieval system with topic map that received information source list, which extracted from the National Archives Portal Service, by editor. 3) Check and assess features of record retrieval system based on topic map through user interface. Through the practice, relevance navigation to other record sources by semantic inference of description metadata is confirmed. And also, records could be built up as knowledge with result of scattered archival sources.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.1128-1135
• /
• 2003

e-Transformation of an enterprise requires the collaboration of business processes to be suited to the business participants' purpose. To realize this collaboration, business processes should be implemented as components and the system developers could be able to reuse the components for their specific purpose. The first step of this collaboration is the discovery of exact components for business processes. A dilemma, however, is the fact that there are thousands or even millions of business processes which vary from one enterprise to another. Moreover, business processes could be decomposed into multiple levels of semantics and classified into several process areas. In general, discovery of exact business processes requires understanding of widely adopted classification schemes such as CBPC, OAGIS, or SCOR. To cope with this obstacle, business process metadata should be defined and managed regardless of specific classification schemes to support effective discovery and reuse of business processes components. In this paper, a methodology to discover business process components published in different semantic levels is proposed. The proposed methodology represents the metadata of business process components as topic maps stored in a registry and utilizes the powerful features of topic maps for process discovery. TM4J, an open-source topic map engine, is modified to support concept matching and navigation. With the implemented tool, application system developers can discover and publish the business process components effectively.

• Journal of KIISE
• /
• v.43 no.11
• /
• pp.1201-1209
• /
• 2016

As the use of SNS continues to increase, various related studies have been conducted. According to the effectiveness of the topic model for existing theme extraction, a huge number of related research studies on topic model based analysis have been introduced. In this research, we suggested an automation system to analyze topics of each country and its distribution in twitter by combining world map visualization and issue matching method. The core system components are the following three modules; 1) collection of tweets and classification by nation, 2) extraction of topics and distribution by country based on topic model algorithm, and 3) visualization of topics and distribution based on Google geochart. In experiments with USA and UK, we could find issues of the two nations and how they changed. Based on these results, we could analyze the differences of each nation's position on ISIS problem.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.6
• /
• pp.48-60
• /
• 2011

Nowadays, the 3D community is actively researching on 3D imaging and free-viewpoint video (FVV). The free-viewpoint rendering in multi-view video, virtually move through the scenes in order to create different viewpoints, has become a popular topic in 3D research that can lead to various applications. However, there are restrictions of cost-effectiveness and occupying large bandwidth in video transmission. An alternative to solve this problem is to generate virtual views using a single texture image and a corresponding depth image. A critical issue on generating virtual views is that the regions occluded by the foreground (FG) objects in the original views may become visible in the synthesized views. Filling this disocclusions (holes) in a visually plausible manner determines the quality of synthesis results. In this paper, a new approach for handling disocclusions using depth based inpainting algorithm in synthesized views is presented. Patch based non-parametric texture synthesis which shows excellent performance has two critical elements: determining where to fill first and determining what patch to be copied. In this work, a noise-robust filling priority using the structure tensor of Hessian matrix is proposed. Moreover, a patch matching algorithm excluding foreground region using depth map and considering epipolar line is proposed. Superiority of the proposed method over the existing methods is proved by comparing the experimental results.