Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

View planning with a registration constraint

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Scott, W.R. ; Dept. of Electr. Eng., Ottawa Univ., Ont., Canada ; Roth, G. ; Rivest, J.-F.

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

Published in:

3-D Digital Imaging and Modeling, 2001. Proceedings. Third International Conference on

Date of Conference:

2001