• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.6
• /
• pp.621-626
• /
• 2010

For geometric correction of high-resolution images, the authors matched corresponding objects between a large-scale digital map and a QuickBird image to obtain the coefficients of the first order polynomial. Proximity corrections were performed, using the Boolean operation, to perform automated matching accurately. The modified iterative closest point (ICP) algorithm was used between the point data of the surface linear objects and the point data of the edge objects of the image to determine accurate transformation coefficients. As a result of the automated geometric correction for the study site, an accuracy of 1.207 root mean square error (RMSE) per pixel was obtained.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.5
• /
• pp.443-451
• /
• 2015

In photogrammetry, GCPs (Ground Control Points) have traditionally been used to determine EOPs (Exterior Orientation Parameters) and to produce DEM (Digital Elevation Model). The existing DEM can be used as GCPs, where the observer’s approach is a difficult area, because it is very restrictive to survey in the field. For this, DEM matching should be performed. This study proposed the fusion method using ICP (Iterative Closest Point) and RT (proposed method by Rosenholm and Torlegard, 1988) in order to improve accuracy of the DEM matching. The proposed method was compared to the ICP method to evaluate its usefulness. Pseudo reference DEM with resolution 10m, and modified DEM (random-numbers are added from 0 to 2 at height; scale is 0.9; translation is 100 meters in 3-D axes; rotation is from 10° to 50° from the reference DEM) were used in the experiment. The results proposed accuracy was highest in the matching and absolute orientation. In the case of ICP, according to rotation of the modified DEM being increased, absolute orientation error is increased, while the proposed method generally showed consistent results without increasing the error. The proposed method would be applied to matching when the DEM is modified up to 30° rotation, compared to the reference DEM, based on the results of experiments. In addition when we use Drone, this method can be utilized to identify EOPs or detect 3-D surface deformation from the existing DEM of the inaccessible area.

• Proceedings of the KSRS Conference
• /
• v.1
• /
• pp.500-503
• /
• 2006

To adjust the discrepancy between Light Detection and Ranging (LIDAR) strips, previous researches generally have been conducted using conjugate features, which are called feature-based approaches. However, irrespective of the type of features used, the adjustment process relies upon the existence of suitable conjugate features within the overlapping area and the ability of employed methods to detect and extract the features. These limitations make the process complex and sometimes limit the applicability of developed methodologies because of a lack of suitable features in overlapping areas. To address these drawbacks, this paper presents a methodology using area-based algorithms. This approach is based on the scheme that discrepancies make complex the local height variations of LIDAR data whithin overlapping area. This scheme can be helpful to determine an appropriate transformation for adjustment in the way that minimizes the geographical complexity. During the process, the contour tree (CT) was used to represent the geological characteristics of LIDAR points in overlapping area and the Iterative Closest Points (ICP) algorithm was applied to automatically determine parameters of transformation. After transformation, discrepancies were measured again and the results were evaluated statistically. This research provides a robust methodology without restrictions involved in methods that employ conjugate features. Our method also makes the overall adjustment process generally applicable and automated.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.4
• /
• pp.575-582
• /
• 2013

This paper proposes a map building using the ICP algorithm based robot localization prediction. Proposed method predicts a robot location to dead reckoning, makes a map in the ICP algorithm. Existing method makes a map building and robot position using a sensor value of reference data and current data. In this case, a large interval of the difference of the reference data and the current data is difficult to compensate. The proposed method can map correction through practical experiments.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.1
• /
• pp.43-54
• /
• 2012

This paper presents a new localization technique of an UGV(Unmanned Ground Vehicle) by matching ortho-edge images generated from a DSM (Digital Surface Map) which represents the 3D geometric information of an outdoor navigation environment and 3D range data which is obtained from a LIDAR (Light Detection and Ranging) sensor mounted at the UGV. Recent UGV localization techniques mostly try to combine positioning sensors such as GPS (Global Positioning System), IMU (Inertial Measurement Unit), and LIDAR. Especially, ICP (Iterative Closest Point)-based geometric registration techniques have been developed for UGV localization. However, the ICP-based geometric registration techniques are subject to fail to register 3D range data between LIDAR and DSM because the sensing directions of the two data are too different. In this paper, we introduce and match ortho-edge images between two different sensor data, 3D LIDAR and DSM, for the localization of the UGV. Details of new techniques to generating and matching ortho-edge images between LIDAR and DSM are presented which are followed by experimental results from four different navigation paths. The performance of the proposed technique is compared to a conventional ICP-based technique.

• Journal of the Korea Computer Graphics Society
• /
• v.10 no.4
• /
• pp.27-36
• /
• 2004

본 논문에서는 뇌의 하부구조인 해마를 정확하게 분석하기 위한 형상 정규화 방법과 정상인과 간질 환자의 해마를 분류하기 위한 방법을 제시한다. 해마에 대한 형상 분석 과정은 크게 형상 표현을 구축하는 과정, 형상의 유사도를 측정하는 과정, 정상인 집단과 환자 집단을 분류하는 과정으로 이루어진다. 본 연구에서는 해마의 형상 표현으로 메쉬, 골격, 복셀로 이루어진 하이브리드 옥트리 자료구조를 구축하였다. 또한 Iterative Closest Point (ICP) 알고리즘을 사용하여 해마 골격을 기반으로 한 정규화를 수행하였다. 그리고 정규화된 해마 형상을 전역적, 국부적으로 분석하여 최종적으로 입력된 해마가 정상인 또는 간질 환자에 속하는지를 학습된 데이터를 이용하여 분류하였다. 본 논문에서 제시한 ICP 기반의 정규화 방법은 3차원 해마 형상을 정확하게 분석하게 해주고, 골격의 정점 수를 조절함으로써 정규화 시간을 감소시킬 수 있다. 뿐만 아니라 3차원 해마 모델의 형상을 신경망을 통하여 학습시킴으로써 해마의 형상이 변형된 환자 집단과 정상인 집단을 분류하는데 이용할 수 있다.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.22 no.3
• /
• pp.452-458
• /
• 2013

Over the past several years, many studies have been carried out in the field of 3D data inspection systems. Several attempts have been made to improve the quality of manufactured parts. The introduction of laser sensors for inspection has made it possible to acquire data at a remarkably high speed. In this paper, a robust inspection technique for detecting defects in 3D pressed parts using laser-scanned data is proposed. Point cloud data are segmented for the extraction of features. These segmented features are used for shape matching during the localization process. An iterative closest point (ICP) algorithm is used for the localization of the scanned model and CAD model. To achieve a higher accuracy rate, the ICP algorithm is modified and then used for matching. To enhance the speed of the matching process, aKd-tree algorithm is used. Then, the deviation of the scanned points from the CAD model is computed.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.303-315
• /
• 2007

This paper proposes a 3D structure recovery and registration method that uses four or more common points. For each frame of a given video, a partial structure is recovered using tracked points. The 3D coordinates, camera positions and camera directions are computed at once by our improved scaled orthographic factorization method. The partially recovered point sets are parts of a whole model. A registration of point sets makes the complete shape. The recovered subsets are integrated by transforming each coordinate system of the local point subset into a common basis coordinate system. The process of shape recovery and integration is performed uniformly and linearly without any nonlinear iterative process and without loss of accuracy. The execution time for the integration is significantly reduced relative to the conventional ICP method. Due to the fast recovery and registration framework, our shape recovery scheme is applicable to various interactive video applications. The processing time per frame is under 0.01 seconds in most cases and the integration error is under 0.1mm on average.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.1123-1124
• /
• 2008

In this paper, we develop a program that recognition of the object 3D pose using stereo camera. In order to detect the object, this paper is applied to canny edge detection algorithm and also used stereo camera to get the 3D point about the object and applied to recognize the pose of the object using iterative closest point(ICP) algorithm.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.15-19
• /
• 2001

A dedicated reverse engineering(RE) system for rapid manufacturing of human head in a 3D bust has been developed. The first step in the process is to capture the surface details of a human head and shoulder by three scanners based upon the digital moire fringe technique. Then the multiple scans captured from different angles are aligned and merged into a single polygonal mesh, and the aligned data set is refined by smoothing, subdividing or hole filling process. Finally, the refined data set is sent to a 4-axis computer numerically control(NC) machine to manufacture a replica. In this paper, we mainly describe on the algorithms and software for aligning multiple data sets. The method is based on the recently popular Iterative Closest Point(ICP) algorithm that aligns different polygonal meshes into one common coordinate system. The ICP algorithm finds the nearest positions on one scan to a collection of points on the other scan by minimizing the collective distance between different scans. We also integrate some heuristics into the ICP to enhance the aligning process. A typical example is presented to validate the system and further research work is also discussed.