Multi-Commodity Network Flow for Tracking Multiple People

被引:104
作者
Ben Shitrit, Horesh [1 ]
Berclaz, Jerome [2 ]
Fleuret, Francois [1 ,3 ]
Fua, Pascal [1 ]
机构
[1] Ecole Polytech Fed Lausanne, CH-1015 Lausanne, Switzerland
[2] Microsoft, Sunnyvale, CA 94089 USA
[3] Idiap Res Inst, CH-1920 Martigny, Switzerland
基金
瑞士国家科学基金会;
关键词
Multi-object tracking; multi-commodity network flow; MCNF; tracklet association; linear programming; layered graph; ALGORITHM; PATHS;
D O I
10.1109/TPAMI.2013.210
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a multi-commodity network flow problem. Our proposed framework is designed to exploit image appearance cues to prevent identity switches. Our method is effective even when such cues are only available at distant time intervals. This is unlike many current approaches that depend on appearance being exploitable from frame-to-frame. Furthermore, our algorithm lends itself to a real-time implementation. We validate our approach on three publicly available datasets that contain long and complex sequences, the APIDIS basketball dataset, the ISSIA soccer dataset, and the PETS'09 pedestrian dataset. We also demonstrate its performance on a newer basketball dataset that features complete world championship basketball matches. In all cases, our approach preserves identity better than state-of-the-art tracking algorithms.
引用
收藏
页码:1614 / 1627
页数:14
相关论文
共 58 条
  • [1] [Anonymous], P IPSN PAL ALT CA US
  • [2] [Anonymous], P INT C ADV VID SIGN
  • [3] [Anonymous], P CVPR
  • [4] [Anonymous], P COCOON TAIP TAIW
  • [5] [Anonymous], P ECCV
  • [6] [Anonymous], MOSEK OPTIMIZATION T
  • [7] [Anonymous], P CVPR
  • [8] [Anonymous], P ICPR
  • [9] [Anonymous], P BMVC
  • [10] [Anonymous], P CVPR