Abstract

Discriminative correlation filter (DCF) has attracted enormous popularity among the tracking community. Standard DCF based trackers easily achieve real-time tracking speed but significantly suffer from the boundary effects. Recently, spatially regularized or constrained correlation filters tackle the problem of boundary effects at the sacrifice of the closed-form element-wise solution. In this paper, we cope with boundary effects from a novel perspective and present a coarse-to-fine tracking (CTFT) framework which breaks the task of visual tracking into two stages. In the first stage, CTFT locates the target coarsely with a deep convolution operator in a large search area. In the second stage, CTFT performs a fine-grained search of the target with a shallow convolution operator around the initial location in the first stage. With this two-stage tracking framework, CTFT holds a large target search area and maintains the efficient element-wise solution of standard DCF. Compared with state-of-the-art deep trackers, CTFT makes a good balance between computational efficiency and accuracy. Extensive experimental results on OTB2013 and OTB2015 demonstrate that CTFT maintains real-time performance at an average tracking speed of 35.8 fps and achieves favorable performance against state-of-the-art trackers.

Full Text
Published version (Free)

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