Bridge 2D-3D: Uncertainty-aware Hierarchical Registration Network with Domain Alignment
Zhixin Cheng, Jiacheng Deng, Xinjun Li, Baoqun Yin, Tianzhu Zhang
TL;DR
Bridge 2D-3D proposes B2-3Dnet, an uncertainty-aware hierarchical registration network with domain alignment to tackle cross-modal 2D–3D patch matching. It introduces UHMM to weigh image patches by uncertainty across multiple scales and AMAM to reduce modality gaps via a gradient reversal-based adversarial objective. The method achieves state-of-the-art registration metrics on RGB-D Scene V2 and 7-Scenes, demonstrating improved inlier ratios, feature matching recall, and robust generalization to scale variations. By combining a hierarchical patch-level matching strategy with adversarial domain alignment and a PnP-RANSAC pose estimator, the approach yields accurate, robust image-to-point cloud registration suitable for 3D reconstruction and localization tasks.
Abstract
The method for image-to-point cloud registration typically determines the rigid transformation using a coarse-to-fine pipeline. However, directly and uniformly matching image patches with point cloud patches may lead to focusing on incorrect noise patches during matching while ignoring key ones. Moreover, due to the significant differences between image and point cloud modalities, it may be challenging to bridge the domain gap without specific improvements in design. To address the above issues, we innovatively propose the Uncertainty-aware Hierarchical Matching Module (UHMM) and the Adversarial Modal Alignment Module (AMAM). Within the UHMM, we model the uncertainty of critical information in image patches and facilitate multi-level fusion interactions between image and point cloud features. In the AMAM, we design an adversarial approach to reduce the domain gap between image and point cloud. Extensive experiments and ablation studies on RGB-D Scene V2 and 7-Scenes benchmarks demonstrate the superiority of our method, making it a state-of-the-art approach for image-to-point cloud registration tasks.
