%0 Journal Article
%@ 1530437X
%A Altahir, A.A.
%A Asirvadam, V.S.
%A Hamid, N.H.B.
%A Sebastian, P.
%A Saad, N.B.
%A Ibrahim, R.B.
%A Dass, S.C.
%D 2018
%F scholars:10275
%I Institute of Electrical and Electronics Engineers Inc.
%J IEEE Sensors Journal
%K Algorithms; Cameras; Flow visualization; Models; Monitoring; Optimization; Redundancy; Security systems; Sensor arrays; Sensors; Space surveillance, Discrete optimization problems; Dynamic programming techniques; Global greedy search algorithm; Layout; Two dimensional spaces; Video surveillance; Visual sensor; Visual surveillance systems, Dynamic programming
%N 11
%P 4544-4552
%R 10.1109/JSEN.2018.2825781
%T Optimizing Visual Sensor Coverage Overlaps for Multiview Surveillance Systems
%U https://khub.utp.edu.my/scholars/10275/
%V 18
%X Modern surveillance systems rely on coverage overlapping to attain multi-viewing capabilities and to support coverage redundancy. This paper examines the coverage overlapping configurations in visual surveillance systems. This paper proposes a robust dynamic programming framework to optimize visual surveillance sensor coverage overlaps. Based on visual sensor parameters information, and the features of the area to be monitored, this paper uses a deterministic modeling approach to model the sensor coverage in a 2-D space. Then, the minimization and the maximization arrangements of the coverage overlapping are formulated as discrete optimization problems. The obtained solutions from the dynamic programming technique are evaluated with respect to local and global greedy search algorithms. The results reveal the feasibility of the proposed technique compared with the benchmarked optimization methods in terms of the amount of coverage redundancy. © 2001-2012 IEEE.
%Z cited By 22