Visual Tracking Decomposition

被引:896
作者
Kwon, Junseok [1 ]
Lee, Kyoung Mu [1 ]
机构
[1] Seoul Natl Univ, Dept EECS, ASRI, Seoul 151742, South Korea
来源
2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) | 2010年
关键词
D O I
10.1109/CVPR.2010.5539821
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose a novel tracking algorithm that can work robustly in a challenging scenario such that several kinds of appearance and motion changes of an object occur at the same time. Our algorithm is based on a visual tracking decomposition scheme for the efficient design of observation and motion models as well as trackers. In our scheme, the observation model is decomposed into multiple basic observation models that are constructed by sparse principal component analysis (SPCA) of a set of feature templates. Each basic observation model covers a specific appearance of the object. The motion model is also represented by the combination of multiple basic motion models, each of which covers a different type of motion. Then the multiple basic trackers are designed by associating the basic observation models and the basic motion models, so that each specific tracker takes charge of a certain change in the object. All basic trackers are then integrated into one compound tracker through an interactive Markov Chain Monte Carlo (IMCMC) framework in which the basic trackers communicate with one another interactively while run in parallel. By exchanging information with others, each tracker further improves its performance, which results in increasing the whole performance of tracking. Experimental results show that our method tracks the object accurately and reliably in realistic videos where the appearance and motion are drastically changing over time.
引用
收藏
页码:1269 / 1276
页数:8
相关论文
共 20 条
[1]  
[Anonymous], 2009, CVPR
[2]  
[Anonymous], 2009, CVPR
[3]  
[Anonymous], 2006, CVPR
[4]  
[Anonymous], 1999, J COMPUTER VISION RE
[5]  
Comaniciu D., 2000, CVPR
[6]   Parallell interacting MCMC for learning of topologies of graphical models [J].
Corander, Jukka ;
Ekdahl, Magnus ;
Koski, Timo .
DATA MINING AND KNOWLEDGE DISCOVERY, 2008, 17 (03) :431-456
[7]   A direct formulation for sparse PCA using semidefinite programming [J].
d'Aspremont, Alexandre ;
El Ghaoui, Laurent ;
Jordan, Michael I. ;
Lanckriet, Gert R. G. .
SIAM REVIEW, 2007, 49 (03) :434-448
[8]  
DU W, 2008, ECCV
[9]  
Han B., 2007, ICCV
[10]  
Isard M., 1998, ECCV