L q-closest-point to affine subspaces using the generalized Weiszfeld Algorithm
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]
|Collections||ANU Research Publications|
|Source:||International Journal of Computer Vision|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.