loading...
View Planning with a Registration Constraint
Quebec City, Canada May 28-June 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IM.2001.924419Third International Conference on 3-D ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
W. R. Scott, University of Ottawa
Gerhard Roth, Visual Information Technology Group, National Research Council of Canada
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.
Citation:
W. R. Scott, Gerhard Roth, G. Roth, J.-F. Rivest, "View Planning with a Registration Constraint," 3dim, pp.127, Third International Conference on 3-D Digital Imaging and Modeling (3DIM '01), 2001
Usage of this product signifies your acceptance of the Terms of Use.