Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T02:03:46.189Z Has data issue: false hasContentIssue false

Riemannian median and its estimation

Published online by Cambridge University Press:  01 December 2010

Le Yang*
Affiliation:
Laboratoire de Mathématiques et, Applications (CNRS: UMR 6086) Université de Poitiers, Téléport 2 – BP30179, Boulevard Marie et Pierre Curie, F – 86962 Futuroscope Chasseneuil Cedex, France (email: Le.Yang@math.univ-poitiers.fr)

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper, we define the geometric median for a probability measure on a Riemannian manifold, give its characterization and a natural condition to ensure its uniqueness. In order to compute the geometric median in practical cases, we also propose a subgradient algorithm and prove its convergence as well as estimating the error of approximation and the rate of convergence. The convergence property of this subgradient algorithm, which is a generalization of the classical Weiszfeld algorithm in Euclidean spaces to the context of Riemannian manifolds, also improves a recent result of P. T. Fletcher et al. [NeuroImage 45 (2009) S143–S152].

Information

Type
Research Article
Copyright
Copyright © London Mathematical Society 2010