Bayesian Multi-Camera Surveillance

Abstract

The task of multicamera surveillance is to reconstruct the paths taken by all moving objects that are temporally 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 efficiently approximate the maximum a posteriori solution by linear programming and present initial experimental results.

Cite

Text

Kettnaker and Zabih. "Bayesian Multi-Camera Surveillance." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1999. doi:10.1109/CVPR.1999.784638

Markdown

[Kettnaker and Zabih. "Bayesian Multi-Camera Surveillance." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1999.](https://mlanthology.org/cvpr/1999/kettnaker1999cvpr-bayesian/) doi:10.1109/CVPR.1999.784638

BibTeX

@inproceedings{kettnaker1999cvpr-bayesian,
  title     = {{Bayesian Multi-Camera Surveillance}},
  author    = {Kettnaker, Vera M. and Zabih, Ramin},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1999},
  pages     = {2253-},
  doi       = {10.1109/CVPR.1999.784638},
  url       = {https://mlanthology.org/cvpr/1999/kettnaker1999cvpr-bayesian/}
}