Abstract

A new accurate and robust non-rigid point set registration method, named DSMM, is proposed for non-rigid point set registration in the presence of significant amounts of missing correspondences and outliers. The key idea of this algorithm is to consider the relationship between the point sets as random variables and model the prior probabilities via Dirichlet distribution. We assign the various prior probabilities of each point to its correspondences in the Student’s-t mixture model. We later incorporate the local spatial representation of the point sets by representing the posterior probabilities in a linear smoothing filter and get closed-form mixture proportions, leading to a computationally efficient registration algorithm comparing to other Student’s-t mixture model based methods. Finally, by introducing the hidden random variables in the Bayesian framework, we propose a general mixture model family for generalizing the mixture-model-based point set registration, where the existing methods can be considered as members of the proposed family. We evaluate DSMM and other state-of-the-art finite mixture models based point set registration algorithms on both artificial point set and various 2D and 3D point sets, where DSMM demonstrates its statistical accuracy and robustness, outperforming the competing algorithms.

Highlights

  • A new accurate and robust non-rigid point set registration method, named DSMM, is proposed for non-rigid point set registration in the presence of significant amounts of missing correspondences and outliers

  • Comparing with the existing state-of-the-art point set registration algorithms, the key contributions of our work are: (1) We introduce the idea of considering the mixture component label vector as random variables, which is a major difference from the existing point set registration, where the mixture proportions are considered as discrete labels

  • In order to show the performance of our method, we compare DSMM with other state-of-the-art non-rigid point set registration (PR-GLS46, pSMM32, Gaussian mixture model (GMM)-L219, CPD15, Robust Point Matching (RPM)-TPS9, and its variety RPM-RBF) in the following evaluations

Read more

Summary

Introduction

A new accurate and robust non-rigid point set registration method, named DSMM, is proposed for non-rigid point set registration in the presence of significant amounts of missing correspondences and outliers. We later incorporate the local spatial representation of the point sets by representing the posterior probabilities in a linear smoothing filter and get closed-form mixture proportions, leading to a computationally efficient registration algorithm comparing to other Student’s-t mixture model based methods. ICP finds a closest point yi in Y for each point xi in X It subsequently estimates a transformation which best aligns X to Y by using a least-squares method. Instead of aligning a one-to-one correspondence based on a closest distance criterion, the Robust Point Matching (RPM) algorithm[7] proposed by Gold et al and its variants[8,9], alternatively estimate soft-assignment of correspondences and transformation, leading to allowing for fuzzy correspondences, and[9] subsequently used Thin-Plate-Spline (TPS) to re-parameterize the transformation that resulted into the TPS-RPM algorithm. Tsin and Kanade[10] proposed a kernel-correlation-based point set registration approach, considering the non-rigid www.nature.com/scientificreports/

Methods
Results
Conclusion

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.