Kernelized correlation tracking based on point trajectories
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 co...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2018-06-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2018097/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1000-436X |