Point Clouds Registration by Using Depth Images

Laser three-dimensional (3D) image is a novel non-cooperative target 3D image acquisition technology, and the improvements in detection capability and imaging accuracy of the system are critically dependent on efficient echo-signal processing technique and 3D reconstruction method. The registration process is an essential step in array 3D imaging laser point cloud data processing. Registration of point clouds is an effective method that solves the problem caused by the target self-occlusion in the laser 3D imaging system. The accurate registration result will help provide better support for subsequent applications, such as object reconstruction and target recognition. In this study, a set of thresholds in the iterative closest point (ICP) algorithm is analysed on the basis of the characteristics of the laser array 3D imaging system and is combined with the range error and visual lateral resolution of the system, which are both important parameters in the imaging system. To improve the accuracy and speed of registration, the stop threshold of the iterative algorithm and the corresponding point-distance threshold in the algorithm are established in a novel way based on the range error and visual lateral resolution of the system. This forms the foundation, based on which an adaptive threshold ICP algorithm is proposed. The principal idea of the algorithm is to improve the threshold set that has a considerable effect on the accuracy and speed of registration. At first, the characteristics of the imaging point clouds of the laser array 3D imaging system are analysed in the algorithm. Based on this analysis, the distance between the two point clouds and corresponding points with ideal registrations are estimated theoretically, according to the range error and visual lateral resolution of the system. The simulation results show that the theoretically estimated results and actual results have the same variation tendency, thus providing a theoretical basis for subsequent improvements. Next, the estimated results are added according to the iterative closest point algorithm. This implies that the registration thresholds are capable of changing and adapting under different iterations and imaging systems, thus improving the speed and accuracy of registrations. This phenomenon is not seen in other algorithms. Experiments involving laser array imaging of a point cloud and laser scanning of depth imaging data show that the algorithm is practical and effective for both imaging types of point clouds and can improve the speed and accuracy of registration notably. The effectiveness and feasibility of the proposed algorithm are thus verified. In addition, for its full consideration of the imaging system, the basic idea of the proposed algorithm can be used for designing future applications as required.

Point cloud registration has a wide range of applications in 3D reconstruction, pose estimation, intelligent driving, heritage conservation, and digital cities. The traditional iterative closest point (ICP) algorithm has strong dependence on the initial position, poor robustness, and low timeliness. To address the above issues, a fast point cloud registration method that incorporates RGB image information is proposed. The SIFT algorithm is used to detect feature points of point clouds corresponding to the RGB image, followed by feature point matching. The RANSAC algorithm is applied to remove erroneous point pairs in order to calculate the initial transformation matrix. After applying a pass-through filter for noise reduction and transiting down with a voxel grid, the point cloud is subjected to rotation and translation transformation for initial registration. On the basis of initial alignment, the FR-ICP algorithm is utilized for achieving precise registration. This method not only avoids the problem of ICP easily getting stuck in local optima, but also has higher registration accuracy and efficiency. Experimental studies were conducted based on point clouds of automotive parts collected in real scenes, and the results showed that the proposed method has a registration error of only 0.487 mm. Among the same group of experimental point clouds with comparable registration error, the proposed method showed a speed improvement of 69%/48% compared to ICP/FR-ICP with regard to registration speed.

In response to the issues of slow convergence and the tendency to fall into local optima in traditional iterative closest point (ICP) point cloud registration algorithms, this study presents a fast registration algorithm for laser point clouds based on 3D scale-invariant feature transform (3D-SIFT) feature extraction. First, feature points are preliminarily extracted using a normal vector threshold; then, more high-quality feature points are extracted using the 3D-SIFT algorithm, effectively reducing the number of point cloud registrations. Based on the extracted feature points, a coarse registration of the point cloud is performed using the fast point feature histogram (FPFH) descriptor combined with the sample consensus initial alignment (SAC-IA) algorithm, followed by fine registration using the point-to-plane ICP algorithm with a symmetric target function. The experimental results show that this algorithm significantly improved the registration efficiency. Compared with the traditional SAC-IA+ICP algorithm, the registration accuracy of this algorithm increased by 29.55% in experiments on a public dataset, and the registration time was reduced by 81.01%. In experiments on actual collected data, the registration accuracy increased by 41.72%, and the registration time was reduced by 67.65%. The algorithm presented in this paper maintains a high registration accuracy while greatly reducing the registration speed.

The registration of point clouds in a three-dimensional space is an important task in many areas of computer vision, including robotics and autonomous driving. The purpose of registration is to find a rigid geometric transformation to align two point clouds. The registration problem can be affected by noise and partiality (two point clouds only have a partial overlap). The Iterative Closed Point (ICP) algorithm is a common method for solving the registration problem. Recently, artificial neural networks have begun to be used in the registration of point clouds. The drawback of ICP and other registration algorithms is the possible convergence to a local minimum. Thus, an important characteristic of a registration algorithm is the ability to avoid local minima. In this paper, we propose an ICP-type registration algorithm (λ-ICP) that uses a multiparameter functional (λ-functional). The proposed λ-ICP algorithm generalizes the NICP algorithm (normal ICP). The application of the λ-functional requires a consistent choice of the eigenvectors of the covariance matrix of two point clouds. The paper also proposes an algorithm for choosing the directions of eigenvectors. The performance of the proposed λ-ICP algorithm is compared with that of a standard point-to-point ICP and neural network Deep Closest Points (DCP).

The present work proposes a new method Reg3DFacePtCd for registration of point clouds. The key contribution of the present method is that an unknown face in 3D point cloud form is given to the system and is registered to the already existing known 3D face point clouds using a fast 3D face registration method. The novelty of the present technique is that at first the alignment and registration parameters are found out by initially registering eight key points of the unknown source model to that of the known model. Next, the rest of the point clouds of the unknown model are registered to that of the known model using the same parameters found as above. The main method used for alignment is iterative closest point (ICP) using point-based technique followed by registration in the least squares sense. Mainly there are two significant contributions. Firstly, we have developed a new mathematical model facial landmark point based model across poses to obtain the target or the known model to which all the unknown models will be registered. Secondly, a novel way to accelerate point cloud matching by reducing the number of points has been proposed. Using a small number of points necessarily would speed up the registration process but may inculcate errors. So, to determine the registration quality of the fundamental eight key points on which the entire registration process is based, a new robust metric namely ICV (ICP certainty vector) consisting of several key components have been used. Finally, we have addressed several important face registration issues like pre-processing, convergence and quality of registration of the entire facial point cloud based on the eight key points. Extensive experimentation on Frav3D, GavabDB, and the Bosphorus databases on a high-performance computing environment show the novelty and robustness of the method.

Point cloud registration is a central theme in computer vision, with alignment algorithms continuously improving for greater robustness. Commonly used methods evaluate Euclidean distances between point clouds and minimize an objective function, such as Root Mean Square Error (RMSE). However, these approaches are most effective when the point clouds are well-prealigned and issues such as differences in density, noise, holes, and limited overlap can compromise the results. Traditional methods, such as Iterative Closest Point (ICP), require choosing one point cloud as fixed, since Euclidean distances lack commutativity. When only one point cloud has issues, adjustments can be made, but in real scenarios, both point clouds may be affected, often necessitating preprocessing. The authors introduce a novel differential entropy-based metric, designed to serve as the objective function within an optimization framework for fine rigid pairwise 3D point cloud registration, denoted as Iterative Differential Entropy Minimization (IDEM). This metric does not depend on the choice of a fixed point cloud and, during transformations, reveals a clear minimum corresponding to the best alignment. Multiple case studies are conducted, and the results are compared with those obtained using RMSE, Chamfer distance, and Hausdorff distance. The proposed metric proves effective even with density differences, noise, holes, and partial overlap, where RMSE does not always yield optimal alignment.

Point set augmentation through fitting for enhanced ICP registration of point clouds in multisensor coordinate metrology

Scanned data often contain substantial outliers due to environmental interference, which drastically decreases the performance of traditional registration algorithms. To address this issue, this article proposes an improved principal component analysis (PCA) and Jacobian-enhanced whale optimization collaborative method for point cloud registration. First, an improved PCA point cloud initial registration algorithm is proposed by introducing the normal vector local information to set the screening conditions. This algorithm can streamline the original set of 48 candidate rotation matrices down to 4, achieving rapid point cloud registration at the data level between the scanned and model point clouds. Second, a Jacobian whale optimization algorithm for fine registration (JWOA-FR) is proposed by incorporating local gradient information. The algorithm employs gradient descent on optimal whale individuals to dynamically guide global search updates, thereby enhancing both registration accuracy and efficiency. Finally, a threshold is set to remove the outliers contained in the workpieces based on the information of the matched point pairs. The iterative closest point (ICP) algorithm is further used to improve registration accuracy for data without outliers. The experimental results showed that registration errors of large workpieces 1, 2, and 3 were 2.0755 mm, 2.3955 mm, and 2.5823 mm, respectively, after outlier removal, which indicates that the proposed method is applicable to data with outliers, and the registration accuracy meets the requirements.

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.

Towards 3D lidar point cloud registration improvement using optimal neighborhood knowledge

With the rapid development of binocular reconstruction, fringe projection profilometry, and time of flight, 3D imaging technology has been widely applied in the field of 3D measurement. However, due to limited measurement range and self-occlusion, point cloud registration methods are often used to obtain larger or more complete 3D contours. Although many scholars have proposed various point cloud registration methods, the accuracy and efficiency of point cloud registration still need to be further improved, especially for point clouds with different density or non-rigid transformation. Image registration technology based on image correlation has been developed for many years and has achieved great success in fields such as computer vision, photomechanics, and photogrammetry. Therefore, a simple and direct idea in this paper is to transform the point cloud registration problem into volume image correlation problem. By this, an efficient image registration method based on fast Fourier transform and an inverse compositional Gaussian Newton optimization method that only needs to calculate the Hessian matrix once can be introduced into the point cloud registration field, which can greatly improve the speed and accuracy of point cloud registration. Comparative experiments have shown that our method has doubled the accuracy and efficiency compared to the iterative closest point (ICP) method, and its practicality has also been verified in impeller reconstruction experiments.

Light detection and ranging (LiDAR) sensors provide accurate 3-D point clouds for noncooperative spacecraft pose estimation. Several robust methods, such as iterative closest point, exist to perform a local refinement of the pose starting from an initial estimate. However, finding the initial pose of the spacecraft is a global optimization problem, which is challenging to solve in real time. This is especially true on space hardware with limited computing power. In addition, many spacecrafts have a shape with multiple symmetries, making an unambiguous initial pose estimation impossible. This work introduces a convolutional-neural-network-based pose estimation method, accounting for potential symmetries of the target satellite. The point clouds are projected to a 2-D depth image before being processed by the network. To generate a sufficient amount of training data, a LiDAR simulator integrating multiple effects such as reflections or laser beam divergence is developed. While being trained solely on synthetic point clouds, the pose estimation method shows to be precise, efficient, and reliable when evaluated on real point clouds taken at a hardware-in-the-loop rendezvous test facility. A runtime evaluation on potential space computing hardware is also performed to demonstrate the applicability of the method to real-time onboard pose estimation.

Localization and mapping are key requirements for autonomous mobile systems to perform navigation and interaction tasks. Iterative Closest Point (ICP) is widely applied for LiDAR scan-matching in the robotic community. In addition, the standard ICP algorithm only considers geometric information when iteratively searching for the nearest point. However, ICP individually cannot achieve accurate point-cloud registration performance in challenging environments such as dynamic environments and highways. Moreover, the computation of searching for the closest points is an expensive step in the ICP algorithm, which is limited to meet real-time requirements, especially when dealing with large-scale point-cloud data. In this paper, we propose a segment-based scan-matching framework for six degree-of-freedom pose estimation and mapping. The LiDAR generates a large number of ground points when scanning, but many of these points are useless and increase the burden of subsequent processing. To address this problem, we first apply an image-based ground-point extraction method to filter out noise and ground points. The point cloud after removing the ground points is then segmented into disjoint sets. After this step, a standard point-to-point ICP is applied into to calculate the six degree-of-freedom transformation between consecutive scans. Furthermore, once closed loops are detected in the environment, a 6D graph-optimization algorithm for global relaxation (6D simultaneous localization and mapping (SLAM)) is employed. Experiments based on publicly available KITTI datasets show that our method requires less runtime while at the same time achieves higher pose estimation accuracy compared with the standard ICP method and its variants.

The iterative closest point (ICP) algorithm is widely used in three-dimensional (3D) point cloud registration, and it is very stable and robust. However, its biggest drawback is being easily trapped in a local optimal solution, which results in the incorrect registration result. Currently, there is neither a clear effective range to define whether the ICP algorithm will fall into a local optimum nor a study providing a comprehensive evaluation of the ICP algorithm. In this paper, we take the overlap ratio, angle, distance, and noise as the influencing factors of ICP and evaluate the validity, robustness, accuracy, and efficiency of point-to-point and point-to-plane ICP by using four datasets. We first analyze the effective ranges of the two ICP algorithms with respect to overlap ratio, angle, and distance and then propose a universal effective range for the three factors. Next, the effect of Gaussian noise on the validity and accuracy of two ICPs is evaluated. We also analyze the factors influencing ICP accuracy and explain their changing rules. We finally study the effect of different parameters on the efficiency. All results are compared by using point-to-point and point-to-plane ICP algorithms. The results show that the overlap ratio has no effect on validity, but it has a significant influence on accuracy. The angle has a great impact on the validity and efficiency of ICP but has no effect on accuracy. The distance only affects validity, has a limited effect on efficiency and no effect on accuracy. Meanwhile, Gaussian noise has a little effect on the validity. In addition, the general effective range of point-to-point ICP is larger than that of point-to-plane ICP, but the point-to-plane ICP algorithm presents a better efficiency. The point-to-point ICP is more robust to Gaussian noise with respect to validity, while the point-to-plane is more resistant in terms of accuracy.

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.