Journal of South China University of Technology(Natural Science) >
Target Tracking Algorithm with Structured Sparse Representation Based on Ranks
Received date: 2013-07-02
Revised date: 2013-08-05
Online published: 2013-10-11
Supported by
粤港关键领域重点突破项目(2011BZ100012);东莞市高等院校、 科研机构和医疗卫生单位科技计划重点项目(2011108101002)
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.
Hou Yue- en Li Wei- guang Sekou Singare Zeng Shun- xing Rong Ai- qiong . Target Tracking Algorithm with Structured Sparse Representation Based on Ranks[J]. Journal of South China University of Technology(Natural Science), 2013 , 41(11) : 23 -29,35 . DOI: 10.3969/j.issn.1000-565X.2013.11.004
/
| 〈 |
|
〉 |