Point Cloud Registration Algorithm Research Articles

Point Cloud Registration Method Based on Improved TLBO for Landing Gear Components Measurement

When using point cloud technology to measure the dimension and geometric error of aircraft landing gear components, the point cloud data obtained after scanning may have certain differences because of the sophistication and diversity of the components that make up the landing gear. However, when using traditional point cloud registration algorithms, if the initial pose between point clouds is poor, it can lead to significant errors in the final registration results or even registration failure. Furthermore, the significant difference in registration results between point clouds can affect the final measurement results. Adopting Teaching-Learning-Based Optimization (TLBO) to solve some optimization problems has unique advantages such as high accuracy and good stability. This study integrates TLBO with point cloud registration. To increase the probability of using TLBO for point cloud registration to search for the global optimal solution, adaptive learning weights are first introduced during the learner phase of the basic TLBO. Secondly, an additional tutoring phase has been designed based on the symmetry and unimodality of the normal distribution to improve the accuracy of the solution results. In order to evaluate the performance of the proposed algorithm, it was first used to solve the CEC2017 test function. The comparison results with other metaheuristics showed that the improved TLBO has excellent comprehensive performance. Then, registration experiments were conducted using the open point cloud dataset and the landing gear point cloud dataset, respectively. The registration results showed that the point cloud registration method proposed in this paper has strong competitiveness.

Geodesic-Based Maximal Cliques Search for Non-Rigid Human Point Cloud Registration.

Non-rigid point cloud registration holds significant importance for human body pose analysis in the fields of sports, medicine, gaming, etc. In this paper, we propose a non-rigid point cloud registration algorithm based on geodesic distance measurement, which can improve the accuracy of the registration for matching point pairs during non-rigid deformations. Firstly, a graph is constructed for two sets of point clouds using geodesic distance measurement considering that geodesic distance changes minimally during non-rigid deformation of the human body, which can preserve the point cloud matching information between corresponding points. Furthermore, a maximal clique search is employed to find combinations of matching pairs between point clouds. Finally, by driving the human body model parameters, sparse matching pairs are overlapped as much as possible to achieve non-rigid point cloud registration of the human body. The accuracy of the proposed algorithm is verified with FAUST and CAPE datasets.

Massive Point Cloud Processing for Efficient Construction Quality Inspection and Control.

The construction of large-scale civil infrastructures requires massive spatiotemporal data to support the management and control of scheduling, quality control, and safety monitoring. Existing artificial-intelligence-based data processing algorithms rely heavily on experienced engineers to adjust the parameters of data processing, which is inefficient and time-consuming when dealing with huge datasets. Limited studies have compared the performance of different algorithms on a unified dataset. This study proposes a framework and evaluation system for comparing different data processing policies for processing huge spatiotemporal data in construction quality control. The proposed method compares the combination of multiple types of algorithms involved in the processing of massive point cloud data. The performance of data processing strategies is evaluated through this framework, and the optimal point cloud processing strategies are explored based on registration accuracy and data fidelity. Results show that a reasonable choice of combinations of point cloud sampling, filtering, and registration algorithms can significantly improve the efficiency of point cloud data processing and satisfy engineering demands for data accuracy and completeness. The proposed method can be applied to the civil engineering problem of processing a large amount of point cloud data and selecting the optimal processing method.

Robust and correspondence-free point cloud registration: an extended approach with multiple hypotheses evaluation

AbstractPoint 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.

Second-order Spatial Measures Low Overlap Rate Point Cloud Registration Algorithm Based On FPFH Features1

When the sensor dynamically collects point cloud data for object or map reconstruction, the registration effect is poor and reconstruction application is difficult with a too low overlap rate of the collected point cloud data. The reason is that the objects are covered, the sensor rotation angle is too large and the speed of movement is too fast. Because of these problems, this paper proposes a point cloud registration algorithm based on FPFH feature matching, combined with second-order spatial measures. Firstly, using the FPFH feature extraction algorithm, the features of each point are extracted, and then feature matching is performed to generate the set of feature point pairs. Secondly, the second-order spatial measure is used to calculate the set of feature point pairs to obtain the second-order spatial measure matrix scores and sort them. Finally, the dichotomy method is used to find the appropriate second-order spatial measure scores for distinguishing the inner points (points in the overlap region) from the outer points (points that do not belong to the overlap region as well as the mismatched points and some disturbances). The contrast experiments between this algorithm and three common point cloud registration algorithms, FPFH-ICP, 4PCS-ICP, and NDT-ICP, on the Stanford dataset and 3DMatch dataset shows that the registration accuracy of the other algorithms decreases significantly with a low overlap rate. But this algorithm still has a high registration accuracy and is less affected by outliers than the other algorithms. Besides, this algorithm can still maintain a good registration effect on different data sets.

FELC-SLAM: feature extraction and loop closure optimized lidar SLAM system

Abstract Simultaneous Localization and Mapping (SLAM) is one of the key technologies in robot navigation and autonomous driving, playing an important role in robot navigation. Due to the sparsity of LiDAR data and the singularity of point cloud features, accuracy loss of LiDAR SLAM can occur during point cloud matching and localization. In response to these issues, this paper proposes a LiDAR Measurement SLAM algorithm that integrates multi type geometric feature extraction and optimized point cloud registration algorithms. This article first adopts advanced ground segmentation methods and feature segmentation strategies, including ground features, edge features, planar features, and spherical features, to improve matching accuracy. In addition, this article improves the previous method for extracting edge and planar features, extracting clearer and more robust line and surface features to address the degradation of geometric features. Finally, by introducing a robust decoupling global registration method for loop closure detection in the backend of the system, the sparsity problem of distant point clouds and the degradation problem caused by the reduction of inner layers in point cloud registration were effectively solved. In the evaluation of the KITTI dataset, our algorithm reduced absolute trajectory error values by 60%, 29%, and 71% compared to LeGO-LOAM in multi loop and feature constrained scenarios (such as sequences 00, 01, and 02), respectively. The evaluation of the M2DGR and Botanic Garden datasets also indicates that the positioning accuracy of our algorithm is superior to other advanced LiDAR SLAM algorithms.

Research on Student's T-Distribution Point Cloud Registration Algorithm Based on Local Features.

LiDAR offers a wide range of uses in autonomous driving, remote sensing, urban planning, and other areas. The laser 3D point cloud acquired by LiDAR typically encounters issues during registration, including laser speckle noise, Gaussian noise, data loss, and data disorder. This work suggests a novel Student's t-distribution point cloud registration algorithm based on the local features of point clouds to address these issues. The approach uses Student's t-distribution mixture model (SMM) to generate the probability distribution of point cloud registration, which can accurately describe the data distribution, in order to tackle the problem of the missing laser 3D point cloud data and data disorder. Owing to the disparity in the point cloud registration task, a full-rank covariance matrix is built based on the local features of the point cloud during the objective function design process. The combined penalty of point-to-point and point-to-plane distance is then added to the objective function adaptively. Simultaneously, by analyzing the imaging characteristics of LiDAR, according to the influence of the laser waveform and detector on the LiDAR imaging, the composite weight coefficient is added to improve the pertinence of the algorithm. Based on the public dataset and the laser 3D point cloud dataset acquired in the laboratory, the experimental findings demonstrate that the proposed algorithm has high practicability and dependability and outperforms the five comparison algorithms in terms of accuracy and robustness.

Fast Robust Point Cloud Registration Based on Compatibility Graph and Accelerated Guided Sampling

Point cloud registration is a crucial technique in photogrammetry, remote sensing, etc. A generalized 3D point cloud registration framework has been developed to estimate the optimal rigid transformation between two point clouds using 3D key point correspondences. However, challenges arise due to the uncertainty in 3D key point detection techniques and the similarity of local surface features. These factors often lead to feature descriptors establishing correspondences containing significant outliers. Current point cloud registration algorithms are typically hindered by these outliers, affecting both their efficiency and accuracy. In this paper, we propose a fast and robust point cloud registration method based on a compatibility graph and accelerated guided sampling. By constructing a compatible graph with correspondences, a minimum subset sampling method combining compatible edge sampling and compatible vertex sampling is proposed to reduce the influence of outliers on the estimation of the registration parameters. Additionally, an accelerated guided sampling strategy based on preference scores is presented, which effectively utilizes model parameters generated during the iterative process to guide the sampling toward inliers, thereby enhancing computational efficiency and the probability of estimating optimal parameters. Experiments are carried out on both synthetic and real-world data. The experimental results demonstrate that our proposed algorithm achieves a significant balance between registration accuracy and efficiency compared to state-of-the-art registration algorithms such as RANSIC and GROR. Even with up to 2000 initial correspondences and an outlier ratio of 99%, our algorithm achieves a minimum rotation error of 0.737° and a minimum translation error of 0.0201 m, completing the registration process within 1 s.

Underwater Mapping and Optimization Based on Multibeam Echo Sounders

Multibeam echo sounders (MBESs) enable extensive underwater environment exploration. However, due to weak correlation between adjacent multibeam sonar data and difficulties in inter-frame feature matching, the resulting underwater mapping accuracy frequently falls short of the desired level. To address this issue, this study presents the development of a multibeam data processing system, which includes functionalities for sonar parameter configuration, data storage, and point cloud conversion. Subsequently, an Iterative Extended Kalman Filter (iEKF) algorithm is employed for odometry estimation, facilitating the initial construction of the point cloud map. To further enhance mapping accuracy, we utilize the Generalized Iterative Closest Point (GICP) algorithm for point cloud registration, effectively merging point cloud data collected at different times from the same location. Finally, real-world lake experiments demonstrate that our method achieves an Absolute Trajectory Error (ATE) of 15.10 m and an average local point cloud registration error of 0.97 m. Furthermore, we conduct measurements on various types of artificial targets. The experimental results indicate that the average location error of the targets calculated by our method is 4.62 m, which meets the accuracy requirements for underwater target exploration.

An Improved Large Planar Point Cloud Registration Algorithm

The traditional Iterative Closest Point (ICP) algorithm often suffers from low computational accuracy and efficiency in certain scenarios. It is highly sensitive to the initial pose, has a poor ability to resist interference, and frequently becomes trapped in local optima. Extracting feature points accurately from partially overlapping points with weak three-dimensional features, such as smooth planes or surfaces with low curvature, is challenging using only the traditional ICP algorithm for registration. This research introduces a “First Rough then Precise” registration strategy. Initially, the target position is extracted in complex environments using an improved clustering method, which simultaneously reduces the impact of environmental factors and noise on registration accuracy. Subsequently, an improved method for calculating normal vectors is applied to the Fast Point Feature Histogram (FPFH) to extract feature points, providing data for the Sample Consistency Initial Algorithm (SAC-IA). Lastly, an improved ICP algorithm, which has strong anti-interference capabilities for partially overlapping point clouds, is utilized to merge such point clouds. In the experimental section, we validate the feasibility and precision of the proposed algorithm by comparing its registration outcomes with those of various algorithms, using both standard point cloud dataset models and actual point clouds obtained from camera captures.

Subpocket Similarity-Based Hit Identification for Challenging Targets: Application to the WDR Domain of LRRK2.

We herewith applied a priori a generic hit identification method (POEM) for difficult targets of known three-dimensional structure, relying on the simple knowledge of physicochemical and topological properties of a user-selected cavity. Searching for local similarity to a set of fragment-bound protein microenvironments of known structure, a point cloud registration algorithm is first applied to align known subpockets to the target cavity. The resulting alignment then permits us to directly pose the corresponding seed fragments in a target cavity space not typically amenable to classical docking approaches. Last, linking potentially connectable atoms by a deep generative linker enables full ligand enumeration. When applied to the WD40 repeat (WDR) central cavity of leucine-rich repeat kinase 2 (LRRK2), an unprecedented binding site, POEM was able to quickly propose 94 potential hits, five of which were subsequently confirmed to bind in vitro to LRRK2-WDR.

A Point Cloud Registration Algorithm Based on Weighting Strategy for 3D Indoor Spaces

Point cloud registration is a technology that aligns point cloud data from different viewpoints by computing coordinate transformations to integrate them into a specified coordinate system. Many cutting-edge fields, including autonomous driving, industrial automation, and augmented reality, require the registration of point cloud data generated by millimeter-wave radar for map reconstruction and path planning in 3D environments. This paper proposes a novel point cloud registration algorithm based on a weighting strategy to enhance the accuracy and efficiency of point cloud registration in 3D environments. This method combines a statistical weighting strategy with a point cloud registration algorithm, which can improve registration accuracy while also increasing computational efficiency. First, in 3D indoor spaces, we apply PointNet to the semantic segmentation of the point cloud. We then propose an objective weighting strategy to assign different weights to the segmented parts of the point cloud. The Iterative Closest Point (ICP) algorithm uses these weights as reference values to register the entire 3D indoor space’s point cloud. We also show a new way to perform nonlinear calculations that yield exact closed-form answers for the ICP algorithm in generalized 3D measurements. We test the proposed algorithm’s accuracy and efficiency by registering point clouds on public datasets of 3D indoor spaces. The results show that it works better in both qualitative and quantitative assessments.

The Application Characteristics and Creation of Digital Sculpture Based on Parameter Model

Recently, digital sculpture based on parametric models has emerged both domestically and internationally. To improve the accuracy and efficiency of constructing digital sculpture parameter models, this study proposes a method for constructing digital sculpture parameter models based on improved point cloud registration algorithms by iterating the nearest point algorithm and multi-scale matrix descriptors to increase the iteration efficiency and accuracy of point cloud registration algorithms. The results show that under the Bunny model, the number of three scale feature points is 2146, and the coarse registration error is 0.925 * 10-6 m; As the noise increases, the efficiency of the algorithm proposed in the study increases by an average of 10.1%. The average relative rotation error is reduced by 1-2 orders of magnitude, and the registration time is shortened by 62.7% on average. For a 30dB noise point cloud, it is reduced by one order of magnitude, and as the noise increases, the efficiency of the algorithm proposed in the study increases by an average of 10.1%. In the Dragon model, the number of three scale feature points is 2235, the coarse registration time is only 26 seconds, and the registration error is 0.285 * 10-5m; The average relative rotation error is reduced by 1-2 orders of magnitude, and the registration time is shortened by 62.7% on average. The digital sculpture creation method on the ground of parameter models proposed in this study has improved the registration accuracy and efficiency of parameter models.

Point Cloud Registration Algorithm Based on Adaptive Neighborhood Eigenvalue Loading Ratio

Traditional iterative closest point (ICP) registration algorithms are sensitive to initial positions and easily fall into the trap of locally optimal solutions. To address this problem, a point cloud registration algorithm is put forward in this study based on adaptive neighborhood eigenvalue loading ratios. In the algorithm, the resolution of the point cloud is first calculated and used as an adaptive basis to determine the raster widths and radii of spherical neighborhoods in the raster filtering; then, the adaptive raster filtering is implemented to the point cloud for denoising, while the eigenvalue loading ratios of point neighborhoods are calculated to extract and match the contour feature points; subsequently, sample consensus initial alignment (SAC-IA) is used to carry out coarse registration; and finally, a fine registration is delivered with KD-tree-accelerated ICP. The experimental results of this study demonstrate that the feature points extracted with this method are highly representative while consuming only 35.6% of the time consumed by other feature point extraction algorithms. Additionally, in noisy and low-overlap scenarios, the registration error of this method can be controlled at a level of 0.1 mm, with the registration speed improved by 56% on average over that of other algorithms. Taken together, the method in this study cannot only ensure strong robustness in registration but can also deliver high registration accuracy and efficiency.

Robust colored point cloud alignment based on L*a*b* guided and Cauchy kernel

AbstractPrecision agriculture benefits from point set registration, which can monitor plant health and growth in real time, promote the precise application of fertilizers and pesticides, and provide technical support for achieving sustainable development of agriculture. In this work, we propose a robust point set registration method for precision agriculture based on L*a*b* color guidance, bidirectional search and Cauchy distribution. First, the L*a*b* color guidance is applied to establish accurate correspondences between agricultural RGB‐D data. Second, the bidirectional nearest neighbor search strategy between point sets improves the reliability of establishing correspondences and broadens the convergence domain of the algorithm. Third, Cauchy distribution is utilized as an energy function for noise suppression, which further improves the robustness of the algorithm in dealing with complex vegetation scenes. Finally, results of ablation and simulation experiments indicate that the proposed registration algorithm can achieve more accurate and robust alignment results than other classic and state‐of‐the‐art point cloud registration algorithms to achieve monitoring and comparison of plant growth.

An effective point cloud registration method for three-dimensional reconstruction of pressure piping

Abstract At present, industrial scenes with sparse features and weak textures are widely encountered, and the three-dimensional reconstruction of such scenes is a recognized problem. Pressure pipelines have a wide range of applications in fields such as petroleum engineering, chemical engineering, and hydropower station engineering. However, there is no mature solution for the three-dimensional reconstruction of pressure pipes. The main reason is that the typical scenes in which pressure pipes are found also have relatively few features and textures. Traditional three-dimensional reconstruction algorithms based on feature extraction are largely ineffective for such scenes that are lacking in features. In view of the above problems, this paper proposes an improved interframe registration algorithm based on point cloud fitting with cylinder axis vector constraints. By incorporating geometric feature parameters of a cylindrical pressure pipeline, specifically the axis vector of the cylinder, to constrain the traditional iterative closest point algorithm, the accuracy of point cloud registration can be improved in scenarios lacking features and textures, and some environmental uncertainties can be overcome. Finally, using actual laser point cloud data collected from pressure pipelines, the proposed fitting-based point cloud registration algorithm with cylinder axis vector constraints is tested. The experimental results show that under the same conditions, compared with other open-source point cloud registration algorithms, the proposed method can achieve higher registration accuracy. Moreover, integrating this algorithm into an open-source three-dimensional reconstruction algorithm framework can lead to better reconstruction results.

A Coal Mine Tunnel Deformation Detection Method Using Point Cloud Data.

In recent years, the deformation detection technology for underground tunnels has played a crucial role in coal mine safety management. Currently, traditional methods such as the cross method and those employing the roof abscission layer monitoring instrument are primarily used for tunnel deformation detection in coal mines. With the advancement of photogrammetric methods, three-dimensional laser scanners have gradually become the primary method for deformation detection of coal mine tunnels. However, due to the high-risk confined spaces and distant distribution of coal mine tunnels, stationary three-dimensional laser scanning technology requires a significant amount of labor and time, posing certain operational risks. Currently, mobile laser scanning has become a popular method for coal mine tunnel deformation detection. This paper proposes a method for detecting point cloud deformation of underground coal mine tunnels based on a handheld three-dimensional laser scanner. This method utilizes SLAM laser radar to obtain complete point cloud information of the entire tunnel, while projecting the three-dimensional point cloud onto different planes to obtain the coordinates of the tunnel centerline. By using the calculated tunnel centerline, the three-dimensional point cloud data collected at different times are matched to the same coordinate system, and then the tunnel deformation parameters are analyzed separately from the global and cross-sectional perspectives. Through on-site collection of tunnel data, this paper verifies the feasibility of the algorithm and compares it with other centerline fitting and point cloud registration algorithms, demonstrating higher accuracy and meeting practical needs.

Navigation system for orchard spraying robot based on 3D LiDAR SLAM with NDT_ICP point cloud registration

Autonomous navigation of orchard spraying robots can effectively improve operational efficiency and reduce workload. The conventional robot navigation solutions based on the Global Navigation Satellite System (GNSS) are susceptible to signal loss in orchards due to interference from the canopy of fruit trees. In this paper, an autonomous navigation scheme for orchard spraying robots based on multi-sensor devices and the three-dimensional (3D) LiDAR Simultaneous Localization and Mapping (SLAM) technology. The initial step of the scheme involved the construction of a 3D point cloud map of the orchard using the 3D LiDAR SLAM algorithm. Subsequently, a designed point cloud map transformation algorithm was used to convert the 3D point cloud map of the orchard into a two-dimensional (2D) grid map containing key feature information of the orchard. To enhance the mapping accuracy of the orchard point cloud, a point cloud registration algorithm combining Iterative Closet Point (ICP) and Normal Distributions Transform (NDT) was proposed. This algorithm initially utilized the NDT algorithm for coarse point cloud registration to obtain transformation parameters. Then, the ICP algorithm was applied in conjunction with the obtained parameters for fine registration. Regarding obstacle avoidance, a cooperative obstacle avoidance algorithm based on the Robot Operating System (ROS) multithreaded communication mechanism was introduced. Experimental trials conducted in a standardized spindle-shaped peach orchard validated the successful completion of the SLAM mapping trajectory, which was achieved through the utilization of the proposed NDT_ICP point cloud registration algorithm. The average absolute pose error between the mapped trajectory and the reference trajectory was 1.173 m, with a standard deviation of 0.498 m. The robot's positioning and navigation errors increased with higher speeds, with the largest positioning deviation observed at 1.2 m/s speed, with a maximum lateral positioning error of 7.04 cm. The robot's average lateral navigation error did not exceed 16 cm, and the average heading deviation was less than 8° at different speeds of 0.4, 0.8 and 1.2 m/s. Both the positioning and navigation accuracies of the robot were sufficient to meet the autonomous operational requirements of orchard spraying robots.

Minimal configuration point cloud odometry and mapping

Simultaneous Localization and Mapping (SLAM) refers to the common requirement for autonomous platforms to estimate their pose and map their surroundings. There are many robust and real-time methods available for solving the SLAM problem. Most are divided into a front-end, which performs incremental pose estimation, and a back-end, which smooths and corrects the results. A low-drift front-end odometry solution is needed for robust and accurate back-end performance. Front-end methods employ various techniques, such as point cloud-to-point cloud (PC2PC) registration, key feature extraction and matching, and deep learning-based approaches. The front-end algorithms have become increasingly complex in the search for low-drift solutions and many now have large configuration parameter sets. It is desirable that the front-end algorithm should be inherently robust so that it does not need to be tuned by several, perhaps many, configuration parameters to achieve low drift in various environments. To address this issue, we propose Simple Mapping and Localization Estimation (SiMpLE), a front-end LiDAR-only odometry method that requires five low-sensitivity configurable parameters. SiMpLE is a scan-to-map point cloud registration algorithm that is straightforward to understand, configure, and implement. We evaluate SiMpLE using the KITTI, MulRan, UrbanNav, and a dataset created at the University of Queensland. SiMpLE performs among the top-ranked algorithms in the KITTI dataset and outperformed all prominent open-source approaches in the MulRan dataset whilst having the smallest configuration set. The UQ dataset also demonstrated accurate odometry with low-density point clouds using Velodyne VLP-16 and Livox Horizon LiDARs. SiMpLE is a front-end odometry solution that can be integrated with other sensing modalities and pose graph-based back-end methods for increased accuracy and long-term mapping. The lightweight and portable code for SiMpLE is available at: https://github.com/vb44/SiMpLE.

A Method for Unseen Object Six Degrees of Freedom Pose Estimation Based on Segment Anything Model and Hybrid Distance Optimization

Six degrees of freedom pose estimation technology constitutes the cornerstone for precise robotic control and similar tasks. Addressing the limitations of current 6-DoF pose estimation methods in handling object occlusions and unknown objects, we have developed a novel two-stage 6-DoF pose estimation method that integrates RGB-D data with CAD models. Initially, targeting high-quality zero-shot object instance segmentation tasks, we innovated the CAE-SAM model based on the SAM framework. In addressing the SAM model’s boundary blur, mask voids, and over-segmentation issues, this paper introduces innovative strategies such as local spatial-feature-enhancement modules, global context markers, and a bounding box generator. Subsequently, we proposed a registration method optimized through a hybrid distance metric to diminish the dependency of point cloud registration algorithms on sensitive hyperparameters. Experimental results on the HQSeg-44K dataset substantiate the notable improvements in instance segmentation accuracy and robustness rendered by the CAE-SAM model. Moreover, the efficacy of this two-stage method is further corroborated using a 6-DoF pose dataset of workpieces constructed with CloudCompare and RealSense. For unseen targets, the ADD metric achieved 2.973 mm, and the ADD-S metric reached 1.472 mm. This paper significantly enhances pose estimation performance and streamlines the algorithm’s deployment and maintenance procedures.