- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes CSPTrack, a robust and efficient visual tracking framework that addresses three key limitations of existing template-search trackers: insufficient temporal state modeling, identity ambiguity under temporal fusion, and redundant token computation. The framework introduces three complementary designs: (1) a Causal State Prediction Module (CSPM) that leverages current search features and historical hidden states to explicitly predict short-term future states; (2) an instance-consistency objective applied during training to align target representations across template and search frames while separating different instances; and (3) a Ridge-Aware Token Pruning (RaTP) strategy that estimates search-token redundancy via ridge-reconstruction errors, selectively retains informative tokens, and aggregates removed tokens without pruning template tokens. Extensive experiments across six benchmarks (including LaSOT, GOT-10k, and TrackingNet) demonstrate competitive performance and improved inference efficiency.
Critical strengths
1.The paper addresses practical issues in tracking: temporal adaptation, distractor discrimination, and computational redundancy. The three proposed components are logically connected and easy to follow. 2.CSPM and RaTP are complementary: CSPM improves feature quality, while RaTP reduces computation. The overall design is sensible for efficient tracking. 3.The paper reports results on GOT-10k, LaSOT, LaSOText, TrackingNet, NFS, and OTB100, and includes ablations on CSPM, IC, RaTP, search frames, templates, and basis-token selection. 4.The LaSOT attribute-wise analysis and qualitative comparisons help demonstrate robustness under motion, occlusion, and appearance changes.
Critical weaknesses
1.The paper reports average results but does not analyze failure cases, especially under severe occlusion, small objects, or fast motion. 2.CSPTrack combines existing ideas in temporal modeling, instance consistency, and token compression, but its methodological novelty is not sufficiently clear. The authors should better distinguish novel contributions from adaptations of prior methods and provide controlled comparisons with relevant baselines under consistent experimental settings. 3.The efficiency claims are not fully supported: retaining 70% of tokens reduces MACs by only about 3.7%, and matched FPS or latency comparisons are missing. Moreover, the ablation results show that removing RaTP slightly improves AUC, raising concerns about its accuracy–efficiency trade-off. 4.The reported improvements are marginal and, in some cases, essentially negligible. For example, the LaSOT AUC gain is only 0.4 points (75.4% vs. 75.0%), the LaSOText gain is only 0.1 point (54.6% vs. 54.5%), the NFS gain is only 0.2 points (71.5% vs. 71.3%), and the OTB100 result is tied at 73.3%. Several attribute-wise gains are also very small, such as 0.1–0.3 points on motion blur, rotation, scale variation, and aspect-ratio change. Moreover, these comparisons are not fully controlled, since the methods differ in backbone resolution, architecture, and computational cost (e.g., B224 vs. B384). Such small margins under mismatched settings do not convincingly demonstrate a robust advantage. 5.The baseline in the component ablation is not clearly defined relative to the adopted MCITrack/CIF backbone, making it difficult to isolate the true contribution of the proposed modules. Most ablations, except the component ablation, are conducted under the pruned setting, and comparisons with concurrent works lack same-backbone or FLOPs-matched controls. The reported efficiency gains from pruning are modest—MACs decrease only from 48.6G to 46.8G at ρ=0.7—which is inconsistent with the claimed 10% speed improvement, and performance degrades noticeably under more aggressive ratios.
Questions for authors
1.Many comparisons mix B224 and B384 models with different architectures and computational costs. Can you provide same-backbone, same-resolution, and FLOPs-matched comparisons with concurrent trackers? Would the reported advantages remain under such matched settings? 2.Most ablations, except the component ablation, are conducted under the pruned setting. Can you provide key ablations under the unpruned setting to isolate the effects of CSPM, IC, search frames, templates, and basis-token selection? 3.CSPTrack combines temporal modeling, instance consistency, and token compression. Can you clarify the essential novel contribution of each component compared with DreamTrack, ARTrackV2, MCITrack, and existing token-pruning methods? Which parts are new designs rather than adaptations? 4.Table 3 shows that removing RaTP gives 75.4% AUC, while the full model gives 75.2% AUC. Can you explain why RaTP should be retained? Is its benefit mainly efficiency, and given the modest MACs reduction, is this trade-off favorable? 5.The paper claims a 10% increase in tracking speed, but MACs decrease only from 48.6G to 46.8G at ρ=0.7, about 3.7%. Can you report actual FPS or latency for different retention ratios, and explain how the 10% figure is measured?