Journal of South China University of Technology (Natural Science Edition) ›› 2013, Vol. 41 ›› Issue (11): 23-29,35.doi: 10.3969/j.issn.1000-565X.2013.11.004

• Electronics, Communication & Automation Technology • Previous Articles     Next Articles

Target Tracking Algorithm with Structured Sparse Representation Based on Ranks

Hou Yue- en1 Li Wei- guang1 Sekou Singare2 Zeng Shun- xing1 Rong Ai- qiong1   

  1. 1.School of Mechanical and Automotive Engineering,South China University of Technology,Guangzhou 510640,Guangdong,China;2.College of Mechanical Engineering,Dongguan University of Technology,Dongguan 523808,Guangdong,China
  • Received:2013-07-02 Revised:2013-08-05 Online:2013-11-25 Published:2013-10-11
  • Contact: 侯跃恩(1983-),男,博士生,主要从事机器视觉和机器人控制研究. E-mail:houyueen@163.com
  • About author:侯跃恩(1983-),男,博士生,主要从事机器视觉和机器人控制研究.
  • Supported by:

    粤港关键领域重点突破项目(2011BZ100012);东莞市高等院校、 科研机构和医疗卫生单位科技计划重点项目(2011108101002)

Abstract:

As the existing tracking algorithms are of poor performance in complex situations,a target tracking algo-rithm with structured sparse representation is proposed based on ranks.In this algorithm,first,a target dictionarycontaining targets and background information is constructed.Next,the candidate targets are represented linearlyvia the structured sparse representation,and the corresponding correlation coefficients are combined and ranked.Then,the residual error scores of the candidate targets are computed by using the residual errors of the target andthe background,and the scores are ranked later,from which the target state is finally determined.Experimental re-sults show that the proposed tracking algorithm is of high tracking accuracy and strong robustness.

Key words: target tracking, structured sparse representation, residual error, sparse coefficient, particle filtering

CLC Number: