• 한국측량학회:학술대회논문집
• /
• 한국측량학회 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.

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

• 로봇학회논문지
• /
• 제6권3호
• /
• pp.247-254
• /
• 2011

This paper presents a method of sonar grid map matching for topological place recognition. The proposed method provides an effective rotation invariant grid map matching method. A template grid map is firstly extracted for reliable grid map matching by filtering noisy data in local grid map. Using the template grid map, the rotation invariant grid map matching is performed by Ring Projection Transformation. The rotation invariant grid map matching selects candidate locations which are regarded as representative point for each node. Then, the topological place recognition is achieved by calculating matching probability based on the candidate location. The matching probability is acquired by using both rotation invariant grid map matching and the matching of distance and angle vectors. The proposed method can provide a successful matching even under rotation changes between grid maps. Moreover, the matching probability gives a reliable result for topological place recognition. The performance of the proposed method is verified by experimental results in a real home environment.

• 제어로봇시스템학회논문지
• /
• 제18권3호
• /
• pp.208-217
• /
• 2012

This paper presents two adaptive fingerprint matching methods. First, we experiment an adaptive threshold selection of 1:N matching system in order to raise the reliability of the matching score. Second, we propose a adaptive threshold selection using fitting algorithm for high speed matching. The experiment was conducted on the NITZEN database, which has 5247 samples. Consequently, this paper shows that our suggested method can perform 1.88 times faster matching speed than the bidirectional matching speed. And, we prove that FRR of our suggested method decreases 1.43 % than that of the unidirectional matching.

• 대한원격탐사학회지
• /
• 제13권2호
• /
• pp.121-132
• /
• 1997

본 논문에서는 위성영상으로부터 수치표고모형 추출을 목적으로 하는 영상정합 알고리즘 의 개발에 관하여 기술한다. 개발된 알고리즘은 주어진 목적에 맞추어 비선형 최소자승법에 기초 한 영역정합방식에 기초하였으나 새롭게 정의된 정합구역을 이용함으로써 기존의 정합방식보다 향상된 정합 수행속도를 가진다. 이 정합 알고리즘은 정합수행 모듈, 정합조절 모듈, 정합최적화 모듈로 구성되어 있으며 각각의 기능에 대하여 기술한다. 또한 제안된 알고리즘의 성능을 정합 가능도, 수행 속도, 정합 수렴 반경 등을 이용하여 정량적으로 분석한다.

• 전자공학회논문지B
• /
• 제29B권8호
• /
• pp.44-53
• /
• 1992

In this paper, a matching method is proposed to improve the correct matching rate in stereo correspondence matching in which the fingerprint of zero-crossing points on the scale-space is used as the robust matching feature. The dynamic programming, which is appropriate for the fingerprint feature, is introduced for correspondence matching. We also improve the matching rate by using the post-processing for correcting mismatched points. In simulation, we apply the proposed algorithm to the synthetic and real images and obtain good matching results.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 G
• /
• pp.2225-2227
• /
• 1998

An efficient stereo matching method with variable matching weights is proposed. The edge segment-based stereo matching has been shown to be efficient method. The method includes 5 matching factor with different weights. The ordinary matching weights are not always adequate for every image. Employing different weight sets depending on the complexity shows better matching performance. In this paper, an evaluation criterion for complexity is suggested and the experimental results with the proposed method is shown.

• 정보과학회 논문지
• /
• 제42권10호
• /
• pp.1280-1285
• /
• 2015

고속 정규표현식 매칭을 수행하기 위한 여러 종류의 정규표현식 매칭 하드웨어 구조가 연구되었다. 특히 프로그램과 같이 패턴의 갱신이 쉽도록 범용 프로세서와 유사한 방식으로 정규표현식 매칭을 수행하는 ReCPU와 SMPU와 같은 정규표현식 프로세서가 연구되었다. 그렇지만 기존의 정규표현식 프로세서들은 문자클래스 매칭을 위한 별도의 기능을 제공하지 않아서 문자클래스 처리에 비효율적이다. 본 논문에서는 문자클래스 매칭을 지원하는 정규표현식 매칭 프로세서의 명령어 집합을 제시하고, 이에 대한 프로세서 구조를 설계 구현한다. 제시된 프로세서는 문자클래스, 문자 범위와 부정 문자클래스 처리 기능을 포함하고 있어서 문자클래스 매칭을 매우 효율적으로 처리할 수 있다.

• 인터넷정보학회논문지
• /
• 제12권3호
• /
• pp.69-76
• /
• 2011

온라인 중개 서비스 시스템에서 원하는 고객을 상호 매칭시키는 기능은 핵심 역할 중의 하나이다. 매칭은 정보검색과 같이 한쪽의 의사만으로 결정되는 단방향과, 양쪽 사용자의 의사를 모두 고려하는 양방향 방식이 있다. 기존의 양방향 방식은 사용자가 상대에 대한 관심을 직접 입력하여야 하므로 입력의 번거로움 뿐만 아니라 상대가 나에 대해 관심을 입력하지 않은 경우는 서비스 활용이 어렵다는 문제점이 있었다. 따라서 본 연구는 퍼지 알고리즘을 이용하여 시스템이 상대의 흥미를 자동으로 계산하도록 하여 양방향 방식을 자동화 하고자한다. 개발된 퍼지 알고리즘의 구인/구직 정보매칭 결과가 모두 95%이상의 취업알선가능률을 보였다. 또한 실 서비스에 구축하여 도입효과를 분석한 결과 취업활동 동기 부여에 통계적으로 유의미한 긍정적인 효과가 나타났다.

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