Robust visual tracking with structured sparse representation appearance model

被引:90
作者
Bai, Tianxiang [1 ]
Li, Y. F. [1 ]
机构
[1] City Univ Hong Kong, Dept Mech & Biomed Engn, Kowloon, Hong Kong, Peoples R China
关键词
Appearance model; Block-sparsity; Orthogonal matching pursuit; Sparse representation; Visual tracking; RECOGNITION; SIGNALS; RECOVERY; SAMPLE;
D O I
10.1016/j.patcog.2011.12.004
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
In this paper, we present a structured sparse representation appearance model for tracking an object in a video system. The mechanism behind our method is to model the appearance of an object as a sparse linear combination of structured union of subspaces in a basis library, which consists of a learned Eigen template set and a partitioned occlusion template set. We address this structured sparse representation framework that preferably matches the practical visual tracking problem by taking the contiguous spatial distribution of occlusion into account. To achieve a sparse solution and reduce the computational cost, Block Orthogonal Matching Pursuit (BOMP) is adopted to solve the structured sparse representation problem. Furthermore, aiming to update the Eigen templates over time, the incremental Principal Component Analysis (PCA) based learning scheme is applied to adapt the varying appearance of the target online. Then we build a probabilistic observation model based on the approximation error between the recovered image and the observed sample. Finally, this observation model is integrated with a stochastic affine motion model to form a particle filter framework for visual tracking. Experiments on some publicly available benchmark video sequences demonstrate the advantages of the proposed algorithm over other state-of-the-art approaches. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:2390 / 2404
页数:15
相关论文
共 41 条
[1]
Face description with local binary patterns:: Application to face recognition [J].
Ahonen, Timo ;
Hadid, Abdenour ;
Pietikainen, Matti .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (12) :2037-2041
[2]
A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking [J].
Arulampalam, MS ;
Maskell, S ;
Gordon, N ;
Clapp, T .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2002, 50 (02) :174-188
[3]
Babenko B., 2009, P IEEE C CVPR
[4]
EigenTracking: Robust matching and tracking of articulated objects using a view-based representation [J].
Black, MJ ;
Jepson, AD .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1998, 26 (01) :63-84
[5]
Brand M., 2002, P ECCV
[6]
CANDES EJ, 2005, MAGIC RECOVERY SPARS
[7]
Dynamic View Planning by Effective Particles for Three-Dimensional Tracking [J].
Chen, Huiying ;
Li, Youfu .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2009, 39 (01) :242-253
[8]
Chen SSB, 2001, SIAM REV, V43, P129, DOI [10.1137/S003614450037906X, 10.1137/S1064827596304010]
[9]
Kernel-based object tracking [J].
Comaniciu, D ;
Ramesh, V ;
Meer, P .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2003, 25 (05) :564-577
[10]
Fast Solution of l1-Norm Minimization Problems When the Solution May Be Sparse [J].
Donoho, David L. ;
Tsaig, Yaakov .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (11) :4789-4812