Abstract

A robust and efficient object tracking algorithm is required in a variety of computer vision applications. Although various modern trackers have impressive performance, some challenges such as occlusion and target scale variation are still intractable, especially in the complex scenarios. This paper proposes a robust scale adaptive tracking algorithm to predict target scale by a sequential Monte Carlo method and determine the target location by the correlation filter simultaneously. By analyzing the response map of the target region, the completeness of the target can be measured by the peak-to-sidelobe rate (PSR), i.e., the lower the PSR, the more likely the target is being occluded. A strict template update strategy is designed to accommodate the appearance change and avoid template corruption. If the occlusion occurs, a retained scheme is allowed and the tracker refrains from drifting away. Additionally, the feature integration is incorporated to guarantee the robustness of the proposed approach. The experimental results show that our method outperforms other state-of-the-art trackers in terms of both the distance precision and overlap precision on the publicly available TB-50 dataset.

Highlights

  • Visual object tracking plays an important role in computer vision

  • There are a total of 52 sequences that are recorded in various scenarios and contain different challenges such as illumination variation, scale variation, occlusion, deformation, etc

  • A robust scale adaptive tracking algorithm based on the correlation filter is proposed

Read more

Summary

Introduction

Visual object tracking plays an important role in computer vision. It is a basic component within a variety of applications including surveillance, human–computer interaction, action recognition and robotics, etc. The performance of these applications depends on the accuracy of the object tracking algorithms. The popular tracking algorithm can be categorized into generative and discriminative methods. The generative method seeks to consider tracking as a problem of finding the maximal-similarity region to the target. The similarity is measured in feature space or a low-dimensional subspace to describe the target and incrementally learn the subspace to adapt to appearance changes during tracking. The discriminative method formulates the tracking problem as a binary classification task whose goal is to discriminate the target from the background [1,3,11,12,13]

Methods
Results
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.