Target Track Recording System Based on Kernelized Correlation Filters Tracking Algorithm
CSTR:
Author:
  • Article
  • | |
  • Metrics
  • |
  • Reference [16]
  • |
  • Related
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    In order to ensure that our tracking algorithm can real-time capture the fast-moving target and record its three-dimensional coordinates, the system uses a high-speed tracking algorithm based on Kernelized Correlation Filters (KCF). First, use KCF tracking algorithm to track the target. Second, use ORB feature point detection algorithm to calculate the target feature point. Then find out the corresponding point in Multi-Camera. After finding the corresponding points, use three-dimensional reconstruction theory of Multi-Camera to calculate the three-dimensional coordinates of the target object in each frame. Finally, using polynomial to fit the discrete points of each frame and then get the final trajectory. The experimental results show that this algorithm can track target efficiently and the whole system can meet actual requirements.

    Reference
    1 Kalal Z, Mikolajczyk K, Matas J. Tracking learning detection. IEEE Trans. on Pattern Analysis & Machine Intelligence, 2012, 34(7):1409-1422.
    2 Zhang K, Zhang L, Yang MH. Real-time compressive tracking. European Conference on Computer Vision. Springer-Verlag. 2012. 864-877.
    3 Henriques JF, Rui C, Martins P, et al. High-speed tracking with kernelized correlation filters. IEEE Trans. on Pattern Analysis & Machine Intelligence, 2015, 37(3):583-596.
    4 Dalal N, Triggs B. Histograms of oriented gradients for human detection. IEEE Conference on Computer Vision & Pattern Recognition. 2013. 886-893.
    5 Rifkin R, Yeo G, Poggio T. Regularized least-squares classification. Acta Electronica Sinica, 2003, (190):93-104.
    6 Gray RM. Toeplitz And Circulant matrices:A review (foundations and trends(R) in communications and information theory). Now Publishers Inc, 2006.
    7 Davis PJ. Circulant Matrices:Second Edition. 1994.
    8 Schölkopf B, Smola A. Learning with Kernels:Support vector machines, regularization, optimization, and beyond. Journal of the American Statistical Association, 2011, 16(3):781.
    9 Henriques JF, Rui C, Martins P, et al. Exploiting the Circulant Structure of Tracking-by-Detection with Kernels. European Conference on Computer Vision. 2012. 702-715.
    10 Lowe DG. Distinctive Image Features from Scale-Invariant Keypoints. International Journal of Computer Vision, 2004, 60(2):91-110.
    11 Rublee E, Rabaud V, Konolige K, et al. ORB:An efficient alternative to SIFT or SURF. 2011 IEEE International Conference on Computer Vision (ICCV). 2011. 2564-2571.
    12 Rosin PL. Measuring corner properties. Computer Vision and Image Understanding, 1999, 73(2):291-307.
    13 Calonder M, Lepetit V, Strecha C, et al. BRIEF:Binary robust independent elementary features. European Conference on Computer Vision. 2010. 778-792.
    14 Chum O, Matas J. Matching with PROSAC-Progressive sample consensus. IEEE Computer Society Conference on Computer Vision And Pattern Recognition. 2005,1. 220-226.
    15 邱茂林,马颂德,李毅.计算机视觉中摄像机定标综述.自动化学报,2000,26(1):43-55.
    16 王辉,肖建,严殊.关于模糊系统辨识近年来的研究与发展. 信息与控制,2004,33(4):445-450.
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

张乘龙,夏筱筠,柏松,姚恺丰.基于KCF跟踪算法的目标轨迹记录系统.计算机系统应用,2017,26(5):113-118

Copy
Share
Article Metrics
  • Abstract:2139
  • PDF: 3728
  • HTML: 0
  • Cited by: 0
History
  • Received:August 29,2016
  • Revised:October 17,2016
  • Online: May 13,2017
Article QR Code
You are the first990536Visitors
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