Pre-adjustment of positions of point-clouds for the ICP algorithm using IMU and parallel projection

2021 ◽  
Author(s):  
Keigo Tsuda ◽  
Shogo Tokai
Keyword(s):  
Point Clouds ◽  
Parallel Projection ◽  
Icp Algorithm

scholarly journals OICP: An Online Fast Registration Algorithm Based on Rigid Translation Applied to Wire Arc Additive Manufacturing of Mold Repair

Materials ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 1563
Author(s):  
Ruibing Wu ◽  
Ziping Yu ◽  
Donghong Ding ◽  
Qinghua Lu ◽  
Zengxi Pan ◽  
...  
Keyword(s):  
Additive Manufacturing ◽  
Point Cloud ◽  
Point Clouds ◽  
Iterative Closest Point ◽  
Multiple Point ◽  
Icp Algorithm ◽  
Registration Algorithm ◽  
Cloud Models ◽  
Comparison Results ◽  
Wire Arc Additive Manufacturing

As promising technology with low requirements and high depositing efficiency, Wire Arc Additive Manufacturing (WAAM) can significantly reduce the repair cost and improve the formation quality of molds. To further improve the accuracy of WAAM in repairing molds, the point cloud model that expresses the spatial distribution and surface characteristics of the mold is proposed. Since the mold has a large size, it is necessary to be scanned multiple times, resulting in multiple point cloud models. The point cloud registration, such as the Iterative Closest Point (ICP) algorithm, then plays the role of merging multiple point cloud models to reconstruct a complete data model. However, using the ICP algorithm to merge large point clouds with a low-overlap area is inefficient, time-consuming, and unsatisfactory. Therefore, this paper provides the improved Offset Iterative Closest Point (OICP) algorithm, which is an online fast registration algorithm suitable for intelligent WAAM mold repair technology. The practicality and reliability of the algorithm are illustrated by the comparison results with the standard ICP algorithm and the three-coordinate measuring instrument in the Experimental Setup Section. The results are that the OICP algorithm is feasible for registrations with low overlap rates. For an overlap rate lower than 60% in our experiments, the traditional ICP algorithm failed, while the Root Mean Square (RMS) error reached 0.1 mm, and the rotation error was within 0.5 degrees, indicating the improvement of the proposed OICP algorithm.

Point Clouds Registration by Using Depth Images

2014 ◽  
Vol 513-517 ◽  
pp. 4193-4196
Author(s):  
Wen Bao Qiao ◽  
Ming Guo ◽  
Jun Jie Liu
Keyword(s):  
Point Cloud ◽  
Point Clouds ◽  
Scale Space ◽  
Target Object ◽  
Icp Algorithm ◽  
Depth Images ◽  
Curvature Scale Space ◽  
Initial Location ◽  
Characteristic Points

In this paper, we propose an efficient way to produce an initial transposed matrix for two point clouds, which can effectively avoid the drawback of local optimism caused by using standard Iterative Closest Points (ICP)[ algorithm when matching two point clouds. In our approach, the correspondences used to calculate the transposed matrix are confirmed before the point cloud forms. We use the depth images which have been carefully target-segmented to find the boundaries of the shapes that reflect different views of the same target object. Then each contour is affected by curvature scale space (CSS)[ method to find a sequence of characteristic points. After that, our method is applied on these characteristic points to find the most matching pairs of points. Finally, we convert the matched characteristic points to 3D points, and the correspondences are there being confirmed. We can use them to compute an initial transposed matrix to tell the computer which part of the first point cloud should be matched to the second. In this way, we put the two point clouds in a correct initial location, so that the local optimism of ICP and its variations can be excluded.

scholarly journals A framework for non-ICP lidar-based pose estimation using an optimally constrained 3D target

2021 ◽  
Author(s):  
Pierre Saint-Cyr
Keyword(s):  
Pose Estimation ◽  
Full Range ◽  
Point Clouds ◽  
Initial Guess ◽  
Measurement Noise ◽  
Lidar Data ◽  
Lidar Measurement ◽  
Camera System ◽  
Icp Algorithm ◽  
Scan Data

This thesis describes a non-ICP-based framework fohr [sic] the computation of a pose estimate of a special target shape from raw LIDAR scan data. In previous work, an ideal unambiguously-shaped 3D target (the Reduced Ambiguity Cuboctahedron, or RAC) was designed for use in LIDAR-based pose estimation. The RAC was designed to be used in an ICP algorithm, without an initial guess at the pose. This property is, however, not robust to LIDAR measurement noise and data artefacts. The pose estimation technique described in the present work is based upon the geometric non-ambiguity criteria used originally to design the target, and is robust to the aforementioned LIDAR data characteristics. This technique has been tested using simulated point clouds representing a full range of views of the RAC. The technique has been validated using real LIDAR scans of the RAC, generated at Neptec's Ottawa facility with their Laser Camera System (LCS). Experimental results using LCS data show that pose estimates can be generated with mean errors (relative to ICP) of 1.03 [deg] and 1.08 [mm], having standard deviations of 0.56 [deg] and 0.67 [mm] respectively.

scholarly journals A framework for non-ICP lidar-based pose estimation using an optimally constrained 3D target

2021 ◽  
Author(s):  
Pierre Saint-Cyr
Keyword(s):  
Pose Estimation ◽  
Full Range ◽  
Point Clouds ◽  
Initial Guess ◽  
Measurement Noise ◽  
Lidar Data ◽  
Lidar Measurement ◽  
Camera System ◽  
Icp Algorithm ◽  
Scan Data

This thesis describes a non-ICP-based framework fohr [sic] the computation of a pose estimate of a special target shape from raw LIDAR scan data. In previous work, an ideal unambiguously-shaped 3D target (the Reduced Ambiguity Cuboctahedron, or RAC) was designed for use in LIDAR-based pose estimation. The RAC was designed to be used in an ICP algorithm, without an initial guess at the pose. This property is, however, not robust to LIDAR measurement noise and data artefacts. The pose estimation technique described in the present work is based upon the geometric non-ambiguity criteria used originally to design the target, and is robust to the aforementioned LIDAR data characteristics. This technique has been tested using simulated point clouds representing a full range of views of the RAC. The technique has been validated using real LIDAR scans of the RAC, generated at Neptec's Ottawa facility with their Laser Camera System (LCS). Experimental results using LCS data show that pose estimates can be generated with mean errors (relative to ICP) of 1.03 [deg] and 1.08 [mm], having standard deviations of 0.56 [deg] and 0.67 [mm] respectively.

scholarly journals Research on Point Cloud Registering Method of Tunneling Roadway Based on 3D NDT-ICP Algorithm

Sensors ◽  
2021 ◽  
Vol 21 (13) ◽  
pp. 4448
Author(s):  
Jianjian Yang ◽  
Chao Wang ◽  
Wenjie Luo ◽  
Yuchen Zhang ◽  
Boshen Chang ◽  
...  
Keyword(s):  
Coordinate Transformation ◽  
Point Cloud ◽  
Point Clouds ◽  
Icp Algorithm ◽  
Point Pair ◽  
Filtering Method ◽  
Environmental Features ◽  
Modeling Accuracy ◽  
Nonlinear Objective Function ◽  
Voxel Grid

In order to meet the needs of intelligent perception of the driving environment, a point cloud registering method based on 3D NDT-ICP algorithm is proposed to improve the modeling accuracy of tunneling roadway environments. Firstly, Voxel Grid filtering method is used to preprocess the point cloud of tunneling roadways to maintain the overall structure of the point cloud and reduce the number of point clouds. After that, the 3D NDT algorithm is used to solve the coordinate transformation of the point cloud in the tunneling roadway and the cell resolution of the algorithm is optimized according to the environmental features of the tunneling roadway. Finally, a kd-tree is introduced into the ICP algorithm for point pair search, and the Gauss–Newton method is used to optimize the solution of nonlinear objective function of the algorithm to complete accurate registering of tunneling roadway point clouds. The experimental results show that the 3D NDT algorithm can meet the resolution requirement when the cell resolution is set to 0.5 m under the condition of processing the point cloud with the environmental features of tunneling roadways. At this time, the registering time is the shortest. Compared with the NDT algorithm, ICP algorithm and traditional 3D NDT-ICP algorithm, the registering speed of the 3D NDT-ICP algorithm proposed in this paper is obviously improved and the registering error is smaller.

scholarly journals Point Cloud Registration Based on Multiparameter Functional

Mathematics ◽  
2021 ◽  
Vol 9 (20) ◽  
pp. 2589
Author(s):  
Artyom Makovetskii ◽  
Sergei Voronin ◽  
Vitaly Kober ◽  
Aleksei Voronin
Keyword(s):  
Dimensional Space ◽  
Three Dimensional ◽  
Point Clouds ◽  
Autonomous Driving ◽  
Geometric Transformation ◽  
Icp Algorithm ◽  
Registration Algorithm ◽  
Closed Point ◽  
Partial Overlap ◽  
Point To Point

The registration of point clouds in a three-dimensional space is an important task in many areas of computer vision, including robotics and autonomous driving. The purpose of registration is to find a rigid geometric transformation to align two point clouds. The registration problem can be affected by noise and partiality (two point clouds only have a partial overlap). The Iterative Closed Point (ICP) algorithm is a common method for solving the registration problem. Recently, artificial neural networks have begun to be used in the registration of point clouds. The drawback of ICP and other registration algorithms is the possible convergence to a local minimum. Thus, an important characteristic of a registration algorithm is the ability to avoid local minima. In this paper, we propose an ICP-type registration algorithm (λ-ICP) that uses a multiparameter functional (λ-functional). The proposed λ-ICP algorithm generalizes the NICP algorithm (normal ICP). The application of the λ-functional requires a consistent choice of the eigenvectors of the covariance matrix of two point clouds. The paper also proposes an algorithm for choosing the directions of eigenvectors. The performance of the proposed λ-ICP algorithm is compared with that of a standard point-to-point ICP and neural network Deep Closest Points (DCP).

scholarly journals Evaluation of Partially Overlapping 3D Point Cloud's Registration by using ICP variant and CloudCompare.

2014 ◽  
Vol XL-8 ◽  
pp. 891-897 ◽  
Author(s):  
Y. D. Rajendra ◽  
S. C. Mehrotra ◽  
K. V. Kale ◽  
R. R. Manza ◽  
R. K. Dhumal ◽  
...  
Keyword(s):  
Point Cloud ◽  
Point Clouds ◽  
Large Object ◽  
Point Cloud Registration ◽  
Icp Algorithm ◽  
Cloud Data ◽  
Registration Process ◽  
Heritage Site ◽  
Laser Scanners ◽  
Dense Point

Terrestrial Laser Scanners (TLS) are used to get dense point samples of large object’s surface. TLS is new and efficient method to digitize large object or scene. The collected point samples come into different formats and coordinates. Different scans are required to scan large object such as heritage site. Point cloud registration is considered as important task to bring different scans into whole 3D model in one coordinate system. Point clouds can be registered by using one of the three ways or combination of them, Target based, feature extraction, point cloud based. For the present study we have gone through Point Cloud Based registration approach. We have collected partially overlapped 3D Point Cloud data of Department of Computer Science & IT (DCSIT) building located in Dr. Babasaheb Ambedkar Marathwada University, Aurangabad. To get the complete point cloud information of the building we have taken 12 scans, 4 scans for exterior and 8 scans for interior façade data collection. There are various algorithms available in literature, but Iterative Closest Point (ICP) is most dominant algorithms. The various researchers have developed variants of ICP for better registration process. The ICP point cloud registration algorithm is based on the search of pairs of nearest points in a two adjacent scans and calculates the transformation parameters between them, it provides advantage that no artificial target is required for registration process. We studied and implemented three variants Brute Force, KDTree, Partial Matching of ICP algorithm in MATLAB. The result shows that the implemented version of ICP algorithm with its variants gives better result with speed and accuracy of registration as compared with CloudCompare Open Source software.

scholarly journals RIGOROUS STRIP ADJUSTMENT OF AIRBORNE LASERSCANNING DATA BASED ON THE ICP ALGORITHM

2015 ◽  
Vol II-3/W5 ◽  
pp. 73-80 ◽  
Author(s):  
P. Glira ◽  
N. Pfeifer ◽  
C. Briese ◽  
C. Ressl
Keyword(s):  
Measurement Errors ◽  
Laser Scanning ◽  
Ground Truth ◽  
Point Clouds ◽  
Redundant Information ◽  
Ground Truth Data ◽  
Icp Algorithm ◽  
Airborne Laser ◽  
Fully Automatic

Airborne Laser Scanning (ALS) is an efficient method for the acquisition of dense and accurate point clouds over extended areas. To ensure a gapless coverage of the area, point clouds are collected strip wise with a considerable overlap. The redundant information contained in these overlap areas can be used, together with ground-truth data, to re-calibrate the ALS system and to compensate for systematic measurement errors. This process, usually denoted as <i>strip adjustment</i>, leads to an improved georeferencing of the ALS strips, or in other words, to a higher data quality of the acquired point clouds. We present a fully automatic strip adjustment method that (a) uses the original scanner and trajectory measurements, (b) performs an on-the-job calibration of the entire ALS multisensor system, and (c) corrects the trajectory errors individually for each strip. Like in the Iterative Closest Point (ICP) algorithm, correspondences are established iteratively and directly between points of overlapping ALS strips (avoiding a time-consuming segmentation and/or interpolation of the point clouds). The suitability of the method for large amounts of data is demonstrated on the basis of an ALS block consisting of 103 strips.

Automatic Point Clouds Registration Method Based on Mesh Segmentation

2013 ◽  
Vol 423-426 ◽  
pp. 2587-2590
Author(s):  
Li Hua Fan ◽  
Bo Liu ◽  
Bao Ling Xie ◽  
Qi Chen
Keyword(s):  
Computer Aided Design ◽  
Point Cloud ◽  
High Speed ◽  
Point Clouds ◽  
Mesh Segmentation ◽  
Registration Method ◽  
Icp Algorithm ◽  
Computer Aided ◽  
Aided Design ◽  
Region Feature

This paper proposes an automatic point clouds registration method based on High-Speed Mesh Segmentation. The proposed method works fast for doing an initial registration and extracting point clouds region feature. First, the features of the point region are used for matching point cloud regions. Second, matched regions sets are classified for calculating transform matrix of initial registration. Based on the initial registration result the Iterative Closest Point (ICP) algorithm which had been used for accuracy registration to composite point cloud pairs will be applied. The proposed registration approach is able to do automatic registration without any assumptions about their initial positions, and avoid the problems of traditional ICP in bad initial estimate. The proposed method plus with ICP algorithm provides an efficient 3D model for computer-aided engineering and computer-aided design.

scholarly journals An Experimental Study of a New Keypoint Matching Algorithm for Automatic Point Cloud Registration

2021 ◽  
Vol 10 (4) ◽  
pp. 204
Author(s):  
Ramazan Alper Kuçak ◽  
Serdar Erol ◽  
Bihter Erol
Keyword(s):  
Point Cloud ◽  
Point Clouds ◽  
Data Systems ◽  
Icp Algorithm ◽  
Matching Algorithm ◽  
Suggested Algorithm ◽  
Registration Process ◽  
Building Facade ◽  
Coarse Registration ◽  
Fine Registration

Light detection and ranging (LiDAR) data systems mounted on a moving or stationary platform provide 3D point cloud data for various purposes. In applications where the interested area or object needs to be measured twice or more with a shift, precise registration of the obtained point clouds is crucial for generating a healthy model with the combination of the overlapped point clouds. Automatic registration of the point clouds in the common coordinate system using the iterative closest point (ICP) algorithm or its variants is one of the frequently applied methods in the literature, and a number of studies focus on improving the registration process algorithms for achieving better results. This study proposed and tested a different approach for automatic keypoint detecting and matching in coarse registration of the point clouds before fine registration using the ICP algorithm. In the suggested algorithm, the keypoints were matched considering their geometrical relations expressed by means of the angles and distances among them. Hence, contributing the quality improvement of the 3D model obtained through the fine registration process, which is carried out using the ICP method, was our aim. The performance of the new algorithm was assessed using the root mean square error (RMSE) of the 3D transformation in the rough alignment stage as well as a-prior and a-posterior RMSE values of the ICP algorithm. The new algorithm was also compared with the point feature histogram (PFH) descriptor and matching algorithm, accompanying two commonly used detectors. In result of the comparisons, the superiorities and disadvantages of the suggested algorithm were discussed. The measurements for the datasets employed in the experiments were carried out using scanned data of a 6 cm × 6 cm × 10 cm Aristotle sculpture in the laboratory environment, and a building facade in the outdoor as well as using the publically available Stanford bunny sculpture data. In each case study, the proposed algorithm provided satisfying performance with superior accuracy and less iteration number in the ICP process compared to the other coarse registration methods. From the point clouds where coarse registration has been made with the proposed method, the fine registration accuracies in terms of RMSE values with ICP iterations are calculated as ~0.29 cm for Aristotle and Stanford bunny sculptures, ~2.0 cm for the building facade, respectively.

Sign in / Sign up

Export Citation Format

Share Document