Paper
9 April 2007 Summary of results on optimal camera placement for boundary monitoring
Robert J. Holt, Hong Man, Rainer Martini, Iraban Mukherjee, Ravi Netravali, Jing Wang
Author Affiliations +
Abstract
We consider the problems of placing cameras so that every point on a perimeter, that is not necessarily planar, is covered by at least one camera while using the smallest number of cameras. This is accomplished by aligning the edges of the cameras' fields of view with points on the boundary under surveillance. Taken into consideration are visibility concerns, where features such as mountains must not be allowed to come between a camera and a boundary point that would otherwise be in the camera's field of view. We provide a general algorithm that determines optimal camera placements and orientations. Additionally, we consider double coverings, where every boundary point is seen by at least two cameras, with selected boundary points and cameras situated such that the average calibration errors between adjacent cameras is minimized. We describe an iterative algorithm that accomplishes these tasks. We also consider a joint optimization algorithm, which strikes a balance between minimizing calibration error and the number of cameras required to cover the boundary.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Robert J. Holt, Hong Man, Rainer Martini, Iraban Mukherjee, Ravi Netravali, and Jing Wang "Summary of results on optimal camera placement for boundary monitoring", Proc. SPIE 6570, Data Mining, Intrusion Detection, Information Assurance, and Data Networks Security 2007, 657005 (9 April 2007); https://doi.org/10.1117/12.719139
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Cameras

Calibration

Spherical lenses

Visibility

Surveillance

Computer intrusion detection

Buildings

Back to Top