Streaming Video Understanding  ·  Training-Free

Dynamic Hub-and-Spoke Memory
for Streaming Video Understanding

1Northeastern University    2University of Alabama at Birmingham    3Tulane University    4University of Virginia    5Adobe Research   
* Equal contribution    Corresponding authors
Overview of the D-HSM pipeline: historical video chunks are converted by a frozen VLM into structured textual observations, organized into a dynamic hub-and-spoke memory, then retrieved question-adaptively and combined with recent visual frames for answer prediction.

“Remembering is not the re-excitation of innumerable fixed, lifeless and fragmentary traces. It is an imaginative reconstruction, or construction.”

— Frederic C. Bartlett
Overview of D-HSM. Historical chunks are turned by a frozen VLM into structured textual observations and organized into a dynamic hub-and-spoke memory. When a question arrives, D-HSM retrieves a compact, question-adaptive subset, expands it through hub-and-spoke links, and combines it with the recent visual window for frozen-VLM answer prediction.

Abstract

Reconstruct the past, don’t replay it

Streaming video understanding requires answering questions at arbitrary times over a continuously growing visual stream. The central challenge is to compactly remember long-range history while effectively retrieving question-relevant evidence.

We propose D-HSM (Dynamic Hub-and-Spoke Memory), a training-free framework that represents distant history as structured textual memory while preserving recent frames as visual tokens for fine-grained perception. D-HSM turns selected historical chunks into typed textual observations and stores them in an entity-centered hub-and-spoke memory, with entities as hubs and related evidence as spokes. To answer a question, it dynamically retrieves a compact question-aware subset, expands it through hub-and-spoke links, and combines it with the recent visual window for frozen-VLM prediction.

Across streaming and long-video benchmarks, D-HSM consistently and substantially improves VLM backbones and outperforms state-of-the-art online and offline baselines.

The Memory Problem

Two questions a streaming model must answer

Existing streaming methods mostly ask which past visual tokens to keep. That leaves open a harder pair of questions about how the retained history should be represented and queried.

1

How should a streaming model organize long-range history into structured semantic memory?

Flat captions are segment-level summaries with no explicit links among recurring entities, actions, and relations across time. D-HSM answers with structured, entity-centered semantic memory.

2

How should a streaming model dynamically retrieve question relevant history?

Real-time questions are best answered from the recent window alone; adding history can distract. Backward and temporal questions need earlier evidence. D-HSM answers this with question-adaptive retrieval.

A simple diagnostic motivates the design. Starting from a recent-frames-only baseline, appending historical video tokens is less effective than converting the same segments into textual traces, but flat text still isn’t enough, which is why D-HSM structures it as a graph and queries it adaptively.

Method

A frozen VLM with a structured, adaptive memory

D-HSM handles the asymmetry between voluminous history and the detail-rich present: distant history is stored as compact textual memory, while the recent window stays as visual frames for fine-grained perception. No parameters are trained.

Construction & update (in three stages). D-HSM (i) selects a bounded, dynamically-budgeted set of historical chunks, (ii) converts each into a fixed-schema typed observation via a frozen VLM, and (iii) integrates them into an entity-centered hub-and-spoke graph — linking entities, merging repeated facts, connecting co-occurring entities and ordered actions, and removing evidence whose supporting chunks are dropped.

Each chunk becomes typed evidence, not a caption:

Objects People Actions OCR-Text Spatial Event

Dynamic hub-and-spoke retrieval. A lightweight keyword gate skips retrieval for explicitly current-state questions. Otherwise D-HSM ranks memory entries by query similarity and, instead of a fixed top-K, truncates at the most salient score gap, keeping only the high-similarity prefix. Selected entries are expanded through hubs, co-occurrence, and next-action chains, then linearized and passed to the frozen VLM with the recent frames.

Hub-and-Spoke Memory

Entities are hubs. Evidence hangs off as spokes.

Recurring entities become persistent hubs with stable identifiers; their actions, spatial relations, OCR text, and events attach as timestamped spokes. Evidence about the same entity accumulates, merges, and stays localizable across time.

Example of the hub-and-spoke memory: entities such as the artist, canvas, paintbrushes, and sketch stored as hubs with consistent identifiers, and their associated actions, spatial relations, OCR text, and events stored as timestamped spokes.
Hub-and-spoke memory representation. Entities (e.g., “artist”, “canvas”, “paintbrushes”, “sketch”) are hubs with consistent IDs; associated actions, spatial relations, OCR text, and events are timestamped spokes. Repeated or related evidence attaches to the corresponding hub, letting D-HSM connect evidence across different moments.

Results

State of the art on streaming — strong on offline long video

73.7 → 84.7
StreamingBench overall, Qwen2.5-VL baseline vs. D-HSM
+9.7
Over Gemini 1.5 Pro on StreamingBench (85.4 best)
~0.75 s
Question-path latency · 11 ms retrieval + 0.74 s answer generation
−51%
Fewer retrieved tokens via dynamic cutoff (OVO-Bench)
StreamingBench — real-time understanding (overall)
ModelSize#FramesOverall
Human91.5
Proprietary models
GPT-4o6473.3
Claude 3.5 Sonnet2072.4
Gemini 1.5 Pro1 fps75.7
Open-source offline
LLaVA-OneVision7B3271.1
Qwen2.5-VL (baseline)7B1 fps73.7
Open-source online
TimeChatOnline7B1 fps75.4
Streamforest7B1 fps77.3
Qwen2.5-VL + D-HSM7B20+482.5
Qwen2.5-VL + D-HSM7B20+884.7
Qwen3-VL + D-HSM8B20+483.1
Qwen3-VL + D-HSM8B20+885.4

“20+n” = 20 historical frames for memory construction + n recent frames for perception. Full per-task breakdown (OP/CR/CS/ATP/EU/TR/PR/SU/ACP/CT) is in the paper.

OVO-Bench — online video understanding (category averages)
ModelSizeReal-TimeBackwardForwardOverall
Human Agents93.292.392.992.8
Proprietary models
GPT-4o64.560.853.459.5
Gemini 1.5 Pro69.362.557.263.0
Open-source online
Streamforest7B61.252.052.555.6
Streamo7B67.449.257.057.9
Qwen2.5-VL + D-HSM (20+4)7B79.062.858.566.8
Qwen2.5-VL + D-HSM (20+8)7B79.058.559.265.6
Qwen3-VL + D-HSM (20+4)8B81.661.353.865.6
Qwen3-VL + D-HSM (20+8)8B79.561.154.765.1

D-HSM adapts its evidence use — leaning on recent frames for current-state questions while retrieving history for backward / temporal ones. Highlighted values are best among the non-human entries shown.

Offline long-video understanding
ModelSizeLongVideoBenchMLVUVideoMME
Proprietary
GPT-4o66.764.671.9
Gemini 1.5 Pro64.075.0
Open-source online
Streamforest7B69.661.9
TimeChatOnline7B57.765.462.5
D-HSM (Qwen2.5-VL)7B60.767.363.9

D-HSM with Qwen2.5-VL and 4 recent frames. Highlighted values are best among the open-source online models shown, not against the proprietary rows. Beyond streaming, the hub-and-spoke memory is an effective compact representation for long-range offline evidence.

Citation

BibTeX

@inproceedings{jiang_dhsm,
  title     = {Dynamic Hub-and-Spoke Memory for Streaming Video Understanding},
  author    = {Jiang, Xinru and Zhao, Lin and Xiao, Xi and Zhang, Yunbei and
               Wang, Janet and Ma, Chenrui and Li, Haolin and Wang, Yanzhi and
               Gong, Yifan and Camps, Octavia},
  booktitle = {},
  year      = {},
  url       = {https://oshikaka.github.io/DHSM/}
}

Venue and year to be filled in once the camera-ready details are final.