Skip navigation
Skip navigation

L q-closest-point to affine subspaces using the generalized Weiszfeld Algorithm

Aftab, Khurrum; Hartley, Richard; Trumpf, Jochen


This paper presents a method for finding an Lq - closest-point to a set of affine subspaces, that is a point for which the sum of the q-th power of orthogonal distances to all the subspaces is minimized, where 1 ≤ q < 2. We give a theoretical proof for the convergence of the proposed algorithm to a unique Lq minimum. The proposed method is motivated by the Lq Weiszfeld algorithm, an extremely simple and rapid averaging algorithm, that finds the Lq mean of a set of given points in a...[Show more]

CollectionsANU Research Publications
Date published: 2015-02-13
Type: Journal article
Source: International Journal of Computer Vision
DOI: 10.1007/s11263-014-0791-8


There are no files associated with this item.

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator