• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.613-617
• /
• 1990

This paper presents a method of calculating the position and orientation of a polyhedron arbitrarily placed in 3-D space using two cameras. We use key feature of the object and CAD data to solve the correspondence problem between two cameras' images.

• 대한수학회보
• /
• 제54권5호
• /
• pp.1577-1596
• /
• 2017

We study contraction of points on ${\mathbb{P}}^1({\bar{\mathbb{Q}}})$ with certain control on local ramification indices, with application to the unramified curve correspondence problem initiated by Bogomolov and Tschinkel.

• 대한전자공학회논문지SP
• /
• 제46권6호
• /
• pp.58-67
• /
• 2009

대응점 정합은 컴퓨터 비전에서 중요한 작업 중에 하나지만 스케일, 조명, 시점이 변한 환경에서 대응점을 찾는 과정은 매우 어렵다. 대응점 정합 알고리즘인 SURF(Speeded Up Robust Features) 기법은 SIFT(Scale Invariant Feature Transform) 기법에 비해 정합 속도가 매우 빠르고 비슷한 정합 성능을 보여 널리 사용되고 있다. 하지만 SURF 기법은 흑백 영상과 지역 공간정보를 사용하기 때문에 유사한 패턴이 존재하는 영상에서 대응점의 정합 성능이 매우 떨어진다. 이런 문제점을 해결하기 위해 본 논문에서는 강인한 컬러 특징 정보와 광역적 특징 정보를 이용하는 확장 SURF 알고리즘을 제안한다. 제안하는 알고리즘은 비슷한 패턴이 존재하더라도 색상정보과 광역 공간 정보를 추가로 사용되기 때문에 대응점 매칭 성능을 크게 향상시킨다. 본 논문에서는 제안하는 방법의 우수성을 조명과 시점이 변화하고 유사한 패턴들을 갖는 영상들에 적용하여 기존의 방법들과 비교 실험함으로서 입증하였다.

• 대한기계학회논문집A
• /
• 제27권5호
• /
• pp.697-704
• /
• 2003

In this paper, the visual tracking system for arbitrary shaped moving object is proposed. The established tracking system can be divided into model based method that needs previous model for target object and image based method that uses image feature. In the model based method, the reliable tracking is possible, but simplification of the shape is necessary and the application is restricted to definite target mod el. On the other hand, in the image based method, the process speed can be increased, but the shape information is lost and the tracking system is sensitive to image noise. The proposed tracking system is composed of the extraction process that recognizes the existence of moving object and tracking process that extracts dynamic characteristics and shape information of the target objects. Specially, active contour model is used to effectively track the object that is undergoing shape change. In initializatio n process of the contour model, the semi-automatic operation can be avoided and the convergence speed of the contour can be increased by the proposed effective initialization method. Also, for the efficient solution of the correspondence problem in multiple objects tracking, the variation function that uses the variation of position structure in image frame and snake energy level is proposed. In order to verify the validity and effectiveness of the proposed tracking system, real time tracking experiment for multiple moving objects is implemented.

• Management Science and Financial Engineering
• /
• 제14권2호
• /
• pp.1-12
• /
• 2008

This study explores several donor location strategies and discusses experiment results, which contributes to the saving of time and effort required in designing data fusion processes. In particular, three concepts are introduced. The Mahalanobis distance is applied to locate the nearest neighbors more effectively; which incorporates the covariance structure of attributes. The ideal point helps reduce the dimensionality problem that arises in conjoint-type experiments. The correspondence analysis is used to derive the coordinates from non-metric attributes. The Monte Carlo simulation results show that the proposed donor location strategies provide better fusion performance, compared to the currently-in-use methods.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(4)
• /
• pp.13-16
• /
• 2000

This paper presents a robust method to combine a collection of images with small fields of view to obtain an image with a large field of view. In the previous works, there are two main areas which one is a cross correlation-based method and the other is a feature-based method. The former is based on motion estimation from video sequences. so there are a problem on rotating a camera about optical axis. In the latter method, it is difficult to match correspondence feature points correctly.'re find correct correspondences, we proposed the geometrical feature model and correspondence filters and the Gaussian distribution weight function to blend the images smoothly. The experiments show that our method is robust and effective.

• 전자공학회논문지B
• /
• 제32B권10호
• /
• pp.1305-1313
• /
• 1995

In this paper, we propose a robust estimation of camera parameters from image sequence for high quality video composition. We first establish correspondence of feature points between consecutive image fields. After the establishment, we formulate a nonlinear least-square data fitting problem. When the image sequence contains moving objects, and/or when the correspondence establishment is not successful for some feature points, we get bad observations, outliers. They should be properly eliminated for a good estimation. Thus, we propose an iterative algorithm for rejecting the outliers and fitting the camera parameters alternatively. We show the validity of the proposed method using computer generated data sets and real image sequeces.

• 대한전기학회논문지
• /
• 제41권4호
• /
• pp.411-421
• /
• 1992

In the conventional track while scan (TWS) system, there are two major functions to be performed : detection and tracking. These two functions are normally designed and optimised independently. So TWS algorithm ignores the available decision features that can help in resolving the plot-to-track association ambiguity. Therefore conventional TWS system cna't track the targets in a densed multi-target environment. This paper presents a new TWS algorithm for multi-target track to solve the existing TWS system problem in clutter environment. The algorithm proposed in this paper is derived by modifying the part of joint probabilistic data association (JPDA) algotithm to get the one to one correspondence instead of multiple correspondence and combined with maneuvering detection logic so that it could also track the low maneuvering targets. Simulations to confirm the performance are done in crossing, parallel and maneuvering target. The proposed algorithm was successfully tracking targets above target situations.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 하계학술대회 논문집 B
• /
• pp.1251-1253
• /
• 1996

The vision processing system for mobile robots requires real time processing and reliability for the purpose of safe navigation. But, general types of vision systems are not appropriate owing to the correspondence problem which correlates the points out of two images. To determine the obstacle area, we use correspondences of line segments between two perspective images sequentially acquired by camera. To simplify the correspondence, the matching of line segments are performed in the navigation space, based on the assumption that mobile robot should be navigated in the flat surface and the motion of mobile robot between two frames should be approximately known.

• International Journal of CAD/CAM
• /
• 제8권1호
• /
• pp.21-28
• /
• 2009

In the present work, an attempt has been made to construct branching surface from 2-D contours, which are given at different layers and may have branches. If a layer having more than one contour and corresponds to contour at adjacent layers, then it is termed as branching problem and approximated by adding additional points in between the layers. Firstly, the branching problem is converted to single contour case in which there is no branching at any layer and the final branching surface is obtained by skinning. Contours are constructed from the given input points at different layers by energy-based B-Spline approximation. 3-D curves are constructed after adding additional points into the contour points for all the layers having branching problem by using energy-based B-Spline formulation. Final 3-D surface is obtained by skinning 3-D curves and 2-D contours. There are three types of branching problems: (a) One-to-one, (b) One-to-many and (c) Many-to-many. Oneto-one problem has been done by plethora of researchers based on minimizations of twist and curvature and different tiling techniques. One-to-many problem is the one in which at least one plane must have more than one contour and have correspondence with the contour at adjacent layers. Many-to-many problem is stated as m contours at i-th layer and n contours at (i+1)th layer. This problem can be solved by combining one-to-many branching methodology. Branching problem is very important in CAD, medical imaging and geographical information system(GIS).