• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.3177-3195
• /
• 2014

In many moving object detection problems of an aerial video, accurate and robust stabilization is of critical importance. In this paper, a novel accurate image alignment algorithm for aerial electronic image stabilization (EIS) is described. The feature points are first selected using optimal derivative filters based Harris detector, which can improve differentiation accuracy and obtain the precise coordinates of feature points. Then we choose the Delaunay Triangulation edges to find the matching pairs between feature points in overlapping images. The most "useful" matching points that belong to the background are used to find the global transformation parameters using the projective invariant. Finally, intentional motion of the camera is accumulated for correction by Sage-Husa adaptive filtering. Experiment results illustrate that the proposed algorithm is applied to the aerial captured video sequences with various dynamic scenes for performance demonstrations.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.689-692
• /
• 1998

Matching two images is an essential step for many computer vision applications. A new approach to the scale and rotation invariant scene matching is presented. A set of andidate parameters are hypthesized by mapping the angular difference and a new distance measure to the hough space and by detecting maximally consistent points. The proposed method is shown to be much faster than the conventinal one where the relaxation process is repeated until convergence, while providing robust matching performance, without a priori information on the geometrical transformation parameters.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.859-863
• /
• 1993

There are two methods to get 3-dimensional information by matching image pair feature-based matching and area-based matching. One of the problems in the area-based matching is how the optimal search region which gives accurate correlation between given point and its neighbors can be selected. In this paper, we proposed a new area-based matching algorithm which uses edge-features used in the conventional feature-based matching. It first selects matching candidates by feature-based and matches image pair with area-based method by taking these candidates as guidance to decision of search area. The results show that running time is reduced by optimizing search area(considering edge points and continuity of disparity), keeping on the precision as the conventional area-based matching method.

• 전자공학회논문지B
• /
• 제32B권1호
• /
• pp.39-49
• /
• 1995

Stereo vision is useful to obtain three dimensional depth information from two images taken from different view points. In this paper, we reduce searching area for correspondence by using the intra-scanline constraint, and utilize the inter-scanline constraint and the property of disparity continuity among the neighboring pixels for relaxation. Nodes with 3-D stucture are located on the axes of two views, and have matching possibility of correspondent pixels of two images. A matching is accepted if a node at the intersection of the disparity axes has the greatest matching possibility. Otherwise, the matching possibility of the node is updated by relaxation with the cooperation of neighboring nodes. Further relaxation with competition of two views is applied to a matching possibility of randomly selected node. The consensus of two views increases the confidence of matching, and removes a blurring phenomenon on the discontinuity of object. This approach has been tested with various types of image such as random dot stereogram and aerial image, and the experimental results show good matching performance.

• 대한전자공학회논문지SP
• /
• 제41권6호
• /
• pp.9-18
• /
• 2004

본 논문에서 우리는 시차공간영상 (disparity space image)을 이용한 새로운 스테레오 정합 방법을 제안한다. 본 논문에서는 실측 제어점 대신 영상 안에서 특징점을 추출하여 정합영역을 설정하였고, 간단한 비용행렬을 정의하였다. 그리고 정합 속도를 증가시키기 위해 화소 단위의 정합을 이용하였다. 화소 단위의 정합은 정합 속도는 향상시키지만, 주변 영역을 이용하지 않기 때문에 정합의 정확성이 낮아진다. 이러한 단점을 보완하기 위해 시차공간영상의 특성을 이용하여 정합경로를 확대시켜서 주변 영역을 최대한 이용하였다. 또한, 현재 위치에서 이전과 이후의 시차공간영상을 체적화하여 전후의 시차공간영상을 이용함으로써 정합의 정확도를 더욱 향상시키는 정합 보정 모듈을 추가하였다. 본 논문에서 제안된 알고리즘은 다양한 영상에 적용하여 실험하였고, 그 결과 제안된 방법의 우수한 성능을 확인할 수 있었다.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2006년도 춘계학술발표회 논문집
• /
• pp.181-185
• /
• 2006

Image co-registration is the process of overlaying two images of the same scene, one of which represents a reference image, while the other is geometrically transformed to the one. In order to improve efficiency and effectiveness of the co-registration approach, the author proposed a pre-qualified area matching algorithm which is composed of feature extraction with canny operator and area matching algorithm with cross correlation coefficient. For refining matching points, outlier detection using studentized residual was used and iteratively removes outliers at the level of three standard deviation. Throughout the pre-qualification and the refining processes, the computation time was significantly improved and the registration accuracy is enhanced. A prototype of the proposed algorithm was implemented and the performance test of 3 Landsat images of Korea showed: (1) average RMSE error of the approach was 0.436 Pixel (2) the average number of matching points was over 38,475 (3) the average processing time was 489 seconds per image with a regular workstation equipped with a 3 GHz Intel Pentium 4 CPU and 1 Gbytes Ram. The proposed approach achieved robustness, full automation, and time efficiency.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2001년도 추계학술대회논문집 I
• /
• pp.155-160
• /
• 2001

Actual engineering structure is frequently very complex, and parts of structure are designed independently by different engineers. Also each structure contains so many degree of freedom. For these reason, methods have been developed which permits the structure to be divided into components or substructures, with analysis being done on a small substructure in order to obtain a full structural system. In such case, because of different mesh size among finite element model (FEM) or different matching points among FEM models and experimentally obtained models, their interfacing points may be non-matching. Solving this non-matching problem is useful to other application such as structural dynamic modification or model updating. In this work, virtual node concept is introduced. Lagrange multipliers are used to enforce the interface compatibility constraint, and interface displacement is approximated by polynomial presentation. The governing equation of whole structure is derived using hybrid variational principle. The eigenvalue of whole structure are calculated using the determinant search method. The number of degree of freedom in the eigenvalue problem can be drastically reduced to just the number of interface degree of freedom. Some numerical simulation is performed to show usefulness of synthesis method.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2002년도 Proceedings of International Symposium on Remote Sensing
• /
• pp.40-44
• /
• 2002

Precision correction is the process of geometrically aligning images to a reference coordinate system using GCPs(Ground Control Points). Many applications of remote sensing data, such as change detection, mapping and environmental monitoring, rely on the accuracy of precision correction. However it is a very time consuming and laborious process. It requires GCP collection, the identification of image points and their corresponding reference coordinates. At typical satellite ground stations, GCP collection requires most of man-powers in processing satellite images. A method of automatic registration of satellite images is demanding. In this paper, we propose a new algorithm for automatic precision correction by GCP chips and RANSAC(Random Sample Consensus). The algorithm is divided into two major steps. The first one is the automated generation of ground control points. An automated stereo matching based on normalized cross correlation will be used. We have improved the accuracy of stereo matching by determining the size and shape of match windows according to incidence angle and scene orientation from ancillary data. The second one is the robust estimation of mapping function from control points. We used the RANSAC algorithm for this step and effectively removed the outliers of matching results. We carried out experiments with SPOT images over three test sites which were taken at different time and look-angle with each other. Left image was used to select UP chipsets and right image to match against GCP chipsets and perform automatic registration. In result, we could show that our approach of automated matching and robust estimation worked well for automated registration.

• 한국지능시스템학회논문지
• /
• 제26권6호
• /
• pp.505-510
• /
• 2016

본 논문은 모바일 로봇의 SLAM(Simultaneous Localization and Mapping) 구현 시 사용되는 스캔매칭을 위한 회전오차에 강인한 대응점 탐색 기법을 제시한다. 많은 모바일 로봇의 연구에 차동구동방식의 구동부가 사용되는데, 이는 곡선 주행이나 제자리 회전을 위해 두 모터의 속력을 다르게 하거나, 반대 방향으로 제어하게 된다. 이러한 경우 직선 주행에 비해 비교적 바퀴의 미끄러짐 현상(Wheel Slip)을 심화시켜 모바일 로봇의 누적 위치 오차를 증가시키는 요인이 된다. 따라서 본 논문에서는 모바일 로봇의 회전 반경을 기반으로 최근접점을 추출하는 대응점 탐색 기법을 통해 스캔매칭 성능을 향상시키고자 한다. 제안된 방법의 검증을 위해 LRF(Laser Range Finder)를 이용해 실험을 진행하였으며, 기존 알고리즘에 주로 적용되는 유클리디안 최근접점 기반의 대응점 탐색 알고리즘과 비교한 결과, 제안된 대응점 탐색 기법이 보다 정확하게 대응점 집합을 추출하는 것을 확인했다.

• 대한원격탐사학회지
• /
• 제8권1호
• /
• pp.15-26
• /
• 1992

This paper describes an implementation of adaptive stereo matching for DBM generation. The matching method of two stereo satellite images to find corresponding points used in this paper is area-based matching, which is usually used in the field of making DBM. Same window size and search area used as in the conventional matching methods and we propose adaptive stereo matching algorithm in this paper. We cluster three areas which are consist of mountainous areas, cultivated areas and cities, and rivers and lakes by using proposed linear feature extracting method. These classified areas are matched by adaptive window size and search area, but rivers and lakes is excluded in this experiment. The matching time is three times faster than conventional methods.