• Title/Summary/Keyword: ICP algorithm

Search Result 52, Processing Time 0.03 seconds

A Fast Correspondence Matching for Iterative Closest Point Algorithm (ICP 계산속도 향상을 위한 빠른 Correspondence 매칭 방법)

  • Shin, Gunhee;Choi, Jaehee;Kim, Kwangki
    • The Journal of Korea Robotics Society
    • /
    • v.17 no.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.

Human Body Motion Tracking Using ICP and Particle Filter (반복 최근접점와 파티클 필터를 이용한 인간 신체 움직임 추적)

  • Kim, Dae-Hwan;Kim, Hyo-Jung;Kim, Dai-Jin
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.12
    • /
    • pp.977-985
    • /
    • 2009
  • This paper proposes a real-time algorithm for tracking the fast moving human body. Although Iterative closest point (ICP) algorithm is suitable for real-time tracking due to its efficiency and low computational complexity, ICP often fails to converge when the human body moves fast because the closest point may be mistakenly selected and trapped in a local minimum. To overcome such limitation, we combine a particle filter based on a motion history information with the ICP. The proposed human body motion tracking algorithm reduces the search space for each limb by employing a hierarchical tree structure, and enables tracking of the fast moving human bodies by using the motion prediction based on the motion history. Experimental results show that the proposed human body motion tracking provides accurate tracking performance and fast convergence rate.

Coregistration of QuickBird Imagery and Digital Map Using a Modified ICP Algorithm (수정된 ICP알고리즘을 이용한 수치지도와 QuickBird 영상의 보정)

  • Han, Dong-Yeob;Eo, Yang-Dam;Kim, Yong-Hyun;Lee, Kwang-Jae;Kim, Youn-Soo
    • 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.

Region-based ICP algorithm in TKR operation (인공무릎관절 수술에서의 영역기반 ICP 알고리즘)

  • Key Jae-Hong;Lee Moon-Kyu;Lee Chang-Yang;Kim Dong-M.;Yoo Sun-K.;Choi Kui-Won
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.185-186
    • /
    • 2006
  • Image Guided Surgery(IGS) system has been developed to provide exquisite and objective information to surgeons for surgical operation process. It is necessary that registration technique is important to match between 3D image model reconstructed from image modalities and the object operated by surgeon. Majority techniques of registration in IGS system have been used by recognizing fiducial markers placed on the object. However, this method has been criticized due to its invasive protocol inserting fiducial markers in patient's bone. Therefore, shape-based registration technique using geometric characteristics of the object has been invested to improve the limitation of IGS system. During Total Knee Replacement(TKR) operation, it is challenge to register with high accuracy by using shape-based registration because the area to acquire sample data from knee is limited. We have developed region-based 3D registration technique based on anatomical landmarks on the object and this registration algorithm was evaluated in femur model. It was found that region-based algorithm can improve the accuracy in 3D registration. We expect that this technique can efficiently improve the IGS system.

  • PDF

Automatic Matching of Building Polygon Dataset from Digital Maps Using Hierarchical Matching Algorithm (계층적 매칭 기법을 이용한 수치지도 건물 폴리곤 데이터의 자동 정합에 관한 연구)

  • Yeom, Junho;Kim, Yongil;Lee, Jeabin
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.33 no.1
    • /
    • pp.45-52
    • /
    • 2015
  • The interoperability of multi-source data has become more important due to various digital maps, produced from public institutions and enterprises. In this study, the automatic matching algorithm of multi-source building data using hierarchical matching was proposed. At first, we divide digital maps into blocks and perform the primary geometric registration of buildings with the ICP algorithm. Then, corresponding building pairs were determined by evaluating the similarity of overlap area, and the matching threshold value of similarity was automatically derived by the Otsu binary thresholding. After the first matching, we extracted error matching candidates buildings which are similar with threshold value to conduct the secondary ICP matching and to make a matching decision using turning angle function analysis. For the evaluation, the proposed method was applied to representative public digital maps, road name address map and digital topographic map 2.0. As a result, the F measures of matching and non-matching buildings increased by 2% and 17%, respectively. Therefore, the proposed method is efficient for the matching of building polygons from multi-source digital maps.

Georegistration of Airborne LiDAR Data Using a Digital Topographic Map (수치지형도를 이용한 항공라이다 데이터의 기하보정)

  • Han, Dong-Yeob;Yu, Ki-Yun;Kim, Yong-Il
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.3
    • /
    • pp.323-332
    • /
    • 2012
  • An airborne LiDAR system performs several observations on flight routes to collect data of targeted regions accompanying with discrepancies between the collected data strips of adjacent routes. This paper aims to present an automatic error correction technique using modified ICP as a way to remove relative errors from the observed data of strip data between flight routes and to make absolute correction to the control data. A control point data from the existing digital topographic map were created and the modified ICP algorithm was applied to perform the absolute automated correction on the relatively adjusted airborne LiDAR data. Through such process we were able to improve the absolute accuracy between strips within the average point distance of airborne LiDAR data and verified the possibility of automation in the geometric corrections using a large scale digital map.

A reverse engineering system for reproducing a 3D human bust (인체 흉상 복제를 위한 역공학 시스템)

  • 최회련;전용태;장민호;노형민;박세형
    • 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.

  • PDF

Automatic Global Registration for Terrestrial Laser Scanner Data (지상레이저스캐너 데이터의 자동 글로벌 보정)

  • Kim, Chang-Jae;Eo, Yang-Dam;Han, Dong-Yeob
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.28 no.2
    • /
    • pp.281-287
    • /
    • 2010
  • This study compares transformation algorithms for co-registration of terrestrial laser scan data. Pair-wise transformation which is used for transformation of scan data from more than two different view accumulates errors. ICP algorithm commonly used for co-registration between scan data needs initial geometry information. And it is difficult to co-register simultaneously because of too many control points when managing scan at the same time. Therefore, this study perform global registration technique using matching points. Matching points are extracted automatically from intensity image by SIFT and global registration is performed using GP analysis. There are advantages for operation speed, accuracy, automation in suggested global registration algorithm. Through the result from it, registration algorithms can be developed by considering accuracy and speed.

Robust Matching Algorithm for Optical Images (광학 영상의 강인한 정합 알고리즘)

  • Yang, Han-Jin;Joo, Young-Hoon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.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.