MFT: Long-Term Tracking of Every Pixel

Michal Neoral, Jonáš Šerých, Jiří Matas
5/22/2023
cs.CV

No official code found. Best implementation: serycjon/MFT (72 stars, last commit 2024-11-15).

Abstract

We propose MFT -- Multi-Flow dense Tracker -- a novel method for dense, pixel-level, long-term tracking. The approach exploits optical flows estimated not only between consecutive frames, but also for pairs of frames at logarithmically spaced intervals. It selects the most reliable sequence of flows on the basis of estimates of its geometric accuracy and the probability of occlusion, both provided by a pre-trained CNN. We show that MFT achieves competitive performance on the TAP-Vid benchmark, outperforming baselines by a significant margin, and tracking densely orders of magnitude faster than the state-of-the-art point-tracking methods. The method is insensitive to medium-length occlusions and it is robustified by estimating flow with respect to the reference frame, which reduces drift.

View on arXivView PDF

Code Implementations(1)

serycjon/MFTCommunity100%

MFT: Long-Term Tracking of Every Pixel -- code for the WACV 2024 paper

729C++, CudaNov 3, 20231 years agoNOASSERTION
computer-vision-algorithms

Similar Papers

Cite this paper

@article{neoral2023mft,
  title  = {MFT: Long-Term Tracking of Every Pixel},
  author = {Michal Neoral and Jonáš Šerých and Jiří Matas},
  year   = {2023},
  eprint = {2305.12998},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.12998v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.12998.svg)](https://codeofpaper.com/paper/2305.12998)

Discussion