The softassign procrustes matching algorithm

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

Abstract

The problem of matching shapes parameterized as a set of points is frequently encountered in medical imaging tasks. When the point-sets are derived from landmarks, there is usually no problem of determining the correspondences or homologies between the two sets of landmarks. However, when the point sets are automatically derived from images, the difficult problem of establishing correspondence and rejecting non-homologies as outliers remains. The Procrustes method is a well-known method of shape comparison and can always be pressed into service when homologies between point-sets are known in advance. This paper presents a powerful extension of the Procrustes method to pointsets of differing point counts with correspondences unknown. The result is the softassign Procrustes matching algorithm which iteratively establishes correspondence, rejects non-homologies as outliers, determines the Procrustes rescating and the spatial mapping between the point-sets.

Cite

CITATION STYLE

APA

Rangarajan, A., Chui, H., & Bookstein, F. L. (1997). The softassign procrustes matching algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1230, pp. 29–42). Springer Verlag. https://doi.org/10.1007/3-540-63046-5_3

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