Abstract

The traditional iterative closest point (ICP) algorithm could register two points sets well, but it is easily affected by local dissimilar. To deal with this problem, this paper proposes an isotropic scaling ICP algorithm with corner point constraint. First, an objective function is proposed under the guidance of the corner points, as the corner points can preserve the similar of the whole shapes. Secondly, a new ICP algorithm is used to complete the isotropic scaling registration. At each 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. The experimental results demonstrate that our algorithm can prevent the influence of the local dissimilar and improve the registration precision compared with the traditional ICP algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.