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 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 3D Point Cloud Filtering Method for Leaves Based on Manifold Distance and Normal Estimation

2019 ◽  
Vol 11 (2) ◽  
pp. 198 ◽  
Author(s):  
Chunhua Hu ◽  
Zhou Pan ◽  
Pingping Li
Keyword(s):  
Leaf Area ◽  
Point Cloud ◽  
Mean Absolute Error ◽  
Point Clouds ◽  
Absolute Error ◽  
Area Measurement ◽  
3D Point Cloud ◽  
Filtering Method ◽  
Normal Estimation ◽  
3D Point Clouds

Leaves are used extensively as an indicator in research on tree growth. Leaf area, as one of the most important index in leaf morphology, is also a comprehensive growth index for evaluating the effects of environmental factors. When scanning tree surfaces using a 3D laser scanner, the scanned point cloud data usually contain many outliers and noise. These outliers can be clusters or sparse points, whereas the noise is usually non-isolated but exhibits different attributes from valid points. In this study, a 3D point cloud filtering method for leaves based on manifold distance and normal estimation is proposed. First, leaf was extracted from the tree point cloud and initial clustering was performed as the preprocessing step. Second, outlier clusters filtering and outlier points filtering were successively performed using a manifold distance and truncation method. Third, noise points in each cluster were filtered based on the local surface normal estimation. The 3D reconstruction results of leaves after applying the proposed filtering method prove that this method outperforms other classic filtering methods. Comparisons of leaf areas with real values and area assessments of the mean absolute error (MAE) and mean absolute error percent (MAE%) for leaves in different levels were also conducted. The root mean square error (RMSE) for leaf area was 2.49 cm2. The MAE values for small leaves, medium leaves and large leaves were 0.92 cm2, 1.05 cm2 and 3.39 cm2, respectively, with corresponding MAE% values of 10.63, 4.83 and 3.8. These results demonstrate that the method proposed can be used to filter outliers and noise for 3D point clouds of leaves and improve 3D leaf visualization authenticity and leaf area measurement accuracy.

scholarly journals GENERATION OF GROUND TRUTH DATASETS FOR THE ANALYSIS OF 3D POINT CLOUDS IN URBAN SCENES ACQUIRED VIA DIFFERENT SENSORS

2018 ◽  
Vol XLII-3 ◽  
pp. 2009-2015 ◽  
Author(s):  
Y. Xu ◽  
Z. Sun ◽  
R. Boerner ◽  
T. Koch ◽  
L. Hoegner ◽  
...  
Keyword(s):  
Point Cloud ◽  
Spatial Information ◽  
Ground Truth ◽  
Semantic Segmentation ◽  
Point Clouds ◽  
Urban Scenes ◽  
3D Space ◽  
3D Point Clouds ◽  
Testing Site ◽  
Voxel Grid

In this work, we report a novel way of generating ground truth dataset for analyzing point cloud from different sensors and the validation of algorithms. Instead of directly labeling large amount of 3D points requiring time consuming manual work, a multi-resolution 3D voxel grid for the testing site is generated. Then, with the help of a set of basic labeled points from the reference dataset, we can generate a 3D labeled space of the entire testing site with different resolutions. Specifically, an octree-based voxel structure is applied to voxelize the annotated reference point cloud, by which all the points are organized by 3D grids of multi-resolutions. When automatically annotating the new testing point clouds, a voting based approach is adopted to the labeled points within multiple resolution voxels, in order to assign a semantic label to the 3D space represented by the voxel. Lastly, robust line- and plane-based fast registration methods are developed for aligning point clouds obtained via various sensors. Benefiting from the labeled 3D spatial information, we can easily create new annotated 3D point clouds of different sensors of the same scene directly by considering the corresponding labels of 3D space the points located, which would be convenient for the validation and evaluation of algorithms related to point cloud interpretation and semantic segmentation.

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.

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.

scholarly journals A Fast Point Clouds Registration Algorithm for Laser Scanners

2021 ◽  
Vol 11 (8) ◽  
pp. 3426
Author(s):  
Guangxuan Xu ◽  
Yajun Pang ◽  
Zhenxu Bai ◽  
Yulei Wang ◽  
Zhiwei Lu
Keyword(s):  
Laser Scanner ◽  
Point Clouds ◽  
Shape Context ◽  
Registration Accuracy ◽  
Icp Algorithm ◽  
Laser Scanners ◽  
Intrinsic Shape ◽  
Random Sample Consensus ◽  
Voxel Grid ◽  
Ransac Algorithm

Point clouds registration is an important step for laser scanner data processing, and there have been numerous methods. However, the existing methods often suffer from low accuracy and low speed when registering large point clouds. To meet this challenge, an improved iterative closest point (ICP) algorithm combining random sample consensus (RANSAC) algorithm, intrinsic shape signatures (ISS), and 3D shape context (3DSC) is proposed. The proposed method firstly uses voxel grid filter for down-sampling. Next, the feature points are extracted by the ISS algorithm and described by the 3DSC. Afterwards, the ISS-3DSC features are used for rough registration with the RANSAC algorithm. Finally, the ICP algorithm is used for accurate registration. The experimental results show that the proposed algorithm has faster registration speed than the compared algorithms, while maintaining high registration accuracy.

scholarly journals AUTOMATIC RAIL EXTRACTION AND CELARANCE CHECK WITH A POINT CLOUD CAPTURED BY MLS IN A RAILWAY

2018 ◽  
Vol XLII-2 ◽  
pp. 767-771 ◽  
Author(s):  
Y. Niina ◽  
R. Honma ◽  
Y. Honma ◽  
K. Kondo ◽  
K. Tsuji ◽  
...  
Keyword(s):  
Contact Line ◽  
Point Cloud ◽  
Laser Scanning ◽  
Point Clouds ◽  
Road Maintenance ◽  
Icp Algorithm ◽  
Railway Company ◽  
Visual Confirmation ◽  
Clearance Model ◽  
The Ideal

Recently, MLS (Mobile Laser Scanning) has been successfully used in a road maintenance. In this paper, we present the application of MLS for the inspection of clearance along railway tracks of West Japan Railway Company. Point clouds around the track are captured by MLS mounted on a bogie and rail position can be determined by matching the shape of the ideal rail head with respect to the point cloud by ICP algorithm. A clearance check is executed automatically with virtual clearance model laid along the extracted rail. As a result of evaluation, the accuracy of extracting rail positions is less than 3 mm. With respect to the automatic clearance check, the objects inside the clearance and the ones related to a contact line is successfully detected by visual confirmation.

scholarly journals TLS POINT CLOUD REGISTRATION BASED ON ICP ALGORITHM USING POINT QUALITY

2019 ◽  
Vol XLII-2/W13 ◽  
pp. 963-968 ◽  
Author(s):  
H. Date ◽  
E. Wakisaka ◽  
Y. Moribe ◽  
S. Kanai
Keyword(s):  
Point Cloud ◽  
Incident Angle ◽  
Point Clouds ◽  
Outdoor Environment ◽  
Simple Extension ◽  
Registration Accuracy ◽  
Icp Algorithm ◽  
Extension Method ◽  
Registration Errors ◽  
Efficient Matching

<p><strong>Abstract.</strong> A simple extension method of the ICP algorithm using point quality based on the distance and incident angle is presented for improving the registration accuracy of TLS point clouds. First, using a structured point cloud representation, the distance and incident angle of each point are calculated. Then, quality measures for the distance and incident angle are defined, considering the relationship between them and the scanning errors. Finally, an extension method of the ICP algorithm by the weighting using the estimated point qualities is described. A method for efficient matching using point properties is also introduced. The proposed method is applied to two datasets of TLS point clouds of a small plant and an outdoor environment, and the effectiveness is evaluated by comparing registration errors with the ground truths obtained using the scan target and a total station.</p>

Sign in / Sign up

Export Citation Format

Share Document