View Planning with a Registration Component

Download
  1. (PDF, 392 KB)
AuthorSearch for: ; Search for: ; Search for:
TypeArticle
ConferenceProceedings of the 3D Imaging and Modeling Conference (3DIM), May 28 - June 1, 2001., Québec, Québec, Canada
AbstractThe 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.
Publication date
LanguageEnglish
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number44166
NPARC number5765758
Export citationExport as RIS
Report a correctionReport a correction
Record identifier8ac6a1e3-8ed1-4528-aee1-ceb1ea169602
Record created2009-03-29
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)