Iterative Closest Point Algorithm Research Articles

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.

Four-Dimensional Digital Monitoring and Registering of Historical Architecture for the Preservation of Cultural Heritage

Preserving cultural heritage through monitoring, registering, and analyzing damage in historical architectural structures presents significant financial and logistical burdens. Developed approaches for monitoring and registering 4D (4-dimensional)-scanned range and raster images of damaged objects were investigated in a case study of historical Baron Palace in Egypt. In the methodology, we first prepared and observed the damaged historical models. The damaged historical models were scanned using a laser scanner at a predetermined date and time. Simultaneously, digital images of the models were captured (by a calibrated digital camera) and stored on a researcher’s tablet device. By observing and comparing the scanned models with the digital images, geometric defects and their extent are identified. Then, the observed data components were detected on the map. Then, damaged statue materials were investigated using system of energy dispersive (SEM; scanning electron microscope, Gemini Zeiss-Ultra 55) and XRF (X-ray fluorescence) spectroscopic analysis to identify the statue’s marble elements, and the results indicate that SEM-EDX and XRF analyses accurately identify major and minor compositions of the damaged statue. Then, the damaged models were registered in two stages. In the registration stages, the corresponding points were determined automatically by detecting the closest points in the clouds and ICP (iterative closest point) algorithm in RiSCAN. The point clouds (of the Palace and damaged statues) gave very detailed resolutions and more realistic images in RiSCAN, but it is a costly program. Finally, the accuracies of the registration tasks were assessed; the standard deviations are within acceptable limits and tend to increase irregularly as the number of polydata observations used in the registration calculations increase.

Application of Micro-Plane Projection Moving Least Squares and Joint Iterative Closest Point Algorithms in Spacecraft Pose Estimation

Application of Micro-Plane Projection Moving Least Squares and Joint Iterative Closest Point Algorithms in Spacecraft Pose Estimation

Multi-GPU 3D k-nearest neighbors computation with application to ICP, point cloud smoothing and normals computation

The k-Nearest Neighbors algorithm is a fundamental algorithm that finds applications in many fields like Machine Learning, Computer Graphics, Computer Vision, and others. The algorithm determines the closest points (d-dimensional) of a reference set R according to a query set of points Q under a specific metric (Euclidean, Mahalanobis, Manhattan, etc.). This work focuses on the utilization of multiple Graphical Processing Units for the acceleration of the k-Nearest Neighbors algorithm with large or very large sets of 3D points. With the proposed approach the space of the reference set is divided into a 3D grid which is used to facilitate the search for the nearest neighbors. The search in the grid is performed in a multiresolution manner starting from a high-resolution grid and ending up in a coarse one, thus accounting for point clouds that may have non-uniform sampling and/or outliers. Three important algorithms in reverse engineering are revisited and new multi-GPU versions are proposed based on the introduced KNN algorithm. More specifically, the new multi-GPU approach is applied to the Iterative Closest Point algorithm, to the point cloud smoothing, and to the point cloud normal vectors computation and orientation problem. A series of tests and experiments have been conducted and discussed in the paper showing the merits of the proposed multi-GPU approach.

Determination of Accuracy and Usability of a SLAM Scanner GeoSLAM Zeb Horizon: A Bridge Structure Case Study

The presented paper focuses on testing the performance of a SLAM scanner Zeb Horizon by GeoSLAM for the creation of a digital model of a bridge construction. A cloud acquired using a static scanner Leica ScanStation P40 served as a reference. Clouds from both scanners were registered into the same coordinate system using a Trimble S9 HP total station. SLAM scanner acquisition was performed independently in two passes. The data acquired using the SLAM scanner suffered from relatively high noise. Denoising using the MLS (Moving Least Squares) method was performed to reduce noise. An overall comparison of the point clouds was performed on both the original and MLS-smoothed data. In addition, the ICP (Iterative Closest Point) algorithm was also used to evaluate local accuracy. The RMSDs of MLS-denoised data were approximately 0.02 m for both GeoSLAM passes. Subsequently, a more detailed analysis was performed, calculating RMSDs for several profiles of the construction. This analysis revealed that the deviations of SLAM data from the reference data did not exceed 0.03 m in any direction (longitudinal, transverse, elevation) which is, considering the length of the bridge of 133 m, a very good result. These results demonstrate a high applicability of the tested scanner for many applications, such as the creation of digital twins.

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.

Temporal Shape Changes of Pedicle screw-rod Constructs After Lumbar Interbody Fusion.

Retrospective multicenter study. To examine the shape change of screw-rod constructs over time following short-segment lumbar interbody fusion and to clarify its relationship to clinical characteristics. No study has focused on the shape change of screw-rod constructs after short-segment fusion and its clinical implications. One hundred and eight patients who had single-level lumbar interbody fusion with pedicle screws and cages were enrolled. Three-dimensional (3D) images of screw-rod constructs were generated from baseline CT on the day after surgery and follow-up CT, and were superposed on the right and left side, respectively, using the iterative closest point algorithm. The shape change was quantitatively assessed by computing the median distance between the 3D images, which was defined as the shape change value. Among the five time-course categories of follow-up CT (≤1 month, 2-3 months, 4-6 months, 7-12 months, ≥13 months), the shape change values were compared. The relationships between the shape change values and clinical characteristics, such as age, CT-derived vertebral bone mineral density, screw and rod materials, and postoperative interbody fusion status, cage subsidence, and screw loosening, were evaluated. A total of 237 follow-up CTs were included (≤1 month [34 scans], 2-3 months [33 scans], 4-6 months [80 scans], 7-12 months [48 scans], ≥13 months [42 scans]) because many patients underwent multiple follow-up CTs. There were significant differences in shape change values among the time-course categories (P<0.001 in Kruskal-Wallis test). Most shape changes occurred within 6 months postoperatively, with no significant changes observed at 7 months or more. There were no significant relationships between the shape change values and each clinical characteristic. The temporal shape changes of screw-rod constructs following short-segment lumbar interbody fusion progressed up to 6 months after surgery but not significantly thereafter.

Semantic Segmentation Method for Road Intersection Point Clouds Based on Lightweight LiDAR

Lightweight LiDAR, characterized by its ease of use and cost-effectiveness, offers advantages in road intersection information acquisition. This study used lightweight LiDAR to collect 3D point cloud data from an urban road intersection and propose a semantic segmentation model based on the improved RandLA-Net. Initially, raw data from multiple positions and perspectives were obtained, and complete road intersection point clouds were stitched together using the iterative closest point algorithm for sequential registration. Subsequently, a semantic segmentation method for point clouds based on the improved RandLA-Net was proposed. This method included a spatial information encoding module based on feature similarities and a feature enhancement module based on multi-pooling fusion. This model optimized the feature aggregation capabilities during downsampling with the weighted cross-entropy loss function applied to reduce the impact of input sample scale imbalances. In comparisons of the improved RandLA-Net with PointNet++ and RandLA-Net on the same dataset, our method showed improved segmentation accuracy for various categories. The overall prediction accuracy on two road intersection point cloud test sets was 87.68% and 89.61%, with average F1 scores of 82.76% and 80.61%, respectively. Most notably, the prediction accuracy for road surface areas reached 94.48% and 94.79%. The results show that our model can enrich the spatial feature expression of input data and enhance semantic segmentation performance in road intersection scenarios.

Automatic image alignment and stitching for ultrasound-based robotic inspection of complex geometry components

Robotic inspection of complex geometry components using immersion ultrasonic techniques is relevant for many ultrasonic Non-Destructive Testing (NDT) applications in different industries. To image large component, ultrasonic probe is manipulated around the component immersed in water using a robotic guided system to create a tiled image of the entire component. Due to the mechanical vibrations of the high-speed robotic arm, the probe position coordinates provided by the robotic system are not precise enough to ensure an accurate reconstruction (stitching) of a composite image from all individual images. In this work, we propose a stitching method specifically designed to create a single 2D image of the surface of an inspected component from a stack of Total Focusing Method (TFM) images. This stitching method uses Iterative Closest Point (ICP) registration to estimate a 2D rigid transformation between two consecutive 2D images, by maximizing the overlap between the surface geometries extracted from each image. The capabilities of this imaging technique are illustrated by various simulated and experimental results carried out in a water tank. Significant improvements in surface image quality, leading to accurate surface reconstruction, are shown for vertical vibrations with displacements of more than two operating wavelengths and for rotational vibrations with deviation angles of less than 1°. The results also show that the resolving power of the ICP algorithm decreases for strong rotational vibrations.

Normscan: open-source Python software to create average models from CT scans.

Age-matched average 3D models facilitate both surgical planning and intraoperative guidance of cranial birth defects such as craniosynostosis. We aimed to develop an algorithm that accepts any number of CT scans as input and generates highly accurate, average models with minimal user input that are ready for 3D printing and clinical use. Using a compiled database of 'normal' pediatric computed tomography (CT) scans, we report Normscan, an open-source platform built in Python that allows users to generate normative models of CT scans through user-defined landmarks. We use the basion, nasion, and left and right porions as anatomical landmarks for initial correspondence and then register the models using the iterative closest points algorithm before downstream averaging. Normscan is fast and easy to use via our user interface and also creates highly accurate average models of any number of input models. Additionally, it is highly repeatable, with coefficients of variance for the surface area and volume of the average model being less than 3% across ten independent trials. Average models can then be 3D printed and/or visualized in augmented reality. Normscan provides an end-to-end pipeline for the creation of average models of skulls. These models can be used for the generation of databases of specific demographic anatomical models as well as for intraoperative guidance and surgical planning. While Normscan was designed for craniosynostosis repair, due to the modular nature of the algorithm, Normscan has many applications in other areas of surgical planning and research.

Automatic extraction of facial median sagittal plane for patients with asymmetry based on the EDMA alignment algorithm.

We aimed to establish a novel method for automatically constructing three-dimensional (3D) median sagittal plane (MSP) for mandibular deviation patients, which can increase the efficiency of aesthetic evaluating treatment progress. We developed a Euclidean weighted Procrustes analysis (EWPA) algorithm for extracting 3D facial MSP based on the Euclidean distance matrix analysis, automatically assigning weight to facial anatomical landmarks. Forty patients with mandibular deviation were recruited, and the Procrustes analysis (PA) algorithm based on the original mirror alignment and EWPA algorithm developed in this study were used to construct the MSP of each facial model of the patient as experimental groups 1 and 2, respectively. The expert-defined regional iterative closest point algorithm was used to construct the MSP as the reference group. The angle errors of the two experimental groups were compared to those of the reference group to evaluate their clinical suitability. The angle errors of the MSP constructed by the two EWPA and PA algorithms for the 40 patients were 1.39 ± 0.85°, 1.39 ± 0.78°, and 1.91 ± 0.80°, respectively. The two EWPA algorithms performed best in patients with moderate facial asymmetry, and in patients with severe facial asymmetry, the angle error was below 2°, which was a significant improvement over the PA algorithm. The clinical application of the EWPA algorithm based on 3D facial morphological analysis for constructing a 3D facial MSP for patients with mandibular deviated facial asymmetry deformity showed a significant improvement over the conventional PA algorithm and achieved the effect of a dental clinical expert-level diagnostic strategy.

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.

MF-LIO: integrating multi-feature LiDAR inertial odometry with FPFH loop closure in SLAM

Abstract Simultaneous localization and mapping (SLAM) is a pivotal technology in autonomous vehicle navigation and a significant research area in robotics. Addressing the inaccuracies in point cloud registration of traditional LiDAR SLAM, which lead to localization and mapping errors, we propose a novel LiDAR inertial odometry approach integrating inertial measurement units and a multi-feature joint registration strategy. Initially, we introduce an innovative ground segmentation method and feature categorization strategy, enhancing ground detection mechanisms and optimizing the feature extraction process. Subsequently, our multi-feature joint registration method computes the pose transformations between current frames and the local map. Finally, we employ a global registration method based on fast point feature histograms feature descriptors for coarse alignment, providing initial estimates for the generalized iterative closest point algorithm, thus efficiently and accurately mitigating cumulative errors. Extensive evaluations on the KITTI dataset and real-world campus environment demonstrate that our approach significantly surpasses existing advanced LiDAR SLAM solutions, achieving over a 24% improvement in pose estimation accuracy.

Toward Robotic Nuclear Decommissioning: Deep Learning-Based Object Classification and Pose Estimation from Partial-View Scans

This study introduces a novel framework for the robotic decommissioning of nuclear facilities, that focuses on object classification and six degrees of freedom pose estimation from partial-view three-dimensional (3-D) scan data. Addressing the challenge of precise robotic manipulation in environments where acquiring full-scan data is impractical, this framework leverages a deep neural network for initial pose estimation, subsequently refined by a modified iterative closest point algorithm. Our method demonstrates high accuracy in identifying scanned objects and estimating their poses from partial-view scans, validated through experiments with 3-D printed mock-ups. This advancement highlights the potential for significantly enhancing robotic automation in nuclear decommissioning and related fields.

Research on prediction of water target motion status of unmanned surface vehicle based on lidar

To improve the perception ability of unmanned boats on water targets and improve the autonomous collision avoidance function of unmanned boats, the problem of target motion state prediction is studied and a method for predicting the motion state of unmanned water targets based on lidar is proposed. Firstly, a three-dimensional point cloud space model is established and the down-sampling and clutter filtering are completed through various filters. Secondly, based on European clustering target segmentation, a target tracking algorithm combined with 3D-IOU metric is proposed to achieve target tracking. Finally, the Kalman filter is introduced for denoising, combined with the iterative closest point algorithm (Iterative Closest Point, ICP) and the centroid calculation algorithm to realize the prediction of the target speed and course. After the test on the lake, the method can meet the real-time requirements, complete the accurate prediction of the target motion state and control the error at a low level. At the same time, this method can also lay the foundation for the development of subsequent autonomous navigation tasks of unmanned vehicles.

Research on Deformation Monitoring of Roadway Surrounding Rock Based on Mobile 3D Laser Scanning Technology

Aiming at the problems of low data acquisition efficiency, unintuitive data form, low relative accuracy, and inability to continuously monitor the whole cross-section in traditional roadway rock deformation monitoring methods, a roadway rock deformation monitoring method based on mobile 3D laser scanning technology is proposed. Firstly, the mobile 3D laser scanning technology is used to obtain the real 3D point cloud data of the roadway surrounding rock; secondly, the multi-scale dimensional features are used to classify the 3D point cloud data, filter the invalid point cloud data, and form the accurate point cloud data of the roadway surrounding rock surface; then the 3D laser scanning is carried out on a regular basis for the deformation-prone areas of the roadway, and the Iterative Closest Point Algorithm (ICP algorithm) is used to align the overlapping part of the point cloud to achieve the point cloud splicing and point cloud stitching of the two scans. The point cloud splicing and point cloud overlapping of the two scans are achieved; finally, the multi-scale model-to-model point cloud comparison algorithm (M3C2 algorithm) is used to compare the point cloud data of the two periods of the roadway, and the appropriate parameters are selected to indicate the displacement change of the surface of the roadway rock with the size of the color value, so as to realize the monitoring of the deformation of the roadway rock in the three-dimensional full cross-section of the roadway. The method is applied to the deformation monitoring of the surrounding rock in the return roadway of 21407 working face in a coal mine, and the results show that: the mobile laser scanning technology can be used to obtain the complete point cloud data of the roadway, and the deformation area of the surrounding rock is successfully identified after the classification of the scanned point clouds in different time periods, the alignment of the point clouds, and the comparison of the point clouds, and the deformation condition of the surrounding rock of the roadway is visually reflected in the three-dimensional full-section deformation condition of the surrounding rock of the roadway. This method is suitable for monitoring the overall de-formation of the surrounding rock of the roadway under complex environmental conditions, and the de-formation of the surrounding rock is identified by different color areas.

Regression Method for Rail Fastener Tightness Based on Center-Line Projection Distance Feature and Neural Network

In the railway system, fasteners have the functions of damping, maintaining the track distance, and adjusting the track level. Therefore, routine maintenance and inspection of fasteners are important to ensure the safe operation of track lines. Currently, assessment methods for fastener tightness include manual observation, acoustic wave detection, and image detection. There are limitations such as low accuracy and efficiency, easy interference and misjudgment, and a lack of accurate, stable, and fast detection methods. Aiming at the small deformation characteristics and large elastic change of fasteners from full loosening to full tightening, this study proposes high-precision surface-structured light technology for fastener detection and fastener deformation feature extraction based on the center-line projection distance and a fastener tightness regression method based on neural networks. First, the method uses a 3D camera to obtain a fastener point cloud and then segments the elastic rod area based on the iterative closest point algorithm registration. Principal component analysis is used to calculate the normal vector of the segmented elastic rod surface and extract the point on the centerline of the elastic rod. The point is projected onto the upper surface of the bolt to calculate the projection distance. Subsequently, the mapping relationship between the projection distance sequence and fastener tightness is established, and the influence of each parameter on the fastener tightness prediction is analyzed. Finally, by setting up a fastener detection scene in the track experimental base, collecting data, and completing the algorithm verification, the results showed that the deviation between the fastener tightness regression value obtained after the algorithm processing and the actual measured value RMSE was 0.2196 mm, which significantly improved the effect compared with other tightness detection methods, and realized an effective fastener tightness regression.

Does facial asymmetry vary between subjects of different age groups? A 3D stereophotogrammetry analysis

This study was aimed to assess whether facial asymmetry increases with age and to examine potential gender differences using 3D stereophotogrammetry. A prospective cross-sectional study was performed. 3D photographs were acquired from 600 control subjects, 300 male, 300 female, and were stratified into 15 different age groups ranging from 0 to 70+. The 3D photographs were postprocessed and mirrored. The original and mirrored faces were surface-based matched using an iterative closest point algorithm. The primary outcome variable, facial asymmetry, was evaluated by calculating the absolute mean distance between the original and mirrored images. The primary predictor was age. Pearson’s correlation was used to assess the correlation between facial asymmetry and age. The average overall facial asymmetry was 0.72 mm (SD 0.72 mm; range 0.25 – 3.04 mm). Mean facial asymmetry increased significantly with age, from 0.45 mm in the age group of 0-4 years to 0.98 mm in the age group of 70+ (p<0.001). Facial asymmetry was positively correlated with age (Pearson’s r = 0.55; p<0.001). Male subjects were significantly more asymmetric compared to females, 0.77 mm and 0.67 mm, respectively (p<0.001). This study indicates that facial asymmetry significantly increases with age and is significantly larger in males than in females.

Experimental research based on robot-assisted surgery: Lower limb fracture reduction surgery planning navigation system.

Lower extremity fracture reduction surgery is a key step in the treatment of lower extremity fractures. How to ensure high precision of fracture reduction while reducing secondary trauma during reduction is a difficult problem in current surgery. First, segmentation and three-dimensional reconstruction are performed based on fracture computed tomography images. A cross-sectional point cloud extraction algorithm based on the normal filtering of the long axis of the bone is designed to obtain the cross-sectional point clouds of the distal bone and the proximal bone, and the optimal reset target pose of the broken bone is obtained by using the iterative closest point algorithm. Then, the optimal reset sequence of reset parameters was determined, combined with the broken bone collision detection algorithm, a surgical planning algorithm for lower limb fracture reset was proposed, which can effectively reduce the reset force while ensuring the accuracy of the reset process without collision. The average error of the reduction of the model bone was within 1.0 mm. The reduction operation using the planning and navigation system of lower extremity fracture reduction surgery can effectively reduce the reduction force. At the same time, it can better ensure the smooth change of the reduction force. Planning and navigation system of lower extremity fracture reduction surgery is feasible and effective.

Improving ultrasound-based bone registration using the iterative closest point algorithm paired with a complex optimization solver

The Iterative Close Point (ICP) algorithm is used for bone registrations based on ultrasound measurements. However, the ICP has been shown to suffer from local minima. The Complex optimization, as a more robust routine compared to the commonly used gradient-based algorithms, could be an alternative for solving the ICP problem. In this study, we investigated the effect of the initial estimate and the number of registration points on bone registrations achieved using the ICP and a Complex optimization routine and we compared it against using Quadratic Sequential Programming (SQP). Ultrasound measurements were performed with an A-mode probe on a bovine humerus and an ovine femur embedded into ballistic gel. Simultaneously, the bones and the probe were tracked in 3D space using retroreflective markers. Kinematic, ultrasound and geometrical data obtained from scans of the specimens and the probe served as input to a bone registrations routine. Registrations were performed using two ICP solvers for different initial estimates and number of registration points. On average, 68 % of the Complex optimization registrations had less than 1 mm translation error and less than 1° rotational error for perturbations of the initial estimate from the reference measurements compared to the 35 % of the SQP ones. Similar medians of registration errors were observed between the two methods for variations of the number of the employed registration points. Although the Complex optimization provided accurate bone registrations for all cases, the objective function could not always determine the registrations with the smallest registration error. Future research should explore methodologies to overcome this challenge.