Precise iterative closest point algorithm with corner point constraint for isotropic scaling registration

The traditional iterative closest point (ICP) algorithm could register two point sets well, but it is easily affected by local dissimilarity. To deal with this problem, this paper proposes an isotropic scaling ICP algorithm with corner point constraint. First of all, because the corner points can preserve the similarity of the whole shapes, an objective function based on least square error is proposed under the guidance of the corner points. Second, a new ICP algorithm is proposed to complete the isotropic scaling registration. At each iterative step of this new algorithm, the correspondence is built based on the closest point searching, and then a closed-form solution of the transformation is computed. This new algorithm converges monotonically to a local minimum from any given initial scaling transformation. To obtain the expected minimum, the traditional scaling ICP algorithm is applied to compute the initial transformation. The experimental results demonstrate that our algorithm can prevent the influence of the local dissimilarity and improve the registration precision compared with the traditional ICP algorithm.