- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper presents ObjectStream, a training-free visual-memory framework for streaming video understanding. The method identifies salient patches through their dissimilarity to the frame-level feature average, groups spatially connected patches into latent object candidates, and associates these candidates across frames using feature similarity and exponential moving averages.
Critical strengths
- The method offers a simple way to construct object-like memory without additional learned models.
- Reported improvements over the original backbones are substantial on online perception.
- The paper includes useful construction and sensitivity comparisons.
Critical weaknesses
- The claimed bounded streaming memory is not established by the described algorithm. Bounding the number of tracks and the final tokens exposed to the language model does not necessarily bound the state maintained during ingestion.
- The evidence does not adequately isolate the benefit of persistent object identities. Cross-frame matching uses independent nearest-neighbor feature similarity without a stated one-to-one assignment constraint or spatial/motion consistency requirement.
- The efficiency comparisons require a clearer accounting of computation and retained context. Table 5 reports 16.223 s TTFT for Patch Top-K versus 6.697 s for ObjectStream, despite identical peak memory and approximately matched token budgets. It also reports substantially different TPOT values across object-construction variants, ranging from 0.240 s to 1.230 s. Since these variants share the language-model backbone, these differences require an explanation in terms of actual context lengths, caching, execution paths, or measurement boundaries.
Questions for authors
- What exactly is stored in each historical token pool during ingestion? Is it incrementally pruned, and how are temporal-event buffers capped and evicted?
- How does ObjectStream perform when cross-frame association is disabled or randomized while preserving the same spatial candidates, recent window, and total token budget?
- Why is Patch Top-K substantially slower than ObjectStream in Table 5, and why do the object-construction variants have such different TPOT values?
Review and Rebuttal Summary
Dear Reviewers, Area Chairs, Senior Area Chairs, and Program Chairs, We sincerely thank all Area Chairs and all reviewers (
uwG7,4MED, andZBgy) for their time and constructive feedback that helped us improve the paper. We have uploaded the revised manuscript and supplementary materials with all major updates highlighted in blue.1. Overview of Review Status
[2,2,3]and currently stand at[3,3,3](Weak Accept)uwG7and4MEDconfirmed that our additional experiments resolved all concerns and raised their score from2to3.ZBgyconfirmed that our new results addressed their concern and strengthened the paper, maintaining their recommendation for acceptance.2. Summary of Key Revisions and Clarifications
Through the rebuttal and manuscript revision, we resolved all raised concerns across three main fronts:
A. New Experiments & Architectural Validation (Added & Modified)
uwG7).Qwen3.5-9B): Evaluated ObjectStream out-of-the-box—without modifying core memory rules—on Qwen3.5-9B across OVO-Bench, StreamingBench, VideoMME-Long, and EgoSchema in Tables 1 and 2 (W2, RevieweruwG7; Q4, Reviewer4MED).4MED; W2/Q2, ReviewerZBgy).4MED; W2/Q2, ReviewerZBgy).4MED; W3/Q3, ReviewerZBgy).uwG7).B. Algorithmic Guarantees & Experimental Protocols (Clarified)
4MED; W1/Q1, ReviewerZBgy).4MED).3. Core Contributions of ObjectStream
Thank you for your time and assistance.
Best regards, The Authors