The reviewed record of science sign in
Pith

arxiv: 2409.16288 · v1 · pith:VI3MUH7E · submitted 2024-09-24 · cs.CV

Self-Supervised Any-Point Tracking by Contrastive Random Walks

Reviewed by Pithpith:VI3MUH7Eopen to challenge →

classification cs.CV
keywords matchingcontrastiveglobalmethodsrandomself-supervisedtrackingcycle
0
0 comments X
read the original abstract

We present a simple, self-supervised approach to the Tracking Any Point (TAP) problem. We train a global matching transformer to find cycle consistent tracks through video via contrastive random walks, using the transformer's attention-based global matching to define the transition matrices for a random walk on a space-time graph. The ability to perform "all pairs" comparisons between points allows the model to obtain high spatial precision and to obtain a strong contrastive learning signal, while avoiding many of the complexities of recent approaches (such as coarse-to-fine matching). To do this, we propose a number of design decisions that allow global matching architectures to be trained through self-supervision using cycle consistency. For example, we identify that transformer-based methods are sensitive to shortcut solutions, and propose a data augmentation scheme to address them. Our method achieves strong performance on the TapVid benchmarks, outperforming previous self-supervised tracking methods, such as DIFT, and is competitive with several supervised methods.

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.