The view planning problem, also known as the next-best-view (NBV) problem, for object reconstruction and inspection, has been shown to be isomorphic to the set covering problem which is NP-Complete. In this paper we express a theoretical framework for the NBV problem as an integer programming problem including a registration constraint. Experimental view planning results using a modified greedy search algorithm are presented.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    View planning with a registration constraint


    Beteiligte:
    Scott, W.R. (Autor:in) / Roth, G. (Autor:in) / Rivest, J.-F. (Autor:in)


    Erscheinungsdatum :

    2001-01-01


    Format / Umfang :

    733196 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    View Planning with a Registration Constraint

    Scott, W. / Roth, G. / Rivest, J.-F. et al. | British Library Conference Proceedings | 2001


    TRIP PLANNING WITH ENERGY CONSTRAINT

    Europäisches Patentamt | 2018

    Freier Zugriff

    TRIP PLANNING WITH ENERGY CONSTRAINT

    BAGLINO ANDREW D / HAYER THORSTEN / BOBLETT BRENNAN et al. | Europäisches Patentamt | 2015

    Freier Zugriff

    TRIP PLANNING WITH ENERGY CONSTRAINT

    BAGLINO ANDREW D / HAYER THORSTEN / BOBLETT BRENNAN et al. | Europäisches Patentamt | 2016

    Freier Zugriff

    One man's view of registration today

    Bray, O.S. | Engineering Index Backfile | 1969