1996
DOI: 10.1109/34.481539
|View full text |Cite
|
Sign up to set email alerts
|

An efficient implementation of Reid's multiple hypothesis tracking algorithm and its evaluation for the purpose of visual tracking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
382
0
15

Year Published

2010
2010
2016
2016

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 580 publications
(398 citation statements)
references
References 26 publications
(18 reference statements)
1
382
0
15
Order By: Relevance
“…This approach that considers future positions of the object in addition to the past has been adopted in some automated tracking algorithms including MHT (e.g. Reid, 1979;Cox and Hingorani, 1996;Blackman, 2004;Lakshmanan and Smith, 2010;Scharenbrouch et al, 2010;Root et al, 2011;Lakshmanan et al, 2013;Miller et al, 2013) and ThOR (Barjenbruch and Houston, 2006;Barjenbruch, 2008;Lahowetz et al, 2010) and is employed in AALTO. Future positions are examined by building a search tree in which each node represents the position of an object along a candidate track, which refers to a possible continuation of the existing track.…”
Section: Trackingmentioning
confidence: 99%
“…This approach that considers future positions of the object in addition to the past has been adopted in some automated tracking algorithms including MHT (e.g. Reid, 1979;Cox and Hingorani, 1996;Blackman, 2004;Lakshmanan and Smith, 2010;Scharenbrouch et al, 2010;Root et al, 2011;Lakshmanan et al, 2013;Miller et al, 2013) and ThOR (Barjenbruch and Houston, 2006;Barjenbruch, 2008;Lahowetz et al, 2010) and is employed in AALTO. Future positions are examined by building a search tree in which each node represents the position of an object along a candidate track, which refers to a possible continuation of the existing track.…”
Section: Trackingmentioning
confidence: 99%
“…35,47 Statistical methods, for example using probability density functions such as Multiple Hypothesis Trackers and NP-Hard methods have been applied with varying degrees of success. 40,48 Multiple Hypothesis Trackers (MHT) introduce probabilistic knowledge, but can be difficult to apply from matching a variable number of image feature points in global optimization both in space and time, while NP-Hard methods prohibit fast computation. Heuristic methods can be used to identify putative tracks from qualitative descriptions, but suffer the disadvantage of relying critically on the accuracy in the detection stage and easily fail when ambiguities occur.…”
Section: Pinpointing Fluorescently-labelled Moleculesmentioning
confidence: 99%
“…Heuristic methods can be used to identify putative tracks from qualitative descriptions, but suffer the disadvantage of relying critically on the accuracy in the detection stage and easily fail when ambiguities occur. 48,49 To overcome many of the shortcomings of existing tracking methods, my laboratory has developed a new automated multiparticle tracking algorithm based on minimal path optimization, similar to those used previously but extended in application to native cell membranes of living bacterial cells. After detecting candidate particles and linking image feature points frame-byframe, some segmented trajectories are obtained initially.…”
Section: Pinpointing Fluorescently-labelled Moleculesmentioning
confidence: 99%
“…multi-hypothesis detection problems [9,10,7,8], without restricting to [4]. Then we derive continuous valued features (e.g., {Dist j , P robDecay j }) more precisely describing the underlying "candidate-ICV" associations, which permits further statistical analysis and classification, converting from binary detections.…”
Section: Discussionmentioning
confidence: 99%
“…1. For robustness, all steps of this detection pipeline leverage and keep multiple hypotheses (as a set of 3D boxes) for the next level until the last stage, which is in the same spirit of robust object tracking using multiple hypotheses [7], sequential Monte Carlo or particle filtering [8].…”
Section: Introductionmentioning
confidence: 99%