Visual tracking using locality-constrained linear coding under a particle filtering framework

被引:3
作者
Ding, Meng [1 ,2 ]
Wei, Li [3 ]
Cao, Yunfeng [4 ]
Wang, Jie [1 ]
Cao, Li [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Civil Aviat, 29 Jiangjun St, Nanjing, Jiangsu, Peoples R China
[2] Sci & Technol Electroopt Control Lab, 25 Kaixuan St, Luoyang, Peoples R China
[3] Nanjing Univ Aeronaut & Astronaut, Jin Cheng Coll, 88 Hangjin St, Nanjing, Jiangsu, Peoples R China
[4] Nanjing Univ Aeronaut & Astronaut, Coll Astronaut, 29 Yudao St, Nanjing, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
linear codes; particle filtering (numerical methods); target tracking; local region information; computational complexity; matrix calculation; local feature descriptor; LLC; tracking algorithm; spatiotemporal factors; variable appearance; visual target tracking; particle filtering framework; locality constrained linear coding; visual tracking; ROBUST OBJECT TRACKING; REAL-TIME TRACKING; APPEARANCE MODEL;
D O I
10.1049/iet-cvi.2017.0271
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Visual target tracking has long been a challenging problem because of the variable appearance of the target with changing spatiotemporal factors. Therefore, it is important to design an effective and efficient appearance model for tracking tasks. This study proposes a tracking algorithm based on locality-constrained linear coding (LLC) under a particle filtering framework. A local feature descriptor is presented that can evenly represent the local information of each patch in the tracking region. LLC uses the locality constraints to project each local feature descriptor into its local-coordinate system. Compared with sparse coding, LLC can be performed very quickly for appearance modelling because it has an analytical solution derived by a three-step matrix calculation, and the computational complexity of the proposed tracking algorithm is o(eta x m x n). Both quantitative and qualitative experimental results demonstrate that the authors' proposed algorithm performs favourably against the 10 state-of-the-art trackers on 12 challenging test sequences. However, related experimental results show that the performance of their tracker is not effective enough for small tracking targets owing to a lack of sufficient local region information.
引用
收藏
页码:196 / 207
页数:12
相关论文
共 43 条
  • [1] Ali N.H., 2014, Int. J. Comput. Appl., V89, P15
  • [2] [Anonymous], 2012, PROC CVPR IEEE
  • [3] [Anonymous], 2014, IEEE T PATTERN ANAL, DOI DOI 10.1109/TPAMI.2013.230
  • [4] Robust Object Tracking with Online Multiple Instance Learning
    Babenko, Boris
    Yang, Ming-Hsuan
    Belongie, Serge
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) : 1619 - 1632
  • [5] Kernel Particle Filter for visual tracking
    Chang, C
    Ansari, R
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2005, 12 (03) : 242 - 245
  • [6] Hand gesture recognition using a real-time tracking method and hidden Markov models
    Chen, FS
    Fu, CM
    Huang, CL
    [J]. IMAGE AND VISION COMPUTING, 2003, 21 (08) : 745 - 758
  • [7] Comaniciu D, 2000, PROC CVPR IEEE, P142, DOI 10.1109/CVPR.2000.854761
  • [8] Enhanced fast compressive tracking based on adaptive measurement matrix
    Gao, Yun
    Zhou, Hao
    Zhang, Xuejie
    [J]. IET COMPUTER VISION, 2015, 9 (06) : 857 - 863
  • [9] Robust object tracking based on local region sparse appearance model
    Han, Guang
    Wang, Xingyue
    Liu, Jixin
    Sun, Ning
    Wang, Cailing
    [J]. NEUROCOMPUTING, 2016, 184 : 145 - 167
  • [10] Spatial Pyramid Pooling in Deep Convolutional Networks for Visual Recognition
    He, Kaiming
    Zhang, Xiangyu
    Ren, Shaoqing
    Sun, Jian
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2015, 37 (09) : 1904 - 1916