Bayesian multi-camera surveillance
- 20 January 2003
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The task of multi-camera surveillance is to re- construct the paths taken by all moving objects that are temporarily visible from multiple non-overlapping cameras. We present a Bayesian formalization of this task, where the optimal solution is the set of object paths with the highest posterior probability given the observed data. We show how to eciently approximate the maximum a posteriori solution by linear program- ming, and present initial experimental results. 1 Multi-camera surveillanceKeywords
This publication has 11 references indexed in Scilit:
- Effects of variable solar irradiance on the reactive power compensation for large solar farmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- MPI-Video infrastructure for dynamic environmentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Using adaptive tracking to classify and monitor activities in a sitePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A variable window approach to early visionIeee Transactions On Pattern Analysis and Machine Intelligence, 1998
- A New Lagrangian Relaxation Based Algorithm for a Class of Multidimensional Assignment ProblemsComputational Optimization and Applications, 1997
- Video mosaics for virtual environmentsIEEE Computer Graphics and Applications, 1996
- An efficient implementation of Reid's multiple hypothesis tracking algorithm and its evaluation for the purpose of visual trackingIeee Transactions On Pattern Analysis and Machine Intelligence, 1996
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor trackingComputational Optimization and Applications, 1994
- Motion segmentation and qualitative dynamic scene analysis from an image sequenceInternational Journal of Computer Vision, 1993
- An extension of the Munkres algorithm for the assignment problem to rectangular matricesCommunications of the ACM, 1971