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

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

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제7권2호
• /
• pp.109-114
• /
• 2007

Fingerprints have been widely used in the biometric authentication because of its performance, uniqueness and universality. Lately, the speed of identification has become a very important aspect in the fingerprint-based security applications. Also, the reliability still remains the main issue in the fingerprint identification. A fast and reliable fingerprint matching algorithm based on the process of the 'self-nonself' discrimination in the biological immune system was proposed. The proposed algorithm is organized by two-matching stages. The 1st matching stage utilized the self-space and MHC detector string set that are generated from the information of the minutiae and the values of the directional field. The 2nd matching stage was made based on the local-structure of the minutiae. The proposed matching algorithm reduces matching time while maintaining the reliability of the matching algorithm.

• 제어로봇시스템학회논문지
• /
• 제17권3호
• /
• pp.248-253
• /
• 2011

This paper proposes the robust matching algorithm for optical images obtained by WSI(White-light Scanning Interferometer) machine. The matching algorithms are divided by two part according to the matching points: algorithm whether the matching points between two images exist or not. Also, after matching the images, we propose the algorithm to smooth the matched image. Finally, we show the effectiveness and feasibility of the proposed method through some experiments.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집B
• /
• pp.706-711
• /
• 2001

This paper represents a relaxation matching algorithm based on global structure constraint satisfaction. Relaxation matching algorithm is a conventional approach to the matching problem. However, we confronted some problems such as null-matching and multi-matching problems by just using the relaxation matching technique. In order to solve the problems, in this paper, the matching problem is regarded as constraint satisfaction problem, and a relaxation matching algorithm is proposed based on global structure constraint satisfaction. The proposed algorithm is applied a landslide picture to show the effectiveness. When the algorithm is processed at landslide inspecting and monitoring system, motion parameters such as displacement area and its direction are computed. Once movement is recognized, displacements are estimated graphically with statistical amount in the image plane. Simulation has been done to prove the proposed algorithm by using time-sequence image of landslide inspection and monitoring system.

• 대한전자공학회논문지
• /
• 제24권4호
• /
• pp.667-674
• /
• 1987

In this paper an effective block matching algorithm is proposed to find the motion vector. There are two approaches to the estimation of the motion vector in MCC (motion compensated coding), i.e., pel(pixel element) recursive algorithm and block matching algorithm. The search algorithm in this paper is based on the block matching method. The advantage of a proposed algorithm using integral projections is the reduction of the computation time. While the conventional block matching methods have to be computed in 2-dimensional arrays, the proposed algorithm using integral projections can be computed in 1-dimensional arrays. In comparison with conventional block matching methods, a computer simulation shows that though the prediction error increases 0.23 db, it is not detectable for human eyes and the average reduction ratio of computation time obtained from the proposed algorithm is about 3-4.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권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.

• Journal of Information Processing Systems
• /
• 제13권2호
• /
• pp.256-267
• /
• 2017

An active research area in computer vision, stereo matching is aimed at obtaining three-dimensional (3D) information from a stereo image pair captured by a stereo camera. To extract accurate 3D information, a number of studies have examined stereo matching algorithms that employ adaptive support weight. Among them, the adaptive census transform (ACT) algorithm has yielded a relatively strong matching capability. The drawbacks of the ACT, however, are that it produces low matching accuracy at the border of an object and is vulnerable to noise. To mitigate these drawbacks, this paper proposes and analyzes the features of an improved stereo matching algorithm that not only enhances matching accuracy but also is also robust to noise. The proposed algorithm, based on the ACT, adopts the truncated absolute difference and the multiple sparse windows method. The experimental results show that compared to the ACT, the proposed algorithm reduces the average error rate of depth maps on Middlebury dataset images by as much as 2% and that is has a strong robustness to noise.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권8호
• /
• pp.335-343
• /
• 2002

A segment matching algorithm in stereo vision via the fusion of multiple features on long edge segments is proposed. One problem of the previous segment matching algorithm is the similarity among the segments caused from its short length. In the proposed algorithm, edges are composed of longer segments which are obtained by breaking the edges only at the locations with distinguished changes of the shape. Such long segments can contain extra features such as curvature ratio and length of segments which could not be included in shorter ones. Use of such additional features enhances the matching accuracy significantly To fuse multiple features for matching, weighting value determination algorithm which is computed according to the degree of the contribution of each factor is proposed. The stereo matching simulations with the proposed algorithm are done about various images and their results are included.

• 한국통신학회논문지
• /
• 제35권7C호
• /
• pp.628-633
• /
• 2010

본 논문은 블록 정합에 크게 기여하는 일부 서브블록들만 사용하는 서브블록 정합 알고리즘을 개선하기 위한 블록 정합 알고리즘을 제안한다. 하나의 서브블록 그룹을 사용하는 기존 알고리즘과 달리 제안된 알고리즘은 두개의 서브블록 그룹을 사용하고 있다. 소 그룹을 이용한 정합은 적은 계산량으로 유사 블록 가능성이 큰 후보 블록들을 선택하고, 선택된 블록에서 대 그룹을 이용해 추가적인 정합은 잘못된 정합을 줄인다. 모의 실험 결과들은 제안된 알고리즘이 기존 알고리즘과 비교하여 같은 계산량에서 항상 높은 화질을 갖는 것을 보이고 있고, 적은 서브블록들을 이용한 정합에서 매우 뛰어난 성능을 갖는 것을 보여주고 있다.

• 로봇학회논문지
• /
• 제17권3호
• /
• pp.373-380
• /
• 2022

This paper considers a method of fast correspondence matching for iterative closest point (ICP) algorithm. In robotics, the ICP algorithm and its variants have been widely used for pose estimation by finding the translation and rotation that best align two point clouds. In computational perspectives, the main difficulty is to find the correspondence point on the reference point cloud to each observed point. Jump-table-based correspondence matching is one of the methods for reducing computation time. This paper proposes a method that corrects errors in an existing jump-table-based correspondence matching algorithm. The criterion activating the use of jump-table is modified so that the correspondence matching can be applied to the situations, such as point-cloud registration problems with highly curved surfaces, for which the existing correspondence-matching method is non-applicable. For demonstration, both hardware and simulation experiments are performed. In a hardware experiment using Hokuyo-10LX LiDAR sensor, our new algorithm shows 100% correspondence matching accuracy and 88% decrease in computation time. Using the F1TENTH simulator, the proposed algorithm is tested for an autonomous driving scenario with 2D range-bearing point cloud data and also shows 100% correspondence matching accuracy.