Abstract This is a survey paper summarizing recent research aimed at finding guaranteed optimal algorithms for solving problems in Multiview Geometry. Many of the traditional problems in Multiview Geometry now have optimal solutions in terms of minimizing residual imageplane error. Success has been achieved in minimizing L 2 (least-squares) or L  ∞  (smallest maximum error) norm. The main methods involve Second Order Cone Programming, or quasi-convex optimization, and Branch-and-bound. The paper gives an overview of the subject while avoiding as far as possible the mathematical details, which can be found in the original papers.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal Algorithms in Multiview Geometry


    Contributors:


    Publication date :

    2007-01-01


    Size :

    22 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Multiview Differential Geometry of Curves

    Fabbri, R. / Kimia, B. B. | British Library Online Contents | 2016


    Practical Global Optimization for Multiview Geometry

    Agarwal, S. / Chandraker, M. K. / Kahl, F. et al. | British Library Conference Proceedings | 2006


    Practical Global Optimization for Multiview Geometry

    Kahl, F. / Agarwal, S. / Chandraker, M. K. et al. | British Library Online Contents | 2008


    Optimal motion estimation from multiview normalized epipolar constraint

    Vidal, R. / Ma, Y. / Hsu, S. et al. | IEEE | 2001


    Optimal Motion Estimation from Multiview Normalized Epipolar Constraint

    Vidal, R. / Ma, Y. / Hsu, S. et al. | British Library Conference Proceedings | 2001