DMCA
VC-dimension of Exterior Visibility (2004)
Cached
Download Links
- [www.cis.upenn.edu]
- [www.cs.rpi.edu]
- [www-users.cs.umn.edu]
- [www-users.cs.umn.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE Trans. Pattern Analysis and Machine Intelligence |
| Citations: | 13 - 1 self |
BibTeX
@ARTICLE{Isler04vc-dimensionof,
author = {Volkan Isler and Sampath Kannan and Kostas Daniilidis and Pavel Valtr},
title = {VC-dimension of Exterior Visibility},
journal = {IEEE Trans. Pattern Analysis and Machine Intelligence},
year = {2004},
volume = {26},
pages = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we study the Vapnik-Chervonenkis (VC)-dimension of set systems arising in 2D polygonal and 3D polyhedral configurations where a subset consists of all points visible from one camera. In the past, it has been shown that the VCdimension of planar visibility systems is bounded by 23 if the cameras are allowed to be anywhere inside a polygon without holes [1]. Here, we consider the case of exterior visibility, where the cameras lie on a constrained area outside the polygon and have to observe the entire boundary. We present results for the cases of cameras lying on a circle containing the polygon (VC-dimension=2) or lying outside the convex hull of a polygon (VC-dimension= 5). The main result of this paper concerns the 3D case: we prove that the VC-dimension is unbounded if the cameras lie on a sphere containing the polyhedron, hence the term exterior visibility.
