Skip navigation
Skip navigation

L1-rotation averaging using the Weiszfeld algorithm

Hartley, Richard; Aftab, Khurrum; Trumpf, Jochen

Description

We consider the problem of rotation averaging under the L1 norm. This problem is related to the classic Fermat-Weber problem for finding the geometric median of a set of points in IRn. We apply the classical Weiszfeld algorithm to this problem, adapting it iteratively in tangent spaces of SO(3) to obtain a provably convergent algorithm for finding the L1 mean. This results in an extremely simple and rapid averaging algorithm, without the need for line search. The choice of L1 mean (also called...[Show more]

CollectionsANU Research Publications
Date published: 2011
Type: Conference paper
URI: http://hdl.handle.net/1885/63757
Source: Graph connectivity in sparse subspace clustering
DOI: 10.1109/CVPR.2011.5995745

Download

File Description SizeFormat Image
01_Hartley_L1-rotation_averaging_using_2011.pdf380.58 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator