View Planning with a Registration Constraint

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by W. R. Scott Articles by Gerhard Roth Articles by G. Roth Articles by J.-F. Rivest

Third International Conference on 3-D Digital Imaging and Modeling (3DIM '01)

Quebec City, Canada

May 28-June 01

ISBN: 0-7695-0984-3

	ASCII Text	x
	W. R. Scott, Gerhard Roth, G. Roth, J.-F. Rivest, "View Planning with a Registration Constraint," 3D Digital Imaging and Modeling, International Conference on, pp. 127, Third International Conference on 3-D Digital Imaging and Modeling (3DIM '01), 2001.

	BibTex	x
	@article{ 10.1109/IM.2001.924419, author = {W. R. Scott and Gerhard Roth and G. Roth and J.-F. Rivest}, title = {View Planning with a Registration Constraint}, journal ={3D Digital Imaging and Modeling, International Conference on}, volume = {0}, year = {2001}, isbn = {0-7695-0984-3}, pages = {127}, doi = {http://doi.ieeecomputersociety.org/10.1109/IM.2001.924419}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - 3D Digital Imaging and Modeling, International Conference on TI - View Planning with a Registration Constraint SN - 0-7695-0984-3 SP EP A1 - W. R. Scott, A1 - Gerhard Roth, A1 - G. Roth, A1 - J.-F. Rivest, PY - 2001 VL - 0 JA - 3D Digital Imaging and Modeling, International Conference on ER -

W. R. Scott, University of Ottawa

Gerhard Roth, Visual Information Technology Group, National Research Council of Canada

G. Roth

J.-F. Rivest

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IM.2001.924419

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.