Robust Deformable and Occluded Object Tracking With Dynamic Graph

被引:78
作者
Cai, Zhaowei [1 ]
Wen, Longyin [2 ]
Lei, Zhen [2 ]
Vasconcelos, Nuno [1 ]
Li, Stan Z. [2 ]
机构
[1] Univ Calif San Diego, Dept Elect & Comp Engn, La Jolla, CA 92093 USA
[2] Chinese Acad Sci, Inst Automat, Ctr Biometr & Secur Res, Natl Lab Pattern Recognit, Beijing 100190, Peoples R China
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
Visual tracking; dynamic graph; graph matching; deformation; occlusion; ENERGY MINIMIZATION; ONLINE; MODEL;
D O I
10.1109/TIP.2014.2364919
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
While some efforts have been paid to handle deformation and occlusion in visual tracking, they are still great challenges. In this paper, a dynamic graph-based tracker (DGT) is proposed to address these two challenges in a unified framework. In the dynamic target graph, nodes are the target local parts encoding appearance information, and edges are the interactions between nodes encoding inner geometric structure information. This graph representation provides much more information for tracking in the presence of deformation and occlusion. The target tracking is then formulated as tracking this dynamic undirected graph, which is also a matching problem between the target graph and the candidate graph. The local parts within the candidate graph are separated from the background with Markov random field, and spectral clustering is used to solve the graph matching. The final target state is determined through a weighted voting procedure according to the reliability of part correspondence, and refined with recourse to a foreground/background segmentation. An effective online updating mechanism is proposed to update the model, allowing DGT to robustly adapt to variations of target structure. Experimental results show improved performance over several state-of-the-art trackers, in various challenging scenarios.
引用
收藏
页码:5497 / 5509
页数:13
相关论文
共 45 条
[1]   SLIC Superpixels Compared to State-of-the-Art Superpixel Methods [J].
Achanta, Radhakrishna ;
Shaji, Appu ;
Smith, Kevin ;
Lucchi, Aurelien ;
Fua, Pascal ;
Suesstrunk, Sabine .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (11) :2274-2281
[2]  
Adam A., 2006, IEEE C COMPUTER VISI, V1, P798, DOI [DOI 10.1109/CVPR.2006.256, 10.1109/CVPR.2006.256]
[3]  
[Anonymous], ACCV
[4]  
[Anonymous], 2007, P 2007 IEEE C COMP V
[5]  
[Anonymous], 2007, Computer Vision and Pattern Recognition
[6]   Robust Object Tracking with Online Multiple Instance Learning [J].
Babenko, Boris ;
Yang, Ming-Hsuan ;
Belongie, Serge .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) :1619-1632
[7]  
Bordes A, 2005, J MACH LEARN RES, V6, P1579
[8]   An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision [J].
Boykov, Y ;
Kolmogorov, V .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) :1124-1137
[9]  
Cai Z., 2012, Proceedings of the Asian Conference on Computer Vision, volume 7726 of Lecture Notes in Computer Science, V7726, P86
[10]  
Cehovin L, 2011, IEEE I CONF COMP VIS, P1363, DOI 10.1109/ICCV.2011.6126390