| Abstract: | Euclidean “(size-and-)shape spaces” are spaces of configurations of points in R N modulo certain equivalences. In many applications one seeks to average a sample of shapes, or sizes-and-shapes, thought of as points in one of these spaces. This averaging is often done using algorithms based on generalized Procrustes analysis (GPA). These algorithms have been observed in practice to converge rapidly to the Procrustean mean (size-and-)shape, but proofs of convergence have been lacking. We use a general Riemannian averaging (RA) algorithm developed in [Groisser, D. (2004) “Newton's method, zeroes of vector fields, and the Riemannian center of mass”, Adv. Appl. Math. 33, pp. 95–135] to prove convergence of the GPA algorithms for a fairly large open set of initial conditions, and estimate the convergence rate. On size-and-shape spaces the Procrustean mean coincides with the Riemannian average, but not on shape spaces; in the latter context we compare the GPA and RA algorithms and bound the distance between the averages to which they converge. |
