Tetris: Tile-level Sampling for Efficient and High-Fidelity Video Object Tracking
Not on the map. Why?
Abstract (arXiv)
Track materialization converts raw videos into reusable object tracks that downstream queries can run against without rerunning tracking, but extracting those tracks efficiently and with high fidelity remains expensive. Prior systems reduce track materialization cost through temporal frame sampling, but aggressive sampling spaces each track's detection points too far apart to faithfully capture the object's actual trajectory. In stationary video, however, large portions of each frame contain no objects of interest, and different sampling rates can be used to extract tracks from the remaining regions. Leveraging this idea, we present Tetris, a track-extraction system that decomposes videos into a tile-based polyomino data model, enabling fine-grained spatiotemporal pruning that reduces detector calls with minimal fidelity loss. Tetris implements track materialization in three steps: first, a classifier identifies relevant tiles and groups them into polyominoes. Then, we use an integer linear program (ILP) to prune redundant polyominoes under a user-specified accuracy constraint, before packing the remaining polyominoes into canvases to minimize detector calls. Across 7 stationary-video datasets, Tetris stays within a 5% tracking accuracy loss as compared to a reference pipeline that processes every frame in its entirety, while prior systems exceed this bound on 3 of the 7 datasets. Moreover, with this 5% bound, Tetris achieves up to 17.4x higher throughput than prior systems, and up to 68.8x higher than the reference pipeline. Conversely, Tetris delivers up to 0.42 higher HOTA tracking accuracy than the best prior system at matched throughput. The project page is at https://tetris-db.github.io .
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 10 of its 39 references that are in the map. First posted on arXiv 25 May 2026.
Builds on
10 of 39 references.
References · 10
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
- 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,852
- 2018ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Designcited by 1,136
- 2017Simple Online and Realtime Tracking with a Deep Association Metriccited by 910
- 2016Simple Online and Realtime Trackingcited by 868
- 2020HOTA: A Higher Order Metric for Evaluating Multi-Object Trackingcited by 552
- 2022Observation-Centric SORT: Rethinking SORT for Robust Multi-Object Trackingcited by 346
- 2018Deep Cosine Metric Learning for Person Re-Identificationcited by 73
- 2024What is YOLOv5: A deep look into the internal features of the popular object detectorcited by 37
- 2022Decentralized Vehicle Coordination: The Berkeley DeepDrive Drone Dataset and Consensus-Based Modelscited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.