Benchmark:

MOT15 |

Short name:

JPDA_m

Detector:

Public

Description:

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.

Reference:

H. Rezatofighi, A. Milan, Z. Zhang, Q. Shi, A. Dick, I. Reid. Joint Probabilistic Data Association Revisited. In ICCV, 2015.

Last submitted:

April 14, 2015 (9 years ago)

Published:

April 22, 2015 at 09:02:53 CET

Submissions:

2

Project page / code:

http://research.milanton.net/files/iccv2015/jpda_m.zip

Open source:

No

Hardware:

3 GHz, 1 Core

Runtime:

32.6 Hz

Benchmark performance:

Detailed performance:

Raw data:

download