It has been shown that various geometric vision problems such as triangulation and pose estimation can be solved optimally by minimizing L ∞ error norm. This paper proposes a novel algorithm for sequential estimation. When a measurement is given at a time instance, applying the original batch bi-section algorithm is very much inefficient because the number of seocnd order constraints increases as time goes on and hence the computational cost increases accordingly. This paper shows that, the upper and lower bounds, which are two input parameters of the bi-section method, can be updated through the time sequence so that the gap between the two bounds is kept as small as possible. Furthermore, we may use only a subset of all the given measurements for the L ∞ estimation. This reduces the number of constraints drastically. Finally, we do not have to re-estimate the parameter when the reprojection error of the measurement is smaller than the estimation error. These three provide a very fast L ∞ estimation through the sequence; our method is suitable for real-time or on-line sequential processing under L ∞ optimality. This paper particularly focuses on the triangulation problem, but the algorithm is general enough to be applied to any L ∞ problems.
Sequential L ∞ Norm Minimization for Triangulation
Asian Conference on Computer Vision ; 2007 ; Tokyo, Japan November 18, 2007 - November 22, 2007
2007-01-01
10 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Local active sound control using 2-norm and (infinity)-norm pressure minimization
Online Contents | 2000
|Pedestrian Detection and Localization Using Antenna Array and Sequential Triangulation
British Library Conference Proceedings | 2005
|H8 Norm Minimization Approach for Slow Adaptive Systems
AIAA | 2010
|British Library Online Contents | 1997
|Fast Algorithms for Solving H-infinity-Norm Minimization Problems
Deutsches Zentrum für Luft- und Raumfahrt (DLR) | 2001
|