Mean field approach for tracking similar objects

C. Medrano, J.E. Herrero, J. Martínez, C. Orrite

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

In this paper, we consider the problem of tracking similar objects. We show how a mean field approach can be used to deal with interacting targets and we compare it with Markov Chain Monte Carlo (MCMC). Two mean field implementations are presented. The first one is more general and uses particle filtering. We discuss some simplifications of the base algorithm that reduce the computation time. The second one is based on suitable Gaussian approximations of probability densities that lead to a set of self-consistent equations for the means and covariances. These equations give the Kalman solution if there is no interaction. Experiments have been performed on two kinds of sequences. The first kind is composed of a single long sequence of twenty roaming ants and was previously analysed using MCMC. In this case, our mean field algorithms obtain substantially better results. The second kind corresponds to selected sequences of a football match in which the interaction avoids tracker coalescence in situations where independent trackers fail.

Original languageEnglish
Pages (from-to)907-920
Number of pages14
JournalComputer Vision and Image Understanding
Volume113
Issue number8
DOIs
Publication statusPublished - Aug 2009

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Signal Processing

Fingerprint Dive into the research topics of 'Mean field approach for tracking similar objects'. Together they form a unique fingerprint.

  • Cite this