TY - GEN
T1 - Camera Placement Meeting Restrictions of Computer Vision
AU - Aghajanzadeh, Sara
AU - Naidu, Roopasree
AU - Chen, Shuo Han
AU - Tung, Caleb
AU - Goel, Abhinav
AU - Lu, Yung Hsiang
AU - Thiruvathukal, George K.
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/10
Y1 - 2020/10
N2 - In the blooming era of smart edge devices, surveillance cam- eras have been deployed in many locations. Surveillance cam- eras are most useful when they are spaced out to maximize coverage of an area. However, deciding where to place cam- eras is an NP-hard problem and researchers have proposed heuristic solutions. Existing work does not consider a signifi- cant restriction of computer vision: in order to track a moving object, the object must occupy enough pixels. The number of pixels depends on many factors (how far away is the object? What is the camera resolution? What is the focal length?). In this study we propose a camera placement method that not only identifies effective camera placement in arbitrary spaces, but can account for different camera types as well. Our strat- egy represents spaces as polygons, then uses a greedy algo- rithm to partition the polygons and determine the cameras’ lo- cations to provide desired coverage. The solution also makes it possible to perform object tracking via overlapping camera placement. Our method is evaluated against complex shapes and real-world museum floor plans, achieving up to 82% cov- erage and 28% overlap.
AB - In the blooming era of smart edge devices, surveillance cam- eras have been deployed in many locations. Surveillance cam- eras are most useful when they are spaced out to maximize coverage of an area. However, deciding where to place cam- eras is an NP-hard problem and researchers have proposed heuristic solutions. Existing work does not consider a signifi- cant restriction of computer vision: in order to track a moving object, the object must occupy enough pixels. The number of pixels depends on many factors (how far away is the object? What is the camera resolution? What is the focal length?). In this study we propose a camera placement method that not only identifies effective camera placement in arbitrary spaces, but can account for different camera types as well. Our strat- egy represents spaces as polygons, then uses a greedy algo- rithm to partition the polygons and determine the cameras’ lo- cations to provide desired coverage. The solution also makes it possible to perform object tracking via overlapping camera placement. Our method is evaluated against complex shapes and real-world museum floor plans, achieving up to 82% cov- erage and 28% overlap.
KW - Camera Placement
KW - Computational Geometry
KW - Computer Vision
UR - https://www.scopus.com/pages/publications/85098632778
UR - https://www.scopus.com/pages/publications/85098632778#tab=citedBy
U2 - 10.1109/ICIP40778.2020.9190851
DO - 10.1109/ICIP40778.2020.9190851
M3 - Conference contribution
T3 - Proceedings - International Conference on Image Processing, ICIP
SP - 3254
EP - 3258
BT - 2020 IEEE International Conference on Image Processing, ICIP 2020 - Proceedings
PB - IEEE Computer Society
T2 - 2020 IEEE International Conference on Image Processing, ICIP 2020
Y2 - 25 September 2020 through 28 September 2020
ER -