Robust non-rigid point set registration based on dynamic tree

Abstract

Listen

Translate article

This paper proposes a novel method via dynamic tree to solve the non-rigid registration of point sets with large shape difference which is a difficult problem for existing methods. Affine ICP algorithm with bidirectional distance is employed to evaluate the similarity between two point sets, and then non-rigid registration is conducted on similar models and subjects. Subjects with accurate registration results are added in the dynamic tree. These steps are repeated until all subjects are linked in the tree. Therefore, large shape difference is divided into several small deformations by the intermediate point sets, and the registration results of model and every subject in the tree are satisfactory. Experimental results show that our method incredibly improves the accuracy of the registration with two point sets bearing large shape difference compared with existing approaches.