Multiview triangulation with uncertain data

The traditional triangulation algorithms in multiview geometry problems have the drawback that its solution is locally optimal. Robust Optimization is a specific and relatively novel methodology for handling optimization problems with uncertain data. The key idea of robust optimization is to find the best possible performance in the worst case. In this paper, we propose a novel approach which solves the triangulation problems with perturbational data employing robust optimization. The main advantage of this method is global optimality under the perturbational data. Good performance has been demonstrated by experimental results for synthetic and real data, respectively.

[1]  Richard I. Hartley,et al.  Multiple-View Geometry Under the {$L_\infty$}-Norm , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  R. Hartley,et al.  L/sub /spl infin// minimization in geometric reconstruction problems , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[3]  Richard I. Hartley,et al.  An L∞ approach to structure and motion problems in ID-vision , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[4]  Richard I. Hartley,et al.  Optimal Algorithms in Multiview Geometry , 2007, ACCV.

[5]  Didier Henrion,et al.  Globally Optimal Estimates for Geometric Reconstruction Problems , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[6]  Richard I. Hartley,et al.  L-8Minimization in Geometric Reconstruction Problems , 2004, CVPR.

[7]  Takeo Kanade,et al.  Quasiconvex Optimization for Robust Geometric Reconstruction , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  David J. Kriegman,et al.  Practical Global Optimization for Multiview Geometry , 2006, International Journal of Computer Vision.

[9]  Jianwei Zhang,et al.  Homography estimation in omnidirectional vision under the L∞-norm , 2010, 2010 IEEE International Conference on Robotics and Biomimetics.

[10]  Jianwei Zhang,et al.  Triangulation in omnidirectional vision under the L∞-norm , 2010, The 2010 IEEE International Conference on Information and Automation.

[11]  F. Kahl Multiple View Geometry and the -norm , 2005 .

[12]  Fredrik Kahl,et al.  Triangulation of Points, Lines and Conics , 2007, Journal of Mathematical Imaging and Vision.

[13]  Kristy Karen Wan Yen Sim,et al.  Multiple view geometry and convex optimization , 2007 .

[14]  Jean-Philippe Vial,et al.  Robust Optimization , 2021, ICORES.

[15]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[16]  Ying Hu,et al.  Multiview geometry in traditional vision and omnidirectional vision under the l∞-norm , 2012 .

[17]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[18]  Stephen P. Boyd,et al.  The CVX Users' Guide , 2015 .

[19]  Fredrik Kahl,et al.  Multiple view geometry and the L/sub /spl infin//-norm , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[20]  Bernhard P. Wrobel,et al.  Multiple View Geometry in Computer Vision , 2001 .

[21]  Lisa Turner,et al.  Applications of Second Order Cone Programming , 2012 .