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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    View planning with a registration constraint


    Contributors:
    Scott, W.R. (author) / Roth, G. (author) / Rivest, J.-F. (author)


    Publication date :

    2001-01-01


    Size :

    733196 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    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

    European Patent Office | 2018

    Free access

    TRIP PLANNING WITH ENERGY CONSTRAINT

    BAGLINO ANDREW D / HAYER THORSTEN / BOBLETT BRENNAN et al. | European Patent Office | 2015

    Free access

    TRIP PLANNING WITH ENERGY CONSTRAINT

    BAGLINO ANDREW D / HAYER THORSTEN / BOBLETT BRENNAN et al. | European Patent Office | 2016

    Free access

    Efficient Closed-Loop Multiple-View Registration

    Shao, Xiaowei / Shi, Yun / Zhao, Huijing et al. | IEEE | 2014