Title :
View planning with a registration constraint
Author :
Scott, William R. ; Roth, Gerhard ; Rivest, Jean-François
Author_Institution :
Dept. of Electr. Eng., Ottawa Univ., Ont., Canada
Abstract :
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
Keywords :
algorithm theory; computational complexity; image reconstruction; inspection; integer programming; search problems; NP-Complete; inspection; integer programming; modified greedy search algorithm; next-best-view problem; object reconstruction; registration constraint; set covering problem; view planning; Density measurement; Image segmentation; Iterative algorithms; Process planning; Rough surfaces; Sampling methods; Shape measurement; Solid modeling; Surface reconstruction; Surface roughness;
Conference_Titel :
3-D Digital Imaging and Modeling, 2001. Proceedings. Third International Conference on
Conference_Location :
Quebec City, Que.
Print_ISBN :
0-7695-0984-3
DOI :
10.1109/IM.2001.924419
