atlas

Research map / Label-efficient and robust learning / Recognition and long-tail

RTracker: Recoverable Tracking via PN Tree Structured Memory

CVPR 2024 · Label-efficient and robust learning › Recognition and long-tail · approach: Dense features and foundation priors · 22 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes RTracker, which pairs a tracker and a detector through a Positive-Negative tree-structured memory and walking rules to detect target loss and recover tracking.

Problem

Visual object tracking fails to recover after target loss caused by full occlusion, out-of-view, or tracking failure; fixed-threshold presence checks generalize poorly.

Approach

A PN tree memory stores chronological positive and negative target samples, and walking rules classify a test node by relative cosine similarity to these support samples, instead of fixed thresholds; control flows then switch between tracker and global detector.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
associate the tracker and detector using PN-tree target-state prediction (ablation)MixViT-L tracker and MITS detector · VideoCubeNP: 78.7 -> 81.5Helped
associate the tracker and detector using PN-tree target-state prediction (ablation)MixViT-L tracker and MITS detector · LaSOTextNP: 61.6 -> 65.5Helped
associate the tracker and detector using PN-tree target-state prediction (ablation)MixViT-L tracker and MITS detector · TNL2KNP: 75.5 -> 76.9Helped
replace tracker-only tracking with detector-only tracking (ablation)RTracker · VideoCubeAUC: 69.6 -> 46.6Hurt
replace tracker-only tracking with detector-only tracking (ablation)RTracker · LaSOTextAUC: 54.9 -> 50.3Hurt
replace tracker-only tracking with detector-only tracking (ablation)RTracker · TNL2KAUC: 60.6 -> 55.5Hurt
replace PN-tree state prediction with a fixed confidence threshold (ablation)RTracker · VideoCubeAUC: 60.9 -> 69.6Hurt
replace PN-tree state prediction with a fixed confidence threshold (ablation)RTracker · LaSOTextAUC: 50.7 -> 54.9Hurt
replace PN-tree state prediction with a fixed confidence threshold (ablation)RTracker · TNL2KAUC: 56.5 -> 60.6Hurt
remove PN-tree walking rules (ablation)RTracker · VideoCubeAUC: 62.6 -> 69.6Hurt
remove PN-tree walking rules (ablation)RTracker · LaSOTextAUC: 49.0 -> 54.9Hurt
remove PN-tree walking rules (ablation)RTracker · TNL2KAUC: 57.4 -> 60.6Hurt

Surprising findings

Limitations

Experimental setup

Datasets: LaSOT NIGHTS GOT-10k

Benchmarks: VideoCube LaSOT LaSOText TNL2K GOT-10k

Metrics: normalized precision AUC success rate precision AO SR0.5 SR0.75 recovery success rate

Baselines: MixViT-L SeqTrack-L OSTrack ARTrack-L UNINEXT-H MITS CiteTracker DropTrack TLD

Builds on: MixViT MITS DreamSim

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy