View planning with a registration constraint

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.

[1]  Sandip Sen,et al.  Minimal cost set covering using probabilistic methods , 1993, SAC '93.

[2]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[3]  Glenn H. Tarbox,et al.  Planning for Complete Sensor Coverage in Inspection , 1995, Comput. Vis. Image Underst..

[4]  L. Wolsey,et al.  On the greedy heuristic for continuous covering and packing problems , 1982 .

[5]  Jean-Francois Rivest,et al.  View planning for multi-stage object reconstruction , 2001 .

[6]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[7]  Ruzena Bajcsy,et al.  Occlusions as a Guide for Planning the Next View , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Richard Pito,et al.  A sensor-based solution to the "next best view" problem , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[9]  J. Beasley.  A lagrangian heuristic for set‐covering problems , 1990 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Frank P. Ferrie,et al.  Autonomous exploration: driven by uncertainty , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[12]  K. Al-Sultan,et al.  A Genetic Algorithm for the Set Covering Problem , 1996 .

[13]  Gerhard Roth,et al.  View Planning as a Set Covering Problem , 2001 .

[14]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  T. Grossman,et al.  Computational Experience with Approximation Algorithms for the Set Covering Problem , 1994 .

[16]  Konstantinos A. Tarabanis,et al.  A survey of sensor planning in computer vision , 1995, IEEE Trans. Robotics Autom..

[17]  Ioannis Stamos,et al.  Interactive sensor planning , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).