A Genetic Algorithm Approach for the Rigorous Registration of Arbitrary Laser Scanner Point Clouds

Registration of large-scale terrestrial laser scanner point clouds: A review and benchmark

Abstract. The registration of ground laser point cloud and close-range image is the key content of high-precision 3D reconstruction of cultural relic object. In view of the requirement of high texture resolution in the field of cultural relic at present, The registration of point cloud and image data in object reconstruction will result in the problem of point cloud to multiple images. In the current commercial software, the two pairs of registration of the two kinds of data are realized by manually dividing point cloud data, manual matching point cloud and image data, manually selecting a two – dimensional point of the same name of the image and the point cloud, and the process not only greatly reduces the working efficiency, but also affects the precision of the registration of the two, and causes the problem of the color point cloud texture joint. In order to solve the above problems, this paper takes the whole object image as the intermediate data, and uses the matching technology to realize the automatic one-to-one correspondence between the point cloud and multiple images. The matching of point cloud center projection reflection intensity image and optical image is applied to realize the automatic matching of the same name feature points, and the Rodrigo matrix spatial similarity transformation model and weight selection iteration are used to realize the automatic registration of the two kinds of data with high accuracy. This method is expected to serve for the high precision and high efficiency automatic 3D reconstruction of cultural relic objects, which has certain scientific research value and practical significance.

Automatic registration of terrestrial laser scanning point clouds is a crucial but unresolved topic that is of great interest in many domains. This study combines terrestrial laser scanner with a smartphone for the coarse registration of leveled point clouds with small roll and pitch angles and height differences, which is a novel sensor combination mode for terrestrial laser scanning. The approximate distance between two neighboring scan positions is firstly calculated with smartphone GPS coordinates. Then, 2D distribution entropy is used to measure the distribution coherence between the two scans and search for the optimal initial transformation parameters. To this end, we propose a method called Iterative Minimum Entropy (IME) to correct initial transformation parameters based on two criteria: the difference between the average and minimum entropy and the deviation from the minimum entropy to the expected entropy. Finally, the presented method is evaluated using two data sets that contain tens of millions of points from panoramic and non-panoramic, vegetation-dominated and building-dominated cases and can achieve high accuracy and efficiency.

Terrestrial laser scanning (TLS) is an important part of urban reconstruction and terrain surveying. In TLS applications, 4-point congruent set (4PCS) technology is widely used for the global registration of point clouds. However, TLS point clouds usually enjoy enormous data and uneven density. Obtaining the congruent set of tuples in a large point cloud scene can be challenging. To address this concern, we propose a registration method based on the voxel grid of the point cloud in this paper. First, we establish a voxel grid structure and index structure for the point cloud and eliminate uneven point cloud density. Then, based on the point cloud distribution in the voxel grid, keypoints are calculated to represent the entire point cloud. Fast query of voxel grids is used to restrict the selection of calculation points and filter out 4-point tuples on the same surface to reduce ambiguity in building registration. Finally, the voxel grid is used in our proposed approach to perform random queries of the array. Using different indoor and outdoor data to compare our proposed approach with other 4-point congruent set methods, according to the experimental results, in terms of registration efficiency, the proposed method is more than 50% higher than K4PCS and 78% higher than Super4PCS.

The fully automatic registration of 3D terrestrial laser scanning (TLS) point clouds, which is the first step in the usage of point clouds, is a highly challenging task in Light Detection and Ranging (LiDAR) remote sensing applications. Here, an automatic algorithm for pairwise coarse registration of TLS point clouds using 3D line features is proposed. First, the 3D line sets were extracted from the original pair of point clouds respectively, and two arbitrary lines from a point cloud were used to construct a 2-line base; Then, a pair of conjugate 2-line bases were identified from the source and target 3D line sets at a time, based on which a 3D rotation matrix together with its corresponding overlap between the pairwise 3D line sets was calculated; Third, a series of 3D rotation matrixes together with their overlaps were obtained using the traversing strategy to identify conjugate 2-line base pairs, and the 3D rotation matrix with the highest overlap was outputted as the final 3D rotation matrix, which was further used to compute the corresponding lines set from the pairwise 3D line sets; Next, based on the set of common perpendicular midpoints between the line correspondences, the 3D translation vector was computed; Finally, the 3D transformation matrix between pairwise point clouds was obtained by combining the 3D rotation matrix and the 3D translation vector. The proposed method was tested on three different TLS datasets, with experimental results demonstrating that the proposed algorithm could perform well on registering pairwise TLS point clouds. The rotation and translation errors of aligning the nine experimental pairwise point clouds were all less than 0.50° and 0.55m, respectively. This registration framework was also shown to be superior to state-of-the-art methods in terms of registration accuracy.

Partial point cloud registration is an essential and fundamental component of generating complete 3D shapes, aiming at converting partial scans into a unified coordinate system. However, existing point cloud registration methods suffer from inadequately rich local feature extraction and feature interaction. In addition, these methods still face challenges in modeling the global contextual information of point clouds sufficiently, which limits the improvement in registration effectiveness, especially for partial-to-partial point cloud registration with high noise. To overcome these issues, this paper proposes an enhanced PointNet and assignable weights transformer network (LFA-Net) for partial point cloud registration. The model achieves coarse-to-fine point cloud registration through three core modules. First, the Sufficient Local Feature Extraction Module (LFM) is constructed to extract various local feature information. Then, the Adequate Feature Aggregation Module (FAM) is designed to integrate the feature information from different point clouds. Finally, the Assignable Weights Transformer Module (ATM) is presented to stimulate the model’s global modeling ability during the registration process, enabling the selection of representative points for optimal point cloud registration. Extensive experiments conducted on ModelNet40 using partially overlapping point clouds illustrate the superior registration performance of LFA-Net compared with other state-of-the-art methods. Moreover, Numerous experiments on synthetic and real-word datasets further indicate that LFA-Net also has significant advantages in registering partial point clouds with noise and unseen categories, which demonstrates its excellent robustness and generalization ability for real-world practical application.

Large-scale scene point cloud registration with limited overlap is a challenging task due to computational load and constrained data acquisition. To tackle these issues, we propose a point cloud registration method, MT-PCR, based on Modality Transformation. MT-PCR leverages a Bird's Eye View (BEV) capturing the maximal overlap information to improve the accuracy and utilizes images to provide complementary spatial features. Specifically, MT-PCR converts 3D point clouds to BEV images and estimates correspondence by 2D image keypoints extraction and matching. Subsequently, the 2D correspondence estimates are then transformed back to 3D point clouds using inverse mapping. We have applied MT-PCR to Terrestrial Laser Scanning (TLS) and Aerial Laser Scanning (ALS) point cloud registration on the GrAco dataset, involving 8 low-overlap, square-kilometer scale registration scenarios. Experiments and comparisons with commonly used methods demonstrate that MT-PCR can achieve superior accuracy and robustness in large-scale scenes with limited overlap.

Coded light measurement is an important method of non-contact optical measurement. Because of the camera view limitations, it was hard to complete the measurement of the whole surface at a time. Then it needs registration of 3D point clouds. The registration of point clouds can reflect the 3D surface of the object to be measured, which can achieve the full range of requirements. According to the encoded optical 3D measurement system has been built in laboratory, exploring a method which is high accurate and high speed to reach a full range measurement to industrial parts. This paper describes the color target cube. According to the existing method of coordinate transformation (the Nearest Point Iterative Method), Evaluating the registration accuracy. The registration method based on auxiliary three-dimensional targets was been validated, which has its own rationality.

Multisource forest point cloud registration with semantic-guided keypoints and robust RANSAC mechanisms

Automatic pairwise registration for unordered terrestrial laser scanner (TLS) point clouds is the pre-requisite for many applications, including 3D model reconstruction, cultural heritage management and landslide monitoring. However, most of the existing registration methods are still suffering from several limitations: (1) difficult to find the correct corresponding point pairs from the source and target point cloud, (2) low accuracy of pairwise registration and (3) the iterative process of registration is time-consuming. To overcome these challenges, based on the covariance matrix, this paper presents a robust and descriptive feature descriptor vector (FDV) to locally describe a point, by which the corresponding point pairs are obtained and the registration matrix is calculated. First, the FDVs of the original point cloud’s keypoints are calculated. Second, the corresponding point pairs are found via their FDVs. Third, the coarse transformation matrix is calculated by the corresponding point pairs using the singular value decomposition (SVD) algorithm, and which is further refined by the iterative closest point (ICP) algorithm to get a better result. Finally, the experiments are conducted on the Autonomous Systems Lab (ASL) and ISPRS datasets; our results show that the proposed algorithm can obtain good registration performance, and outperforms the compared methods.

The registration of 3-D point clouds is an important procedure during the terrestrial laser scanning data processing. Recently, due to their high flexibility and the powerful mathematical model, a large amount of least-squares-based (LSs-based) methods are proposed and widely applied to estimate the transformation parameters of 3-D point clouds registration. In these LSs-based methods some based on the generalized Gauss–Markov model do not correct the influence of random errors on source 3-D point clouds. Although there are other methods based on the errors-in-variables (EIV) model, they are inapplicable for transformation problems with large rotation angles and arbitrary scale ratio. In addition, the gross errors are usually ignored in previous studies on 3-D point clouds registration, which, however, exists commonly and could distort the registration severely. Aiming to avoid the influence of gross errors and extend its application, an advanced outlier detected total least-squares (OD-TLS) method is proposed in this paper. Based on the generalized EIV model OD-TLS performs a seven-parameter 3-D similarity transformation with large rotation angles and arbitrary scale ratio. The random errors of both source and target 3-D point clouds are considered. Furthermore, outliers are detected and removed automatically by combining the data snooping method with total least-squares (TLS) estimation. In order to indicate the benefits of OD-TLS, comparative experiments with the LS3D and weighted total least squares (WTLS) on synthetic and real-world scanned 3-D point clouds were performed. The experimental results show OD-TLS not only enhances the registration accuracy but also increases its robustness.

Point cloud registration is of great significance to the reconstruction of high‐precision 3D city models. There are some challenges when aligning aerial and close‐range photogrammetric point clouds, such as huge view differences caused by the different sights of the sensors, massive noisy points due to the error in dense matching, and scale uncertainty since there are no control points for absolute orientation. To achieve complementary advantages of aerial and close‐range point clouds, in this paper, a robust cross‐source point clouds registration method is proposed using image visual context features and scale consistency. First, a cross‐view image matching method based on image visual context features is proposed to obtain corresponding points. Second, to overcome the challenges of noisy points and scale differences, an outlier filtering method is designed based on scale consistency. Finally, the dual quaternions model considering the scale factor is introduced to solve the spatial transformation model. To analyze the feasibility of this method qualitatively and quantitatively, experiments are conducted using the public scene dataset of Dortmund, Germany, and the scene dataset of Zhengzhou City, China. Three kinds of cross‐source point clouds registration experiments are conducted in this paper, including aerial and close‐range point clouds registration in Dortmund, and aerial and ground point clouds registrations in both Dortmund and Zhengzhou. The chamfer distances of the three sets of experiments are 4.48 m, 5.97 m and 4.78 m, respectively. The ablation study shows that the outlier filtering method and the dual quaternions model improve the accuracy by at least 14% and 25%, respectively. The experiments demonstrate that the method accomplishes the cross‐source point clouds registration in large‐scale scenes accurately and efficiently, providing a solid foundation for subsequent fine 3D reconstruction.

Local-to global point cloud registration is a challenging task due to the substantial differences between these two types of data, and the different techniques used to acquire them. Global clouds cover large-scale environments and are usually acquired aerially, e.g., 3D modeling of a city using Airborne Laser Scanning (ALS). In contrast, local clouds are often acquired from ground level and at a much smaller range, for example, using Terrestrial Laser Scanning (TLS). The differences are often manifested in point density distribution, occlusions nature, and measurement noise. As a result of these differences, existing point cloud registration approaches, such as keypoint-based registration, tend to fail. We improve upon a different approach, recently proposed, based on converting the global cloud into a viewpoint-based cloud dictionary. We propose a local-toglobal registration method where we replace the dictionary clouds with viewpoint descriptors, consisting of panoramic range-images. We then use an efficient dictionary search in the Discrete Fourier Transform (DFT) domain, using phase correlation, to rapidly find plausible transformations from the local to the global reference frame. We demonstrate our method's significant advantages over the previous cloud dictionary approach, in terms of computational efficiency and memory requirements. In addition, We show its superior registration performance in comparison to a state-ofthe- art, keypoint-based method (FPFH). For the evaluation, we use a challenging dataset of TLS local clouds and an ALS large-scale global cloud, in an urban environment.

With the widespread application of large-scale 3D point cloud data in real-world scenarios, efficient and accurate point cloud registration has become a crucial challenge. We propose an end-to-end point cloud registration method based on the Transformer architecture. This method addresses the issues of low overlap and registration in large scenes, exhibiting strong algorithmic versatility and efficiency. We introduce a combination of dynamic position encoding and ternary angular position encoding within the Transformer, effectively enhancing the representation capability of point cloud data and algorithmic generality, thus better tackling point cloud registration challenges in large scenes. Additionally, to enhance the learning capacity of the attention mechanism, we employ an improved cross-attention mechanism that multiplies the softmax with adaptive weights, enabling the model to capture key information within the point cloud more accurately. In the decoding stage, we introduce a multi-scale feature fusion approach that fully exploits the multi-layer information in point cloud data, further improving registration accuracy and robustness. Through the fusion of multi-scale features, we effectively mitigate information loss and handle matching problems between point clouds of varying sizes. Experimental results demonstrate the excellence of our method in addressing low overlap and registration tasks in large scenes, validated across multiple datasets including 3DMatch, ModelNet, KITTI, and MVP-RG.

Point cloud registration is a fundamental problem in robotics, critical for tasks such as localization and mapping. Most approaches to this problem use feature-based techniques. However, these approaches have issues when dealing with unstructured environments where meaningful features are difficult to extract. Recently, an innovative global point cloud registration algorithm, PHASER, which does not rely on geometric features or point correspondences, has been introduced. It leverages Fourier transforms to identify the optimal rigid transform that maximizes cross-correlation between source and target point clouds. PHASER can also incorporate additional data channels, like LiDAR intensity, to enhance registration results. Because it does not rely on local features and because of its ability to exploit additional data, PHASER is particularly useful when dealing with very noisy point clouds or with many outliers. For this reason, we propose an extension to PHASER that considers multiple plausible rototranslation hypotheses. Our extended approach outperforms the original PHASER algorithm, especially in challenging scenarios where point clouds are widely separated. We validate its effectiveness on the DARPA SubT, and the Newer College datasets, showcasing its potential for improving registration accuracy in complex environments.