Robust generalized total least squares iterative closest point registration

56Citations
Citations of this article
43Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper investigates the use of a total least squares approach in a generalization of the iterative closest point (ICP) algorithm for shape registration. A new Generalized Total Least Squares (GTLS) formulation of the minimization process is presented opposed to the traditional Least Squares (LS) technique. Accounting for uncertainty both in the target and in the source models will lead to a more robust estimation of the transformation. Robustness against outliers is guaranteed by an iterative scheme to update the noise covariances. Experimental results show that this generalization is superior to the least squares counterpart. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Estépar, R. S. J., Brun, A., & Westin, C. F. (2004). Robust generalized total least squares iterative closest point registration. In Lecture Notes in Computer Science (Vol. 3216, pp. 234–241). Springer Verlag. https://doi.org/10.1007/978-3-540-30135-6_29

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