In this paper we apply a recursive algorithm based on kernel mappings to propose an automated, real-time intruder detection mechanism for surveillance networks. Our proposed method is portable and adaptive, and does not require any expensive or sophisticated components. Through application to real images from BRAC University's closed-circuit television system and comparison with common methods based on Principle Component Analysis (PCA), we show that it is possible to obtain high detection accuracy with low complexity.

This article was published in the SIMULATION [© 2012 The Society for Modeling and Simulation International.] and the definite version is available at: http://doi.org/10.1177/0037549712460908 The Article's website is at: http://sim.sagepub.com/content/89/5/562Many schemes have been presented over the years to develop automated visual surveillance systems. However, these schemes typically need custom equipment, or involve significant complexity and storage requirements. In this paper we present three software-based agents built using kernel machines to perform automated, real-time intruder detection in surveillance systems. Kernel machines provide a powerful data mining technique that may be used for pattern matching in the presence of complex data. They work by first mapping the raw input data onto a (often much) higher-dimensional feature space, and then clustering in the feature space instead. The reasoning is that mapping onto the (higher-dimensional) feature space enables the comparison of additional, higher-order correlations in determining patterns between the raw data points. The agents proposed here have been built using algorithms that are adaptive, portable, do not require any expensive or sophisticated components, and are lightweight and efficient having run times of the order of hundredths of a second. Through application to real image streams from a simple, run-of-the-mill closed-circuit television surveillance system, and direct quantitative performance comparison with some existing schemes, we show that it is possible to easily obtain high detection accuracy with low computational and storage complexities.Publishe

No abstract

No abstract

No abstract

This conference paper was presented in the 3rd International Conference on Advances in Computing, Communications and Informatics, ICACCI 2014; Delhi; India; 24 September 2014 through 27 September 2014 [© 2014 Institute of Electrical and Electronics Engineers Inc.] The conference paper's definite version is available at: http:// 10.1109/ICACCI.2014.6968617Many types of automated visual surveillance systems have been presented in the recent literature. Most of the schemes require custom equipment, or involve significant complexity and storage needs. After studying the area in detail, this work presents four novel algorithms to perform automated, real-time intruder detection in surveillance networks. Built using machine learning techniques, the proposed algorithms are adaptive and portable, do not require any expensive or sophisticated component, are lightweight, and efficient with runtimes of the order of hundredths of a second. Two of the proposed algorithms have been developed by us. With application to two complementary data sets and quantitative performance comparisons with two representative existing schemes, we show that it is possible to easily obtain high detection accuracy with low false positives.Publishe

Visual surveillance networks are installed in many sensitive places in the present world. Human security officers are required to continuously stare at large numbers of monitors simultaneously, and for lengths of time at a stretch. Constant alert vigilance for hours on end is difficult to maintain for human beings. It is thus important to remove the onus of detecting unwanted activity from the human security officer to an automated system. While many researchers have proposed solutions to this problem in the recent past, significant gaps remain in existing knowledge. Most existing algorithms involve high complexities. No quantitative performance analysis is provided by most researchers. Most commercial systems require expensive equipment. This work proposes algorithms where the complexities are independent of time, making the algorithms naturally suited to online use. In addition, the proposed methods have been shown to work with the simplest surveillance systems that may already be publicly deployed. Furthermore, direct quantitative performance comparisons are provided.

Visual surveillance networks are installed in many sensitive places in the present world. Human security officers are required to continuously stare at large numbers of monitors simultaneously, and for lengths of time at a stretch. Constant alert vigilance for hours on end is difficult to maintain for human beings. It is thus important to remove the onus of detecting unwanted activity from the human security officer to an automated system. While many researchers have proposed solutions to this problem in the recent past, significant gaps remain in existing knowledge. Most existing algorithms involve high complexities. No quantitative performance analysis is provided by most researchers. Most commercial systems require expensive equipment. This work proposes algorithms where the complexities are independent of time, making the algorithms naturally suited to online use. In addition, the proposed methods have been shown to work with the simplest surveillance systems that may already be publicly deployed. Furthermore, direct quantitative performance comparisons are provided.