Joint Probabilistic Data Association Revisited

Seyed Hamid Rezatofighi, Anton Milan, Zhen Zhang, Qinfeng Shi, Anthony Dick, Ian Reid; Proceedings of the IEEE International Conference on Computer Vision (ICCV), 2015, pp. 3047-3055


In this paper, we revisit the joint probabilistic data association (JPDA) technique and propose a novel solution based on recent developments in finding the m-best solutions to an integer linear program. The key advantage of this approach is that it makes JPDA computationally tractable in applications with high target and/or clutter density, such as spot tracking in fluorescence microscopy sequences and pedestrian tracking in surveillance footage. We also show that our JPDA algorithm embedded in a simple tracking framework is surprisingly competitive with state-of-the-art global tracking methods in these two applications, while needing considerably less processing time.

Related Material

author = {Rezatofighi, Seyed Hamid and Milan, Anton and Zhang, Zhen and Shi, Qinfeng and Dick, Anthony and Reid, Ian},
title = {Joint Probabilistic Data Association Revisited},
booktitle = {Proceedings of the IEEE International Conference on Computer Vision (ICCV)},
month = {December},
year = {2015}