pith. machine review for the scientific record. sign in

arxiv: 1811.11325 · v4 · submitted 2018-11-28 · 💻 cs.CV

Recognition: unknown

CyLKs: Unsupervised Cycle Lucas-Kanade Network for Landmark Tracking

Authors on Pith no claims yet
classification 💻 cs.CV
keywords trackinglucas-kanadecylksfeatureperformassumptiondriftduring
0
0 comments X
read the original abstract

Across a majority of modern learning-based tracking systems, expensive annotations are needed to achieve state-of-the-art performance. In contrast, the Lucas-Kanade (LK) algorithm works well without any annotation. However, LK has a strong assumption of photometric (brightness) consistency on image intensity and is easy to drift because of large motion, occlusion, and aperture problem. To relax the assumption and alleviate the drift problem, we propose CyLKs, a data-driven way of training Lucas-Kanade in an unsupervised manner. CyLKs learns a feature transformation through CNNs, transforming the input images to a feature space which is especially favorable to LK tracking. During training, we perform differentiable Lucas-Kanade forward and backward on the convolutional feature maps, and then minimize the re-projection error. During testing, we perform the LK tracking on the learned features. We apply our model to the task of landmark tracking and perform experiments on datasets of THUMOS and 300VW.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.