• Journal of the Korean Data and Information Science Society
• /
• v.14 no.1
• /
• pp.83-92
• /
• 2003

In this paper, we derive noninformative priors for the ratio of parameters in the Burr model. We obtain Jeffreys' prior, reference prior and second order probability matching prior. Also we prove that the noninformative prior matches the alternative coverage probabilities and a HPD matching prior up to the second order, respectively. Finally, we provide simulated frequentist coverage probabilities under the derived noninformative priors for small and moderate size of samples.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.956-967
• /
• 2010

Rapid growth of internet applications has increased the importance of intrusion detection system (IDS) performance. String matching is the most computation-consuming task in IDS. In this paper, a new algorithm for multiple string matching is proposed. This proposed algorithm is based on the canonical Aho-Corasick algorithm and it utilizes a bidirectional and parallel processing structure to accelerate the matching speed. The proposed string matching algorithm was implemented and patched into Snort for experimental evaluation. Comparing with the canonical Aho-Corasick algorithm, the proposed algorithm has gained much improvement on the matching speed, especially in detecting multiple keywords within a long input text string.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1482-1485
• /
• 2005

An equivalent schema matching among several different source schemas is very important for information integration or mining on the XML based World Wide Web. Finding most similar source schema corresponding mediated schema is a major bottleneck because of the arbitrary nesting property and hierarchical structures of XML DTD schemas. It is complex and both very labor intensive and error prune job. In this paper, we present the first complex matching of XML schema, i.e. XML DTD, inlining two dimensional DTD graph into flat feature values. The proposed method captures not only schematic information but also integrity constraints information of DTD to match different structured DTD. We show the integrity constraints based hierarchical schema matching is more semantic than the schema matching only to use schematic information and stored data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5203-5217
• /
• 2018

In order to increase the capacity and improve the spectrum efficiency of wireless communication systems, this paper proposes a rate-based two-sided many-to-one matching game algorithm for energy-harvesting small cells with non-orthogonal multiple access (NOMA) in heterogeneous cellular networks (HCN). First, we use a heuristic clustering based channel allocation algorithm to assign channels to small cells and manage the interference. Then, aiming at addressing the user access problem, this issue is modeled as a many-to-one matching game with the rate as its utility. Finally, considering externality in the matching game, we propose an algorithm that involves swap-matchings to find the optimal matching and to prove its stability. Simulation results show that this algorithm outperforms the comparing algorithm in efficiency and rate, in addition to improving the spectrum efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.395-405
• /
• 2012

A joint template matching algorithm is proposed in this paper to reduce the high rate of miss-detection and false-alarm caused by the traditional template matching algorithm during the process of multi-object detection. The proposed algorithm can reduce the influence on each object by matching all objects together according to the correlation information among different objects. Moreover, the rate of miss-detection and false-alarm in the process of single-template matching is also reduced based on the algorithm. In this paper, firstly, joint template is created from the information of relative positions among different objects. Then, matching criterion according to normalized cross correlation is generated for multi-object matching. Finally, the proposed algorithm is applied to the detection of watermarks in bill. The experiments show that the proposed algorithm has lower miss-detection and false-alarm rate comparing to the traditional NCC algorithm during the process of multi-object detection.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.39-49
• /
• 1995

Stereo vision is useful to obtain three dimensional depth information from two images taken from different view points. In this paper, we reduce searching area for correspondence by using the intra-scanline constraint, and utilize the inter-scanline constraint and the property of disparity continuity among the neighboring pixels for relaxation. Nodes with 3-D stucture are located on the axes of two views, and have matching possibility of correspondent pixels of two images. A matching is accepted if a node at the intersection of the disparity axes has the greatest matching possibility. Otherwise, the matching possibility of the node is updated by relaxation with the cooperation of neighboring nodes. Further relaxation with competition of two views is applied to a matching possibility of randomly selected node. The consensus of two views increases the confidence of matching, and removes a blurring phenomenon on the discontinuity of object. This approach has been tested with various types of image such as random dot stereogram and aerial image, and the experimental results show good matching performance.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.3
• /
• pp.173-186
• /
• 2013

Web-based map services provide various geographic information that users want to get by continuous updating of data. Those map services provide different information for a geographic object respectively. It causes several problems, and most of all various information cannot be integrated and provided. To resolve the problem, this paper proposes a system which can integrate diverse geographic information and provide users rich geographic information. In this paper, a hybrid schema matching (HSM) algorithm is proposed and the algorithm is a mixture of the adapter-based semantic processing method, static semantic management-based approach, and dynamic semantic management-based approach. A comparative evaluation is described to show effectiveness of the proposed algorithm. The proposed algorithm in this paper improves the accuracy of schema matching because of registration and management of schemas of new semantic information. The proposal enables vocabulary-based schema matching using various schemas, and it thus also supports high usability. Finally, the proposed algorithm is cost-effective by providing the progressive extension of relationships between schema meanings.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.265-268
• /
• 2004

Keyword matching technique which is used in most information retrieval systems is unfit for efficient processing of geometrically increasing information. The problem can be solved by using semantic information and an efficient method of semantic processing is introduced in this paper. The technique uses conceptual graph to represent the semantic information and apply it for information retrieval. The implemented system can perform exact matching and partial matching. Partial matching has two different types. One is syntactic partial matching and the other is semantic partial matching. The semantic semilaries are measured by the subclass relations in the ontology. The introduced technique can be used not only information retrieval but also in various applications such as an implementation of dynamic hyperlinks.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.63-68
• /
• 2010

In this paper, we propose a multiresolution stereo matching method based on genetic algorithm using edge information. The proposed approach considers the matching environment as an optimization problem and finds the solution by using a genetic algorithm. A cost function composes of certain constraints which are commonly used in stereo matching. We defines the structure of chromosomes using edge pixel information of reference image of stereo pair. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement. We valid our approach not only reduce the search time for correspondence but alse ensure the validity of matching.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8C
• /
• pp.680-688
• /
• 2010

In this paper, we present a dynamic programming(DP)-based stereo matching method using image segmentation algorithm. DP has been a classical and popular optimization method for various computer vision problems including stereo matching. However, the performance of conventional DP has not been satisfactory when it is applied to the stereo matching since the vertical correlation between scanned lines has not been properly considered. In the proposed algorithm, accurate edge information is first obtained from segmented image information then we considers the discontinuity of disparity and occlusions region based on the obtained edge information. The experimental results applied to the Middlebury stereo images demonstrate that the proposed algorithm has better performances in stereo matching than the previous DP based algorithms.