MapTCL: Temporal Consistency Learning via Bidirectional Alignment for Vectorized HD Map Construction

Dongsuk Kum; Hiwon Shin; Hyeonjun Jeong; Hyeonseo Kim; Juyeb Shin

REVIEW 4 major objections 4 minor 30 references

MapTCL: Temporal Consistency Learning via Bidirectional Alignment for Vectorized HD Map Construction

T0 review · 4 major / 4 minor · reviewed 2026-08-08 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Adding bidirectional temporal-consistency losses between matched high-confidence map instances across frames improves both accuracy and temporal stability of online HD map construction, without adding inference cost.

desk verdict Genuinely new bidirectional vector consistency loss for HD map training; consistent gains reported, but forced matching and single-run evidence leave the causal claim unproven. read the letter →

arxiv 2608.05209 v1 pith:KYG2ZK2T submitted 2026-08-05 cs.CV

Hyeonseo Kim , Juyeb Shin , Hyeonjun Jeong , Hiwon Shin , Dongsuk Kum This is my paper · ORCID

classification cs.CV

keywords onlineHDmapconstructiontemporalconsistencyvectorizedbidirectionalalignmentauxiliarytraininglossBEVperceptionautonomousdriving

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Online HD map construction from onboard cameras usually trains each frame against ground truth independently, so the same physical lane divider or road boundary can jitter, flicker, or vanish between consecutive frames. This paper proposes MapTCL, a plug-and-play auxiliary training strategy that adds two temporal consistency losses: Bidirectional Vector Consistency Learning (BVCL), which matches high-confidence vector instances from past and current frames after ego-motion warping and penalizes their geometric and class differences, and Raster map Consistency Learning (RCL), which penalizes differences between dense BEV raster maps. The claim is that this explicit cross-frame objective improves both single-frame accuracy and temporal stability for existing HD map models, without adding any inference cost. The paper reports consistent gains across three baselines on nuScenes and Argoverse2, including +3.7 mAP and +2.8 C-mAP on nuScenes for StreamMapNet. A sympathetic reader would care because the fix is training-only and can be dropped into any existing model.

What carries the argument

The load-bearing mechanism is Bidirectional Temporal Matching (BTM), a two-stage matching procedure: it filters predicted vector instances to those with confidence above $\tau$, warps them into the other frame's coordinate system using ego motion, solves instance-level assignment with the Hungarian algorithm, then solves point-level assignment within each matched pair, and repeats the process in the reverse direction. The matched pairs feed two loss terms, a SmoothL1 positional loss and a KL-divergence class loss, with temporal weights that decay for older frames. RCL is the second mechanism: a segmentation head produces a binary raster map, supervised against a rasterized ground truth, and a mask Focal loss between the current raster map and warped historical raster maps stabilizes dense BEV features. Both auxiliary losses are added to the total loss and applied only in later training stages, which the paper argues avoids propagating early false positives.

What would settle it

Train the same model with BVCL applied to instances taken from different scenes (so the matched pairs are guaranteed not to be the same physical elements); if mAP and C-mAP gains persist, the temporal-correspondence assumption is not what drives the reported improvements.

Watch

Extended reading notes

Core claim

On its own terms, the paper's central claim is that per-frame ground-truth supervision leaves a measurable gap: temporal fusion architectures such as StreamMapNet, SQD-MapNet, and MapTracker still lack an explicit objective that penalizes geometric noise and temporal jitter between consecutive predicted maps. MapTCL closes this gap with two auxiliary losses. BVCL selects instances with confidence above a threshold, warps them across frames using ego motion, performs Hungarian-based instance- and point-level matching in both forward and backward directions, and minimizes SmoothL1 point differences plus KL-divergence on class distributions. RCL generates a binary BEV raster map through a segmentation head and minimizes mask Focal loss between the current raster map and warped past raster maps. Trained jointly with the standard map loss, these losses are reported to improve mAP and C-mAP across all tested baselines on both benchmarks while leaving inference FPS unchanged, since the module is removed at inference time.

Load-bearing premise

High-confidence predicted instances in past and current frames, after ego-motion warping and Hungarian matching, actually correspond to the same physical map elements; if warping is inaccurate or false positives pass the confidence filter, the consistency loss rewards the model for agreeing with its own mistakes.

Editorial extensions

If this is right

Existing vectorized HD map models can adopt MapTCL as a training-only plug-in, improving accuracy and temporal stability with no change to inference latency or memory footprint.
Temporal consistency can be enforced at the prediction level without recurrent feature fusion, making the benefit complementary to architectural temporal fusion and applicable to models that do not fuse features.
The confidence-filtered bidirectional matching acts as a self-supervision signal across frames, potentially reducing the need for temporally annotated ground truth.
Memory length matters: the paper's ablation shows performance peaks at $N_t=5$ and degrades at $N_t=7$, indicating that the optimal temporal context is a hyperparameter to tune.
The reported gains on two datasets and three baselines suggest the improvement transfers across model designs and perception ranges.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Editorial: the same prediction-level temporal consistency objective could be applied to other streaming perception outputs, such as online lane detection or BEV segmentation, which suffer from the same frame-to-frame jitter.
Editorial: because the confidence filter creates a curriculum that only later-stage predictions participate in, MapTCL could be combined with pseudo-labeling on unlabeled temporal sequences, an extension the paper does not explore.
Editorial: the C-mAP gains are smaller and less consistent than mAP gains in some rows of the tables; a reader should treat the temporal-stability claim as scene-dependent and in need of a dedicated temporal benchmark.
Editorial: a direct testable prediction is that BVCL's contribution shrinks as ego-motion estimates become noisier, since warping errors corrupt the matching; the paper does not quantify this sensitivity.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

MapTCL is a clean, useful training-time addition to vectorized HD map models. The genuinely new piece is bidirectional vector-level matching between current and past predictions; DTCLMapper, the closest prior work, uses contrastive learning and a raster occupancy loss rather than forward-backward vector alignment. The paper reports consistent gains across StreamMapNet, SQD-MapNet, and MapTracker on nuScenes and Argoverse2, with mAP improvements up to +3.7 and C-mAP up to +6.2, all at zero inference cost. That is a real contribution if it checks out.

The authors do solid empirical work: component ablations, memory size, confidence threshold, long-range and occlusion scenarios. They also acknowledge hyperparameter sensitivity, particularly the temporal context length. The methodology is clearly described.

The soft spots are real. The main one is the forced Hungarian matching in Eq. 1: every high-confidence past instance is matched to some current instance, with no unmatched or rejection option. False positives and temporarily occluded elements are therefore dragged toward the nearest current prediction, and the loss can reward agreeing with its own mistakes. The confidence threshold of 0.3 is permissive, and applying MapTCL only in later training stages is an implicit admission that early predictions are too noisy. The paper never measures matching quality, e.g., by comparing assigned pairs against ground-truth correspondences. This concern lands on reading the paper and is the thing I'd most want addressed.

The other weaknesses are methodological: single-run results without error bars, hyperparameters selected on the same validation sets used for final comparisons, and no released code or checkpoints. Also, the C-mAP metric measures exactly what BVCL optimizes, so those gains are partly by construction; the mAP gains are less directly optimized and carry the argument.

The central claim is plausible but not yet proven. I'd send this to a serious referee. The idea is solid, the experiments are extensive, and the limitations are disclosed. What's missing is independent reproduction, variance estimates, and a sanity check on the matching quality.

This paper is for researchers working on temporal consistency in online HD mapping. I'd bring it to a reading group, but I wouldn't cite it as evidence until the results are reproduced or artifacts are released.

Referee Report

4 major / 4 minor

Summary. The paper proposes MapTCL, an auxiliary training strategy for online vectorized HD map construction. It adds two temporal-consistency losses to a per-frame supervised baseline: Bidirectional Vector Consistency Learning (BVCL), which warps high-confidence vector instances across frames, matches them with Hungarian assignment, and penalizes geometric and semantic discrepancies; and Raster map Consistency Learning (RCL), which adds BEV segmentation supervision plus a raster-level consistency loss between current and past predicted maps. The auxiliary modules are removed at inference. Experiments on nuScenes and Argoverse 2 with StreamMapNet, SQD-MapNet, and MapTracker report consistent mAP and C-mAP gains, including +3.7 mAP and +2.8 C-mAP on the nuScenes newsplit, with unchanged FPS.

Significance. If the empirical claims hold, the contribution is practically useful: a training-only regularizer that improves both accuracy and temporal stability across several baselines and two benchmarks, with no additional inference overhead, would be an attractive plug-in for HD-map systems. The paper's strengths include the breadth of the experimental matrix, the long-range and occlusion analyses, and the explicit adoption of the C-mAP temporal-consistency metric. The main caveats are that (i) the C-mAP gains are partly expected by construction, since BVCL and RCL directly minimize cross-frame prediction differences; (ii) the headline numbers appear to come from single runs with hyperparameters tuned on the same validation sets used for final comparison; and (iii) the forced Hungarian matching in BVCL can pair false positives or occluded elements with unrelated instances, making the consistency signal potentially self-confirming. The mAP gains, if reproducible, would constitute a meaningful result, but the current evidence is not yet sufficient to support the strong 'consistently enhances' claim.

major comments (4)

[Section III-C, Eqs. (1)-(3)] The matching in Eqs. (1)-(3) is forced: every selected high-confidence instance must be paired with some instance in the other frame, because there is no unmatched category or rejection threshold. Under the low confidence threshold tau=0.3, false positives and map elements that are temporarily occluded will be paired with the nearest current instance and dragged toward the past geometry/class by L_BVCL, and the backward pass does the same in reverse. The paper's own decision to apply MapTCL only in later training stages (Sec. IV-A) and the degraded results at tau=0.1 in Table VII confirm that low-confidence predictions are unreliable. This makes the central mechanism vulnerable to self-confirmation: the loss can improve by making the model agree with its own false positives. Please provide an oracle check of matching quality against ground-truth instance associations, or add a cost-threshold/unmatched option, and report results under pose noise as in the MapTracker setting.
[Section IV-A, IV-C, Tables I-III] The key hyperparameters (tau, N_t, w_n, u_n, alpha_n, lambda_1-lambda_3, beta) are tuned by ablations on the same validation sets that are then used for the final comparisons (Tables VI and VII), and the manuscript gives no multi-seed statistics or error bars. The statement after Table II that the large C-mAP gain on the old split 'may also be affected by hyperparameter settings' is an explicit limitation of the same kind, and the Conclusion similarly notes sensitivity to temporal context length. With no held-out validation for hyperparameter selection, no multiple seeds, and no released code or checkpoints, the claim that MapTCL 'consistently enhances' baselines is not yet statistically supported. Please add at least three seeds with mean and standard deviation for the main tables, or fix hyperparameters on a separate split before evaluating the final comparisons.
[Section IV-B, Eqs. (5)-(12)] The C-mAP gains should not be presented as independent evidence of a temporal-stability benefit. C-mAP is designed to measure temporal consistency, and L_BVCL and L_RCL explicitly minimize cross-frame geometric and semantic discrepancies of predictions, so an increase in C-mAP is expected when these losses are added. The mAP improvements are the more decisive evidence that the regularizer helps beyond optimizing the evaluation metric itself. Please report an additional temporal metric not directly aligned with the training objective (for example, instance-level tracking stability or a flicker-rate measure) and clearly distinguish 'improves C-mAP by construction' from 'improves temporal consistency.'
[Section III-C, III-E, Eqs. (1) and (6)] The exact objective is under-specified. In Eq. (1), pi is described as a permutation of the K selected past instances, but the sum runs over current indices i=1..K while the current map has N instances; Eq. (6) uses gamma_i(j) without defining how the point-level assignment is obtained per matched instance; and Sec. III-E says the backward losses are computed by 'warping the current HD map instance to the current frame,' which appears to be a typo for warping to the past coordinate frame. These ambiguities matter because the Hungarian matching is the core of BVCL. Please rewrite the matching and loss definitions with explicit index sets, coordinate frames, and the distinction between the N predicted instances and the K selected high-confidence instances.

minor comments (4)

[Table V] The component-ablation table is difficult to read because the check marks are not clearly aligned with the column headers in the text; please reformat so that each row's combination of VCL, BVCL, SL, and RCL is unambiguous.
[Section III-B and Eq. (2)] The class matching cost L_cls is called an L1 distance between class distributions; please specify whether it is applied to probability vectors or logits and whether it is summed over classes.
[Section IV-A] The sentence 'Both datasets follow the standard 700/150/150 train/val/test split' is stated for the original splits, but the paper mainly evaluates on non-overlapping splits; please clarify the sizes of the newsplit sets as well.
[Related Work, Sec. IV-B] DTCLMapper is a closely related temporal-consistency method, but it appears only in the old-split tables; please add a direct comparison under the same single-frame fusion setting, or state explicitly why such a comparison is not possible.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: MapTCL is an explicit auxiliary loss, and the reported gains are empirical rather than derived from the loss by construction.

full rationale

MapTCL introduces two auxiliary losses, L_BVCL and L_RCL, as explicit training objectives. The paper does not claim to derive mAP or C-mAP improvements from the loss equations; it reports experimental results on nuScenes and Argoverse2. The C-mAP metric measures temporal consistency, which is conceptually related to what the losses optimize, but the paper nowhere reduces a predicted gain to the loss definition; the losses are not fitted to C-mAP, and the mAP gains (which are not optimized by the auxiliary losses) provide independent support. The forced Hungarian matching without an unmatched option (Eq. 1) is a potential robustness concern about false-positive correspondences, but it is not a circularity: the loss is still a genuine auxiliary objective, not a renaming of the evaluation metric. Self-citations (Refs. [1], [10], [12]) appear only as related work and do not carry the argument. No uniqueness theorem, ansatz-by-citation, or fitted-input-as-prediction pattern is present. Hence no significant circularity.

Assumptions & free parameters 5 free parameters · 4 assumptions · 0 invented entities

The method's central claim rests on several domain assumptions: static map elements, accurate ego poses, and correct instance matching. It also depends on validation-tuned hyperparameters: tau, N_t, and temporal weights. No new physical entities are introduced.

free parameters (5)

Confidence threshold tau = 0.3
Ablation Table VII shows best at 0.3; selected on the validation set.
Memory length N_t = 5
Ablation Table VI shows best at 5; larger N_t degrades performance.
Temporal weights w_1 to w_5 = [9, 7, 5, 3, 1]
Weights for positional consistency, set by hand to emphasize recent frames.
Temporal weights u_1 to u_5 and alpha_1 to alpha_5 = [1.0, 0.7, 0.5, 0.3, 0.1]
Weights for semantic and raster consistency, set by hand.
Loss weights lambda_1, lambda_2, lambda_3, beta = 50.0, 5.0, 0.1, 1.0
Loss balance hyperparameters adapted from the StreamMapNet baseline; not justified by ablation.

assumptions (4)

standard math Hungarian bipartite matching returns an optimal and meaningful correspondence between warped past and current instances.
Used in Equations 1 to 3 to establish instance and point correspondences; a standard algorithm with no controversy.
domain assumption Ego poses provided by nuScenes and Argoverse 2 are accurate enough for warping past predictions into the current frame.
Section IV-A notes that StreamMapNet and SQD-MapNet assume accurate ego poses; if poses are noisy, the bidirectional alignment is misaligned.
domain assumption The same physical map element is expected to be geometrically and semantically identical across frames after ego-motion warping.
BVCL penalizes differences between matched past and current instances, which is only valid for static map elements; no moving-object filter is applied to vector instances.
ad hoc to paper High-confidence predictions selected by the tau threshold are correct enough to serve as training targets.
Section IV-A applies MapTCL only in later training stages to avoid error propagation, acknowledging that this assumption is fragile early in training.

how reviews work

0 comments

Cite this review

Pith. "Pith review of MapTCL: Temporal Consistency Learning via Bidirectional Alignment for Vectorized HD Map Construction." pith.science (2026). https://pith.science/paper/KYG2ZK2T

@misc{pith2026260805209,
  author       = {Pith},
  title        = {Pith review of: MapTCL: Temporal Consistency Learning via Bidirectional Alignment for Vectorized HD Map Construction},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KYG2ZK2T}},
  note         = {Machine review of arXiv:2608.05209}
}

read the original abstract

Constructing reliable online HD maps remains challenging in dynamic urban environments due to moving objects and occlusions. While recent works employ feature-level temporal fusion to address this, they rely solely on per-frame ground truth supervision. Consequently, they lack an explicit objective to directly penalize the geometric noise and temporal jitter between consecutive online HD maps. To address this, we propose MapTCL, an auxiliary training strategy that formulates temporal consistency loss between current and past frames via bidirectional alignment. Specifically, Bidirectional Vector Consistency Learning (BVCL) models the geometric and semantic discrepancies between associated past and current vector instances as an auxiliary loss. We also employ Raster map Consistency Learning (RCL) as an additional loss to stabilize dense BEV features. By jointly training with these dual losses, MapTCL improves the temporal stability of generated HD maps. Extensive experiments on two standard benchmarks demonstrate the effectiveness of our approach. As a versatile plug-and-play module, MapTCL consistently enhances existing baseline models, achieving gains of +3.7 mAP & +2.8 C-mAP on nuScenes and +3.1 mAP & +2.5 C-mAP on Argoverse 2 without additional inference overhead.

Figures

Figures reproduced from arXiv: 2608.05209 by the authors.

**Figure 2.** Overall pipeline of MapTCL. The pipeline takes multi-view images as input, encodes them into BEV features, and employs a map decoder to [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗

**Figure 3.** Bidirectional Temporal Matching mechanism. High-confidence [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗

Figures from the paper (2 more)

**Figure 4.** Figure 4: Qualitative comparisons on newsplit of nuScenes validation within [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]

**Figure 5.** Figure 5: Qualitative comparisons on newsplit of Argoverse2 validation within [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

30 extracted references · 17 canonical work pages

[1]

Multi-modal place recognition via vectorized hd maps and images fusion for autonomous driving,

H. Jeong, J. Shin, F. Rameau, and D. Kum, “Multi-modal place recognition via vectorized hd maps and images fusion for autonomous driving,”IEEE Robotics and Automation Letters, 2024

work page 2024
[2]

A survey on map-based localization techniques for autonomous vehicles,

A. Chalvatzaras, I. Pratikakis, and A. A. Amanatiadis, “A survey on map-based localization techniques for autonomous vehicles,”IEEE Transactions on intelligent vehicles, vol. 8, no. 2, pp. 1574–1596, 2022

2022
[3]

Mp3: A unified model to map, perceive, predict and plan,

S. Casas, A. Sadat, and R. Urtasun, “Mp3: A unified model to map, perceive, predict and plan,” inProceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 14403– 14412, 2021

work page 2021
[4]

Vad: Vectorized scene representation for efficient autonomous driving,

B. Jiang, S. Chen, Q. Xu, B. Liao, J. Chen, H. Zhou, Q. Zhang, W. Liu, C. Huang, and X. Wang, “Vad: Vectorized scene representation for efficient autonomous driving,” inProceedings of the IEEE/CVF International Conference on Computer Vision, pp. 8340–8350, 2023

work page 2023
[5]

Loam: Lidar odometry and mapping in real- time.,

J. Zhang, S. Singh,et al., “Loam: Lidar odometry and mapping in real- time.,” inRobotics: Science and systems, vol. 2, pp. 1–9, Berkeley, CA, 2014

2014
[6]

Lego-loam: Lightweight and ground- optimized lidar odometry and mapping on variable terrain,

T. Shan and B. Englot, “Lego-loam: Lightweight and ground- optimized lidar odometry and mapping on variable terrain,” in2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 4758–4765, IEEE, 2018

work page 2018
[7]

Hdmapnet: An online hd map construction and evaluation framework,

Q. Li, Y . Wang, Y . Wang, and H. Zhao, “Hdmapnet: An online hd map construction and evaluation framework,” in2022 International Conference on Robotics and Automation (ICRA), pp. 4628–4634, IEEE, 2022

work page 2022
[8]

Vectormapnet: End-to-end vectorized hd map learning,

Y . Liu, T. Yuan, Y . Wang, Y . Wang, and H. Zhao, “Vectormapnet: End-to-end vectorized hd map learning,” inInternational Conference on Machine Learning, pp. 22352–22369, PMLR, 2023

2023

Show all 30 references

[9]

Maptr: Structured modeling and learning for online vectorized hd map construction,

B. Liao, S. Chen, X. Wang, T. Cheng, Q. Zhang, W. Liu, and C. Huang, “Maptr: Structured modeling and learning for online vectorized hd map construction,”arXiv preprint arXiv:2208.14437, 2022

2022 arXiv
[10]

Instagram: Instance-level graph modeling for vectorized hd map learning,

J. Shin, H. Jeong, F. Rameau, and D. Kum, “Instagram: Instance-level graph modeling for vectorized hd map learning,”IEEE Transactions on Intelligent Transportation Systems, 2025

2025
[11]

Maptrv2: An end-to-end framework for online vectorized hd map construction,

B. Liao, S. Chen, Y . Zhang, B. Jiang, Q. Zhang, W. Liu, C. Huang, and X. Wang, “Maptrv2: An end-to-end framework for online vectorized hd map construction,”International Journal of Computer Vision, pp. 1–23, 2024

2024
[12]

Mask2map: Vectorized hd map construction using bird’s eye view segmentation masks,

S. Choi, J. Kim, H. Shin, and J. W. Choi, “Mask2map: Vectorized hd map construction using bird’s eye view segmentation masks,” in European Conference on Computer Vision, pp. 19–36, Springer, 2024

2024
[13]

Streammapnet: Streaming mapping network for vectorized online hd map construc- tion,

T. Yuan, Y . Liu, Y . Wang, Y . Wang, and H. Zhao, “Streammapnet: Streaming mapping network for vectorized online hd map construc- tion,” inProceedings of the IEEE/CVF Winter Conference on Appli- cations of Computer Vision, pp. 7356–7365, 2024

2024
[14]

Stream query denoising for vectorized hd-map construction,

S. Wang, F. Jia, W. Mao, Y . Liu, Y . Zhao, Z. Chen, T. Wang, C. Zhang, X. Zhang, and F. Zhao, “Stream query denoising for vectorized hd-map construction,” inEuropean Conference on Computer Vision, pp. 203– 220, Springer, 2024

2024
[15]

Maptracker: Track- ing with strided memory fusion for consistent vector hd mapping,

J. Chen, Y . Wu, J. Tan, H. Ma, and Y . Furukawa, “Maptracker: Track- ing with strided memory fusion for consistent vector hd mapping,” inEuropean Conference on Computer Vision, pp. 90–107, Springer, 2024

2024
[16]

Unveiling the hidden: Online vectorized hd map construction with clip-level token interaction and propagation,

N. Kim, H. Seong, D. Ji, and S. Jang, “Unveiling the hidden: Online vectorized hd map construction with clip-level token interaction and propagation,”Advances in Neural Information Processing Systems, vol. 37, pp. 111358–111381, 2025

2025
[17]

nuscenes: A multimodal dataset for autonomous driving,

H. Caesar, V . Bankiti, A. H. Lang, S. V ora, V . E. Liong, Q. Xu, A. Krishnan, Y . Pan, G. Baldan, and O. Beijbom, “nuscenes: A multimodal dataset for autonomous driving,” inProceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp. 11621–11631, 2020

2020
[18]

Argoverse 2: Next generation datasets for self-driving perception and forecasting,

B. Wilson, W. Qi, T. Agarwal, J. Lambert, J. Singh, S. Khandelwal, B. Pan, R. Kumar, A. Hartnett, J. K. Pontes,et al., “Argoverse 2: Next generation datasets for self-driving perception and forecasting,”arXiv preprint arXiv:2301.00493, 2023

2023 arXiv
[19]

End-to-end object detection with transformers,

N. Carion, F. Massa, G. Synnaeve, N. Usunier, A. Kirillov, and S. Zagoruyko, “End-to-end object detection with transformers,” in European conference on computer vision, pp. 213–229, Springer, 2020

2020
[20]

Leveraging enhanced queries of point sets for vectorized map construction,

Z. Liu, X. Zhang, G. Liu, J. Zhao, and N. Xu, “Leveraging enhanced queries of point sets for vectorized map construction,” inEuropean Conference on Computer Vision, pp. 461–477, Springer, 2024

2024
[21]

Motr: End-to-end multiple-object tracking with transformer,

F. Zeng, B. Dong, Y . Zhang, T. Wang, X. Zhang, and Y . Wei, “Motr: End-to-end multiple-object tracking with transformer,” inEuropean conference on computer vision, pp. 659–675, Springer, 2022

2022
[22]

Dn- detr: Accelerate detr training by introducing query denoising,

F. Li, H. Zhang, S. Liu, J. Guo, L. M. Ni, and L. Zhang, “Dn- detr: Accelerate detr training by introducing query denoising,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp. 13619–13627, 2022

2022
[23]

Dtclmapper: Dual temporal consistent learning for vectorized hd map construction,

S. Li, J. Lin, H. Shi, J. Zhang, S. Wang, Y . Yao, Z. Li, and K. Yang, “Dtclmapper: Dual temporal consistent learning for vectorized hd map construction,”IEEE Transactions on Intelligent Transportation Systems, 2024

2024
[24]

Bev- former: learning bird’s-eye-view representation from lidar-camera via spatiotemporal transformers,

Z. Li, W. Wang, H. Li, E. Xie, C. Sima, T. Lu, Q. Yu, and J. Dai, “Bev- former: learning bird’s-eye-view representation from lidar-camera via spatiotemporal transformers,”IEEE Transactions on Pattern Analysis and Machine Intelligence, 2024

2024
[25]

Just go with the flow: Self- supervised scene flow estimation,

H. Mittal, B. Okorn, and D. Held, “Just go with the flow: Self- supervised scene flow estimation,” inProceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp. 11177– 11185, 2020

2020
[26]

The hungarian method for the assignment problem,

H. W. Kuhn, “The hungarian method for the assignment problem,” Naval research logistics quarterly, vol. 2, no. 1-2, pp. 83–97, 1955

1955
[27]

An un- supervised temporal consistency (tc) loss to improve the performance of semantic segmentation networks,

S. Varghese, S. Gujamagadi, M. Klingner, N. Kapoor, A. Bar, J. D. Schneider, K. Maag, P. Schlicht, F. Huger, and T. Fingscheidt, “An un- supervised temporal consistency (tc) loss to improve the performance of semantic segmentation networks,” inProceedings of the IEEE/CVF Confe...

2021
[28]

Deep video matting via spatio-temporal alignment and aggregation,

Y . Sun, G. Wang, Q. Gu, C.-K. Tang, and Y .-W. Tai, “Deep video matting via spatio-temporal alignment and aggregation,” inProceed- ings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 6975–6984, 2021

2021
[29]

Focal loss for dense object detection,

T.-Y . Lin, P. Goyal, R. Girshick, K. He, and P. Doll ´ar, “Focal loss for dense object detection,” inProceedings of the IEEE international conference on computer vision, pp. 2980–2988, 2017

2017
[30]

Fixing weight decay regularization in adam,

I. Loshchilov, F. Hutter,et al., “Fixing weight decay regularization in adam,”arXiv preprint arXiv:1711.05101, vol. 5, p. 5, 2017

2017 arXiv

Pith tools

Reviewed August 8, 2026 · model on record in the stance chip above.

[1] [1]

Multi-modal place recognition via vectorized hd maps and images fusion for autonomous driving,

H. Jeong, J. Shin, F. Rameau, and D. Kum, “Multi-modal place recognition via vectorized hd maps and images fusion for autonomous driving,”IEEE Robotics and Automation Letters, 2024

work page 2024

[2] [2]

A survey on map-based localization techniques for autonomous vehicles,

A. Chalvatzaras, I. Pratikakis, and A. A. Amanatiadis, “A survey on map-based localization techniques for autonomous vehicles,”IEEE Transactions on intelligent vehicles, vol. 8, no. 2, pp. 1574–1596, 2022

2022

[3] [3]

Mp3: A unified model to map, perceive, predict and plan,

S. Casas, A. Sadat, and R. Urtasun, “Mp3: A unified model to map, perceive, predict and plan,” inProceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 14403– 14412, 2021

work page 2021

[4] [4]

Vad: Vectorized scene representation for efficient autonomous driving,

B. Jiang, S. Chen, Q. Xu, B. Liao, J. Chen, H. Zhou, Q. Zhang, W. Liu, C. Huang, and X. Wang, “Vad: Vectorized scene representation for efficient autonomous driving,” inProceedings of the IEEE/CVF International Conference on Computer Vision, pp. 8340–8350, 2023

work page 2023

[5] [5]

Loam: Lidar odometry and mapping in real- time.,

J. Zhang, S. Singh,et al., “Loam: Lidar odometry and mapping in real- time.,” inRobotics: Science and systems, vol. 2, pp. 1–9, Berkeley, CA, 2014

2014

[6] [6]

Lego-loam: Lightweight and ground- optimized lidar odometry and mapping on variable terrain,

T. Shan and B. Englot, “Lego-loam: Lightweight and ground- optimized lidar odometry and mapping on variable terrain,” in2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 4758–4765, IEEE, 2018

work page 2018

[7] [7]

Hdmapnet: An online hd map construction and evaluation framework,

Q. Li, Y . Wang, Y . Wang, and H. Zhao, “Hdmapnet: An online hd map construction and evaluation framework,” in2022 International Conference on Robotics and Automation (ICRA), pp. 4628–4634, IEEE, 2022

work page 2022

[8] [8]

Vectormapnet: End-to-end vectorized hd map learning,

Y . Liu, T. Yuan, Y . Wang, Y . Wang, and H. Zhao, “Vectormapnet: End-to-end vectorized hd map learning,” inInternational Conference on Machine Learning, pp. 22352–22369, PMLR, 2023

2023