Journal on Communications ›› 2018, Vol. 39 ›› Issue (6): 190-198.doi: 10.11959/j.issn.1000-436x.2018097

• Correspondences • Previous Articles    

Kernelized correlation tracking based on point trajectories

Yunqiu LYU,Kai LIU,Fei CHENG   

  1. School of Computer Science and Technology,Xidian University,Xi’an 710071,China
  • Revised:2018-04-08 Online:2018-06-01 Published:2018-07-09
  • Supported by:
    The National Natural Science Foundation of China(91538101);The National Natural Science Foundation of China(61571345)

Abstract:

Visual tracking is one of the most important directions in computer vision.However,many state-of-the-art algorithms cannot track the interested object reliably due to occlusion during tracking process,which leads to deficiency of object information.In order to solve occlusion problem,a kernelized correlation tracking method based on point trajectories was proposed.Through analyzing long-term motion cues of the local information,point trajectories were labeled by spectral clustering.These labeled points were used to differentiate the foreground and background objects and thus detect whether the target was occluded or drifts.If drifting and occlusion occur,re-detection was used to detect the re-entering of the target.Experimental results show that the proposed algorithm can handle occlusion and drifting problems effectively.

Key words: kernelized correlation filter, point trajectories, spectral clustering

CLC Number: 

No Suggested Reading articles found!