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

Multiple Hypothesis Tracking Revisited

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
443
0
1

Year Published

2016
2016
2019
2019

Publication Types

Select...
4
2
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 603 publications
(444 citation statements)
references
References 33 publications
0
443
0
1
Order By: Relevance
“…Algorithms representing the former category, such as Global Nearest Neighbor (GNN) and Joint Probabilistic Data Association (JPDA) filtering, integer programming or Multi Hypothesis Tracking (MHT) are well-described in Bar-Shalom, Daum, and Huang (2009), Kim, Li, Ciptadi, and Rehg (2015), Pulford (2005) and Khaleghi, Khamis, Karray, and Razavi (2013). More recent work has also applied Random Finite Set (RFS) theory to MTT yielding the Probability Hypothesis Density (PHD) or Cardinalized PHD (CPHD) filters Mahler (2015).…”
Section: Multi-target Trackersmentioning
confidence: 99%
“…Algorithms representing the former category, such as Global Nearest Neighbor (GNN) and Joint Probabilistic Data Association (JPDA) filtering, integer programming or Multi Hypothesis Tracking (MHT) are well-described in Bar-Shalom, Daum, and Huang (2009), Kim, Li, Ciptadi, and Rehg (2015), Pulford (2005) and Khaleghi, Khamis, Karray, and Razavi (2013). More recent work has also applied Random Finite Set (RFS) theory to MTT yielding the Probability Hypothesis Density (PHD) or Cardinalized PHD (CPHD) filters Mahler (2015).…”
Section: Multi-target Trackersmentioning
confidence: 99%
“…However, the nonconvex energy formulation puts out of reach any possibility of global minimization. It is still possible to get approximate solutions using non-exact optimization techniques that do not require a specific energy formulation, as done in Multiple Hypothesis Tracking [17] using a breadth-first search with branch pruning or in Markov Chain Monte Carlo Data Association (MCMCDA) with MCMC sampling [20,29]. Despite the non-optimality of the found solution, these methods can fully exploit the use of more appropriate interaction and dynamic models and can therefore cope with more difficult tracking issues.…”
Section: Multi-frame Data Associationmentioning
confidence: 99%
“…Recently, many online or sliding window approaches have gained in performances by incorporating more complex appearance models [1,4,17]. These models, inspired by the recent improvements in Single Object Tracking (SOT), can be updated online to take into account changes in appearance or pose variations and help better distinguish targets, for more robust tracking results.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Track-by-detection algorithms use post-processed data, that is, the raw sensor measurements have had some kind of thresholding performed [47]. There is a vast amount of work currently being done on developing and evaluating new algorithms (since 2015) that fall into the former category [3,[48][49][50][51][52]. In track-by-detection approaches, there are often separate techniques for detection and data association.…”
Section: Current Trendsmentioning
confidence: 99%