Auto-correct-integrated trackers with and without memory of first frames
Visual short-term tracking in a long sequence of images with a lot of pose variations, target deformations and different types of occlusion is one of the harshest tasks in image processing. Overcoming such challenges can be performed in a superior way by combining different trackers. In this paper,...
Saved in:
| Published in: | International journal of intelligent robotics and applications Online Vol. 4; no. 2; pp. 191 - 201 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Singapore
Springer Singapore
01.06.2020
Springer Nature B.V |
| Subjects: | |
| ISSN: | 2366-5971, 2366-598X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Visual short-term tracking in a long sequence of images with a lot of pose variations, target deformations and different types of occlusion is one of the harshest tasks in image processing. Overcoming such challenges can be performed in a superior way by combining different trackers. In this paper, we propose a method that combines different algorithms for tracking the given target. The algorithms are KCF (Henriques et al. in IEEE Trans Pattern Anal Mach Intell 37(3):583–596, 2014), MIL (Babenko et al. in Visual tracking with online multiple instance learning. In: 2009 IEEE conference on computer vision and pattern recognition. IEEE, 2009), CSR-DCF (Lukezic et al. in Discriminative correlation filter with channel and spatial reliability. In: Proceedings of the IEEE conference on computer vision and pattern recognition, 2017) and MOSSE (Bolme et al. in Visual object tracking using adaptive correlation filters. In: 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE, 2010) trackers. In this method, these algorithms can continuously correct each other’s faults. They also implicitly search for the target even when they are tracking it, to make sure the object they are tracking is the real target. Thus, they outperform many of the state-of-the-art trackers as well as their components when they work independently. In this paper, we examine three trackers which we made in such way. Two of these trackers run at speeds close to real-time on a CPU and so we compare them with some famous wide-spread tracking algorithms both in terms of accuracy and speed. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2366-5971 2366-598X |
| DOI: | 10.1007/s41315-020-00137-0 |