PCL-Based Coarse Registration Algorithm for Point Cloud Data

2019 ◽  
Vol 07 (01) ◽  
pp. 18-23
Author(s):  
如铁 曾
2020 ◽  
Vol 14 (12) ◽  
pp. 2675-2681
Author(s):  
Wenting Cui ◽  
Jianyi Liu ◽  
Shaoyi Du ◽  
Yuying Liu ◽  
Teng Wan ◽  
...  

2014 ◽  
Vol 644-650 ◽  
pp. 4624-4629
Author(s):  
Song Liu ◽  
Xiao Yao Xie

For the problem of huge computation and requiring high computing resource in point cloud registration, according to the theory of parallel computing, the algorithm of point cloud registration base on MapReduce is designed. Through building a Hadoop cluster consisted by average PCs, four examples have been tested. The experiment results show that point cloud registration algorithm based on MapReduce can register point cloud data with high accuracy.


2015 ◽  
Vol 741 ◽  
pp. 237-240
Author(s):  
Li Lun Huang ◽  
Wen Guo Li ◽  
Qi Le Yang ◽  
Ying Chun Chen

The principle of registration of the 3D point cloud data and the current algorithms are compared, and ICP algorithm is chosen since its fast convergence speed, high precision, and simple objective function. On the basis of ICP algorithm, singular value decomposition and four-array method are analysed by programming program, and all the mathematical algorithms is transformed into programming language by Matlab software.


2021 ◽  
Vol 54 (3-4) ◽  
pp. 385-395
Author(s):  
Ming Guo ◽  
Bingnan Yan ◽  
Guoli Wang ◽  
Pingjun Nie ◽  
Deng Pan ◽  
...  

Aiming at the narrow and long tunnel structure, few internal features, and a large amount of point cloud data, the existing registration algorithms and commercial software registration results are not ideal, an iterative global registration algorithm is proposed for massive underground tunnel point cloud registration, which is composed of local initial pose acquisition and global adjustment. Firstly, the feature point coordinates in the point cloud are extracted, and then the station-by-station registration is performed according to the Rodrigues matrix. Finally, the registration result is considered as the initial value of the parameter, and the global adjustment of all observations is carried out. The observation values are weighted by the selection weight iteration method and the weights are constantly modified in the iteration process until the threshold conditions are met and the iteration stops. In this paper, the experimental data, made up of 85 stations of point cloud data, are from the Xiamen subway tunnel, which is about 1300 m long. When the accumulated error of station-to-station registration is too large, several stations are regarded as partial wholes, and the optimal registration is achieved through multiple global adjustments, and the registration accuracy is within 5 mm. Experimental results confirm the feasibility and effectiveness of the algorithm, which provides a new method for point cloud registration of underground space tunnel.


2021 ◽  
Vol 2024 (1) ◽  
pp. 012069
Author(s):  
Jinlong Li ◽  
Ni Zeng ◽  
Jingan Meng ◽  
Xiaorong Gao ◽  
Yu Zhang

Author(s):  
S. N. Mohd Isa ◽  
S. A. Abdul Shukor ◽  
N. A. Rahim ◽  
I. Maarof ◽  
Z. R. Yahya ◽  
...  

Abstract. In this paper, pairwise coarse registration is presented using real world point cloud data obtained by terrestrial laser scanner and without information on reference marker on the scene. The challenge in the data is because of multi-scanning which caused large data size in millions of points due to limited range about the scene generated from side view. Furthermore, the data have a low percentage of overlapping between two scans, and the point cloud data were acquired from structures with geometrical symmetry which leads to minimal transformation during registration process. To process the data, 3D Harris keypoint is used and coarse registration is done by Iterative Closest Point (ICP). Different sampling methods were applied in order to evaluate processing time for further analysis on different voxel grid size. Then, Root Means Squared Error (RMSE) is used to determine the accuracy of the approach and to study its relation to relative orientation of scan by pairwise registration. The results show that the grid average downsampling method gives shorter processing time with reasonable RMSE in finding the exact scan pair. It can also be seen that grid step size is having an inverse relationship with downsampling points. This setting is used to test on smaller overlapping data set of other heritage building. Evaluation on relative orientation is studied from transformation parameter for both data set, where Data set I, which higher overlapping data gives better accuracy which may be due to the small distance between the two point clouds compared to Data set II.


2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Yongshan Liu ◽  
Dehan Kong ◽  
Dandan Zhao ◽  
Xiang Gong ◽  
Guichun Han

The existing registration algorithms suffer from low precision and slow speed when registering a large amount of point cloud data. In this paper, we propose a point cloud registration algorithm based on feature extraction and matching; the algorithm helps alleviate problems of precision and speed. In the rough registration stage, the algorithm extracts feature points based on the judgment of retention points and bumps, which improves the speed of feature point extraction. In the registration process, FPFH features and Hausdorff distance are used to search for corresponding point pairs, and the RANSAC algorithm is used to eliminate incorrect point pairs, thereby improving the accuracy of the corresponding relationship. In the precise registration phase, the algorithm uses an improved normal distribution transformation (INDT) algorithm. Experimental results show that given a large amount of point cloud data, this algorithm has advantages in both time and precision.


2009 ◽  
Vol 16-19 ◽  
pp. 283-287
Author(s):  
Feng Li ◽  
Lan Fang Feng ◽  
Xiao Qing Wu ◽  
Yan Bo Hui

Reverse engineering is a new modern product design technology, which is suitable for designing complex curve and surface, has been becoming a practical and widely-available engineering tool in panel design of automotive, motorcycle and electric vehicle. This paper first expatiates on the basic theory of structured light measurement system, registration algorithm of multi-view point cloud data and the basic principle of curve and surface reverse design, and then gives an application example in the 3D design of electric vehicle front panel.


2020 ◽  
Vol 12 (8) ◽  
pp. 1283 ◽  
Author(s):  
Wuyong Tao ◽  
Xianghong Hua ◽  
Zhiping Chen ◽  
Pengju Tian

Point cloud registration, as the first step for the use of point cloud data, has attracted increasing attention. In order to obtain the entire point cloud of a scene, the registration of point clouds from multiple views is necessary. In this paper, we propose an automatic method for the coarse registration of point clouds. The 2D lines are first extracted from the two point clouds being matched. Then, the line correspondences are established and the 2D transformation is calculated. Finally, a method is developed to calculate the displacement along the z-axis. With the 2D transformation and displacement, the 3D transformation can be easily achieved. Thus, the two point clouds are aligned together. The experimental results well demonstrate that our method can obtain high-precision registration results and is computationally very efficient. In the experimental results obtained by our method, the biggest rotation error is 0.5219o, and the biggest horizontal and vertical errors are 0.2319 m and 0.0119 m, respectively. The largest total computation time is only 713.4647 s.


Sign in / Sign up

Export Citation Format

Share Document