← Latest papers
💻 computer science

TAPNext++: What's Next for Tracking Any Point (TAP)?

TAPNext++ enhances the original TAPNext model by introducing data-driven training strategies, geometric augmentations, and a new re-detection metric to achieve state-of-the-art performance in tracking points over long video sequences and handling re-occurring points with low latency.

Original authors: Sebastian Jung, Artem Zholus, Martin Sundermeyer, Carl Doersch, Ross Goroshin, David Joseph Tan, Sarath Chandar, Rudolph Triebel, Federico Tombari

Published 2026-04-15
📖 5 min read🧠 Deep dive

Original authors: Sebastian Jung, Artem Zholus, Martin Sundermeyer, Carl Doersch, Ross Goroshin, David Joseph Tan, Sarath Chandar, Rudolph Triebel, Federico Tombari

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are playing a game of "Where's Waldo?" but instead of a book, you are watching a chaotic, fast-moving video. Sometimes Waldo runs behind a tree, sometimes he jumps out of the frame entirely, and sometimes he comes back wearing a different hat.

Tracking Any Point (TAP) is the computer vision task of keeping your eyes glued to a specific dot (or "point") in a video, no matter how crazy the camera moves or how many times the dot disappears.

The paper introduces TAPNext++, a new AI model that is incredibly good at this game. Here is the story of how it works, explained simply.

The Problem: The "Short-Term Memory" AI

The previous champion, called TAPNext, was like a very fast runner with a great memory for the last few seconds, but a terrible memory for the last few minutes.

  • The Issue: If a video was short, TAPNext was amazing. But if the video was long (like a whole movie scene), the AI would get "confused." It would forget where the dot started.
  • The "Re-Entry" Fail: If a dot disappeared behind a wall and then popped back out on the other side, TAPNext often wouldn't recognize it. It was like seeing your friend walk out of a room and then walk back in from the other door, but you thinking, "Who is that stranger?"

The Solution: TAPNext++ (The Super-Runner)

The authors took the same engine (the "brain" architecture) that TAPNext used but gave it a massive upgrade in training. They didn't build a new car; they just taught the old car how to drive on much longer, more difficult roads.

Here are the three main tricks they used:

1. The "Marathon Training" (Long Sequences)

Imagine you are training a dog to fetch a ball.

  • Old Way: You throw the ball 50 times, but only 10 feet away. The dog gets good at short throws but panics when you throw it 100 feet.
  • TAPNext++ Way: The researchers taught the AI on videos that were 1,000 frames long (about 30-40 seconds of continuous motion).
  • The Tech Magic: To do this, they couldn't fit the whole video in one computer's memory. So, they used a technique called Sequence Parallelism. Think of it like a relay race where 8 runners (GPUs) pass the baton (data) to each other instantly. They split the long video into chunks, processed them together, and stitched the memory back together. This allowed the AI to learn how to remember things for a long time without getting tired.

2. The "Roller Coaster" Training (Re-Entry)

The biggest weakness was when points left the screen and came back.

  • The Analogy: Imagine you are watching a soccer ball. It rolls off the left side of the screen. In a normal video, it's gone. But in the real world, if the camera pans right, that ball might re-enter from the right side.
  • The Fix: The researchers created a special "Roll" augmentation. They took the training videos and physically rotated and wrapped them around. If a point rolled off the right edge, it instantly reappeared on the left.
  • The Result: The AI was forced to learn that "Oh, just because it disappeared doesn't mean it's gone forever; it might just be on the other side of the world." This made it a master at finding points that reappear after being hidden.

3. The "Invisible Friend" Training (Occlusion)

Sometimes points are hidden behind other objects (occlusion).

  • The Old Way: The AI was only punished if it lost the point when the point was visible. If the point was hidden, the AI could guess randomly and get away with it.
  • The New Way: They told the AI, "Even when the point is hidden, you must guess where it would be if you could see it." They gave the AI a small "homework assignment" to keep tracking the invisible point. This way, when the point pops back out, the AI is already waiting for it in the right spot.

The New Scoreboard: AJRD

The authors realized the old scoring systems were cheating. They measured how long a point stayed visible, but they didn't care if the AI lost it and then found it again.

They invented a new score called AJRD (Re-Detection Average Jaccard).

  • Think of it like this: In a game of tag, if you lose the tagger, run away, and then they tag you again, a good player should still know who they are. AJRD measures exactly how good the AI is at saying, "Aha! I know you, even though you were hiding for a while!"

The Result: Fast, Light, and Strong

The best part? TAPNext++ didn't become slow or heavy.

  • Speed: It runs at 60+ frames per second (real-time speed).
  • Memory: It uses very little computer memory, meaning it could run on a phone or a robot.
  • Performance: It beats every other method on long videos and is the only one that consistently finds points that have been hiding or left the screen.

Summary

TAPNext++ is like taking a smart, fast runner and training them on a marathon course with obstacles, blindfolds, and teleportation. Now, this runner can track a dot through a chaotic video, even if the dot disappears for a long time, comes back from a different angle, or hides behind a wall. It proves that you don't need a bigger, heavier brain to solve these problems; you just need better training.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →