An efficient EM-ICP algorithm for symmetric consistent non-linear registration of point sets

19Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we present a new algorithm for non-linear registration of point sets. We estimate both forward and backward deformations fields best superposing the two point sets of interest and we make sure that they are consistent with each other by designing a symmetric cost function where they are coupled. Regularisation terms are included in this cost function to enforce deformation smoothness. Then we present a two-step iterative algorithm to optimise this cost function, where the two fields and the fuzzy matches between the two sets are estimated in turn. Building regularisers using the RKHS theory allows to obtain fast and efficient closed-form solutions for the optimal fields. The resulting algorithm is efficient and can deal with large point sets. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Combès, B., & Prima, S. (2010). An efficient EM-ICP algorithm for symmetric consistent non-linear registration of point sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6362 LNCS, pp. 594–601). https://doi.org/10.1007/978-3-642-15745-5_73

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free