2015 IEEE International Conference on Computer Vision (ICCV) 2015
DOI: 10.1109/iccv.2015.349
|View full text |Cite
|
Sign up to set email alerts
|

Joint Probabilistic Data Association Revisited

Abstract: 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 track… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
176
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
4
3
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 299 publications
(188 citation statements)
references
References 36 publications
0
176
0
Order By: Relevance
“…Various solutions exist for the same like Joint Probabilistic Data Association (JPDA) [10] by Fortmann et al, Probability Hypothesis Density (PHD) filter [11] by Mahler and Multi Hypothesis Tracking [12] by Reid. And there exist various improvements of these solutions like [13], [14] and [15]. But using these additional data association algorithms not only increases the complexity of the task but at times also can increase the execution time.…”
Section: A Overviewmentioning
confidence: 99%
“…Various solutions exist for the same like Joint Probabilistic Data Association (JPDA) [10] by Fortmann et al, Probability Hypothesis Density (PHD) filter [11] by Mahler and Multi Hypothesis Tracking [12] by Reid. And there exist various improvements of these solutions like [13], [14] and [15]. But using these additional data association algorithms not only increases the complexity of the task but at times also can increase the execution time.…”
Section: A Overviewmentioning
confidence: 99%
“…In other words, they are well equipped to handle challenges numbers 1 and 2 listed in the first paragraph of Section 1. In the last two years, there has been a resurgence of detection-based approaches, including new variations of the more mature multi-target tracking algorithms, for example a revisiting of the JPDAF [33]. Most recently, due to the vast amount of research on (deep) neural networks for object and pedestrian detection [23,[34][35][36][37][37][38][39][40][41], track-by-detection multi-target tracking approaches are starting to be proposed that make use of these stat-of-the-art detectors [42].…”
Section: Common Multi-target Tracking Algorithmsmentioning
confidence: 99%
“…However, this method is difficult to deal with numerous targets and measurements such as multiple human objects tracking in crowded scenes. To overcome this drawback, Rezatofighi et al [21] revisit the JPDAF technique and propose a novel solution in formulating the problem as an integer linear program, which is embedded in a simple tracking framework. More specifically, the proposed method reformulates the calculation of individual JPDA assignment scores as a series of integer linear programs, and approximates the joint score by the m-best solutions, which is efficiently calculated by using a binary tree partition method, and hence addresses the issue of high computational complexity associated with JPDAF without forfeiting tracking performance.…”
Section: Jpdafmentioning
confidence: 99%
“…The most widely used target association techniques include joint probability data association filtering (JPDAF) [18][19][20][21], multiple-hypothesis tracking (MHT) [22][23][24][25], and flow network framework (FNF) [26][27][28][29]. The JPDAF computes a Bayesian estimate of the correspondence between two consecutive frames, based on calculating all possible target-measurement association probabilities jointly.…”
Section: Human Tracking Within a Cameramentioning
confidence: 99%