Block Fast Compressive Tracking Algorithm
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    FCT is a simple yet effective and efficient tracking algorithm, despite much success has been demonstrated, numerous issues remain to be addressed. In FCT, because of the sparsity of the compression measurement matrix, the spatial information of the sample is neglected, so the feature cannot represent the tracking target correctly and there is no remedy when tracking error. In this paper, we propose an improved fast compressive tracking algorithm considering the sample space information and extracts generalized Haar-like features randomly in block; target motion estimation method is used to correct target location, as the classifier is wrong. Adjusting the sparse degree of vector in compression measurement matrix and threshold of naive Bayes classifier can realize accurate target tracking. The experimental results show that compared with FCT, the improved algorithm achieves much better results in terms of both similarity and success rate and subjective visual perception.

    Reference
    Related
    Cited by
Get Citation

张彬彬,王福龙.分块快速压缩追踪算法.计算机系统应用,2016,25(5):101-106

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 20,2015
  • Revised:October 19,2015
  • Adopted:
  • Online: May 20,2016
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063