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.
View planning with a registration constraint
2001-01-01
733196 byte
Conference paper
Electronic Resource
English
View Planning with a Registration Constraint
British Library Conference Proceedings | 2001
|Efficient Closed-Loop Multiple-View Registration
IEEE | 2014
|