• Title/Summary/Keyword: ICP(Iterative Closest Point)

Search Result 44, Processing Time 0.022 seconds

Accuracy Evaluation by Point Cloud Data Registration Method (점군데이터 정합 방법에 따른 정확도 평가)

  • Park, Joon Kyu;Um, Dae Yong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.38 no.1
    • /
    • pp.35-41
    • /
    • 2020
  • 3D laser scanners are an effective way to quickly acquire a large amount of data about an object. Recently, it is used in various fields such as surveying, displacement measurement, 3D data generation of objects, construction of indoor spatial information, and BIM(Building Information Model). In order to utilize the point cloud data acquired through the 3D laser scanner, it is necessary to make the data acquired from many stations through a matching process into one data with a unified coordinate system. However, analytical researches on the accuracy of point cloud data according to the registration method are insufficient. In this study, we tried to analyze the accuracy of registration method of point cloud data acquired through 3D laser scanner. The point cloud data of the study area was acquired by 3D laser scanner, the point cloud data was registered by the ICP(Iterative Closest Point) method and the shape registration method through the data processing, and the accuracy was analyzed by comparing with the total station survey results. As a result of the accuracy evaluation, the ICP and the shape registration method showed 0.002m~0.005m and 0.002m~0.009m difference with the total station performance, respectively, and each registration method showed a deviation of less than 0.01m. Each registration method showed less than 0.01m of variation in the experimental results, which satisfies the 1: 1,000 digital accuracy and it is suggested that the registration of point cloud data using ICP and shape matching can be utilized for constructing spatial information. In the future, matching of point cloud data by shape registration method will contribute to productivity improvement by reducing target installation in the process of building spatial information using 3D laser scanner.

ICP based Point Cloud Contents Quality Improvement Method (ICP 기반 포인트 클라우드 콘텐츠 품질 개선 방법)

  • Lee, Heejea;Yun, Junyoung;Kim, Jongwook;Park, Jong-Il
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2020.11a
    • /
    • pp.200-201
    • /
    • 2020
  • 본 논문에서는 ICP (iterative closest points) 기반의 포인트 클라우드 콘텐츠 품질 개선 방법을 제안한다. 포인트 클라우드 콘텐츠는 실제 환경의 물체를 3 차원의 점으로 획득한 실감 콘텐츠이다. 이처럼 3 차원 점으로 구성된 포인트 클라우드 콘텐츠는 영상 확대 또는 포인트 클라우드 획득 및 복원 과정에서 콘텐츠의 품질이 저하될 수 있다. 제안하는 방법은 ICP 알고리즘을 활용히여 이전 프레임과 현재 프레임 상의 포인트 클라우드 위치 사이가 존재하는지 검사하고, 피사체의 움직임에 의해 발생한 프레임 간 차이를 보정하여 콘텐츠의 품질을 향상시켰다.

  • PDF

Automatic Registration Method for Multiple 3D Range Data Sets (다중 3차원 거리정보 데이타의 자동 정합 방법)

  • 김상훈;조청운;홍현기
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.12
    • /
    • pp.1239-1246
    • /
    • 2003
  • Registration is the process aligning the range data sets from different views in a common coordinate system. In order to achieve a complete 3D model, we need to refine the data sets after coarse registration. One of the most popular refinery techniques is the iterative closest point (ICP) algorithm, which starts with pre-estimated overlapping regions. This paper presents an improved ICP algorithm that can automatically register multiple 3D data sets from unknown viewpoints. The sensor projection that represents the mapping of the 3D data into its associated range image is used to determine the overlapping region of two range data sets. By combining ICP algorithm with the sensor projection constraint, we can make an automatic registration of multiple 3D sets without pre-procedures that are prone to errors and any mechanical positioning device or manual assistance. The experimental results showed better performance of the proposed method on a couple of 3D data sets than previous methods.

Development of robot calibration method based on 3D laser scanning system for Off-Line Programming (오프라인 프로그래밍을 위한 3차원 레이저 스캐닝 시스템 기반의 로봇 캘리브레이션 방법 개발)

  • Kim, Hyun-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.3
    • /
    • pp.16-22
    • /
    • 2019
  • Off-line programming and robot calibration through simulation are essential when setting up a robot in a robot automation production line. In this study, we developed a new robot calibration method to match the CAD data of the production line with the measurement data on the site using 3D scanner. The proposed method calibrates the robot using 3D point cloud data through Iterative Closest Point algorithm. Registration is performed in three steps. First, vertices connected by three planes are extracted from CAD data as feature points for registration. Three planes are reconstructed from the scan point data located around the extracted feature points to generate corresponding feature points. Finally, the transformation matrix is calculated by minimizing the distance between the feature points extracted through the ICP algorithm. As a result of applying the software to the automobile welding robot installation, the proposed method can calibrate the required accuracy to within 1.5mm and effectively shorten the set-up time, which took 5 hours per robot unit, to within 40 minutes. By using the developed system, it is possible to shorten the OLP working time of the car body assembly line, shorten the precision teaching time of the robot, improve the quality of the produced product and minimize the defect rate.

Design of a Mapping Framework on Image Correction and Point Cloud Data for Spatial Reconstruction of Digital Twin with an Autonomous Surface Vehicle (무인수상선의 디지털 트윈 공간 재구성을 위한 이미지 보정 및 점군데이터 간의 매핑 프레임워크 설계)

  • Suhyeon Heo;Minju Kang;Jinwoo Choi;Jeonghong Park
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.61 no.3
    • /
    • pp.143-151
    • /
    • 2024
  • In this study, we present a mapping framework for 3D spatial reconstruction of digital twin model using navigation and perception sensors mounted on an Autonomous Surface Vehicle (ASV). For improving the level of realism of digital twin models, 3D spatial information should be reconstructed as a digitalized spatial model and integrated with the components and system models of the ASV. In particular, for the 3D spatial reconstruction, color and 3D point cloud data which acquired from a camera and a LiDAR sensors corresponding to the navigation information at the specific time are required to map without minimizing the noise. To ensure clear and accurate reconstruction of the acquired data in the proposed mapping framework, a image preprocessing was designed to enhance the brightness of low-light images, and a preprocessing for 3D point cloud data was included to filter out unnecessary data. Subsequently, a point matching process between consecutive 3D point cloud data was conducted using the Generalized Iterative Closest Point (G-ICP) approach, and the color information was mapped with the matched 3D point cloud data. The feasibility of the proposed mapping framework was validated through a field data set acquired from field experiments in a inland water environment, and its results were described.

2D Grid Map Compensation Using ICP Algorithm based on Feature Points (특징 점 기반의 ICP 알고리즘을 이용한 2차원 격자지도 보정)

  • Hwang, Yu-Seop;Lee, Dong-Ju;Yu, Ho-Yun;Lee, Jang-Myung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.10
    • /
    • pp.965-971
    • /
    • 2015
  • This paper suggests a feature point-based Iterative Closest Point (ICP) algorithm to compensate for the disparity error in building a two-dimensional map. The ICP algorithm is a typical algorithm for matching a common object in two different images. In the process of building a two-dimensional map using the laser scanner data, warping and distortions exist in the map because of the disparity between the two sensor values. The ICP algorithm has been utilized to reduce the disparity error in matching the scanned line data. For this matching process in the conventional ICP algorithm, pre-known reference data are required. Since the proposed algorithm extracts characteristic points from laser-scanned data, reference data are not required for the matching. The laser scanner starts from the right side of the mobile robot and ends at the left side, which causes disparity in the scanned line data. By finding the matching points between two consecutive frame images, the motion vector of the mobile robot can be obtained. Therefore, the disparity error can be minimized by compensating for the motion vector caused by the mobile robot motion. The validity of the proposed algorithm has been verified by comparing the proposed algorithm in terms of map-building accuracy to conventional ICP algorithm real experiments.

Lane Map-based Vehicle Localization for Robust Lateral Control of an Automated Vehicle (자율주행 차량의 강건한 횡 방향 제어를 위한 차선 지도 기반 차량 위치추정)

  • Kim, Dongwook;Jung, Taeyoung;Yi, Kyong-Su
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.2
    • /
    • pp.108-114
    • /
    • 2015
  • Automated driving systems require a high level of performance regarding environmental perception, especially in urban environments. Today's on-board sensors such as radars or cameras do not reach a satisfying level of development from the point of view of robustness and availability. Thus, map data is often used as an additional data input to support these systems. An accurate digital map is used as a powerful additional sensor. In this paper, we propose a new approach for vehicle localization using a lane map and a single-layer LiDAR. The maps are created beforehand using a highly accurate DGPS and a single-layer LiDAR. A pose estimation of the vehicle was derived from an iterative closest point (ICP) match of LiDAR's intensity data to the lane map, and the estimated pose was used as an observation inside a Kalmanfilter framework. The achieved accuracy of the proposed localization algorithm is evaluated with a highly accurate DGPS to investigate the performance with respect to lateral vehicle control.

A Robust Real-Time Mobile Robot Self-Localization with ICP Algorithm

  • Sa, In-Kyu;Baek, Seung-Min;Kuc, Tae-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2301-2306
    • /
    • 2005
  • Even if there are lots of researches on localization using 2D range finder in static environment, very few researches have been reported for robust real-time localization of mobile robot in uncertain and dynamic environment. In this paper, we present a new localization method based on ICP(Iterative Closest Point) algorithm for navigation of mobile robot under dynamic or uncertain environment. The ICP method is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. We use the method to align global map with 2D scanned data from range finder. The proposed algorithm accelerates the processing time by uniformly sampling the line fitted data from world map of mobile robot. A data filtering method is also used for threshold of occluded data from the range finder sensor. The effectiveness of the proposed method has been demonstrated through computer simulation and experiment in an office environment.

  • PDF

SIFT-Like Pose Tracking with LIDAR using Zero Odometry (이동정보를 배제한 위치추정 알고리즘)

  • Kim, Jee-Soo;Kwak, Nojun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.11
    • /
    • pp.883-887
    • /
    • 2016
  • Navigating an unknown environment is a challenging task for a robot, especially when a large number of obstacles exist and the odometry lacks reliability. Pose tracking allows the robot to determine its location relative to its previous location. The ICP (iterative closest point) has been a powerful method for matching two point clouds and determining the transformation matrix between the maps. However, in a situation where odometry is not available and the robot moves far from its original location, the ICP fails to calculate the exact displacement. In this paper, we suggest a method that is able to match two different point clouds taken a long distance apart. Without using any odometry information, it only exploits the features of corner points containing information on the surroundings. The algorithm is fast enough to run in real time.

A Study on Matching Method of Hull Blocks Based on Point Clouds for Error Prediction (선박 블록 정합을 위한 포인트 클라우드 기반의 오차예측 방법에 대한 연구)

  • Li, Runqi;Lee, Kyung-Ho;Lee, Jung-Min;Nam, Byeong-Wook;Kim, Dae-Seok
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.29 no.2
    • /
    • pp.123-130
    • /
    • 2016
  • With the development of fast construction mode in shipbuilding market, the demand on accuracy management of hull is becoming higher and higher in shipbuilding industry. In order to enhance production efficiency and reduce manufacturing cycle time in shipbuilding industry, it is important for shipyards to have the accuracy of ship components evaluated efficiently during the whole manufacturing cycle time. In accurate shipbuilding process, block accuracy is the key part, which has significant meaning in shortening the period of shipbuilding process, decreasing cost and improving the quality of ship. The key of block accuracy control is to create a integrate block accuracy controlling system, which makes great sense in implementing comprehensive accuracy controlling, increasing block accuracy, standardization of proceeding of accuracy controlling, realizing "zero-defect transferring" and advancing non-allowance shipbuilding. Generally, managers of accuracy control measure the vital points at section surface of block by using the heavy total station, which is inconvenient and time-consuming for measurement of vital points. In this paper, a new measurement method based on point clouds technique has been proposed. This method is to measure the 3D coordinates values of vital points at section surface of block by using 3D scanner, and then compare the measured point with design point based on ICP algorithm which has an allowable error check process that makes sure that whether or not the error between design point and measured point is within the margin of error.