REVIEW 1 cited by
VMA: Divide-and-Conquer Vectorized Map Annotation System for Large-Scale Driving Scene
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
VMA: Divide-and-Conquer Vectorized Map Annotation System for Large-Scale Driving Scene
read the original abstract
High-definition (HD) map serves as the essential infrastructure of autonomous driving. In this work, we build up a systematic vectorized map annotation framework (termed VMA) for efficiently generating HD map of large-scale driving scene. We design a divide-and-conquer annotation scheme to solve the spatial extensibility problem of HD map generation, and abstract map elements with a variety of geometric patterns as unified point sequence representation, which can be extended to most map elements in the driving scene. VMA is highly efficient and extensible, requiring negligible human effort, and flexible in terms of spatial scale and element type. We quantitatively and qualitatively validate the annotation performance on real-world urban and highway scenes, as well as NYC Planimetric Database. VMA can significantly improve map generation efficiency and require little human effort. On average VMA takes 160min for annotating a scene with a range of hundreds of meters, and reduces 52.3% of the human cost, showing great application value. Code: https://github.com/hustvl/VMA.
Forward citations
Cited by 1 Pith paper
-
OptiMVMap: Offline Vectorized Map Construction via Optimal Multi-vehicle Perspectives
OptiMVMap selects optimal helper vehicles and applies cross-vehicle attention with noise filtering to fuse multi-vehicle views, improving vectorized map accuracy by over 10 mAP on nuScenes compared to MapTRv2.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.