Procrustes alignment with the EM algorithm

6Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper casts the problem of point-set alignment via Procrustes analysis into a maximum likelihood framework using the EM algorithm. The aim is to improve the robustness of the Procrustes alignment to noise and clutter. By constructing a Gaussian mixture model over the missing correspondences between individual points, we show how alignment can be realised by applying singular value decomposition to a weighted point correlation matrix. Moreover, by gauging the relational consistency of the assigned correspondence matches, we can edit the point sets to remove clutter. We illustrate the effectiveness of the method matching stereogram. We also provide a sensitivity analysis to demonstrate the operational advantages of the method.

Cite

CITATION STYLE

APA

Luo, B., & Hancock, E. R. (1999). Procrustes alignment with the EM algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1689, pp. 623–631). Springer Verlag. https://doi.org/10.1007/3-540-48375-6_74

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