To overcome the drawbacks of pairwise registration for mobile laser scanner (MLS) point clouds, such as difficulty in searching the corresponding points and inaccuracy registration matrix, a robust coarse-to-fine registration method is proposed to align different frames of MLS point clouds into a common coordinate system. The method identifies the correct corresponding point pairs from the source and target point clouds, and then calculates the transform matrix. First, the performance of a multiscale eigenvalue statistic-based descriptor with different combinations of parameters is evaluated to identify the optimal combination. Second, based on the geometric distribution of points in the neighborhood of the keypoint, a weighted covariance matrix is constructed, by which the multiscale eigenvalues are calculated as the feature description language. Third, the corresponding points between the source and target point clouds are estimated in the feature space, and the incorrect ones are eliminated via a geometric consistency constraint. Finally, the estimated corresponding point pairs are used for coarse registration. The value of coarse registration is regarded as the initial value for the iterative closest point algorithm. Subsequently, the final fine registration result is obtained. The results of the registration experiments with Autonomous Systems Lab (ASL) Datasets show that the proposed method can accurately align MLS point clouds in different frames and outperform the comparative methods.
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.
3 July 2022 in International Journal of Remote Sensing
To obtain the complete coverage when scanning a large-scale scene using a laser scanner, registration of pairwise point clouds by the corresponding geometric features is usually necessary under the condition of insufficient direct geographic reference information of GNSS sensors. In this paper, we propose a target-less coarse registration method for pairwise point clouds using the corresponding voxel-based planes, which are identified by a pair of conjugate 2-plane bases. The voxel-based planes are firstly extracted from the entire point cloud with 3D cubic grids decomposed by the octree-based voxelization; Then, the 2-plane bases in each point cloud are constructed, and by comparing the dihedral angles of two 2-plane bases that come from the source and target point clouds, respectively, the conjugate 2-plane base pairs are generated one by one; Next, a set of plane correspondences is identified by a pair of conjugate 2-plane bases, and its corresponding largest consistency planes (LCP) set is calculated; Finally, a series of plane correspondence sets are obtained using the generated pairs of conjugate 2-plane bases, and the one with the highest LCP is used to compute the transformation matrix between the pairwise point clouds. Experimental results revealed that our proposed pairwise coarse registration method can be effective for aligning point clouds acquired from indoor and outdoor scenes, with rotation errors less than 0.4 degrees, translation errors less than 0.4 m, root mean square distance (RMSD) less than 0.42 m, and successful registration rate (SRR) about 98%. Furthermore, our proposed method was more efficient than the point- and line-based methods under the same hardware and software configuration conditions.
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.