Pith. sign in

REVIEW 1 cited by

MapExpert: Online HD Map Construction with Simple and Efficient Sparse Map Element Expert

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

arxiv 2412.12704 v1 pith:2HTOVON2 submitted 2024-12-17 cs.CV

classification cs.CV
keywords mapexpertelementsonlineefficientexpertsfusionintroducemethods
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Constructing online High-Definition (HD) maps is crucial for the static environment perception of autonomous driving systems (ADS). Existing solutions typically attempt to detect vectorized HD map elements with unified models; however, these methods often overlook the distinct characteristics of different non-cubic map elements, making accurate distinction challenging. To address these issues, we introduce an expert-based online HD map method, termed MapExpert. MapExpert utilizes sparse experts, distributed by our routers, to describe various non-cubic map elements accurately. Additionally, we propose an auxiliary balance loss function to distribute the load evenly across experts. Furthermore, we theoretically analyze the limitations of prevalent bird's-eye view (BEV) feature temporal fusion methods and introduce an efficient temporal fusion module called Learnable Weighted Moving Descentage. This module effectively integrates relevant historical information into the final BEV features. Combined with an enhanced slice head branch, the proposed MapExpert achieves state-of-the-art performance and maintains good efficiency on both nuScenes and Argoverse2 datasets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Conditional Latent Coding with Learnable Synthesized Reference for Deep Image Compression

    cs.CV 2025-02 conditional novelty 5.0 of 10

    Conditional Latent Coding compresses images by synthesizing a per-image reference latent from a learned feature dictionary, improving low-bitrate rate-distortion over TCM, VTM, and BPG.

Pith tools