• The KIPS Transactions:PartA
• /
• v.18A no.5
• /
• pp.181-192
• /
• 2011

Information superiority is an essential factor in modern warfare and it can be archived by efficient information exchange between systems. Various computing systems are installed on the today's navy vessels. However, it is hard to improve interoperability and efficiency of information exchange since the configurations of installed systems are varying. The military standard and commercial standard are mix-used between systems. In this paper, we propose an information exchange architecture based on Pub/Sub model as a communication middleware to improve interoperability as well as enhancing scalability. We also propose a novel tree matching algorithm to improve a performance of PubSub broker. In the proposed algorithm, each tree nodes have information about predicates of subscription that can reduce event matching time. The performance evaluation results show our proposed algorithm reduces time for matching predicates compare with other algorithms.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.513-516
• /
• 2011

기존의 실시간 파노라마 합성 알고리즘에서는 매칭점과 입력 영상에서의 outlier를 구분하고 제거하기가 어렵기 때문에 노이즈가 많은 영상 또는 반복적인 패턴이 많은 영상에서 왜곡이 쉽게 발생하는 문제가 있다. 따라서 본 논문에서는 기존의 실시간 파노라마 합성 프레임웍에서 실시간 합성 조건을 만족시키면서 효과적으로 매칭점과 입력 영상에서의 outlier를 제거하는 방법을 제안한다. 이를 위해서 선형 모델에서 outlier을 제거하는 데 주로 사용되는 RANSAC 알고리즘을 실시간 파노라마 합성에서 사용되는 비선형 모델에 적용 가능하도록 수정하고 속도 향상을 위해서 사용되는 모델의 파라미터를 줄이는 방법을 제안한다. 이를 통하여 매칭점 중에 존재하는 outiler를 제거하고 전체 매칭점 중에서 inlier 비율을 이용하여 입력되는 영상시퀀스에서 outlier 영상을 제거하는 방법을 제안한다. 실험 결과 기존의 방법에 비해서 합성 결과의 왜곡이 줄어드는 것을 확인하였다.

• Journal of KIISE
• /
• v.42 no.7
• /
• pp.901-909
• /
• 2015

In this paper, to build a parallel corpus between Korean and English in Wikipedia. We proposed a method to find similar sentences based on language resources and topic modeling. We first applied language resources(Wiki-dictionary, numbers, and online dictionary in Daum) to match word sequentially. We construct the Wiki-dictionary using titles in Wikipedia. In order to take advantages of the Wikipedia, we used translation probability in the Wiki-dictionary for word matching. In addition, we improved the accuracy of sentence similarity measuring method by using word distribution based on topic modeling. In the experiment, a previous study showed 48.4% of F1-score with only language resources based on linear combination and 51.6% with the topic modeling considering entire word distributions additionally. However, our proposed methods with sequential matching added translation probability to language resources and achieved 9.9% (58.3%) better result than the previous study. When using the proposed sequential matching method of language resources and topic modeling after considering important word distributions, the proposed system achieved 7.5%(59.1%) better than the previous study.

• Spatial Information Research
• /
• v.23 no.3
• /
• pp.1-10
• /
• 2015

Due to recent improvement of various sensor technologies, indoor positioning becomes available. However, Indoor positioning technologies by Wi-Fi radio map and acceleration sensor and digital campus still have a certain level of errors and a number of researches have been done to increase the positioning accuracy of the indoor positioning. If we could provide a room level accuracy, indoor location based services with current indoor positioning methods such as Wi-Fi radio map and acceleration sensors would be possible. In this paper, we propose an indoor map matching method to provide a room level accuracy based on hidden markov model.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06c
• /
• pp.4-6
• /
• 2006

최근들어 웹 서비스의 수가 증가하면서 필요한 서비스를 정확하게 탐색하는 것이 중요한 이슈가 되고 있다. 이를 위해 온톨로지에 기반한 시맨틱 웹 서비스 탐색에 관한 연구들이 진행되었다. 그러나 기존 연구는 제한된 개념 해석 방식을 사용하고, 명확한 개념 기술 방법을 제공하지 않기 때문에 매칭 오류가 발생 할 수 있다. 본 논문에서는 이러한 문제를 해결하기 위해 통합 개념 모델과 이를 적용한 웹 서비스 탐색 방법을 제안한다. 제안된 통합 개념 모델은 개념 타입, 클래스, 프로퍼티를 이용한 유연하고 명확한 개념 기술 방벌을 제공한다. 제안된 탐색 방법은 통합 개념 모델에 기반하여 서비스와 사용자 요구사항을 기술하고 매칭을 수행한다. 또한 복합 매칭을 지원하여 보다 정교한 서비스 탐색이 가능하다. 다양한 형태의 사용자 요구사항에 대해 실험한 결과, 제안된 방법은 기존 연구보다 더 높은 정확률과 재현율을 보였다.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.665-674
• /
• 2007

Code reuse in software reuse has several limitations such as difficulties of understanding and retrieval of the reuse code written by other developers. To overcome these problems, it should be possible to reuse the analysis/design information than source code itself. Therefore, this paper present analogical matching techniques for the reuse of object models and patterns. And this paper have suggested the object model and the design patterns as reusable components and the representation techniques to store them. Namely, the contents of the paper are as follows. Analogical matching functions to retrieve analogous components from reusable libraries. And the representation of reusable components to be stored in the library in order to support the analogical matching.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.2
• /
• pp.27-32
• /
• 2001

In this paper, the three dimension scanner system employing the parallel camera model is discussed. The camera calibration process and the three dimension scanning algorithm are developed. The laser strip line is utilized for assisting stereo matching. An object being scanned rotates on the plate which is activated by a stepping motor, The world coordinate which is. the measured distance from the camera to the object is converted into the model coordinate. The facets created from the point. cloud of the model coordinate is used for rendering the scanned model by using the graphic library such as OpenGL. The unmatched points having no validate matching points are interpolated from the validate matching points of the vicinity epipolar lines.

• The Journal of the Korea Contents Association
• /
• v.8 no.5
• /
• pp.44-51
• /
• 2008

Pattern matching and pattern searching in time series data have been active issues in a number of disciplines. This paper suggests a novel pattern matching technology which can be used in the field of stock market analysis as well as in forecasting stock market trend. First, we define conceptual patterns, and extract data forming each pattern from given time series, and then generate learning model using Hidden Markov Model. The results show that the context-based pattern matching makes the matching more accountable and the method would be effectively used in real world applications. This is because the pattern for new data sequence carries not only the matching itself but also a given context in which the data implies.

• Annual Conference on Human and Language Technology
• /
• 2018.10a
• /
• pp.443-448
• /
• 2018

웹검색 결과의 품질 향상을 위해서는 질의의 정확한 매칭 뿐만이 아니라, 서로 같은 대상을 지칭하는 한글 문자열과 영문 문자열(예: 네이버-naver)의 매칭과 같은 유연한 매칭 또한 중요하다. 본 논문에서는 문장대문장 학습을 통해 영문 문자열을 한글 문자열로 음차변환하는 방법론을 제시한다. 또한 음차변환 결과로 얻어진 한글 문자열을 동일 영문 문자열의 다양한 음차변환 결과와 매칭시킬 수 있는 발음 유사성 기반 부분 매칭 방법론을 제시하고, 위키피디아의 리다이렉트 키워드를 활용하여 이들의 성능을 정량적으로 평가하였다. 이를 통해 본 논문은 문장대문장 학습 기반의 음차 변환 결과가 복잡한 문맥을 고려할 수 있으며, Damerau-Levenshtein 거리의 계산에 자모 유사도를 활용하여 기존에 비해 효과적으로 한글 키워드들 간의 부분매칭이 가능함을 보였다.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.147-169
• /
• 2007

Semantic Web Services Discovery matches between users' requirements and the ontological description of Web Services. However, concepts of an ontology can be interpreted differently according to a point of view. Previous works are limited in interpreting concepts. Since they lack a precise scheme of describing the advertisements and requirements of services and users, respectively, and even do not support a sophisticated matching, semantic mismatches may occur. This paper presents a sophisticated method of discovering Web services. The proposed method facilitates specifying semantics precisely and flexibly based on a proposed integrated concept model. Additionally, more sophisticated discovery is supported by computing complex matchings with many-to-many relationships. Experimental results show that the proposed method performs more efficiently for various kinds of user requests, compared with previous works.