Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show that, for various geometric reconstruction problems, their reprojection error functions share a common and quasiconvex formulation. Based on the quasiconvexity, we present a novel quasiconvex optimization framework in which the geometric reconstruction problems are formulated as a small number of small-scale convex programs that are ready to solve. Our final reconstruction algorithm is simple and has intuitive geometric interpretation. In contrast to existing random sampling or local minimization approaches. Our algorithm is deterministic and guarantees a predefined accuracy of the minimization result. We demonstrate the effectiveness of our algorithm by experiments on both synthetic and real data.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Quasiconvex optimization for robust geometric reconstruction


    Beteiligte:
    Ke, Q. (Autor:in) / Kanade, T. (Autor:in)


    Erscheinungsdatum :

    2005-01-01


    Format / Umfang :

    291295 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Quasiconvex Optimization for Robust Geometric Reconstruction

    Ke, Q. / Kanade, T. / IEEE | British Library Conference Proceedings | 2005


    Level-Set-Based Robust Topology Optimization Under Geometric Uncertainty

    Chen, S. / Chen, W. / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2010


    Robust Turbine Blade Optimization in the Face of Real Geometric Variations

    Kamenik, Jan / Voutchkov, Ivan / Toal, David J. J. et al. | AIAA | 2018


    Moment-Based Geometric Image Reconstruction

    Milanfar, P. / Karl, W. C. / Willsky, A. S. et al. | British Library Conference Proceedings | 1994