We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maximum likelihood) objective function. Internally, the solution is found by computing roots of multivariate polynomial equations, directly solving the conditions for stationarity. The solver makes use of standard methods from computational commutative algebra to convert the root-finding problem into a 47 /spl times/ 47 nonsymmetric eigenproblem. Although there are in general 47 roots, counting both real and complex ones, the number of real roots is usually much smaller. We also show experimentally that the number of stationary points that are local minima and lie in front of each camera is small but does depend on the scene geometry.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    How hard is 3-view triangulation really?


    Contributors:


    Publication date :

    2005-01-01


    Size :

    515817 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    How Hard is 3-view Triangulation Really?

    Stewenius, H. / Schaffalitzky, F. / Nister, D. et al. | British Library Conference Proceedings | 2005


    Fast Optimal Three View Triangulation

    Byröd, Martin / Josephson, Klas / Åström, Kalle | Springer Verlag | 2007


    Relief mosaics by joint view triangulation

    Lhuillier, M. / Quan, L. / Shum, H. et al. | IEEE | 2001


    Relief Mosaics by Joint View Triangulation

    Lhuillier, M. / Quan, L. / Shum, H. et al. | British Library Conference Proceedings | 2001


    Fast multiple-view L2 triangulation with occlusion handling

    Chesi, G. / Hung, Y. S. | British Library Online Contents | 2011