Mining and Transferring Feature-Geometry Coherence for Unsupervised Point Cloud Registration

Point cloud registration, a fundamental task in 3D vision, has achieved remarkable success with learning-based methods in outdoor environments. Unsupervised outdoor point cloud registration methods have recently emerged to circumvent the need for costly pose annotations. However, they fail to establish reliable optimization objectives for unsupervised training, either relying on overly strong geometric assumptions, or suffering from poor-quality pseudo-labels due to inadequate integration of low-level geometric and high-level contextual information. We have observed that in the feature space, latent new inlier correspondences tend to cluster around respective positive anchors that summarize features of existing inliers. Motivated by this observation, we propose a novel unsupervised registration method termed INTEGER to incorporate high-level contextual information for reliable pseudo-label mining. Specifically, we propose the Feature-Geometry Coherence Mining module to dynamically adapt the teacher for each mini-batch of data during training and discover reliable pseudo-labels by considering both high-level feature representations and low-level geometric cues. Furthermore, we propose Anchor-Based Contrastive Learning to facilitate contrastive learning with anchors for a robust feature space. Lastly, we introduce a Mixed-Density Student to learn density-invariant features, addressing challenges related to density variation and low overlap in the outdoor scenario. Extensive experiments on KITTI and nuScenes datasets demonstrate that our INTEGER achieves competitive performance in terms of accuracy and generalizability.

Paper

References (54)

Scroll for more · 38 remaining

Similar papers

Peer review

Reviewer 2VKD5/10 · confidence 4/52024-07-06

Summary

The paper introduces a new unsupervised outdoor point cloud registration method called INTEGER, which dynamically integrates high-level contextual information and low-level geometric information to generate reliable pseudo-labels, addressing the issue of poor performance in complex outdoor environments seen in previous methods reliant on geometric data. By incorporating the Feature-Geometry Coherence Mining module, Anchor-Based Contrastive Learning, and the Mixed-Density Student model, this method not only performs well in scenarios with significant variations in data density but also demonstrates its efficiency and generalizability on standard datasets like KITTI and nuScenes. Overall, the INTEGER method significantly improves in accuracy and generalizability, especially in handling complex and distant outdoor scenes, showing advantages that traditional methods struggle to match.

Strengths

Originality:The INTEGER method demonstrates originality by innovatively combining high-level contextual and low-level geometric information for unsupervised point cloud registration. This method creatively addresses challenges in outdoor environments, where previous methods relying solely on geometric data often fail. Quality:The paper showcases high-quality research through detailed methodological execution and robust evaluations on standard benchmarks like KITTI and nuScenes. The proposed mixed-density student model, which learns density-invariant features, ensures robust performance across diverse scenarios. Clarity:The manuscript is clearly written and well-organized, effectively communicating its core ideas, methodologies, and results. It uses figures and tables effectively to aid understanding, making it accessible to readers familiar with point cloud processing. Significance:The work is highly significant, offering potential transformative impacts in autonomous driving and robotics by enhancing unsupervised point cloud registration in outdoor scenes. Its competitive performance against supervised methods highlights its practical relevance and potential to reduce reliance on labeled data.

Weaknesses

Dependency on Initial Conditions The INTEGER method's performance heavily relies on the quality of the initial teacher model. A poorly initialized teacher model could propagate errors and inefficiencies through the learning process. The paper could explore and discuss alternative strategies for more robust initializations or provide a more detailed analysis of how the initial conditions affect the overall performance. This would give readers a clearer understanding of the method's robustness and potential limitations in real-world scenarios. Comparison with State-of-the-Art Methods While the paper presents comparisons with existing methods, the selection seems limited to those that are closely aligned with the proposed method's framework. Including a broader range of state-of-the-art methods, especially recent unsupervised learning approaches that use different paradigms, could help validate the strengths and uniqueness of INTEGER more convincingly. This comparison could also be extended to include a discussion on how INTEGER performs relative to these methods in terms of computational efficiency and scalability. Discussion on Failure Cases and Limitations The paper could benefit from a more thorough discussion of scenarios where INTEGER might underperform, such as extremely sparse point clouds or highly noisy environments. Understanding the method's limitations and potential failure cases would help in setting realistic expectations and could guide future research to address these specific challenges. Generalizability Across Different Datasets While the paper tests INTEGER on KITTI and nuScenes, additional experiments on datasets from different domains or with different characteristics could help demonstrate the method's adaptability and robustness. Exploring performance on datasets with varying densities and noise levels would provide a more comprehensive evaluation of the method's effectiveness across diverse real-world conditions.

Questions

Robustness of Initial Teacher Model: Could you elaborate on the strategies used for the initialization of the teacher model? Given the dependency of the INTEGER method on the quality of the initial teacher, understanding its robustness in adverse conditions or with suboptimal initialization would be informative. Are there specific conditions under which the initial model tends to fail, and how does this impact the overall registration accuracy? Broader Comparisons: The paper currently compares INTEGER with a select group of methods. Could you include comparisons with additional state-of-the-art unsupervised methods that employ fundamentally different approaches? This could help in understanding the unique advantages or potential trade-offs of INTEGER. Additionally, it would be beneficial if you could provide insights into the computational efficiency and scalability of INTEGER compared to both supervised and unsupervised counterparts.

Rating

5

Confidence

4

Soundness

2

Presentation

3

Contribution

2

Limitations

The manuscript does discuss some technical limitations related to the initialization of the teacher model and the conditions under which the method may underperform. However, these discussions could be expanded to include: Scalability: How does INTEGER scale with increasingly large datasets or more complex environments? Including a discussion on computational resources and runtime could provide a clearer scope of applicability. Robustness: More detailed exploration of robustness against different types of noise or outliers in point cloud data would be beneficial. Given the application domains of point cloud registration, such as autonomous driving and robotics, understanding these aspects is crucial.

Authorsrebuttal2024-08-12

Dear Reviewer 2VKD, We sincerely thank you for your precious time and efforts in reviewing our paper. We greatly appreciate your insightful and detailed feedback, and we have carefully addressed the concerns in the rebuttal. Please let us know if any aspects remain unclear, and we are happy to provide further clarification. We are looking forward to your reply. Best regards, The authors of submission 1909

Reviewer 2VKD2024-08-13

The author's answer here is convincing and solves some of my previous questions. Although only a few unsupervised methods are compared, it can be seen that the proposed method has advantages over those methods. If possible, it would be better to compare more unsupervised methods. Although the performance of the proposed method is lacking in some aspects compared to other methods, it also shows that the method proposed by the author has a good effect overall, which is surprising. I keep my original score.

Authorsrebuttal2024-08-13

Thanks

Thanks for continuing to recognize our work. Your suggestion on understanding the robustness of the teacher initialization and scalability across various datasets are very helpful—these experiments effectively highlight the superior robustness and generalizability of our work. Additionally, your suggestion on adding more unsupervised baselines can enable a more comprehensive comparison between our work and existing methods, and we are very grateful for that. Although we have found some existing indoor unsupervised methods fail to work in outdoor scenes, we will conduct these experiments and include in the experiment section. We sincerely appreciate your thorough review, and we will incorporate your suggestions into the final version.

Reviewer SEpR4/10 · confidence 5/52024-07-11

Summary

This paper introduces an unsupervised framework for point cloud registration that generates reliable pseudo-correspondences using both low-level geometric and high-level contextual information. It employs a widely used teacher-student architecture and proposes Anchor-Based Contrastive Learning to facilitate robust feature space development through contrastive learning with anchors. Additionally, the paper introduces a Mixed-Density Student approach to learn density-invariant features, effectively addressing challenges associated with density variations and low overlap in outdoor scenarios.

Strengths

This paper focuses on registering point clouds without relying on pose prior datasets to supervise model training. The observation that in the feature space, points of latent new inlier correspondences tend to cluster around respective positive anchors summarizing features of existing inliers is particularly interesting. The FCEM adaptation of the teacher model to a data-specific teacher for the current mini-batch is intriguing. However, the procedure described in the manuscript is complex and challenging to follow. It seems that the teacher model is first updated using the current mini-batch dataset, then correspondences are selected to train the student, followed by an update of the teacher weights using Exponential Moving Average (EMA). This sequence raises questions about the efficiency and effectiveness of such a dynamic updating scheme. The authors need to provide a clearer explanation of this process.

Weaknesses

First limitation is that some parts of the framework appears remarkably similar to the established EYOC method, thereby calling into question the novelty of this contribution. Besides, the integration of different levels (low and high) of information for mining pseudo-labels is highlighted as a distinguishing contribution, yet the manuscript lacks a clear explanation of the specific mechanisms. If Spatial Compatibility Filtering is employed, it should be noted that this technique is already a component of EYOC.

Questions

This paper introduces an unsupervised framework for point cloud registration that integrates both low-level geometric and high-level contextual information to generate reliable pseudo-labels. While the concept is promising, the manuscript could benefit from additional detail and clarification in several areas: 1. Similarity to Existing Methods: Some parts of the framework appears remarkably similar to the established EYOC method, thereby calling into question the novelty of this contribution. 2. Using low and high level information for mining pseudo-labels is highlighted, yet the manuscript lacks a clear explanation of the specific mechanisms. If Spatial Compatibility Filtering is employed, it should be noted that this technique is already a component of EYOC. 3. The manuscript mentions pairs with distances [d1, d2], but it does not explain the impact of these distances for registration. A detailed explanation would enhance understanding of how these challenge the registration. 4. Dataset Differences and Overlap Ratios: The experimental section discusses the use of KITTI and nuScenes datasets. It is important to delineate the differences between these datasets, especially concerning their overlap ratios. Providing specific overlap ratios for these and other datasets would facilitate a more nuanced discussion of the framework's applicability and robustness across different scenarios. 5. Performance on Various Datasets: The framework's performance is evaluated on outdoor datasets like KITTI and nuScenes, but there is no discussion on its efficacy in indoor settings, such as with the 3DLoMatch dataset. Insights into performance in diverse environments would be particularly valuable, given the unique challenges posed by indoor scenarios. 6. Training Time: The manuscript omits details regarding the training duration. Including this information is essential for assessing the practicality of deploying this framework in real-world applications. 7. Comparative Analysis with EYOC: If EYOC also utilizes synthetic pretraining, a direct comparison with the proposed method under similar conditions is necessary. Such a comparative analysis would provide a fairer assessment of the proposed method's strengths and help highlight any genuine advancements. 8. Architecture Details for Predator: Since Predator architecture employs cross-attention and a dual-branch structure but lacks clarity on how the network is divided into teacher and student components. This is non-trivial, and thus, more detailed explanations are required to understand its implementation and functionality fully. 9. Generalization to Indoor Environments: There is a need to assess how networks trained on outdoor datasets perform in indoor point cloud registration tasks. Evaluating the generalization capabilities of the framework would give insights into its versatility and effectiveness across different application settings.

Rating

4

Confidence

5

Soundness

2

Presentation

2

Contribution

3

Limitations

The authors adequately addressed the limitations

Authorsrebuttal2024-08-12

Dear Reviewer SEpR, We sincerely thank you for your precious time and efforts in reviewing our paper. We greatly appreciate your insightful and detailed feedback, and we have carefully addressed the concerns in the rebuttal. Please let us know if any aspects remain unclear, and we are happy to provide further clarification. We are looking forward to your reply. Best regards, The authors of submission 1909

Authorsrebuttal2024-08-13

Further Clarification on Loss Calculation of PREDATOR

We sincerely thank you for your precious time and efforts. We are happy that we have addressed most of your concerns. The reviewer is still concerned about the loss calculation for both the source and target point clouds. Indeed, as stated in the PREDATOR paper, PREDATOR is a two-stream encoder-decoder network, which produces point-level features for both the source and target point clouds. We provide more details about the loss for the source and target point clouds as follows: As is elaborated in Sec.3.4(L236-238) in our manuscript, the overall training loss for student is a weighted combination of multiple $\mathcal{L} _ \text{ABCont}$ introduced by ABCont (see Sec. 3.1), which is defined as $\mathcal{L} _ \text{ABCont} = \mathcal{L} _ \text{reg} + \lambda _ \text{aux} \mathcal{L} _ \text{aux}$. - For the auxiliary loss part $\mathcal{L}_\text{aux}$ **proposed by us**, as we have stated in L142-143 of the manuscript, we calculate it **from the two stream** (i.e.,for **both** source **and** target point clouds): $\mathcal{L} _ \text{aux} = \frac{1}{2} (\mathcal{L} _ \text{aux}^\mathbf{P} + \mathcal{L} _ \text{aux}^\mathbf{Q})$ - For the registration loss part $\mathcal{L}_\text{reg}$ , as we have stated in L137 of the manuscript, we **directly adopt the loss of the registration networks,** such as PREDATOR and FCGF used in our experiments. Therefore, for experiments involving PREDATOR, we calculate the registration loss in the same way as in their paper. As stated in their paper, they calculate the loss **from the two stream** (i.e.,for **both** source **and** target point clouds), and average them to form the total registration loss. In summary, we calculate the loss from the two streams in the experiments involving PREDATOR during teacher-student training. As for synthetic pretratining, we also directly adopt the loss of the registration network, and thus calculate the loss **from the two stream** (i.e.,for **both** source **and** target point clouds) for PREDATOR. We hope this further explanation would address your questions on the loss calculation. Thank you again for your constructive suggestions. We sincerely appreciate your thorough review, and we will incorporate your suggestions into the final version, including further clarification on loss calculation.

Authorsrebuttal2024-08-14

Dear Reviewer SEpR, We sincerely appreciate the time and effort the reviewer has dedicated to evaluating the work. As the reviewer-author discussion phase is coming to the end, we hope that our responses and additional experiments have effectively addressed the concerns raised. We respectfully request that the reviewer re-evaluate our work and kindly reconsider the ratings. Thank you for the continued support and understanding. Best regards, The authors of submission 1909

Reviewer SEpR2024-08-14

Reply for discussion

Hi, Thank you for your replies and the well-prepared rebuttal. I almost fully understand what you did in the method section regarding PREDATOR. I just have a small question about the PREDATOR part, though it does not affect my final score. In this case, both \(L_{\text{aux}}\) and \(L_{\text{reg}}\) are implemented as circle loss. For the distillation part, the gradient backpropagation only passes through one decoder and two encoders for either \(L_{\text{aux}}^P\) or \(L_{\text{aux}}^Q\). However, when combined, they will cover both encoders and decoders. The \(L_{\text{reg}}\) loss passes through both encoders and decoders, so it seems that the \(L_{\text{reg}}\) part might be redundant and could potentially be removed. Best,

Authorsrebuttal2024-08-14

Dear Reviewer SEpR, We sincerely thank you for your precious time. We are happy to see that our work related to PREDATOR has been understood. We would like to clarify a potential misunderstanding of the the two parts of our loss, namely the anchor-based auxiliary loss $\mathcal{L} _ {\text{aux}}$ and the registration loss $\mathcal{L} _ {\text{reg}}$. We **proposed** $\mathcal{L} _ {\text{aux}}$ to increase the feature similarity to positive anchors from the teacher, and decrease the feature similarity to negative anchors from the teacher. It is **not** Circle Loss, although they may share some similarities in their mathmatical expressions. The detailed definition of these anchors are given in L106-117 of our manuscript. Overall, $\mathcal{L} _ {\text{aux}}$ is designed to **regularize the feature space** of the student with teacher's extracted features. $\mathcal{L} _ {\text{reg}}$, in PREDATOR's case, involves the Circle Loss. However, it **cannot be removed** because it is the **primary supervision signal** to supervise the student with the pseudo-labels from the teacher. In Table 3 of our ablation study, we remove the $\mathcal{L} _ {\text{aux}}$ and find a performance drop. However, with $\mathcal{L} _ {\text{reg}}$ and our more accurate pseudo-labels comapred with existing methods, we are still able to outperfrom exsiting SOTAs (our 83.5% mRR v.s. EYOC's 83.2%), which demonstrates **the importance** of $\mathcal{L} _ {\text{reg}}$. For the student, indeed, we **need to train** both encoders and decoders, as well as the overlap attention module in between. As you said, the loss *passes through both encoders and decoders*, so it can adequatly supervise the learning of **all components of the student**. During teacher-student training, we prevent gradients from being propagated to the teacher, as is typically done by works involving distillation. We sincerely appreciate your thorough review. Indeed, it is crucial to understand how gradients are back-propagated and their effects on different modules of the network. We will conduct additional experiments and incorporate your suggestions into the final version. Best regards, The authors of submission 1909

Reviewer SEpR2024-08-14

Reply to Authors

Thank you for your clarification. If the paper is accepted, I strongly suggest releasing the code, as it would help readers understand the method more clearly. I understand that \(L_{\text{aux}}\) is used to increase feature similarity to positive anchors from the teacher and decrease feature similarity to negative anchors. However, it still functions as a circle loss, as stated in PREDATOR and other papers like GeoTransformer. Are the hyperparameters in this loss, such as \(\gamma\), set the same as in PREDATOR? (Perhaps I missed this detail.) Regarding Table 3, which network did you use? Was it not FCGF? I ask this because you mentioned in your response that the loss ablation study cannot remove the regularization loss. In your supplementary material, you provide results for both FCGF and PREDATOR, which has confused me further.

Authorsrebuttal2024-08-14

Dear Reviewer, Thank you for your reply. Follow our tradition, we will release the code if the paper is published. We would also like to clarify a potential misunderstanding in the ablation study. As we stated in our previous reply, we indeed **have removed the regularization loss** in our ablation study (see row "w/o ABCont" in Table 3), and becuase the **registration loss** is the primary part for the student's supervision, we cannot remove it. Best regards, The authors of submission 1909

Reviewer FNCk6/10 · confidence 2/52024-07-12

Summary

This submission proposes an unsupervised framework for point cloud registration. The key contribution is a two-stage training scheme, which first trains a teacher network on synthetic data that extract features in a density-invariant manner, and then trains a student network with pseudo label produced by the teacher net.

Strengths

1. The submission is in general well structured. Similar to this type of works, it contains quite a few notations and architecture design details, which are presented in a relatively clear manner. 2. The key insight, namely, "points of latent new inlier correspondences tend to cluster around respective positive anchors..." seems interesting and fresh to me (though I am not an expert in this area). 3. The experimental performance looks competitive.

Weaknesses

1. The key insight is more presented as an empirical observation, is there any chance that such can be justified in a more concrete way, even on some toy examples? 2. I didn't find report on the training cost and inference efficiency in the submission.

Questions

In KITTI and nuScenes, as the data are scanned with limited degree of viewpoint freedom, can such method be applied to cases with significant rigid transformations? For example, in robotics, one may have to handle objects in varying poses randomly sampled in SE(3). If it is doable, could you please provide some insight/estimation on cost of the pre-training stage. Minor points: . L161, missing space.

Rating

6

Confidence

2

Soundness

3

Presentation

3

Contribution

3

Limitations

The limitation discussion looks good to me.

Authorsrebuttal2024-08-12

Dear Reviewer FNCk, We sincerely thank you for your precious time and efforts in reviewing our paper. We greatly appreciate your insightful and detailed feedback, and we have carefully addressed the concerns in the rebuttal. Please let us know if any aspects remain unclear, and we are happy to provide further clarification. We are looking forward to your reply. Best regards, The authors of submission 1909

Reviewer Bwh65/10 · confidence 4/52024-07-12

Summary

This paper focuses on unsupervised point cloud registration in 3D computer vision. To tackle the problem, it leverages the observation that in the feature space, points of latent new inlier correspondences tend to cluster around respective positive anchors. Based on that, this paper proposes a novel unsupervised registration method termed INTEGER to incorporate high-level contextual information for reliable pseudo-label mining. Extensive experiments were conducted on outdoor benchmarks including KITTI and nuScenes, which demonstrates the effectiveness of the proposed method.

Strengths

1. This paper is well-written and well-organized; 2. The observation w.r.t. the new inliers and positive anchors seems interesting and correct; 3. The use of teacher-student networks is rational, and the design of Feature-Geometry Coherence Mining is novel. 4. The experimental results are strong on outdoor scenes.

Weaknesses

1. There are some problems in terms of figures. For example, Fig. 1 is not very easy to understand. As a teaser, it does not demonstrate the core idea of this paper very clearly. Fig. 2 and Fig.3 include too much content and make it hard to focus.

Questions

1. In Tab.1, why there are fewer baseline methods on nuScenes compared to those on KITTI? As well as the generalization test from KITTI to nuScenes? 2. Although the title demonstrates that this paper focuses on outdoor scenes, the proposed method could also work on Indoor scenes. Why Indoor scenes are excluded? Could some experiments be added to further demonstrate the superiority of the proposed method?

Rating

5

Confidence

4

Soundness

3

Presentation

3

Contribution

3

Limitations

Limitations have been dicussed.

Authorsrebuttal2024-08-12

Dear Reviewer Bwh6, We sincerely thank you for your precious time and efforts in reviewing our paper. We greatly appreciate your insightful and detailed feedback, and we have carefully addressed the concerns in the rebuttal. Please let us know if any aspects remain unclear, and we are happy to provide further clarification. We are looking forward to your reply. Best regards, The authors of submission 1909

Reviewer FNCk2024-08-12

Thank you for the reply, I do not have further questions.

Reviewer SEpR2024-08-13

Post-rebuttal

I appreciate the authors' clarifications. After reading the rebuttal, I still have the following questions: It seems we may have different understandings of the dual-branch structure. Let me restate the concept as described in the original paper: PREDATOR is a two-stream encoder-decoder network, producing point-level features for both the source and target point clouds. How the final loss is calculated remains unclear to me. Did you calculate the loss from the two stream? Again, I thank the authors for their work and time.

Program Chairsdecision2024-09-25

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC