Occlusions as a Guide for Planning the Next View

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 15, Issue 5, 1993, Pages 417-433

  Maver, Jasna ^a   Bajcsy, Ruzena ^b  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

3 D scenes; Active sensing; autonomous exploration; laser; next view planning; occlusions; range finder; robot vision; scene analysis

Indexed keywords

BINOCULAR VISION; COMPUTER VISION; DEPTH PERCEPTION; IMAGE ANALYSIS; PATTERN RECOGNITION; SENSORS;

ACTIVE SENSING; AUTONOMOUS EXPLORATION; LASER RANGE FINDER; OCCLUSIONS; SCENE ANALYSIS; THREE DIMENSIONAL VISION;

DATA ACQUISITION;

EID: 0027591830     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.211463     Document Type: Article

References (17)

1. N. Ahuja and J. Veenstra, “Generating octrees from object silhouettes in orthographic views,” IEEE Trans. Patt. Anal. Machine Intell., vol. 11, pp. 137-149, Feb. 1989.
2. J. Aloimonos “Purposive and qualitative active vision,” in Proc. 10th Int. Conf. Patt. Recogn., June 1990 pp. 346–360.
3. C. I. Connolly, “The determination of next best views,” in Proc. IEEE Int. Conf. Robotics Automat., 1985 pp. 432–435.
4. C. K. Cowan and A. Bergman, “Determining the camera and light source location for a visual task,” in Proc. IEEE Int. Conf. Robotics Automat., 1989 pp. 509–514.
5. S. Fisk, “Short proof of Chvatal's watchman theorem,” J. Combinatorial Theory, ser. b, vol. 24, p. 374, 1978.
6. S. A. Hutchinson and A. C. Kak, “Planning sensing strategies in a robot work cell with multisensor capabilities,” IEEE Trans. Robotics Automat., vol. 5, no. 6, pp. 765–783, Dec. 1989.
7. J. Kahn, M. Klawe, and D. Kleitman, “Traditional galleries require fewer watchmen,” IBM Res. Rep. RJ3021, Dec. 1980.
8. J. Maver and R. Bajcsy, “Occlusions as a guide for planning the next view,” Univ. of Pennsylvania, Tech. Rep. MS-CIS-91-27 GRASP Lab. 257, 1991.
9. R. Nevatia and K. R. Babu, “Linear feature extraction and description,” Comput. Graphics Image Processing, vol. 13, pp. 257–269, 1980.
10. T. Pavlidis, Algorithms for Graphics and Image Processing. New York: Comput. Sci. Press, 1982.
11. S. Sakane, M. Ishii, and M. Kakikura, “Occlusion avoidance of visual sensors based on a hand-eye action simulator system: HAVEN,” Adv. Robotics, vol. 2, no. 2, pp. 149–165, 1987.
12. S. Sakane, T. Sato, and M. Kakikura, “Model-based planning of visual sensors using a hand-eye action simulator system: HAVEN,” in Proc. 3rd Int. Conf Adv. Robotics ICAR'87, Oct. 1987 pp. 163–174.
13. S. Y. Shin and T. C. Woo, “An optimal algorithm for finding all visible edges in a simple polygon,” IEEE Trans. Robotics Automat., vol. 5, no. 2, pp. 202–207, Apr. 1989.
14. K. Tarabanis and R. Y. Tsai, “Viewpoint planning: The visibility constraint,” in Proc. Image Understanding Workshop, May 1989, pp. 893–903.
15. G. T. Toussaint and J. R. Sack, “Some new results on moving polygons in the plane, in Proc. Robotics Intell. Productivity Conf (Detroit), Nov. 1983.
16. C. J. Tsikos, Laser Range Imaging System User's Guide, 1989.
17. P. Whaite and F. P. Ferrie, “From uncertainty to visual exploration,” in Proc. ICCVConf., 1990, pp. 690–697.