• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2004년도 춘계학술발표회논문집
• /
• pp.171-176
• /
• 2004

Image matching is fundamental process in photogrammetry and computer vision to identify and to measure corresponding features on the multiple images. Uniqueness of the matching entities and robustness of the algorithm are the key issues that have influence on quality of the matching result. The optimal solution could be obtained by utilizing appropriate matching entities in the first place. In this study, candidate matching points were extracted by interest operator, and an area-based matching method was applied with characteristics of the gray value distribution as the matching entities. The characteristic information is based on the concept of "intrinsic image" (or parameter image). The information was utilized as additional and/or complementary matching entities. Matching on interest points with the characteristic information resulted in high quality of matching because matching windows were created with surrounding pixels of the interest points that contain distinct and unique features. The experiment shows that matching quality and reliability increase by exploiting interest operator, and the characteristic information has potential to be matching entity.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2007년도 추계학술대회 및 정기총회
• /
• pp.267-272
• /
• 2007

One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching fur expanding results from an exact matching engine to query the OWL MIT Process Handbook. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We perform retrieval experiments to compare the performance of the devised similarity algorithms.

• 한국전자거래학회지
• /
• 제10권3호
• /
• pp.85-110
• /
• 2005

현재 시맨틱 웹 서비스 발견에 대한 연구는 OWL-S를 중심으로 LARKS프로젝트와 METEOR-S 프로젝트에서 활발히 이루어지고 있다. 그러나 이들 프로젝트들은 OWL-S의 발견 요소를 모두 포함하고 있지 않고 발견 알고리즘을 개선할 필요가 있다. 따라서 본 논문에서는 OWL-S의 발견 요소 중 기존 연구에서 고려하지 않은 프로세스 구조 매칭 알고리즘과 METEOR-S 프로젝트의 QoS 매칭에 대한 알고리즘을 개선한 QoS 매칭 알고리즘을 제안한다. 또한 서비스 분류 매칭과 비즈니스 패턴 매칭을 새롭게 정의한다. 마지막으로 사용자의 선호도를 고려한 매칭 통합 알고리즘을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권4호
• /
• pp.711-725
• /
• 2013

A heuristic with multi-byte suffix matching plays an important role in real pattern matching algorithms. By skipping many characters at a time in the process of comparing a given pattern with the text, the pattern matching algorithm based on a heuristic with multi-byte suffix matching shows a faster average search time than algorithms based on deterministic finite automata. Based on various experimental results and simulations, the previous works show that the pattern matching algorithms with multi-byte suffix matching performs well. However, there have been limited studies on the mathematical model for analyzing the performance in a standard manner. In this paper, we propose a new probabilistic model, which evaluates the performance of a heuristic with multi-byte suffix matching in an average-case search. When the theoretical analysis results and experimental results were compared, the proposed probabilistic model was found to be sufficient for evaluating the performance of a heuristic with suffix matching in the real pattern matching algorithms.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1860-1863
• /
• 1997

Transfer alignement is the process of initializing attitude of slave INS using the data of master INS. This paper presents the performance analysis of transfer alignment at sea using convariance analysis method. Velocity & angle matching and angular rate & acceleration matching are used for analysis, and the performance of two matching methods are compared. We propose a new method for angular rate & acceleration matching. Under the assumption of accurate modeling of ship flexure, the performance of transfer alignment time and accuray is improved very much for the new method.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2014년도 춘계 종합학술대회 논문집
• /
• pp.239-240
• /
• 2014

Researchers in KISTI have been participating in the WISET Fellow Mentoring program since 2009 [1]. We describe the history and future of WISET Fellow Mentoring program from KISTI. We have communicated with mentees more freely and effectively using complementary online and offline system. In addition, we designed a automated matching process in order to help mentors and mentees to begin mentoring with satisfaction [2-6]. In the future, we plan to use our automated matching process for matching candidate mentors and mentees in order to obtain more satisfaction in mentoring.

• 한국측량학회지
• /
• 제31권1호
• /
• pp.23-28
• /
• 2013

이종의 공간 데이터 셋을 매칭하는 과정은 매칭 또는 비 매칭의 이진 클래스로 판별하는 과정과 비슷하다. 이에 이진 클래스의 판별이 중요한 연구주제인 바이오인식 분야에서 임계값을 구하는데 이용되는 동일 오류율을 공간 데이터 셋의 매칭에 적용하여 임계값을 산출하였다. 매칭유무를 판별하는 과정에서 임계값이 계속 바뀌면 매칭으로 판별되는 객체 쌍이 상이해지면서 정확도와 재현율도 바뀌게 되며, 이들 지표 사이에 trade-off가 나타나는 지점이 EER, 즉 임계값이 된다. 동일 오류율 기반의 임계값 산출 방법을 훈련 자료에 적용하여 형상유사도 0.802가 임계값으로 구해졌다. 이를 실험 자료에 적용한 결과, 매칭의 성능을 평가하는 척도인 F-measure가 0.940으로 높게 나타났다. 이를 통하여 동일 오류율을 이용하여 연구자의 개입이 없이 정확한 임계값이 산출되고, 동일 오류율 기반의 임계값 산출이 이종의 공간 데이터 셋 매칭에 적합하다는 것을 알 수 있었다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권2호
• /
• pp.251-254
• /
• 2016

An energy-efficient object matching accelerator is proposed for mobile object recognition based on matching prediction scheme. Conventionally, vocabulary tree has been used to save the external memory bandwidth in object matching process but involved massive internal memory transactions to examine each object in a database. In this paper, a novel object matching accelerator is proposed based on matching predictions to reduce unnecessary internal memory transactions by mitigating non-target object examinations, thereby improving the energy-efficiency. Experimental results show a 26% reduction in power-delay product compared to the prior art.

• 한국측량학회지
• /
• 제38권2호
• /
• pp.165-172
• /
• 2020

There is growing interest in Vision-based video image matching owing to the constantly developing technology of unmanned-based systems. The purpose of this paper is the development of a fast and effective matching technique for the UAV oblique video image. We first extracted initial matching points using NCC (Normalized Cross-Correlation) algorithm and improved the computational efficiency of NCC algorithm using integral image. Furthermore, we developed a triangulation-based outlier removal algorithm to extract more robust matching points among the initial matching points. In order to evaluate the performance of the propose method, our method was quantitatively compared with existing image matching approaches. Experimental results demonstrated that the proposed method can process 2.57 frames per second for video image matching and is up to 4 times faster than existing methods. The proposed method therefore has a good potential for the various video-based applications that requires image matching as a pre-processing.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.143-146
• /
• 1996

In this paper, we propose a hopfield model for solving the part-matching which is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and net total path of part-connection. Therefore, this kind of problem is referred to as a combinatorial optimization problem. First of all, we review the theoretical basis for hopfield model to optimization and present two method of part-matching; Traveling Salesman Problem (TSP) and Weighted Matching Problem (WMP). Finally, we show demonstration through computer simulation and analyzes the stability and feasibility of the generated solutions for the proposed connection methods.