On the convergence of some Procrustean averaging algorithms
The author deals with algorithms acting on Euclidean shape space \(\Sigma_N^k\) or size-and-shape space \(\widetilde{\Sigma}_N^k\). These are the spaces of configurations of \(k\) non-identical labeled points in \(\mathbb{R}^N\) modulo equivalence under translations, rotations and dilatations (rescalings) in \(\Sigma_N^k\), or just under translations and rotations in \(\widetilde{\Sigma}_N^k\). The aim of these algorithms is to average a sample of shapes, or size-and-shapes, thought of as points in one of these parameter spaces. Two different definitions of ``average are explored, namely the Procrustean mean and the Riemannian average. On size-and-shape spaces the Procrustean mean coincides with the Riemannian average, but not on shape spaces. Several algorithms based on generalized Procrustean analysis (GPA) are considered and compared with a general Riemannian averaging algorithm (RA). If \(\mathcal{Q}\) is a list of points in a Riemannian manifold and \(\text{diam}(\mathcal{Q})\) is not too large, then the map generating this RA algorithm is a contraction with a constant that is quadratic in \(\text{diam}(\mathcal{Q})\) as \(\text{diam}(\mathcal{Q})\to 0\). In particular, two proofs of the convergence of GPA-shape (for suitable initial conditions) are given. The first one applies only to the geometrically special case \(N=2\), but establishes convergence for a larger set of initial conditions than does the second one. On the other hand, the second proof applies to all \(N\), and if \(N=2\), it gives a better bound on the convergence rate for small values of \(\text{diam}(\mathcal{Q})\). Moreover, if \(\text{diam}(\mathcal{Q})\to 0\), the distance between the Procrustean mean and the Riemannian average is asymptotically computed, and an interesting comparison of the convergence rates of the Procrustean and Riemannian algorithm is given.
- Locating Fréchet means with application to shape spaces
- Mean size-and-shapes and mean shapes: a geometric point of view
- Newton's method, zeroes of vector fields, and the Riemannian center of mass
- On Geodesics in Euclidean Shape Spaces
- On the consistency of procrustean mean shapes
- Riemannian center of mass and mollifier smoothing
- Shape Manifolds, Procrustean Metrics, and Complex Projective Spaces
- The Riemannian structure of Euclidean shape spaces: A novel environment for statistics
- Fréchet means and Procrustes analysis in Wasserstein space
- Newton's method, zeroes of vector fields, and the Riemannian center of mass
- Geometrical smeariness -- a new phenomenon of Fréchet means
- Procrustes analysis for high-dimensional data
- A smeary central limit theorem for manifolds with application to high-dimensional spheres
- Highly resistant gradient descent algorithm for computing intrinsic mean shape on similarity shape spaces
- Intrinsic sample mean in the space of planar shapes
- On means and their asymptotics: circles and shape spaces
- A comment to ``Statistics on manifolds and landmark based image analysis: a nonparametric theory with applications
- scientific article; zbMATH DE number 2159374 (Why is no real title available?)
- Mean size-and-shapes and mean shapes: a geometric point of view
- Stability of the cut locus and a central limit theorem for Fréchet means of Riemannian manifolds
- Diffusion means in geometric spaces
This page was built for publication: On the convergence of some Procrustean averaging algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5460724)