VQ-Map: Bird's-Eye-View Map Layout Estimation in Tokenized Discrete Space via Vector Quantization

Bird's-eye-view (BEV) map layout estimation requires an accurate and full understanding of the semantics for the environmental elements around the ego car to make the results coherent and realistic. Due to the challenges posed by occlusion, unfavourable imaging conditions and low resolution, \emph{generating} the BEV semantic maps corresponding to corrupted or invalid areas in the perspective view (PV) is appealing very recently. \emph{The question is how to align the PV features with the generative models to facilitate the map estimation}. In this paper, we propose to utilize a generative model similar to the Vector Quantized-Variational AutoEncoder (VQ-VAE) to acquire prior knowledge for the high-level BEV semantics in the tokenized discrete space. Thanks to the obtained BEV tokens accompanied with a codebook embedding encapsulating the semantics for different BEV elements in the groundtruth maps, we are able to directly align the sparse backbone image features with the obtained BEV tokens from the discrete representation learning based on a specialized token decoder module, and finally generate high-quality BEV maps with the BEV codebook embedding serving as a bridge between PV and BEV. We evaluate the BEV map layout estimation performance of our model, termed VQ-Map, on both the nuScenes and Argoverse benchmarks, achieving 62.2/47.6 mean IoU for surround-view/monocular evaluation on nuScenes, as well as 73.4 IoU for monocular evaluation on Argoverse, which all set a new record for this map layout estimation task. The code and models are available on \url{https://github.com/Z1zyw/VQ-Map}.

Paper

References (44)

Scroll for more · 32 remaining

Similar papers

Peer review

Reviewer 1JdE6/10 · confidence 4/52024-06-18

Summary

To address challenges facing generating BEV maps posed by occlusion, unfavorable imaging conditions, and low resolution, this paper introduces a generative model to facilitate BEV estimation. A codebook embedding is used to encoder prior knowledge for the high-level BEV semantics in the tokenized discrete space. Compared with other methods leveraging dense features to supervise BEV maps, this paper takes this discrete semantic feature as a signal to supervise BEV tokens learned from PV views. In a word, the article is logical and clear in writing. Moreover, it has excellent results and sufficient ablation experiments.

Strengths

This paper is well-written and easy to understand. Moreover, the experimental data is rich. Both surround-view and monocular map estimation tasks are assessed. The proposed model has superior accuracy results compared to other methods. The visualization result of the BEV codebook is quite interesting.

Weaknesses

In the experiment, the parameters of the ablation method and the table were not explained clearly. In Table 4, the difference between (a), (b) and (c) is not clearly described. The specific meaning of 'Supervision' in (d) - (f) is not described, which should be added.

Questions

1. The motivation of this paper is unclear. Why do sparse features work better than dense features, or do they work better together? 2. In 3.2, the description is not clear. Does this part need supervision? If so, how do you implement the supervision method? 3. The results of Table 3 show that 8-layer and 512-dimensional are a better choice. Doubtly, compared to other methods (6-layer and 256-dimensional), the proposed method has better results due to the increased number of layers and dimensions. The comparison is somewhat unfair. Would you consider discussing this? 4. Would you consider presenting more computational complexity results like FLOPs/MACs, the number of parameters, and running time when comparing your proposed method against existing methods in the experiment tables, e.g., Table 1 and Table 2? 5. Would you consider presenting a set of visual comparisons to directly compare your proposed method against MapPrior? This can better show the advantage of your proposed solution.

Rating

6

Confidence

4

Soundness

3

Presentation

3

Contribution

2

Limitations

This paper has well analyzed the limitations and broad implications of the study.

Reviewer xhZa3/10 · confidence 5/52024-07-12

Summary

The authors propose to use a generative model similar to the Vector Quantized-Variational AutoEncoder (VQ-VAE) to obtain prior knowledge for high-level Bird’s Eye View (BEV) semantics in a tokenized discrete space. By leveraging BEV tokens and a codebook embedding that encapsulates the semantics for different BEV elements, the proposed method aligns image features with the BEV tokens obtained from discrete representation learning in a token decoder. The experiments are conducted on two benchmarks, nuScenes and Argoverse.

Strengths

+ The paper is well-written and very easy to follow. The figures are also very intuitive, significantly facilitating other researchers to follow and understand the gist. + The visualization of the proposed method helps readers understand how the proposed method works. + In fact, I quite like the tokenization idea since tokenization may be more robust against noise and geometric changes. However, tokenization may lose some information or detailed spatial information. Considering the output of this task, the output layout is much coarser than the input though. So tokenization may work well.

Weaknesses

At a glance, the proposed method achieves very good performance. In the experimental part, the proposed method outperforms the competing method. However, there are two main issues in the experiments: **The competing methods are not state-of-the-art** If we look at the reference [17] published in ICCV 2017, that is the state-of-the-art method (The same task and the same dataset). Moreover, the code of [17] is also publicly available. Comparison with reference [19] which is a generative model is not compelling. Based on the reported results of [17], the results of the proposed method are much worse than that of [17]. **The dataset split of nuScene is not right** In nuScene, there are 700 scenes for training, 150 scenes for validation and 150 scenes for testing. In this paper, (L197-198) there is no testing dataset. The authors mentioned to validate the performance of the proposed method. It is not clear whether the authors use the validation set or testing set. Moreover, how do the authors select the model weights if a validation set is not provided?

Questions

My biggest concern is the dataset split for this work. I expect the authors can explain this clearly.

Rating

3

Confidence

5

Soundness

2

Presentation

3

Contribution

2

Limitations

N/A

Reviewer rd8m6/10 · confidence 4/52024-07-17

Summary

This paper proposes to use a generative model to encode BEV semantic maps into tokenized sparse BEV representations with codebooks. Specifically, it consists a two stage training scheme. First, train a BEV generation VQ-VAE, then use the BEV Tokens as a ground truth to train the second stage network where it maps the surround view images into BEV map. The second stage reuse the first stage BEV generator. Experiments show the performance surpass the state-of-the-art by 0.2% - 3% in IoU, on average improving 2.8% IoU on nuScenes.

Strengths

+ This paper proposes a complicated pipeline to generate BEV maps, using a pre-trained VQ-VAE as a intermediate representation then trains a two stage network to firstly encode features from perspective view images into the BEV map. + The idea of using a pre-trained network as codebook seems quite interesting in the BEV map generation domain

Weaknesses

Q1. On average, is IoU a good metric for measuring the performance of BEV map? Considering the road can be a continuous structure, probably one of the most important aspect to measure the drivable area is its boundary, is this faithfully reflected in the IoU metric? Q2. I think the mean IoU increase is summing over the different settings, but not in terms of their raw pixel right? for example, in Table 1, there are 6 factors, f1 to f6, where each f is computed based on their raw pixels. Then the mean is computed by sum{f1, ..., f6} / 6. However, considering the Walkway, stopline, carpark and divider is much fewer than the drivable area, can you compute the average performance on based on normalization of their raw pixels as well? Q3 Complexity of the cost Can the authors list their methods complexity? Since it consists of two stage training and might introduce many overhead. Though it is not a big deal, but it is also interesting to the community.

Questions

as above

Rating

6

Confidence

4

Soundness

3

Presentation

3

Contribution

2

Limitations

This paper cannot handle small regions but might be very important to realistic AD environment, where holes and some random obstacles can be dangerous to the vehicle. Compared to other method that can achieve multiple task at the same time, this is a specialized method only for BEV map generation.

Reviewer 1hbx5/10 · confidence 3/52024-07-21

Summary

The paper proposes a novel approach, VQ-Map, for BEV map layout estimation, addressing the challenges of occlusion and low-resolution images in perspective views. By leveraging a VQ-VAE-like generative model, the authors introduce BEV tokens to bridge the gap between sparse image features and dense BEV representations. The method demonstrates strong performance on both nuScenes and Argoverse benchmarks, setting new state-of-the-art results.

Strengths

The paper clearly identifies the challenges in BEV map layout estimation and provides a well-defined solution. The proposed method is based on the use of generative models like VQ-VAE for BEV map layout estimation and aims to address the limitations of existing methods. The proposed method achieves good results on nuScenes and Argoverse benchmarks.

Weaknesses

The proposed idea of using generative model is based on the previous methods like DDP or DiffBEV. The proposed method like toke-based decoder is not very novel for the feature alignment. For example, the deformable attention is used and explored by many other methods for feature alignment. The paper focuses on two specific datasets. The comparison with more recent diffusion methods is not included.

Questions

How about the proposed method using other attention instead of the deformable attention? What is the effect of the codebook size? In Table 1, what is the reason to make two different settings for the experiment results in nuScenes validation set?

Rating

5

Confidence

3

Soundness

3

Presentation

3

Contribution

2

Limitations

The proposed methods are based on the previous methods like DDP or DiffBEV. The technical contributions are not very novel, like the use of the deformable attention.

Reviewer 1JdE2024-08-08

Comment

The rebuttal helps to address many of the concerns. The added computation complexity analysis and qualitative visualization comparison results should be integrated into the final version. MapPrior also provides realism (MMD) and uncertainty awareness (ECE) results. Would it be possible to provide such results for analysis as well? This could better verify the superiority of your approach over the baseline method. Sincerely,

Authorsrebuttal2024-08-09

Thank Reviewer 1JdE for the reply

Thank you for your careful review and thoughtful reply, and we are happy to continue the discussion. The added computation complexity analysis and qualitative visualization comparison results will be integrated into the final version. **About providing the realism (MMD) results**: MMD is a metric of distance between the generated layout predictions and the ground truth distribution, which is to capture the realism in scene structures (e.g., the lane and sidewalks that have gaps and are not straight may result in topological changes and drastically impact downstream modules). It is noteworthy that this realism metric and the common used precision metric are not closely coupled. It is possible to achieve higher IoU while generating non-realistic map layouts, or vice versa. We provide the MMD comparison between BEVFusion, MapPrior, DDP and our approach under the camera-only setting in the table below, which is conducted on both the nuScenes *validation* set and *test* set. It shows that the generative prior models can enjoy the better structure preservation ability, and our approach VQ-Map is the best at pushing the limit of both the precision and realism simultaneously. We will include this MMD-based analysis in the revision. | | BEVFusion | MapPrior | DDP | VQ-Map | | --------- | --------- | --------- | --------- | --------- | | MMD$\downarrow$ on *validation* set | 39.6 | 28.4 | 23.7 | 24.4 | | MMD$\downarrow$ on *test* set | 19.5 | - | 12.9 | 10.0 | **About providing the uncertainty awareness (ECE) results**: In MapPrior[17], its generative stage after the predictive stage during inference introduces a discrete latent code $\textbf{z}’$ to guide the generative synthesis process through a transformer-based controlled synthesis in the latent space, where multiple diverse $\textbf{z}^{(k)}$ are obtained using nucleus sampling and then decoded into multiple output samples (see Figs. 2 and 5 in [17]). So it is necessary to evaluate the uncertainty awareness (ECE) score for the generated multiple layout estimation samples. As for the discriminative BEV perception baselines that are trained end-to-end with cross-entropy loss, the predictions produced by the softmax function are assumed to be the pseudo probabilities to facilitate the computation of ECE score. However, during inference of our VQ-Map, the token decoder outputs the classification probabilities for each BEV token, and our approach enables us to use these probabilities as weights to perform a weighted sum of the elements in the codebook embeddings and use it as input to the decoder to achieve **one** final layout estimation output. This process is similar to the 1-step version of MapPrior, in which there is no need to evaluate the ECE score as shown in Tab. 1 of [17]. We will clarify this point in the revision.

Reviewer 1JdE2024-08-11

Comment

The reviewer would like to thank the authors for supplementing these analyses, which could be added to the revised version. Sincerely,

Reviewer 1hbx2024-08-11

Questions

Thanks for the response. The rebuttal has addressed many of my concerns. An interesting point is that using deformable attention to replace standard attention can lead to such a large improvemence. Which of the other methods (in Tab. 4 ablation study) has or has not included deformable attention? How about if include? Apart from that, is it possible to list the respective improvements from different proposed components?

Authorsrebuttal2024-08-13

Thank Reviewer 1hbx for the reply

Thank you for your careful review and thoughtful reply, and we are sorry for not clearly describing the specific structures and meaning of the ablation methods in Tab. 4, though they are briefly described in Lines 276-281. **About the deformable attention in the ablation study of Tab. 4**: The supervision signals during the second stage training for PV-BEV alignment in our novel pipeline are the BEV tokens generated from the BEV groundtruth maps as illustrated in Fig. 2. It shows that token classification (f) using the codebook indices is the most effective method for PV-BEV alignment in comparison to columns (d) and (e), which are corresponding to using latent variables that *have not* and *have* been discretized by the codebook respectively. Column (g) aims to show the effectiveness of $N_{aug}$ in Eq. (4). They all use the sparse features generated from our proposed deformable attention-based architecture to predict the supervision signals. Whether using the dense or sparse BEV features for token decoder in our pipeline can be experimentally determined. Columns (a) and (b) both use the dense BEV features generated from the BEVFusion method while not using the attention-like architecture like in our token decoder module. We first found that using dense features with 128$\times$128$\times$80 dimensions to predict the sparse BEV tokens in (b) even performs worse than the traditional end-to-end method in (a). Note that (a) directly predicts the BEV maps and it can be seen as a variant of BEVFusion. Considering that using sparse features to align with our tokenization idea may be more robust against noise and geometric changes (as acknowledged by Reviewer `xhZa`), we thus tested using sparse features with 25$\times$25$\times$512 dimensions to predict the sparse BEV tokens based on our proposed deformable attention-based architecture, which significantly improves the overall performance (comparing (f) to (b)). We also surprisingly found that our achieved sparse features work better even in the traditional end-to-end framework (comparing (c) to (a)) for the BEV map estimation task. Based on the above analyses, we can see that only (a) and (b) do not have the deformable attention included. If (a) uses our achieved sparse features based on the proposed deformable attention-based architecture, it becomes (c) with mIoU improved from 56.4 to 59.8. Due to the failure of using dense features (see column (b) with 56.3 mIoU) or the standard attention-based sparse features (56.5 mIoU), our novel pipeline really enjoys the benefit of deformable attention to achieve the new performance record of 62.2 mIoU, which significantly surpasses the SOTA method DDP (59.4 mIoU). Note that deformable attention has always been a common practice for PV-BEV alignment in the discriminative BEV perception approaches that are trained end-to-end with cross-entropy loss. We will include more details for them in the revision. **About the respective improvements from different proposed components**: Our generative pipeline mainly includes two components, i.e., the deformable attention-based token decoder using sparse features and the codebook embedding for BEV generation, where some parameter settings include the layer and dimension number settings for the deformable attention-based architecture, and the supervision signals for training PV-BEV alignment after discrete representation learning. We list the respective improvements for them below: - The deformable attention-based sparse features employing 6 layers and 512 dimensions improves over the baseline (a) to achieve (c) with 3.4 mIoU performance gain. We also tested the deformable attention-based dense features with 128$\times$128$\times$80 dimensions, which ahcieves 1.6 mIoU performance gain over (a). - The codebook embedding using the latent variables as the supervision signals further improves over (c) to achieve (d) or (e) with 0.3-0.5 mIoU performance gains, while using the codebook indices achieves 61.8 mIoU with 2.0 mIoU performance gain over (c). - Further changing the layer and dimension number settings to 8 layers and 512 dimensions finally achieves (f) with an additional mIou performance gain of 0.4. We will add these respective improvements into Tab. 4 for more clear presentation.

Program Chairsdecision2024-09-25

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC