Quasi-Random Sampling for Condensation

Abstract

The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implementation. However, the conventional Condensation tracker is known to have difficulty with high-dimensional state spaces and unknown motion models. This paper presents an improved algorithm that addresses these problems by using a simplified motion model, and employing quasi-Monte Carlo techniques to efficiently sample the resulting tracking problem in the high-dimensional state space. For N sample points, these techniques achieve sampling errors of O(N ^-1), as opposed to O(N ^-1/2) for conventional Monte Carlo techniques. We illustrate the algorithm by tracking objects in both synthetic and real sequences, and show that it achieves reliable tracking and significant speed-ups over conventional Monte Carlo techniques.

Cite

Text

Philomin et al. "Quasi-Random Sampling for Condensation." European Conference on Computer Vision, 2000. doi:10.1007/3-540-45053-X_9

Markdown

[Philomin et al. "Quasi-Random Sampling for Condensation." European Conference on Computer Vision, 2000.](https://mlanthology.org/eccv/2000/philomin2000eccv-quasi/) doi:10.1007/3-540-45053-X_9

BibTeX

@inproceedings{philomin2000eccv-quasi,
  title     = {{Quasi-Random Sampling for Condensation}},
  author    = {Philomin, Vasanth and Duraiswami, Ramani and Davis, Larry S.},
  booktitle = {European Conference on Computer Vision},
  year      = {2000},
  pages     = {134-149},
  doi       = {10.1007/3-540-45053-X_9},
  url       = {https://mlanthology.org/eccv/2000/philomin2000eccv-quasi/}
}