Efficient coarse registration method using translation- and rotation-invariant local descriptors towards fully automated forest inventory

In surgical navigation-assisted pedicle screw fixation, cross-source pre- and intra-operative point clouds registration faces challenges like significant initial pose differences and low overlapping ratio. Classical algorithms based on feature descriptor have high computational complexity and are less robust to noise, leading to a decrease in accuracy and navigation performance. To address these problems, this paper proposes a coarse-to-fine registration framework. In the coarse registration stage, a Point Matching algorithm based on Curvature Feature Learning (CFL-PM) is proposed. Through CFL-PM and Farthest Point Sampling (FPS), the coarse registration of overlapping regions between the two point clouds is achieved. In the fine registration stage, the Iterative Closest Point (ICP) is used for further optimization. The proposed method effectively addresses the challenges of noise, initial pose and low overlapping ratio. In noise-free point cloud registration experiments, the average rotation and translation errors reached 0.34° and 0.27 mm. Under noisy conditions, the average rotation error of the coarse registration is 7.28°, and the average translation error is 9.08 mm. Experiments on pre- and intra-operative point cloud datasets demonstrate the proposed algorithm outperforms the compared algorithms in registration accuracy, speed, and robustness. Therefore, the proposed method can achieve the precise alignment of the surgical navigation-assisted pedicle screw fixation.

Accurate and robust registration of low overlapping point clouds

The laser point cloud has high density and large amount of data, which will cause the point cloud coarse registration to have a high time cost and unstable registration accuracy. Point cloud fine registration takes the transformation parameters obtained from the coarse registration as the initial value, and usually uses the standard Iterative Closest Point(ICP) algorithm to find the corresponding points and iteratively optimize the transformation parameters. For improving the accuracy and robustness of the laser point cloud registration, this paper proposes to use the 3D Difference-of-Gaussian(DoG) operator to extract the key points with curvature invariance, and then input the key point cloud into 4-Points Congruent Sets(4PCS) algorithm performs coarse registration, and finally uses the standard ICP algorithm to perform fine registration. After using the method in this paper to do registration experiments on three datasets, the effectiveness of the method is verified.

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.

In the process of using structured light technology to obtain indoor point clouds, due to the limited field of view of the device, it is necessary to obtain multiple point clouds of different wall surfaces. Therefore, merging the point cloud is necessary to acquire a complete point cloud. However, due to issues such as the sparse geometric features of the wall point clouds and the high similarity of multiple point clouds, the merging effect of point clouds is poor. In this paper, we leverage artificially enhanced features to improve the accuracy of registration in this scenario. Firstly, we design feature markers and present their layout criteria. Then, the feature information of the marker is extracted based on the Color Signature of Histograms of OrienTations (Color-SHOT) descriptor, and coarse registration is realized through the second-order similarity measure matrix. After that, precise registration is achieved using the Iterative Closest Point (ICP) method based on markers and overlapping areas. Finally, the global error of the point cloud registration is optimized by loop error averaging. Our method enables the high-precision reconstruction of integrated home design scenes lacking significant features at a low cost. The accuracy and validity of the method were verified through comparative experiments.

During the process of the point cloud registration, the problem that the accuracy is not high is due to the unknown relative position of the multi-view point clouds and the diversity of the target structure. This paper proposes a point cloud registration method based on extracting overlapping regions to solve it. First of all, according to the characteristics of the target geometric structure, each point cloud is divided into blocks and the ESF multi-dimensional shape descriptors of each point cloud block are constructed, the region with the greatest similarity between the descriptors, namely the overlapping region between the point clouds. Then our algorithm uses the Super Four Point Fast Robust Matching (Super4PCS) algorithm to execute a coarse registration of point clouds in overlapping regions, the initial positions of the point clouds after the coarse registration are obtained according to the consistency constraints, and finally uses the iterative closest point algorithm (ICP) to precisely register the overlapping region and obtain the final point cloud model. Compared with traditional Super4PCS algorithm, the experimental results show that the method proposed in this paper effectively improves the accuracy and accelerates the process of point cloud registration.

As a fundamental process of three-dimensional lidar point cloud data (3D LPCD) processing, numerous registration methods are time consuming and easily fall into local optimum. A 3D LPCD registration method based on the iterative closest point (ICP) algorithm, which is improved by the Gaussian mixture model (GMM) considering corner features, is proposed in this article to address these limitations. The GMM method is used for coarse registration, and the input original 3D LPCD is replaced by corner features extracted by the improved 3D Harris algorithm to improve the efficiency of coarse registration. In addition, a satisfactory initial position between the reference and the moving 3D LPCD is prepared for ICP fine registration by coarse registration; thus, the accuracy of fine registration can be improved. The registration accuracy and efficiency of the new method is proved to be higher than those of four common ICP-based registration methods (3DSC-RANSACICP, 3DSC-SAC-IAICP, FPFH-RANSACICP, and FPFH-SAC-IAICP), and GMM registration methods, and the local optimum problem is effectively addressed.

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.

Automatic registration of unordered point clouds is the prerequisite for urban reconstruction. However, most of the existing technologies still suffer from some limitations. On one hand, most of them are sensitive to noise and repetitive structures, which makes them infeasible for the registration of large-scale point clouds. On the other hand, most of them dealing with point clouds with limited overlaps and unpredictable location. All these problems make it difficult for registration technology to obtain qualified results in outdoor point cloud. To overcome these limitations, this paper presents a grid graph-based point cloud registration (GGR) algorithm to align pairwise scans. First, point cloud is divided into a set of 3D grids. We propose a voting strategy to measure the similarity between two grids based on feature descriptor, transforming the superficial correspondence into 3D grid expression. Next, a graph matching is proposed to capture the spatial consistency from putative correspondences, and graph matching hierarchically refines the corresponding grids until obtaining point-to-point correspondences. Comprehensive experiments demonstrated that the proposed algorithm obtains good performance in terms of successful registration rate, rotation error, translation error, and outperformed the state-of-the-art approaches.

Abstract. Remote sensing techniques are an important tool in fluvial transport monitoring, since they allow for effective evaluation of the volume of transported material. Nevertheless, there is no methodology for automatic calculation of movement parameters of individual rocks. These parameters can be determined by point cloud registration. Hence, the goal of this study is to develop a robust algorithm for terrestrial laser scanning point cloud registration. The registration is based on Iterative Closest Point algorithm, which requires well established initial parameters of transformation. Thus, we propose to calculate the initial parameters based on key points representing the maximum of Gaussian curvature. For each key point the set of geometrical features is calculated. The key points are then matched between two point clouds as a nearest neighbor in feature domain. Different combinations of neighborhood sizes, feature subsets, metrics and number of nearest neighbors were tested to obtain the highest ratio between properly and improperly matched key points. Finally, RANSAC algorithm was used to calculate the initial transformation parameters between the point clouds and the ICP algorithm was used for calculation of final transformation parameters. The investigations carried out on sample point clouds representing rocks enabled the adjustment of parameters of the algorithm and showed that the Gaussian curvature can be used as a 3-dimentional key point detector for such objects. The proposed algorithm enabled to register point clouds with the mean distance between point clouds equal to 3 mm.

Accurate and efficient registration of unmanned aerial vehicle light detection and ranging (UAV‐lidar) and terrestrial lidar (T‐lidar) data is crucial for forest structure parameter extraction. This study proposes a novel method based on a starburst pattern for the automatic registration of UAV‐lidar and T‐lidar data in forest scenes. It employs density‐based spatial clustering of applications with noise (DBSCAN) for individual tree identification, constructs starburst patterns separately from both lidar sources, and utilises polar coordinate rotation and matching to achieve coarse registration. Fine registration is achieved using the iterative closest point (ICP) algorithm. Experimental results demonstrate that the starburst‐pattern‐based method achieves the desired registration accuracy (average coarse registration error of 0.157 m). Further optimisation with ICP yields slight improvements with an average fine registration error of 0.149 m. Remarkably, the proposed method is insensitive to the individual tree detection number when exceeding 10, and the tree position error has minimal impact on registration accuracy. Furthermore, our proposed method outperforms two existing methods in T‐lidar and UAV‐lidar registration over forest environments.

Unoccupied Aerial Vehicles (UAVs) equipped with optical instruments are increasingly deployed in high mountain environments to investigate and monitor glacial and periglacial processes. The comparison and fusion of UAV data with airborne and terrestrial data offers the opportunity to analyse spatio-temporal changes in the mountains and to upscale findings from local UAV surveys to larger areas. However, due to the lack of gridded high-resolution data in alpine terrain, the specific challenges and uncertainties associated with the comparison and fusion of multi-temporal data from different platforms in this environment are not well known. Here we make use of UAV, airborne, and terrestrial data from four (peri)glacial alpine study sites with different topographic settings. The aim is to assess the accuracy of UAV photogrammetric products in complex terrain, to point out differences to other products, and to discuss best practices regarding the fusion of multi-temporal data. The surface geometry and characteristic geomorphological features of the four alpine sites are well captured by the UAV data, but the positional accuracies vary greatly. They range from 15 cm (root-mean-square error) for the smallest survey area (0.2 km2) with a high ground control point (GCP) density (40 GCPs km−2) to 135 cm for the largest survey area (>2.5 km2) with a lower GCP density (<10 GCPs km−2). Besides a small number and uneven distribution of GCPs, a low contrast, and insufficient lateral image overlap (<50–70%) seem to be the main causes for the distortions and artefacts found in the UAV data. Deficiencies both in the UAV and airborne data are the reason for horizontal deviations observed between the datasets. In steep terrain, horizontal deviations of a few decimetres may result in surface elevation change errors of several metres. An accurate co-registration and evaluation of multi-temporal UAV, airborne, and terrestrial data using tie points in stable terrain is therefore of utmost importance when it comes to the investigation of surface displacements and elevation changes in the mountains. To enhance the accuracy and quality of UAV photogrammetry, the use of UAVs equipped with multi-spectral cameras and high-precision positioning systems is recommended, especially in rugged terrain and snow-covered areas.

<title>Abstract</title> Wheels are critical components of railway vehicles, and the dynamic measurement of wheel parameters is of paramount importance for the safe operation of trains.To enhance the matching accuracy in the existing dynamic measurement processes for train wheel parameters, this paper proposes an improved point cloud registration algorithm based on key point fusion of the Super-4PCS(Super Four-Points Congruent Sets) and ICP (Iterative Closest Point) algorithm. Firstly, point cloud filtering and normal estimation are performed on the wheel point cloud data to obtain source and target point clouds with normal information. Subsequently, the ISS algorithm is employed to extract key points, and the FPFH(Fast Point Feature Histograms) point cloud feature descriptor is utilized to characterize the extracted key points. Then, a two-level registration strategy is used to improve registration accuracy, in which the Super-4PCS algorithm is applied for primary coarse registration and the ICP algorithm is used for the secondary fine registration, respectively. Finally, the experiment is conducted to validate the proposed algorithm and the performance of the algorithm is further comparative analyzed through the listed registration evaluation metrics. Experimental results demonstrate that the proposed algorithm exhibits significant improvements in registration accuracy and robustness for wheel point cloud data compared to the traditional algorithms.

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.

For the defects of bubbles and foreign objects under the protective film of electric vehicle batteries, it is difficult to accurately identify them over traditional 2D optical images. In this paper, we first propose a supervoxel-based region growing algorithm for pre-segmentation of point clouds. Secondly, we utilize radial basis function interpolation and threshold segmentation methods to accurately segment defect point clouds from the entire point cloud. Finally, we develop a feature descriptor and combine it with support vector machine to classify bubbles and foreign objects under the film. This paper achieves the identification of bubbles and foreign objects under the film through two steps: point cloud segmentation and point cloud classification. Experimental results demonstrate that the proposed point cloud segmentation method exhibits high robustness to noise and the intrinsic curvature of the workpiece. Additionally, in the classification scenario presented in this paper, the proposed feature descriptor outperforms classical feature descriptors. Compared to image-based deep learning methods, the defect recognition algorithm proposed in this paper has clear principles and superior performance, with precision and recall of 95.63% and 96.95%, and an intersection over union metric of 0.926.