Computing Occlusion-Free Viewpoints

Authors:
Konstantinos Tarabanis;Roger Y. Tsai;Anil Kaul
Affiliations:
-;-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1996

Citing 6
Cited 28

Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Art gallery theorems and algorithms

Art gallery theorems and algorithms
Automatic Sensor Placement from Vision Task Requirements

IEEE Transactions on Pattern Analysis and Machine Intelligence - Special Issue on Industrial Machine Vision and Computer Vision Technology:8MPart
Introduction to Solid Modeling

Introduction to Solid Modeling
Visibility, occlusion, and the aspect graph

International Journal of Computer Vision
Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects

IEEE Transactions on Pattern Analysis and Machine Intelligence

A Solution to the Next Best View Problem for Automated Surface Acquisition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Active Object Modeling with VIRTUE

Autonomous Robots
Accessibility Analysis Using Computer Graphics Hardware

IEEE Transactions on Visualization and Computer Graphics
View planning for automated three-dimensional object reconstruction and inspection

ACM Computing Surveys (CSUR)
Interactive Sensor Planning

CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Swept volumes and their use in viewpoint computation in robot work-cells

ISATP '95 Proceedings of the 1995 IEEE International Symposium on Assembly and Task Planning
A CAD-based 3D data acquisition strategy for inspection

Machine Vision and Applications
Managing redundant visual measurements for accurate pose tracking

Robotica
Methods for generating 3D exact views of convex polyhedra for visual indentification: part I: view sphere with perspective projection and iterative methods

Machine Graphics & Vision International Journal
Methods for generating 3D exact views of convex polyhedra for visual identification: part II: non-iterative methods, implementation and test results

Machine Graphics & Vision International Journal
Comparing Viewpoint Evaluation Functions for Model-Based Inspectional Coverage

CRV '04 Proceedings of the 1st Canadian Conference on Computer and Robot Vision
Real-time visual tracking based on BSP-tree representations of object boundary

Robotica
Computing an exact spherical visibility map for meshed polyhedra

Proceedings of the 2007 ACM symposium on Solid and physical modeling
Optimal Camera Placement for Automated Surveillance Tasks

Journal of Intelligent and Robotic Systems
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion

International Journal of Computer Vision
Self-orienting wireless multimedia sensor networks for occlusion-free viewpoints

Computer Networks: The International Journal of Computer and Telecommunications Networking
Computing global visibility maps for regions on the boundaries of polyhedra using Minkowski sums

Computer-Aided Design
Towards an Iterative Algorithm for the Optimal Boundary Coverage of a 3D Environment

CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Probabilistic view planner for 3D modelling indoor environments

IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Placement quality in structured light systems

IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Path planning for improved visibility using a probabilistic road map

IEEE Transactions on Robotics
A fuzzy model for coverage evaluation of cameras and multi-camera networks

Proceedings of the Fourth ACM/IEEE International Conference on Distributed Smart Cameras
Active vision in robotic systems: A survey of recent developments

International Journal of Robotics Research
Generalized multi-sensor planning

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I
Optimal positioning of sensors in 3d

CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
A versatile model-based visibility measure for geometric primitives

SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Visual planning for autonomous mobile robot navigation

MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Modeling Coverage in Camera Networks: A Survey

International Journal of Computer Vision

Quantified Score

Hi-index	0.14

Visualization

Abstract

This paper presents methods to compute the locus of all viewpoints from which features on known polyhedral objects can be viewed in their entirety without being occluded by anything in the environment. Convex and concave polyhedra with or without holes and the viewing model of perspective projection are employed in this work. Initially, properties of the occlusion-free and occluded loci of viewpoints are determined. Based on these properties, two methods to construct these loci together with their complexity analysis are presented. In the first method, a boundary representation of the occlusion-free locus is obtained. In the second method, the locus of occluded viewpoints is expressed in terms of a constructive solid geometry (CSG) representation that consists of a union of component solids. Implementation results and comparison of the two methods are given.