Continuous graph partitioning for camera network surveillance

Borra, Domenica; Pasqualetti, Fabio; Bullo, Francesco

doi:10.1016/j.automatica.2014.11.017

Cited by 6 publications

(1 citation statement)

References 21 publications

(5 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the context of camera networks the perimeter patrolling problem is discussed in [8], [9], where distributed algorithms are proposed for the cameras to partition a one-dimensional environment and to coordinate along a trajectory with minimum worst-case detection time of static intruders. Graph partitioning and intruder detection with minimum worst-case detection time for two-dimensional camera networks is studied in [10]. We improve the results along this direction by showing that the strategies proposed in [8], [9] generally fail at detecting smart intruders, and by studying the average detection time of smart intruders.…”

Section: Introductionmentioning

confidence: 99%

Camera Network Coordination for Intruder Detection

Pasqualetti

Zanella

Peters

et al. 2014

IEEE Trans. Contr. Syst. Technol.

Self Cite

View full text Add to dashboard Cite

This work proposes surveillance trajectories for a network of autonomous cameras to detect intruders. We consider smart intruders, which appear at arbitrary times and locations, are aware of the cameras configuration, and move to avoid detection for as long as possible. As performance criteria we consider the worst-case detection time and the average detection time. We focus on the case of a chain of cameras, and we obtain the following results. First, we characterize a lower bound on the worstcase and on the average detection time of smart intruders. Second, we propose a team trajectory for the cameras, namely Equal-waiting trajectory, with minimum worst-case detection time and with guarantees on the average detection time. Third, we design a distributed algorithm to coordinate the cameras along an Equal-waiting trajectory. Fourth, we design a distributed algorithm for cameras reconfiguration in the case of failure or network change. Finally, we illustrate the effectiveness and robustness of our algorithms via simulations and experiments.

show abstract

Section: Introductionmentioning

confidence: 99%

Camera Network Coordination for Intruder Detection

Pasqualetti

Zanella

Peters

et al. 2014

IEEE Trans. Contr. Syst. Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

A heuristic approach for dividing graphs into bi-connected components with a size constraint

2017

View full text Add to dashboard Cite

In this paper we propose a new problem of finding the maximal biconnected partitioning of a graph with a size constraint (MBCPG-SC). With the goal of finding approximate solutions for the MBCPG-SC, a heuristic method is developed based on the open ear decomposition of graphs. Its essential part is an adaptation of the breadth first search which makes it possible to grow bi-connected subgraphs. The proposed randomized algorithm consists of growing several subgraphs in parallel. The quality of solutions generated in this way is further improved using a local search which exploits neighboring relations between the subgraphs. In order to evaluate the performance of the method, an algorithm for generating pseudo-random unit disc graphs with known optimal solutions is created. The conducted computational experiments show that the proposed method frequently manages to find optimal solutions and has an average error of only a few percent to known optimal solutions. Further, it manages to find high quality approximate solutions for graphs having up to 10.000 nodes in reasonable time.

show abstract