• Journal of KIISE:Software and Applications
• /
• v.33 no.9
• /
• pp.787-801
• /
• 2006

Ontology merging describes the process of integrating two ontologies into a new ontology. How this is done best is a subject of ongoing research in the Semantic Web, Data Integration, Knowledge Management System, and other ontology-related application systems. Earlier research on ontology merging, however, has studied for developing effective ontology matching approaches but missed analyzing and solving methods of problems of merging two ontologies given correspondences between them. In this paper, we propose a specific ontology merging process and a generic operator, T-MERGE, for integrating two source ontologies into a new ontology. Also, we define a taxonomy of merging conflicts which is derived from differing representations between input ontologies and a method for detecting and resolving them. Our T-MERGE operator encapsulates the process of detection and resolution of conflicts and merging two entities based on given correspondences between them. We define a data structure, MergeLog, for logging the execution of T-MERGE operator. MergeLog is used to inform detailed results of execution of merging to users or recover errors. For our experiments, we used oriental philosophy ontologies, western philosophy ontologies, Yahoo western philosophy dictionary, and Naver philosophy dictionary as input ontologies. Our experiments show that the automatic merging module compared with manual merging by a expert has advantages in terms of time and effort.

• Journal of the Korean Society of Safety
• /
• v.27 no.4
• /
• pp.108-114
• /
• 2012

Traffic Accident Merging Index(TAMI) is developed for TMACS(Traffic Safety Information Management Complex System). TAMI is calculated by combining 'Severity Index' and 'Frequency'. This paper suggest the accurate TAMI prediction model by time series forecasting. Preventing the traffic accident by accurately predicting it in advance can greatly improve road traffic safety. Searches the model which minimizes the error of 230 local self-governing groups. TAMI of 2007~2009 years data predicts TAMI of 2010. And TAMI of 2010 compares an actual index and a prediction index. And the error is minimized the constant where selects. Exponential Smoothing model was selected. And smoothing constant was decided with 0.59. TAMI Forecasting model provides traffic next year safety information of the local government.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2400-2419
• /
• 2014

Pre-segmented pixels can reduce the difficulty of segmentation and promote the segmentation performance. This paper proposes a novel segmentation method based on merging texture superpixels by computing inner similarity. Firstly, we design a set of Gabor filters to compute the amplitude responses of original image and compute the texture map by a salience model. Secondly, we employ the simple clustering to extract superpixles by affinity of color, coordinates and texture map. Then, we design a normalized histograms descriptor for superpixels integrated color and texture information of inner pixels. To obtain the final segmentation result, all adjacent superpixels are merged by the homogeneity comparison of normalized color-texture features until the stop criteria is satisfied. The experiments are conducted on natural scene images and synthesis texture images demonstrate that the proposed segmentation algorithm can achieve ideal segmentation on complex texture regions.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.87-93
• /
• 2002

A new approach of constructing a suffix tree $T_s$for the given string S is to construct recursively a suffix tree $ T_0$ for odd positions construct a suffix tree $T_e$ for even positions from $ T_o$ and then merge $ T_o$ and $T_e$ into $T_s$ To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets The hardest part of Farachs algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search) Our merging algorithm is more intuitive than Farachs coupled DFS (depth-first search ) merging and thus it can be easily extended to other applications.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.3
• /
• pp.289-294
• /
• 2002

A valid speech-sound block can be classified to provide important information for speech recognition. The classification of the speech-sound block comes from the MRA(multi-resolution analysis) property of the DWT(discrete wavelet transform), which is used to reduce the computational time for the pre-processing of speech recognition. The merging algorithm is proposed to extract valid speech-sounds in terms of position and frequency range. It needs some numerical methods for an adaptive DWT implementation and performs unvoiced/voiced classification and denoising. Since the merging algorithm can decide the processing parameters relating to voices only and is independent of system noises, it is useful for extracting valid speech-sounds. The merging algorithm has an adaptive feature for arbitrary system noises and an excellent denoising SNR(signal-to-nolle ratio).

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.63-71
• /
• 2003

This paper describes a color image segmentation algorithm based on region merging using hue difference as a restrictive condition. The proposed algorithm using mathematical morphology and a modified watershed algorithm does over-segmentation in the RGB space to preserve contour information of regions. Then, the segmentation result of color image is acquired by repeated region merging using hue differences as a restrictive condition. This stems from human visual system based on hue, saturation, and intensity. Hue difference between two regions is used as a restrictive condition for region merging because it becomes more important factor than color difference if intensity is not low. Simulation results show that the proposed color image segmentation algorithm provides efficient segmentation results with the predefined number of regions for various color images.

• The Journal of Society for e-Business Studies
• /
• v.10 no.3
• /
• pp.1-19
• /
• 2005

Ontology-based approaches for automated information integration are being widely investigated. The existing approaches explicitly represent the semantics of information sources in ontologies and let the computer system, through aligning or merging the source ontologies, provide a global view of information sources. The problem of aligning or merging different ontologies is a well known problem, and the inter-ontology mappings play an essential role in information integration. To enable simple and well-founded mappings , the ontologies of information sources should be modeled with the same world view and with the same manner of representation. This paper introduces an ontology modeling framework for component libraries, which is developed based on the Guarino's theory of upper ontology . This paper discusses the results of modeling ontologies of mold and die component libraries based on the framework. A Web-based implementation automatically merges the source ontologies.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.5-12
• /
• 2005

Establishment of bandwidth and effective traffic processing are required to treat various traffics according to a rapid increase in Internet traffic. A wavelength based transferring method was introduced to support a broadband bandwidth according to this requirement, and consequently, a label processing procedure has been investigated to treat various traffics. This paper introduces a regular shape of stack structure in order to solve the present MPLS label stack processing unit, and analyzes the relationship to label merging, which is initiated between label merging inside and outside the LSP tunnel. By applying an adaptive label structure and merging point a hierarchical label, which is aroused in the GMPLS, can be uniformly simplified and improved from the perspective of cost and processing time at a node

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.04a
• /
• pp.171-180
• /
• 2003

The merging of different scales or multi-sensor image data is becoming a widely used procedure of the complementary nature of various data sets. Ideally, the merging method should not distort the characteristics of the high-spatial and high-spectral resolution data used. To present an effective merging method for survey of reclaimed land, this paper compares the results of Intensity Hue Saturation (IHS), Principal Component Analysis (PCA), Color Normalized(CN) and High Pass Filter(HPF) methods used to merge the information contents of the high-resolution (6.6 m) Electro-Optical Camera (EOC) panchromatic image of the first Korea Multi-Purpose Satellite 1 (KOMPSAT-1) and the multi-spectral Moderate Resolution Imaging Spectroradiometer (MODIS) image data. The comparison is made by visual evaluation of three-color combination images of IHS, PCA, CN and HPF results based on spatial and spectral characteristics. The use of a contrasted EOC panchromatic image as a substitute for intensity in merged images with MODIS bands 1, 2 and 3 was found to be particularly effective in this study.

• Journal of Computing Science and Engineering
• /
• v.3 no.2
• /
• pp.109-126
• /
• 2009

Taxonomies are widely used to classify information, and multiple (possibly competing) taxonomies often exist for the same domain. Given a set of correspondences between two taxonomies, it is often necessary to "merge" the taxonomies, thereby creating a unied taxonomy (e.g., that can then be used by data integration and discovery applications). We present an algorithm for merging taxonomies that have been related using articulations given as RCC-5 constraints. Two taxa Nand M can be related using (disjunctions of) the ve base relations in RCC-5: M; N ${\subseteq}$M; N ${\supseteq}$; N ${\oplus}$M (partial overlap of Nand M); and N ! M (disjointness: N ${\cap}$M = ${\varnothing}$). RCC-5 is increasingly being adopted by scientists to specify mappings between large biological taxonomies. We discuss the properties of the proposed merge algorithm and evaluate our approach using real-world taxonomies.