Multiple People Tracking by Lifted Multicut and Person Re-identification

被引:377
作者
Tang, Siyu [1 ,2 ]
Andriluka, Mykhaylo [1 ]
Andres, Bjoern [1 ]
Schiele, Bernt [1 ]
机构
[1] Max Planck Inst Informat, Saarbrucken, Germany
[2] Max Planck Inst Intelligent Syst, Tubingen, Germany
来源
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017) | 2017年
关键词
D O I
10.1109/CVPR.2017.394
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Tracking multiple persons in a monocular video of a crowded scene is a challenging task. Humans can master it even if they loose track of a person locally by re-identifying the same person based on their appearance. Care must be taken across long distances, as similar-looking persons need not be identical. In this work, we propose a novel graph-based formulation that links and clusters person hypotheses over time by solving an instance of a minimum cost lifted multicut problem. Our model generalizes previous works by introducing a mechanism for adding long-range attractive connections between nodes in the graph without modifying the original set of feasible solutions. This allows us to reward tracks that assign detections of similar appearance to the same person in a way that does not introduce implausible solutions. To effectively match hypotheses over longer temporal gaps we develop new deep architectures for re-identification of people. They combine holistic representations extracted with deep networks and body pose layout obtained with a state-of-the-art pose estimation model. We demonstrate the effectiveness of our formulation by reporting a new state-of-the-art for the MOT16 benchmark. The code and pre-trained models are publicly available(1).
引用
收藏
页码:3701 / 3710
页数:10
相关论文
共 37 条
[1]  
Andres B., 2015, CoRR
[2]  
[Anonymous], 2016, ECCV WORKSH BENCHM M
[3]  
[Anonymous], INT J COMPUTER VISIO
[4]  
[Anonymous], 2016, arXiv preprint arXiv:1607.06317
[5]  
[Anonymous], P IEEE C COMP VIS PA
[6]  
[Anonymous], 2011, P IEEE C COMP VIS PA
[7]  
[Anonymous], 2015, ICCV
[8]  
[Anonymous], 2008, P IEEE C COMP VIS PA
[9]  
[Anonymous], P IEEE INT C COMP VI
[10]  
Ban Y., 2016, ECCV WORKSH BENCHM M