Sub-optimal Camera Selection in Practical Vision Networks through Shape Approximation

  • Authors:

  • Huang Lee;Linda Tessens;Marleen Morbee;Hamid Aghajan;Wilfried Philips

  • Affiliations:

  • Wireless Sensor Network Lab Department of Electrical Engineering, Stanford University, Stanford, CA 94305;TELIN-IPI-IBBT, Ghent University, Ghent, Belgium;TELIN-IPI-IBBT, Ghent University, Ghent, Belgium;Wireless Sensor Network Lab Department of Electrical Engineering, Stanford University, Stanford, CA 94305;TELIN-IPI-IBBT, Ghent University, Ghent, Belgium

  • Venue:
  • ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

Within a camera network, the contribution of a camera to the observations of a scene depends on its viewpoint and on the scene configuration. This is a dynamic property, as the scene content is subject to change over time. An automatic selection of a subset of cameras that significantly contributes to the desired observation of a scene can be of great value for the reduction of the amount of transmitted and stored image data. We propose a greedy algorithm for camera selection in practical vision networks where the selection decision has to be taken in real time. The selection criterion is based on the information from each camera sensor's observations of persons in a scene, and only low data rate information is required to be sent over wireless channels since the image frames are first locally processed by each sensor node before transmission. Experimental results show that the performance of the proposed greedy algorithm is close to the performance of the optimal selection algorithm. In addition, we propose communication protocols for such camera networks, and through experiments, we show the proposed protocols improve latency and observation frequency without deteriorating the performance.