A Global Registration Method Based on the Vector Field Representation

Author(s):  
Van Tung Nguyen ◽  
Denis Laurendeau
2020 ◽  
Vol 12 (7) ◽  
pp. 1127
Author(s):  
Nadisson Luis Pavan ◽  
Daniel Rodrigues dos Santos ◽  
Kourosh Khoshelham

Registration of point clouds is a central problem in many mapping and monitoring applications, such as outdoor and indoor mapping, high-speed railway track inspection, heritage documentation, building information modeling, and others. However, ensuring the global consistency of the registration is still a challenging task when there are multiple point clouds because the different scans should be transformed into a common coordinate frame. The aim of this paper is the registration of multiple terrestrial laser scanner point clouds. We present a plane-based matching algorithm to find plane-to-plane correspondences using a new parametrization based on complex numbers. The multiplication of complex numbers is based on analysis of the quadrants to avoid the ambiguity in the calculation of the rotation angle formed between normal vectors of adjacent planes. As a matching step may contain several matrix operations, our strategy is applied to reduce the number of mathematical operations. We also design a novel method for global refinement of terrestrial laser scanner data based on plane-to-plane correspondences. The rotation parameters are globally refined using operations of quaternion multiplication, while the translation parameters are refined using the parameters of planes. The global refinement is done non-iteratively. The experimental results show that the proposed plane-based matching algorithm efficiently finds plane correspondences in partial overlapping scans providing approximate values for the global registration, and indicate that an accuracy better than 8 cm can be achieved by using our global fine plane-to-plane registration method.


Author(s):  
Charles Hessel ◽  
Carlo De Franchis ◽  
Gabriele Facciolo ◽  
Jean-Michel Morel

Author(s):  
R. Yang ◽  
L. Pan ◽  
Z. Xiang ◽  
H. Zeng

Aimed at the global registration problem of the single-closed ring multi-stations point cloud, a formula in order to calculate the error of rotation matrix was constructed according to the definition of error. The global registration algorithm of multi-station point cloud was derived to minimize the error of rotation matrix. And fast-computing formulas of transformation matrix with whose implementation steps and simulation experiment scheme was given. Compared three different processing schemes of multi-station point cloud, the experimental results showed that the effectiveness of the new global registration method was verified, and it could effectively complete the global registration of point cloud.


Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 427 ◽  
Author(s):  
Yongzhuo Gao ◽  
Zhijiang Du ◽  
Wei Xu ◽  
Mingyang Li ◽  
Wei Dong

Methods of point cloud registration based on ICP algorithm are always limited by convergence rate, which is related to initial guess. A good initial alignment transformation can sharply reduce convergence time and raise efficiency. In this paper, we propose a global registration method to estimate the initial alignment transformation based on HEALPix (Hierarchical Equal Area isoLatitude Pixelation of a sphere), an algorithm for spherical projections. We adopt EGI (Extended Gaussian Image) method to map the normals of the point cloud and estimate the transformation with optimized point correspondence. Cross-correlation method is used to search the best alignment results in consideration of the accuracy and robustness of the algorithm. The efficiency and accuracy of the proposed algorithm were verified with created model and real data from various sensors in comparison with similar methods.


2010 ◽  
Author(s):  
Lifeng He ◽  
Takeshi Inaba ◽  
Kenji Suzuki ◽  
Kazuhito Murakami ◽  
Yuyan Chao ◽  
...  

2015 ◽  
Vol 734 ◽  
pp. 608-616
Author(s):  
Jun Cheng ◽  
Ming Cheng ◽  
Yan Bin Lin ◽  
Cheng Wang

This paper presents a novel structure-based registration method for terrestrial laser scanning (TLS) data. The line support region (LSR), which fits the 3D line segment, is adopted to describe the scene structure and reduce geometric complexity. Then we employ an evolution computation method to solve the optimization problem of global registration. Our method can be further enhanced by iterative closest points (ICP) or other local registration methods. We demonstrate the robustness of our algorithm on several point cloud sets with varying extent of overlap and degree of noise.


2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Jinho Song ◽  
Kwanghee Ko

In this paper, we propose a method for registering unorganized point clouds without using targets or markers. Motivated by the 4-points congruent sets (4PCS) algorithm, which is a nontarget-based registration method commonly used in the related fields, we develop a feature-based 4PCS algorithm (F-4PCS). The method combines the basic approach of the 4PCS algorithm with geometric feature information to produce consistent global registration results efficiently. We use the features from the point feature histogram descriptor and the ones that capture the surface curvature. The experimental results show that the proposed method successfully registers point clouds of both the outdoor and indoor scenes and demonstrates better performance than the existing 4PCS-based registration methods.


Sign in / Sign up

Export Citation Format

Share Document