Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where an interval branch-and-bound method is employed for numerical minimization. Thanks to the properties of interval analysis this method is guaranteed to converge to the global solution with mathematical certainty and arbitrary accuracy, and the only input information it requires from the user is a set of point correspondences and a search box. The cost function is based on the Huang-Faugeras constraint of the fundamental matrix. A recently proposed interval extension based on Bernstein polynomial forms has been investigated to speed up the search for the solution. Finally, some experimental results on synthetic images are presented.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Globally convergent autocalibration


    Beteiligte:
    Benedetti, (Autor:in) / Busti, (Autor:in) / Farenzena, (Autor:in) / Fusiello, (Autor:in)


    Erscheinungsdatum :

    2003-01-01


    Format / Umfang :

    406054 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Globally Convergent Autocalibration

    Benedetti, A. / Busti, A. / Farenzena, M. et al. | British Library Conference Proceedings | 2003


    Globally Optimal Algorithms for Stratified Autocalibration

    Chandraker, M. / Agarwal, S. / Kriegman, D. et al. | British Library Online Contents | 2010


    Maximum likelihood autocalibration

    Heinrich, S. B. / Snyder, W. E. / Frahm, J. M. | British Library Online Contents | 2011


    Bayesian autocalibration for surveillance

    Krahnstoever, N. / Mendonca, P.R.S. | IEEE | 2005


    Camera autocalibration using Plucker coordinates

    Ronda, J.I. / Gallego, G. / Valdes, A. | IEEE | 2005