2014 IEEE Conference on Computer Vision and Pattern Recognition 2014
DOI: 10.1109/cvpr.2014.169
|View full text |Cite
|
Sign up to set email alerts
|

A Probabilistic Framework for Multitarget Tracking with Mutual Occlusions

Abstract: Mutual occlusions among targets can cause track loss or target position deviation, because the observation likelihood of an occluded target may vanish even when we have the estimated location of the target. This paper presents a novel probability framework for multitarget tracking with mutual occlusions. The primary contribution of this work is the introduction of a vectorial occlusion variable as part of the solution. The occlusion variable describes occlusion states of the targets. This forms the basis of th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 25 publications
(21 citation statements)
references
References 19 publications
0
21
0
Order By: Relevance
“…Numerous multi-object tracking methods formulated the task as the state estimation problem using the filter based strategies, such as Kalman filter [38,36] and particle filter [29,32,39,63]. These methods typically predicted the states of targets in short time durations which did not perform well in complex scenarios.…”
Section: Survey Of the Existing Mot Methodsmentioning
confidence: 99%
“…Numerous multi-object tracking methods formulated the task as the state estimation problem using the filter based strategies, such as Kalman filter [38,36] and particle filter [29,32,39,63]. These methods typically predicted the states of targets in short time durations which did not perform well in complex scenarios.…”
Section: Survey Of the Existing Mot Methodsmentioning
confidence: 99%
“…Discrete-continuous optimization techniques have been proposed [3,38], where discrete (data association) and continuous (trajectory fitting) optimization problems are solved in an alternating way until converging to a hopefully better local minimum. In [7,11,15,17,59], approximate Markov chain Monte Carlo techniques are employed for solving the data association problem. In order to increase the discriminative power of appearance and dynamical models, online learning approaches have been suggested [33, 35, 46, 56-58, 60, 62].…”
Section: Related Workmentioning
confidence: 99%
“…The MH algorithm [19] has been applied in the multiple target tracking task [21,23], where the authors use it for particle filter sampling to identify the state of each target precisely. However, in our paper, we do not aim at identifying each part all the time.…”
Section: Optimal Parts Inferencementioning
confidence: 99%