• Smart Media Journal
• /
• v.9 no.2
• /
• pp.33-38
• /
• 2020

Order preserving matching refers to the problem of reporting substrings of a given text where there exists order isomorphism with the pattern. In this paper, we propose a new algorithm based on filtering and evaluation. The proposed algorithm is simple and easy to implement, and runs in linear time on average. Experimental results show that it works efficiently with real world data.

• Journal of information and communication convergence engineering
• /
• v.2 no.3
• /
• pp.161-166
• /
• 2004

Electronic Ink is a stored data in the form of the handwritten text or the script without converting it into ASCII by handwritten recognition on the pen-based computers and Personal Digital Assistants(PDA) for supporting natural and convenient data input. One of the most important issue is to search the electronic ink in order to use it. We proposed and implemented a script matching algorithm for the electronic ink. Proposed matching algorithm separated the input stroke into a set of primitive stroke using the curvature of the stroke curve. After determining the type of separated strokes, it produced a stroke feature vector. And then it calculated the distance between the stroke feature vector of input strokes and one of strokes in the database using the dynamic programming technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.313-325
• /
• 1996

This paper presents a new architecture for full-search block-matching motion estimation. The architecture is based on linear systolic arrays. High speed operation is obtained by feeding reference data, search data, and control signals into the linear systolic array in a pipelined fashion. Input data are fed into the linear systolic array at a half of the processor speed, reducing the required data bandwidth to half. The proposed architecture has a good scalability with respect to the number of processors and input bandwidth when the size of reference block and search range change.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.26 no.4
• /
• pp.443-452
• /
• 2008

To deduce 3D linear information which express shapes of buildings out of airphoto by fusion of airphoto and LiDAR data, this research went through 2 process. First, research made LiDAR data into projected data of 2D based on airphoto. For this, the virtual points were added to solve the visual problem of building boundary area which has poor information because the attribute in LiDAR data. Research construct irregular triangular nets from modified LiDAR data and judge visual triangular nets out of image. Through this, research can make reference to information of triangular nets in each image pixel. Second, 3D information was extracted from stereo images segments by combining extracted information of visible region and 2D irregular triangular nets. Matching way based on TIN for segments from stereo images was used. Matching condition based on TIN can improve about 20% of edge matching accuracy compared to existing quadrilateral condition of epipolar geometry.

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

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.32-36
• /
• 2003

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

• Journal of the Korean Statistical Society
• /
• v.32 no.3
• /
• pp.271-288
• /
• 2003

In this paper, when the variance of the normal distribution is related to the mean, we develop noninformative priors such as matching priors and reference priors. We prove that the second order matching prior matches alternative coverage probabilities up to the same order and also it is a HPD matching prior. It turns out that one-at-a-time reference prior satisfies a second order matching criterion. Then using these noninformative priors, we develop a Bayesian test procedure for the equality of the means and variances of two independent normal distributions using fractional Bayes factor. Some simulation study is performed, and a real data example is also provided.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.201-217
• /
• 2019

Ricci curvature for locally finite graphs, as proposed by Lin, Lu and Yau, provides a useful isomorphism invariant. A Matching Condition was introduced as a key tool for computation of this Ricci curvature. The scope of the Matching Condition is quite broad, but it does not cover all cases. Thus the current paper introduces extended versions of the Matching Condition, and applies them to the computation of the Ricci curvature of a class of circulants determined by certain number-theoretic data. The classical Matching Condition is also applied to determine the Ricci curvature for other families of circulants, along with Cayley graphs of abelian groups that are generated by the complements of (unions of) subgroups.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.10
• /
• pp.431-438
• /
• 2015

In this paper we address the symmetric-invariant problem in boundary image matching. Supporting symmetric transformation is an important factor in boundary image matching to get more intuitive and more accurate matching results. However, the previous boundary image matching handled rotation transformation only without considering symmetric transformation. In this paper, we propose symmetric-invariant boundary image matching which supports the symmetric transformation as well as the rotation transformation. For this, we define the concept of image symmetry and formally prove that rotation-invariant matching of using a symmetric image always returns the same result for every symmetric angle. For efficient symmetric transformation, we also present how to efficiently extract the symmetric time-series from an image boundary. Finally, we formally prove that our symmetric-invariant matching produces the same result for two approaches: one is using the time-series extracted from the symmetric image; another is using the time-series directly obtained from the original image time-series by symmetric transformation. Experimental results show that the proposed symmetric-invariant boundary image matching obtains more accurate and intuitive results than the previous rotation-invariant boundary image matching. These results mean that our symmetric-invariant solution is an excellent approach that solves the image symmetry problem in time-series domain.