Compressed Map Priors for 3D Perception

Brady Zhou, Philipp Krähenbühl
12/31/2025
cs.CV

No confident code implementation found for this paper.

Abstract

Human drivers rarely travel where no person has gone before. After all, thousands of drivers use busy city roads every day, and only one can claim to be the first. The same holds for autonomous computer vision systems. The vast majority of the deployment area of an autonomous vision system will have been visited before. Yet, most autonomous vehicle vision systems act as if they are encountering each location for the first time. In this work, we present Compressed Map Priors (CMP), a simple but effective framework to learn spatial priors from historic traversals. The map priors use a binarized hashmap that requires only $32\text{KB}/\text{km}^2$, a $20\times$ reduction compared to the dense storage. Compressed Map Priors easily integrate into leading 3D perception systems at little to no extra computational costs, and lead to a significant and consistent improvement in 3D object detection on the nuScenes dataset across several architectures.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zhou2025compressed,
  title  = {Compressed Map Priors for 3D Perception},
  author = {Brady Zhou and Philipp Krähenbühl},
  year   = {2025},
  eprint = {2601.00139},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.00139v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.00139.svg)](https://codeofpaper.com/paper/2601.00139)

Discussion