• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.96-99
• /
• 1987

In the way of perception and depth finding of 3-D scene stereo vision is one of the best ways. Matching is important problem of stereo vision. In this paper we develop an algorithm that is adaptable to errors and computation time. And we demonstrate the way of matching.

• 디지털융복합연구
• /
• 제11권12호
• /
• pp.353-359
• /
• 2013

웹 서비스의 검색방법은 기능적인 측면만 고려하여 사용자가 원하는 서비스 검색에 대한 한계가 있다. 본 연구에서는 기능적인 면을 고려한 웹 서비스에서의 문제점을 개선시키기 위해 웹 서비스의 WSDL과 매칭정보를 이용하여 기능적인 부분과 비 기능적인 면을 고려한 서비스 선정 방법을 제시한다. 본 연구에서는 웹 서비스 클라이언트들이 서비스 선정 시 클라이언트가 정의한 매칭정보를 만족하는 클라이언트 측면을 고려한 최적의 서비스 선정을 할 수 있도록 서비스 선정 방법에 대한 아키텍처와 선정 프로세스를 연구하고 웹 서비스 선정 프로세스에서 제공되는 기능적인 요구의 매칭뿐만 아니라 클라이언트 요구도 수용할 수 있는 매칭정보를 고려한 최적의 서비스 선정 방법을 연구한다. 본 연구에서는 제안한 매칭정보 추출 및 선정프로세스를 이용하여 사용자 중심의 비 기능적인 측면을 고려한 웹 서비스를 이용할 수 있어 사용자가 원하는 품질을 제공하는 서비스를 제공 받을 수 있도록 최적의 서비스를 제공 할 수 있다.

• 제어로봇시스템학회논문지
• /
• 제13권1호
• /
• pp.52-57
• /
• 2007

In this paper we proposed multi-directional matching windows combined by multi-dimensional feature vector matching, which uses not only intensity values but also multiple feature values, such as variance, first and second derivative of pixels. Multi-dimensional feature vector matching has the advantage of compensating the drawbacks of area-based stereo matching using one feature value, such as intensity. We define matching cost of a pixel by the minimum value among eight multi-dimensional feature vector distances of the pixels expanded in eight directions having the interval of 45 degrees. As best stereo matches, we determine the two points with the minimum matching cost within the disparity range. In the experiment we used aerial imagery and IKONOS satellite imagery and obtained more accurate matching results than that of conventional matching method.

• 전자공학회논문지B
• /
• 제31B권4호
• /
• pp.1-8
• /
• 1994

In this paper, we propose an efficient two-step pattern matching method which promises shape distortion-tolerant recognition of handwritten of handwritten Hangul syllables. In the first step, nonlinear shape normalization is carried out to compensate for global shape distortions in handwritten characters, then a preliminary classification based on simple pattern matching is performed. In the next step, nonlinear pattern matching which achieves best matching between input and reference pattern is carried out to compensate for local shape distortions, then detailed classification which determines the final result of classification is performed. As the performance of recognition systems based on pattern matching methods is greatly effected by the quality of reference patterns. we construct reference patterns by combining the proposed nonlinear pattern matching method with a well-known averaging techniques. Experimental results reveal that recognition performance is greatly improved by the proposed two-step pattern matching method and the reference pattern construction scheme.

• 한국정보통신학회논문지
• /
• 제15권9호
• /
• pp.2007-2012
• /
• 2011

블록정합에서 방대한 계산을 줄이기 위해, 본 논문은 탐색영역에서 탐색점을 제한하는 고속 블록정합 알고리즘을 제안한다. 대부분의 움직임 벡터가 탐색영역 중심부에 위치하고, 정합오차가 최적의 유사블록을 향해 단조감소한다는 사실에 근거하여 제안된 알고리즘은 단계 사이에 정합패턴을 1 화소 단위로 이동하고, 이전 단계들에서 결정된 유사블록들로부터 최적의 유사블록을 향한 움직임을 예측하고, 탐색점들의 움직임을 움직임 방향에 대해 ${\pm}45^{\circ}C$로 제한한다. 그 결과 불필요한 탐색점을 제거할 수 있었고 블록정합 계산을 줄일 수 있었다. 기존 유사 고속 알고리즘과 비교하여 제안된 알고리즘은 큰 움직임을 갖는 영상에서 미미한 화질 저하를 발생시키지만 보통 움직임을 갖는 영상에서 동등한 화질을 유지하고, 반면에 그들의 블록정합 계산을 적게는 20% 많게는 67%를 줄여 주었다.

• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.339-344
• /
• 2007

The relationships between binding number and fractional edge (vertex)-deletability or fractional k-extendability of graphs are studied. Furthermore, we show that the result about fractional vertex-deletability are best possible.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 1994년도 춘계학술대회 논문집
• /
• pp.9-12
• /
• 1994

Epoxy-Ceramic Composite have good insulating, therma1 and mechanical properties, so it is studied actively on this material. In this thesis, we made a composite material b)\ulcorner filling Epoxy Resin with ceramics treated with Sillane Coupling Agent and studied dielectric and insulating characteristics according to treatment density of Sillane Coupling Agent and weight percent of filler. As a result, loss tangent increase and electrical breakdown voltage decrease according to increasing treatment density of sillane coupling agent because Interface matching between matrix and filler is not good. The best treatment density of sillane coupling agent is 0.5% water solution, in this density the best interface matching is achieved so good dielectric and insulation characteristics are shown. Dielectric and insulation characteristics according to weight percent of filler are best at 25wt.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.224-241
• /
• 2015

Multiview plus depth (MVD) videos are widely used in free-viewpoint TV systems. The best-known technique to determine depth information is based on stereo vision. In this paper, we propose a novel local stereo matching algorithm which is radiometric invariant. The key idea is to use a combined matching cost of intensity and gradient based similarity measure. In addition, we realize an adaptive cost aggregation scheme by constructing an adaptive support window for each pixel, which can solve the boundary and low texture problems. In the disparity refinement process, we propose a four-step post-processing technique to handle outliers and occlusions. Moreover, we conduct stereo reconstruction tests to verify the performance of the algorithm more intuitively. Experimental results show that the proposed method is effective and robust against local radiometric distortion. It has an average error of 5.93% on the Middlebury benchmark and is compatible to the state-of-art local methods.

• 한국정밀공학회지
• /
• 제33권2호
• /
• pp.129-138
• /
• 2016

This paper presents a natural corners-based SLAM (Simultaneous Localization and Mapping) with a robust data association algorithm in a real unknown environment. Corners are extracted from raw laser sensor data, which are chosen as landmarks for correcting the pose of mobile robot and building the map. In the proposed data association method, the extracted corners in every step are separated into several groups with small numbers of corners. In each group, local best matching vector between new corners and stored ones is found by joint compatibility, while nearest feature for every new corner is checked by individual compatibility. All these groups with local best matching vector and nearest feature candidate of each new corner are combined by partial compatibility with linear matching time. Finally, SLAM experiment results in an indoor environment based on the extracted corners show good robustness and low computation complexity of the proposed algorithms in comparison with existing methods.

• 로봇학회논문지
• /
• 제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.