/ Paper arXiv 2611.06455
In short
In shortReport a mistake
Key numbers
From the paperCopied from the abstract, not written by AI.
Abstract
From the paperThe authors' own words.
Analytics on video archives are bottlenecked by decoding. In a dense pipeline that runs a detector on every frame, decoding is a small fraction of the runtime, but once the detector is restricted to selected frames, decoding takes over as the main cost. We introduce CoDecide, a retrospective analytics system that only decodes the frames where new content appears, using signals from the compressed bitstream to find them. Motion tells us something is moving, but not whether it is new to the scene or has been there the whole time. To make that distinction, we supervise a lightweight compressed-domain student on a label-free novelty signal from a frozen DINOv2 teacher, which fires on semantically new regions rather than on any motion. Consequently, the student model generalizes to new camera deployments without requiring per-camera retraining. At inference, it decides which frames to decode and which regions to reconstruct. Detections from the decoded frames are propagated to the skipped frames using motion vectors. We evaluate CoDecide with a leave-one-dataset-out protocol on VIRAT, MEVA, and ShanghaiTech. Against a dense per-frame detector, CoDecide recovers more moving-object detections than prior compressed-domain selectors at an equivalent decoding budget, outperforming even a competitor trained directly on the target camera. CoDecide runs 15 to 24x faster than a pipeline that decodes and detects every frame. Code is available at https://github.com/shristy51/CoDecide.
From the full paper
From the paperCopied from the paper itself by our code.
Reading the paper on arXiv…
Where it fits
The most cited papers it builds on, and the papers that build on it.
/ Builds on 3 most cited
- 202160.2k citedLearning Transferable Visual Models From Natural Language Supervision ↗
- 201623.8k citedImage-to-Image Translation with Conditional Adversarial Networks ↗
- 195515.6k citedThe Hungarian method for the assignment problem
/ Built on by None yet
No papers cite it yet. We check again every week.
From Semantic Scholar, updated weekly.
Try it
Code, models and demos that use this paper.
- Code:
- ★ 2 on GitHub ↗
Ask this paper
/ Ask a questionAnswers come from the full paper and name the section
/ Your notes
Select text in the abstract to highlight it or add a note. They stay in this browser.