Optimization of the location of camera in two dimensional floor layout

Abstract

Installation of the security cameras is increasing rapidly in our society that required a secure environment. It motivates us to discover an optimum camera placement in order to improve the coverage of a camera network. It is a significant design problem in order to have a proper camera placement in a distributed smart camera network by considering the number of cameras required. Thus, a method was proposed in order to determine the camera placement by using C and FORTRAN language. Besides that, it is advantageous to maximize the coverage area by using a minimum number of cameras. Hence, in order to reduce the number of cameras used, we divide the area of polygon into grid points. Then, we calculate the camera locations which can cover the grid points as much as possible. We formulate the above problem as a set of maximizing coverage problem. Moreover, the optimal camera problem was solved by developing a general visibility model for visual camera networks through Binary Integer Programming (BIP). Extensive performance analysis is exhibited using FORTRAN programming. Based on the results of this study, we found that by using a minimum number of cameras, it is sufficient to cover the entire area. Finally, the current results and future recommendations are presented in the report.