Improvements to the Iterative Closest Point Algorithm for Shape Registration in Manufacturing

2015 ◽  
Vol 138 (1) ◽  
Author(s):  
Tsz-Ho Kwok ◽  
Kai Tang
Keyword(s):  
Stability Analysis ◽  
Selection Method ◽  
Iterative Closest Point ◽  
Normal Space ◽  
Point Selection ◽  
Icp Algorithm ◽  
Shape Registration ◽  
Normal Vectors ◽  
Iterative Closest Point Algorithm ◽  
The Stability

Iterative closest point (ICP) is a popular algorithm used for shape registration while conducting inspection during a production process. A crucial key to the success of the ICP is the choice of point selection method. While point selection can be customized for a particular application using its prior knowledge, normal-space sampling (NSS) is commonly used when normal vectors are available. Normal-based approach can be further improved by stability analysis—called covariance sampling. The stability analysis should be accurate to ensure the correctness of covariance sampling. In this paper, we go deep into the details of covariance sampling, and propose a few improvements for stability analysis. We theoretically and experimentally show that these improvements are necessary for further success in covariance sampling. Experimental results show that the proposed method is more efficient and robust for the ICP algorithm.

scholarly journals Rigid Shape Registration Based on Extended Hamiltonian Learning

Entropy ◽  
2020 ◽  
Vol 22 (5) ◽  
pp. 539
Author(s):  
Jin Yi ◽  
Shiqiang Zhang ◽  
Yueqi Cao ◽  
Erchuan Zhang ◽  
Huafei Sun
Keyword(s):  
Image Analysis ◽  
Optimization Problem ◽  
Iterative Closest Point ◽  
Euclidean Group ◽  
Simulation Experiments ◽  
Icp Algorithm ◽  
Registration Error ◽  
Shape Registration ◽  
Correct Alignment ◽  
State Of Art

Shape registration, finding the correct alignment of two sets of data, plays a significant role in computer vision such as objection recognition and image analysis. The iterative closest point (ICP) algorithm is one of well known and widely used algorithms in this area. The main purpose of this paper is to incorporate ICP with the fast convergent extended Hamiltonian learning (EHL), so called EHL-ICP algorithm, to perform planar and spatial rigid shape registration. By treating the registration error as the potential for the extended Hamiltonian system, the rigid shape registration is modelled as an optimization problem on the special Euclidean group S E ( n ) ( n = 2 , 3 ) . Our method is robust to initial values and parameters. Compared with some state-of-art methods, our approach shows better efficiency and accuracy by simulation experiments.

Points Registration for Roadside LiDAR Sensors

2019 ◽  
Vol 2673 (9) ◽  
pp. 627-639 ◽  
Author(s):  
Jianqing Wu ◽  
Hao Xu ◽  
Wei Liu
Keyword(s):  
Ground Surface ◽  
Cost Effective ◽  
Point Clouds ◽  
Iterative Closest Point ◽  
Connected Vehicle ◽  
Point Selection ◽  
Registration Method ◽  
Data Registration ◽  
The Difference ◽  
Iterative Closest Point Algorithm

Roadside LiDAR deployment provides a solution to obtain the real-time high-resolution micro traffic data of unconnected road users for the connected-vehicle road network. Single roadside LiDAR sensor has a lot of limitations considering the scant coverage and the difficulty of handling object occlusion issue. Multiple roadside LiDAR sensors can provide a larger coverage and eliminate the object occlusion issue. To combine different LiDAR sensors, it is necessary to integrate the point clouds into the same coordinate system. The existing points registration methods serving mapping scans or autonomous sensing systems could not be directly used for roadside LiDAR sensors considering the different feature of point clouds and the spare points in the cost-effective roadside LiDAR sensors. This paper developed an approach for roadside LiDAR points registration. The developed points-aggregation-based partial iterative closest point algorithm (PA-PICP) is a semi-automatic points registration method, which contains two major parts: XY data registration and Z adjustment. A semi-automatic key point selection method was introduced. The partial iterative closest point was applied to minimize the difference between different LiDARs in the XY plane. The intersection of ground surface between different LiDARs was used for Z-axis adjustment. The performance of the developed procedure was evaluated with field-collected LiDAR data. The results showed the effectiveness and accuracy of data integration using PA-PICP was greatly improved compared with points registration using the traditional iterative closest point. The case studies also showed that the occlusion issue can be fixed after PA-PICP points registration.

Stability Analysis of the Nanjung Water Diversion Twin Tunnels based on Convergence Measurement

2019 ◽  
Vol 1 (1) ◽  
pp. 49-60
Author(s):  
Simon Heru Prassetyo ◽  
Ganda Marihot Simangunsong ◽  
Ridho Kresna Wattimena ◽  
Made Astawa Rai ◽  
Irwandy Arif ◽  
...  
Keyword(s):  
Stability Analysis ◽  
Convergence Rate ◽  
Critical Strain ◽  
Convergence Rates ◽  
Strain Analysis ◽  
Water Diversion ◽  
Tunnel Face ◽  
Tunnel Stability ◽  
The Stability ◽  
Twin Tunnels

This paper focuses on the stability analysis of the Nanjung Water Diversion Twin Tunnels using convergence measurement. The Nanjung Tunnel is horseshoe-shaped in cross-section, 10.2 m x 9.2 m in dimension, and 230 m in length. The location of the tunnel is in Curug Jompong, Margaasih Subdistrict, Bandung. Convergence monitoring was done for 144 days between February 18 and July 11, 2019. The results of the convergence measurement were recorded and plotted into the curves of convergence vs. day and convergence vs. distance from tunnel face. From these plots, the continuity of the convergence and the convergence rate in the tunnel roof and wall were then analyzed. The convergence rates from each tunnel were also compared to empirical values to determine the level of tunnel stability. In general, the trend of convergence rate shows that the Nanjung Tunnel is stable without any indication of instability. Although there was a spike in the convergence rate at several STA in the measured span, that spike was not replicated by the convergence rate in the other measured spans and it was not continuous. The stability of the Nanjung Tunnel is also confirmed from the critical strain analysis, in which most of the STA measured have strain magnitudes located below the critical strain line and are less than 1%.

scholarly journals Estimating intrafraction tumor motion during fiducial-based liver stereotactic radiotherapy via an iterative closest point (ICP) algorithm

2019 ◽  
Vol 14 (1) ◽  
Author(s):  
Wu-zhou Li ◽  
Zhi-wen Liang ◽  
Yi Cao ◽  
Ting-ting Cao ◽  
Hong Quan ◽  
...  
Keyword(s):  
Stereotactic Radiotherapy ◽  
Imaging System ◽  
Liver Tumors ◽  
Three Dimensional ◽  
Rigid Motion ◽  
Iterative Closest Point ◽  
Tumor Motion ◽  
Tracking Accuracy ◽  
Icp Algorithm ◽  
Anterior Posterior

Abstract Background Tumor motion may compromise the accuracy of liver stereotactic radiotherapy. In order to carry out a precise planning, estimating liver tumor motion during radiotherapy has received a lot of attention. Previous approach may have difficult to deal with image data corrupted by noise. The iterative closest point (ICP) algorithm is widely used for estimating the rigid registration of three-dimensional point sets when these data were dense or corrupted. In the light of this, our study estimated the three-dimensional (3D) rigid motion of liver tumors during stereotactic liver radiotherapy using reconstructed 3D coordinates of fiducials based on the ICP algorithm. Methods Four hundred ninety-five pairs of orthogonal kilovoltage (KV) images from the CyberKnife stereo imaging system for 12 patients were used in this study. For each pair of images, the 3D coordinates of fiducial markers inside the liver were calculated via geometric derivations. The 3D coordinates were used to calculate the real-time translational and rotational motion of liver tumors around three axes via an ICP algorithm. The residual error was also investigated both with and without rotational correction. Results The translational shifts of liver tumors in left-right (LR), anterior-posterior (AP),and superior-inferior (SI) directions were 2.92 ± 1.98 mm, 5.54 ± 3.12 mm, and 16.22 ± 5.86 mm, respectively; the rotational angles in left-right (LR), anterior-posterior (AP), and superior-inferior (SI) directions were 3.95° ± 3.08°, 4.93° ± 2.90°, and 4.09° ± 1.99°, respectively. Rotational correction decreased 3D fiducial displacement from 1.19 ± 0.35 mm to 0.65 ± 0.24 mm (P<0.001). Conclusions The maximum translational movement occurred in the SI direction. Rotational correction decreased fiducial displacements and increased tumor tracking accuracy.

scholarly journals OICP: An Online Fast Registration Algorithm Based on Rigid Translation Applied to Wire Arc Additive Manufacturing of Mold Repair

Materials ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 1563
Author(s):  
Ruibing Wu ◽  
Ziping Yu ◽  
Donghong Ding ◽  
Qinghua Lu ◽  
Zengxi Pan ◽  
...  
Keyword(s):  
Additive Manufacturing ◽  
Point Cloud ◽  
Point Clouds ◽  
Iterative Closest Point ◽  
Multiple Point ◽  
Icp Algorithm ◽  
Registration Algorithm ◽  
Cloud Models ◽  
Comparison Results ◽  
Wire Arc Additive Manufacturing

As promising technology with low requirements and high depositing efficiency, Wire Arc Additive Manufacturing (WAAM) can significantly reduce the repair cost and improve the formation quality of molds. To further improve the accuracy of WAAM in repairing molds, the point cloud model that expresses the spatial distribution and surface characteristics of the mold is proposed. Since the mold has a large size, it is necessary to be scanned multiple times, resulting in multiple point cloud models. The point cloud registration, such as the Iterative Closest Point (ICP) algorithm, then plays the role of merging multiple point cloud models to reconstruct a complete data model. However, using the ICP algorithm to merge large point clouds with a low-overlap area is inefficient, time-consuming, and unsatisfactory. Therefore, this paper provides the improved Offset Iterative Closest Point (OICP) algorithm, which is an online fast registration algorithm suitable for intelligent WAAM mold repair technology. The practicality and reliability of the algorithm are illustrated by the comparison results with the standard ICP algorithm and the three-coordinate measuring instrument in the Experimental Setup Section. The results are that the OICP algorithm is feasible for registrations with low overlap rates. For an overlap rate lower than 60% in our experiments, the traditional ICP algorithm failed, while the Root Mean Square (RMS) error reached 0.1 mm, and the rotation error was within 0.5 degrees, indicating the improvement of the proposed OICP algorithm.

Sign in / Sign up

Export Citation Format

Share Document