Video surveillance using distance maps

Human vigilance is limited; hence, automatic motion and distance detection is one of the central issues in video surveillance. Hereby, many aspects are of importance, this paper specially addresses: efficiency, achieving real-time performance, accuracy, and robustness against various noise factors. To obtain fully controlled test environments, an artificial development center for robot navigation is introduced in which several parameters can be set (e.g., number of objects, trajectories and type and amount of noise). In the videos, for each following frame, movement of stationary objects is detected and pixels of moving objects are located from which moving objects are identified in a robust way. An Exact Euclidean Distance Map (E2DM) is utilized to determine accurately the distances between moving and stationary objects. Together with the determined distances between moving objects and the detected movement of stationary objects, this provides the input for detecting unwanted situations in the scene. Further, each intelligent object (e.g., a robot), is provided with its E2DM, allowing the object to plan its course of action. Timing results are specified for each program block of the processing chain for 20 different setups. So, the current paper presents extensive, experimentally controlled research on real-time, accurate, and robust motion detection for video surveillance, using E2DMs, which makes it a unique approach.

[1]  Carlo S. Regazzoni,et al.  Introduction to the special issue on video object processing for surveillance applications , 2005, Real Time Imaging.

[2]  A. ROSENFELD,et al.  Distance functions on digital pictures , 1968, Pattern Recognit..

[3]  Theo E. Schouten,et al.  Timed fast exact Euclidean distance (tFEED) maps , 2005, IS&T/SPIE Electronic Imaging.

[4]  Michael J. Brooks,et al.  Issues in Automated Visual Surveillance , 2003, DICTA.

[5]  Th.E. Schouten,et al.  Weighted Distance Mapping (WDM) , 2005 .

[6]  András Hajdu,et al.  Approximating the Euclidean distance using non-periodic neighbourhood sequences , 2004, Discret. Math..

[7]  Theo E. Schouten,et al.  Three-dimensional fast exact Euclidean distance (3D-FEED) maps , 2006, Electronic Imaging.

[8]  Frank Y. Shih,et al.  Fast Euclidean distance transformation in two scans using a 3 × 3 neighborhood , 2004, Comput. Vis. Image Underst..

[9]  Gabriella Sanniti di Baja,et al.  Using distance transforms to decompose 3D discrete objects , 2002, Image Vis. Comput..

[10]  Yi-Ta Wu,et al.  Three-dimensional Euclidean distance transformation and its application to shortest path planning , 2004, Pattern Recognit..

[11]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[12]  Egon L. van den Broek,et al.  Fast exact Euclidean distance (FEED) transformation , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

[13]  Grégoire Malandain,et al.  3-D chamfer distances and norms in anisotropic grids , 2005, Image Vis. Comput..