Markerless registration for intracerebral hemorrhage surgical system using weighted Iterative Closest Point (ICP)

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.

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.

Airborne light detection and ranging (LiDAR) data are increasingly used in various fields such as topographic mapping, urban planning, and emergency management. A necessary processing step in the application of airborne LiDAR data is the elimination of mismatch errors. This paper proposes a new method for airborne LiDAR strip adjustment based on point clouds with planar neighborhoods; this method is intended to eliminate errors in airborne LiDAR point clouds. Initially, standard pre-processing tasks such as denoising, ground separation, and resampling are performed on the airborne LiDAR point clouds. Subsequently, this paper introduces a unique approach to extract point clouds with planar neighborhoods which is designed to enhance the registration accuracy of the iterative closest point (ICP) algorithm within the context of airborne LiDAR point clouds. Following the registration of the point clouds using the ICP algorithm, tie points are extracted via a point-to-plane projection method. Finally, a strip adjustment calculation is executed using the extracted tie points, in accordance with the strip adjustment equation for airborne LiDAR point clouds that was derived in this study. Three sets of airborne LiDAR point cloud data were utilized in the experiment outlined in this paper. The results indicate that the proposed strip adjustment method can effectively eliminate mismatch errors in airborne LiDAR point clouds, achieving a registration accuracy and absolute accuracy of 0.05 m. Furthermore, this method’s processing efficiency was more than five times higher than that of traditional methods such as ICP and LS3D.

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

The traditional affine iterative closest point (ICP) algorithm is fast and accurate for affine registration between two point sets, but it is easy to fall into local minimum. This paper proposes a robust Affine ICP algorithm based on corner points. First, an objective function is established under the guidance of corner points, where the corner points as the shape control point guides the affine registration of 2D point sets. Then, at each step of the algorithm, the affine transformation obtained by the last iterative step is used to establish the correspondence of these two point sets. Next, the new affine transformation is solved by using the objective function under the guidance of the corner points. Experimental results demonstrate that the robustness and convergence of our algorithm are greatly improved compared with the traditional affine registration algorithm.

The accuracy of the iterative closest point (ICP) algorithm, which is widely employed in image registration, depends on the complexity of the shape of the object under registration. Objects with complex features yield higher reliability in estimating registration parameters. For objects with rotation symmetry, a cylinder for example, rotation along the center axis can not be distinguished. We derive the sensitivity of the rotation error of the ICP algorithm from the curvature of the error function near the minimum error position. We approximate the defined error function to a second order polynomial and show that the coefficient of the second-order term is related to the reliability of the estimated rotation angle. Also the coefficient is related to the shape of the object. In the known correspondence case, the reliability can be expressed by the second moment of the input image. Finally, we apply the sensitivity formula to a simple synthetic object and ellipses, and verify that the predicted orientation variance of the ICP algorithm is in good agreement with computer simulations.

Differential LiDAR (Light Detection and Ranging) from repeated surveys has recently emerged as an effective tool to measure three-dimensional (3D) change for applications, such as quantifying slip and spatially distributed warping associated with earthquake ruptures, and examining the spatial distribution of beach erosion after hurricane impact. Currently, the primary method for determining 3D change from LiDAR is through the use of the iterative closest point (ICP) algorithm and its variants. However, all current studies using ICP have assumed that all LiDAR points in the compared point clouds have uniform accuracy. This assumption is simplistic given that the error for each LiDAR point is variable, and dependent upon time varying factors such as target range, angle of incidence, and aircraft trajectory accuracy. Therefore, to rigorously determine spatial change, it would be ideal to model the random error for every LiDAR observation in the differential point cloud, and use these error estimates as apriori weights in the ICP algorithm. To test this approach, we implemented a rigorous LiDAR observation error propagation method to generate estimated random error for each point in a LiDAR point cloud, and then determine 3D displacements between two point clouds using an anisotropic weighted ICP (A-ICP) algorithm. The algorithm was evaluated by qualitatively and quantitatively comparing point clouds with synthetic fault ruptures between a uniform weight and anistropically weighted ICP algorithm. Then post-earthquake slip is estimated for the 2010 El Mayor-Cucapah Earthquake (EMC), using pre- and post-event LiDAR. Based on the analysis, Moving Window A-ICP is able to better estimate the synthetic surface ruptures, and provides a smoother estimate of actual displacement for the EMC earthquake.

The Iterative Closest Point Registration Algorithm Based on the Normal Distribution Transformation

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.

Augmented reality (AR) is gaining attention in medicine because of the convenience and innovation that it brings to operating rooms. Furthermore, oral and maxillofacial surgery (OMS), which is one of sensitive and narrow spatial surgery, requires high accuracy in image registration and low processing time of the system. However, the current systems are suffering from image registration problems while matching two different posture images. We thus aimed to increase that overlay accuracy and decrease the processing time. The proposed system consists of an Iterative Closest Point (ICP) algorithm, which is the combination of a rotation invariant and Manhattan error metric, to provide the best initial parameters and to decrease the computational cost by sorting high and low processing pixel images, respectively. The study on maxillary and mandibular jaw bone demonstrates that the proposed work overlay accuracy ranges from 0.22 to 0.30 mm, and processing time ranges from 10 to 14 frames per second as opposed to the 0.23- to 0.35-mm overlay accuracy and the current 8 to 12 frames per second processing time. This research aimed to improve the visualization and fast AR system for the OMS. Thus, the proposed system achieved an improvement in overlay accuracy and processing time by implementing the Rotation Invariant and Manhattan error metric ICP algorithm.

PurposeA fast and accurate intraoperative registration method is important for Computer-Aided Orthopedic Surgery (CAOS). A-mode ultrasound (US) is able to acquire bone surface data in a non-invasive manner. To utilize A-mode US in CAOS, a suitable registration algorithm is necessary with a small number of registration points and the presence of measurement errors. Therefore, we investigated the effects of (1) the number of registration points and (2) the Ultrasound Point Localization Error (UPLE) on the overall registration accuracy.MethodsWe proposed a new registration method (ICP-PS), including the Iterative Closest Points (ICP) algorithm and a Perturbation Search algorithm. This method enables to avoid getting stuck in the local minimum of ICP iterations and to find the adjacent global minimum. This registration method was subsequently validated in a numerical simulation and a cadaveric experiment using a 3D-tracked A-mode US system.ResultsThe results showed that ICP-PS outperformed the standard ICP algorithm. The registration accuracy improved with the addition of ultrasound registration points. In the numerical simulation, for 25 sample points with zero UPLE, the averaged registration error of ICP-PS reached 0.25 mm, while 1.71 mm for ICP, decreasing by 85.38%. In the cadaver experiment, using 25 registration points, ICP-PS achieved an RMSE of 2.81 mm relative to 5.84 mm for the ICP, decreasing by 51.88%.ConclusionsThe simulation approach provided a well-defined framework for estimating the necessary number of ultrasound registration points and acceptable level of UPLE for a given required level of accuracy for intraoperative registration in CAOS. ICP-PS method is suitable for A-mode US based intraoperative registration. This study would facilitate the application of A-mode US probe in registering the point cloud to a known shape model, which also has the potential for accurately estimating bone position and orientation for skeletal motion tracking and surgical navigation.

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.

Bin picking is an important task in smart manufacturing and intelligent robotics. For a robot to pick or grip an object with a human-like gripping action, it needs to know the accurate 3D pose of the object. In this paper, we propose a method for estimating the 3D pose of a small ring-shaped object using infrared and depth images generated by a depth camera. The proposed method consists of two algorithm modules, the first to recognize an object in a 2D infrared image and the second to estimate the 3D pose by applying the ICP (iterative closest point) algorithm to 3D depth data. In the first module, we propose a method to generate a three-channel integrated image with features from the depth and infrared images. Next, we introduce a method for training an object detector based on deep-learning. Because the bin-picking test object in this paper is small and ring-shaped, it is difficult to detect and find 3D poses of individual objects when many such objects are piled up. We solved this problem with a depth-based filtering method. Using the filtered image, each object region is separated by the deep learning approach. In the second module, the ICP algorithm is employed to estimate the 3D pose of the ring object. We match a 3D reference model of the object and the real object using the point-to-point ICP algorithm. Performance of the proposed method is evaluated by using two different types of depth camera in the experiments.

The problem of aligning of 3D point data is the known registration task. The most popular registration algorithm is the Iterative Closest Point (ICP) algorithm. The traditional ICP algorithm is a fast and accurate approach for rigid registration between two point clouds but it is unable to handle affine case. Recently, extension of the ICP algorithm for composition of scaling, rotation, and translation is proposed. A generalized ICP version for an arbitrary affine transformation is also suggested. In this paper, a new iterative algorithm for registration of point clouds based on the point-to-plane ICP algorithm with affine transformations is proposed. At each iteration, a closed-form solution to the affine transformation is derived. This approach allows us to get a precise solution for transformations such as rotation, translation, and scaling. With the help of computer simulation, the proposed algorithm is compared with common registration algorithms.

Image registration is an important problem and a fundamental task for understanding the internal organ or internal structure of human body, analyzing the temporal change from the image sets which is obtained different time series in computer vision and image processing field. Especially, CT and MR imaging of the head for diagnosis and surgical planning indicate that physicians and surgeons gain important information from these modalities. In radiotherapy planning, manual registration techniques are performed on MR and CT images of the brain. In general, physicians segment the volumes of interest (VOIs) from each set of slices on the MR and CT images manually. However, manual registration of the object area may require several hours for analysis based on anatomical knowledge. In this paper, to register two images which are obtained from different modalities we develop a new method for automatic registration of the head CT and MR images by using ICP (iterative closest point) algorithm in several extracted data and maximization of mutual information. One of the benefits of using the ICP algorithm is that computational costs can be reduced on the registration. The primary objective of this study is to increase the registration accuracy and reduce the computational processing time. The technique was applied to five real image sets which are obtained from the two different modalities and the satisfactory results are obtained. Some experimental results are shown with discussion.