Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/11040
Title: | On the computation of the Karcher mean on spheres and special orthogonal groups | Contributor(s): | Krakowski, Krzysztof (author); Huper, K (author); Manton, JH (author) | Publication Date: | 2008 | Handle Link: | https://hdl.handle.net/1959.11/11040 | Abstract: | This paper is concerned with computation of the Karcher mean on the unit sphere Sn and the special orthogonal group SO(n). The Karcher mean, or the Riemannian centre of mass, is defined as the point minimising the sum of the squared distances from that point to each of the given points. By its definition, the mean always belongs to the same space as the given points, however, it may not be unique. Motivated by applications in control, vision and robotics, this paper studies the numerical computation of the Karcher mean. We propose simpler and computationally more efficient gradient-like and Newton-like algorithms. We give explicit forms of these algorithms and show that if the set of points lie within a particular open ball, the algorithms are guaranteed to converge to the Karcher mean. | Publication Type: | Conference Publication | Conference Details: | RoboMat 2007: Workshop on Robotics and Mathematics, Coimbra, Portugal, 17th - 19th September, 2007 | Source of Publication: | ROBOMAT 07 Proceedings, p. 119-124 | Publisher: | Centro Internacional de Matematica | Place of Publication: | Coimbra, Portugal | Fields of Research (FoR) 2008: | 010303 Optimisation | Socio-Economic Objective (SEO) 2008: | 970101 Expanding Knowledge in the Mathematical Sciences | HERDC Category Description: | E2 Non-Refereed Scholarly Conference Publication | Publisher/associated links: | http://www.cim.pt/files/robomat07.pdf http://labvis.isr.uc.pt/robomat/ |
---|---|
Appears in Collections: | Conference Publication |
Files in This Item:
File | Description | Size | Format |
---|
Page view(s)
1,192
checked on Nov 19, 2023
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.