Register Anything Model for Generalizable and Robust Point Cloud Registration
Authors: Zheng Qin, Junhua Xi, Yan Huang, Jiahong Lai, Anwen Huang, Qiong Li, Guangda Zhang, Kai Xu
Organizations: Defense Innovation Institute, Academy of Military Sciences, China · College of Computer Science and Technology, National University of Defense Technology, China · College of Data Intelligence, Information Support Force Engineering University, China · Institute of AI for Industry, Chinese Academy of Sciences, China
We present Register Anything Model (RAM), a unified model for generalizable 3D point cloud registration that robustly estimates 6-DoF transformations across diverse domains spanning sensors and environments. Existing registration methods are typically tailored to a single domain, with carefully tuned architectures and hyperparameters, and thus degrade markedly when applied to novel domains. We bridge this gap by training a single model on diverse data from indoor, outdoor, and object domains. A central challenge is the severe geometric discrepancy across domains, i.e., differences in scene scale, sensor noise, point density, and structural patterns, which hinders processing with a unified point-based model. To address this, we introduce a geometry-aware normalization strategy that jointly voxelizes and normalizes point clouds into a standardized geometric space, adaptively based on their geometric properties to preserve salient local structures while standardizing resolution. Built on this normalization, RAM follows a hierarchical coarse-to-fine paradigm, and employs an efficient geometric transformer that models local geometric consistency instead of globally over all points. This design mitigates discretization noise introduced by voxelization, and improves computational efficiency. Extensive experiments on 12 benchmarks demonstrate state-of-the-art performance in terms of inlier ratio and registration recall. Notably, our method outperforms the counterparts trained on each separate domain, showing superior generalization capability.
Figures & tables
Figure 1: Register Anything Model (RAM) achieves strong generalization and robustness across a wide range of domains. Compared with the baselines, our method extracts significantly more high-quality correspondences and effectively improves the registration performance.
Figure 2: Overall pipeline of RAM. Point clouds are first adaptively voxelized and normalized into a standardized geometric space by a geometry-aware normalization module. Aftering extracting hierarchical features, RAM extracts superpoints correspondences with an EGeoTR, and then refines them into dense point correspondences. At last, the transformation is recovered from the correspondences.
Model
3DMatch
3DLoMatch
ScanNet++
TIERS
IR(%)
RR(%)
IR(%)
RR(%)
IR(%)
RR(%)
IR(%)
RR(%)
Predator [ 2 ]
58.0
89.0
26.7
64.4
45.4
88.3
N/A
CoFiNet [ 21 ]
49.8
89.3
24.4
67.4
45.4
85.8
N/A
GeoTrans [ 3 ]
70.9
92.4
43.5
74.3
60.6
88.9
N/A
RoITR [ 4 ]
82.4
91.9
54.6
74.1
-
-
-
-
BUFFER [ 5 ]
87.4
92.1
65.0
70.3
83.9
84.7
77.0
72.6
Table 1: Results on indoor benchmarks. Boldfaced numbers highlight the best and the second best are underlined . † and ‡ denote the models pretrained on 3DMatch and KITTI, respectively. ▽ denotes the models without outlier rejection. ⋆ denotes the model trained on indoor data. “N/A” indicates the model fails to achieve reasonable registrations.
Model
KITTI
nuScenes
ETH
WOD
MIT
Oxford
IR(%)
RR(%)
IR(%)
RR(%)
IR(%)
RR(%)
IR(%)
RR(%)
IR(%)
RR(%)
IR(%)
RR(%)
GeoTrans [ 3 ]
78.5
99.5
45.7
86.5
42.7
82.5
81.2
100.0
39.3
90.9
67.0
96.0
BUFFER [ 5 ]
84.1
99.3
75.2
91.7
91.7
97.3
70.8
100.0
59.3
99.7
75.8
99.3
PARENet [ 20 ]
70.5
99.5
34.4
78.3
12.1
59.8
64.0
98.5
17.0
60.9
38.6
88.7
BUFFER-X † [ 13 ]
65.6
99.5
32.7
82.4
86.1
99.7
58.7
99.7
38.2
96.9
50.8
99.0
BUFFER-X ‡ [ 13 ]
73.9
99.5
52.6
93.5
90.8
100.0
65.2
99.7
51.6
98.7
59.4
99.3
Table 2: Results on outdoor benchmarks. Boldfaced numbers highlight the best and the second best are underlined . † and ‡ denote the models pretrained on 3DMatch and KITTI, respectively. ⋆ denotes the model trained on outdoor data. ⋄ denotes the model trained without nuScenes.
Model
ModelNet
ShapeNet
IR(%)
RR(%)
RRE( ∘ )
RTE(m)
IR(%)
RR(%)
RRE( ∘ )
RTE(m)
RPM-Net [ 6 ]
-
90.9
2.412
0.030
-
70.2
6.177
0.058
Predator [ 2 ]
62.8
90.1
2.614
0.033
56.0
73.6
5.668
0.067
CoFiNet [ 21 ]
48.2
91.8
2.802
0.038
45.7
73.5
6.834
0.068
GeoTrans [ 3 ]
73.3
90.4
2.636
0.032
67.3
76.0
4.492
0.053
BUFFER-X † [ 13 ]
25.3
13.3
95.483
0.608
50.9
39.3
67.315
0.396
Table 3: Results on object benchmarks. Boldfaced numbers highlight the best and the second best are underlined . † and ‡ denote the models pretrained on 3DMatch and KITTI, respectively. ⋆ denotes the model trained on object data.
Model
ScanNet++
TIERS
ETH
WOD
MIT
Oxford
ShapeNet
IR(%)
RR(%)
IR(%)
RR(%)
IR(%)
RR(%)
IR(%)
RR(%)
IR(%)
RR(%)
IR(%)
RR(%)
IR(%)
RR(%)
(a.1) hybrid ⋆
70.6
90.0
66.0
90.0
97.5
100.0
91.2
100.0
74.2
100.0
82.0
99.3
65.9
79.6
(a.2) indoor
65.9
89.2
48.5
81.3
77.9
87.3
66.2
98.5
23.8
58.3
64.4
96.7
21.0
30.7
(a.3) outdoor
41.1
72.5
62.3
87.5
93.8
97.9
90.4
100.0
72.3
98.7
79.2
99.0
21.0
28.8
(a.4) object
28.9
56.0
42.7
68.4
32.3
39.5
36.2
66.2
31.3
75.2
52.0
86.7
65.6
76.0
(b.1) w/ OS ⋆
70.6
90.0
66.0
90.0
97.5
100.0
91.2
100.0
74.2
100.0
82.0
99.3
65.9
79.6
Table 4: Ablation studies. Boldfaced numbers highlight the best and the second best are underlined . OS : overlap scores. O&T : overlap scores and transformer. GN : geometry-aware normalization.
Figure 3: Visualization of the registration results on various benchmarks.
Appendix figures & tables7 assets
Supplementary material from the paper’s appendix.
Appendix
IR(m)
RRE( ∘ )
RTE(m)
RE(m)
3DMatch [ 7 ]
0.1
-
-
0.2
3DLoMatch [ 7 , 2 ]
0.1
-
-
0.2
ScanNet++ [ 47 ]
0.1
5.0
0.3
-
TIERS [ 48 ]
0.8
5.0
0.6
-
KITTI [ 9 ]
1.0
5.0
0.6
-
nuScenes [ 10 ]
1.0
5.0
0.6
-
Appendix
Table 5: Metric thresholds of all benchmarks.
Model
Geometry-aware Normalization
Data Preparation
Model Inference
Total
GeoTrans [ 3 ]
-
0.246
0.062
0.308
BUFFER [ 5 ]
-
0.173
0.148
0.321
BUFFER-X [ 13 ]
-
0.133
0.752
0.885
PARENet [ 20 ]
-
0.234
0.075
0.309
RAM ( ours )
0.212
0.258
0.055
0.525
Appendix
Table 6: Computational time on 3DMatch. All results are measured in seconds.
Geometry-aware Normalization
Data Preparation
Feature Extraction
Superpoint Matching
Point Matching
Local-to-Global Registration
0.212
0.258
0.014
0.022
0.010
0.009
Appendix
Table 7: Detailed computational time of RAM on 3DMatch. All results are measured in seconds.
Data
# Epochs
3DMatch
3DLoMatch
IR(%)
RR(%)
IR(%)
RR(%)
indoor
60
75.0
92.4
47.7
77.8
indoor
120
76.9
92.8
50.3
79.2
hybrid
60
79.7
93.3
53.7
81.1
Appendix
Table 8: Results on 3DMatch and 3DLoMatch with extended training samples. Boldfaced numbers highlight the best.
Model
3DMatch
3DLoMatch
IR(%)
RR(%)
IR(%)
RR(%)
PARENet [ 20 ] (standard)
73.6
97.0
44.3
80.5
PARENet [ 20 ] (rotated)
73.7 ( 0.1 ↑ )
96.7 ( 0.3 ↓ )
44.8 ( 0.5 ↑ )
81.1 ( 0.6 ↑ )
RAM ( ours , standard)
79.7
96.2
53.7
82.4
RAM ( ours , rotated)
78.9 ( 0.8 ↓ )
95.5 ( 0.7 ↓ )
52.7 ( 1.0 ↓ )
79.7 ( 2.7 ↓ )
Appendix
Table 9: Results on 3DMatch with large rotations.
Model
SfM
LiDAR
IR(%)
RR(%)
IR(%)
RR(%)
GeoTrans [ 3 ]
40.2
84.4
3.4
9.1
Cross-PCR [ 39 ]
89.4
93.8
35.5
66.7
RAM ( ours )
44.9
90.6
13.3
42.9
Appendix
Table 10: Results on 3DCSR benchmark. Boldfaced numbers highlight the best and the second best are underlined .
Figure 4: Statistical tests on ScanNet++ and Oxford benchmarks.
Robust point cloud registration is a fundamental task in 3D computer vision and geometric deep learning, essential for applications such as large-scale 3D reconstruction, augmented reality, and scene understanding. However, the performance of established learning-based methods often degrades in complex, real world scenarios characterized by incomplete data, sensor noise, and low overlap regions. To address these limitations, we propose CMHANet, a novel Cross-Modal Hybrid Attention Network. Our method integrates the fusion of rich contextual information from 2D images with the geometric detail of 3D point clouds, yielding a comprehensive and resilient feature representation. Furthermore, we introduce an innovative optimization function based on contrastive learning, which enforces geometric consistency and significantly improves the model's robustness to noise and partial observations. We evaluated CMHANet on the 3DMatch and the challenging 3DLoMatch datasets. \rev{Additionally, zero-shot evaluations on the TUM RGB-D SLAM dataset verify the model's generalization capability to unseen domains.} The experimental results demonstrate that our method achieves substantial improvements in both registration accuracy and overall robustness, outperforming current techniques. We also release our code in https://github.com/DongXu-Zhang/CMHANet.
Dongxu Zhang, Yingsen Wang, Yiding Sun +3
School of Software, Xi’an Jiaotong University, No. 28 Xianning West Road, China · CEPRI, China Electric Power Research Institute No. 15 Xiaoying East Road, Qinghe, Haidian District, Beijing, China
We introduce C-GenReg, a training-free framework for 3D point cloud registration that leverages the complementary strengths of world-scale generative priors and registration-oriented Vision Foundation Models (VFMs). Current learning-based 3D point cloud registration methods struggle to generalize across sensing modalities, sampling differences, and environments. Hence, C-GenReg augments the geometric point cloud registration branch by transferring the matching problem into an auxiliary image domain, where VFMs excel, using a World Foundation Model to synthesize multi-view-consistent RGB representations from the input geometry. This generative transfer, preserves spatial coherence across source and target views without any fine-tuning. From these generated views, a VFM pretrained for finding dense correspondences extracts matches. The resulting pixel correspondences are lifted back to 3D via the original depth maps. To further enhance robustness, we introduce a "Match-then-Fuse" probabilistic cold-fusion scheme that combines two independent correspondence posteriors, that of the generated-RGB branch with that of the raw geometric branch. This principled fusion preserves each modality inductive bias and provides calibrated confidence without any additional learning. C-GenReg is zero-shot and plug-and-play: all modules are pretrained and operate without fine-tuning. Extensive experiments on indoor (3DMatch, ScanNet) and outdoor (Waymo) benchmarks demonstrate strong zero-shot performance and superior cross-domain generalization. For the first time, we demonstrate a generative registration framework that operates successfully on real outdoor LiDAR data, where no imagery data is available.
Point cloud registration (PCR) is a fundamental task in 3D vision and provides essential support for applications such as autonomous driving, robotics, and environmental modeling. Despite its widespread use, existing methods often fail when facing real-world challenges like heavy noise, significant occlusions, and large-scale transformations. These limitations frequently result in compromised registration accuracy and insufficient robustness in complex environments. In this paper, we propose IGASA as a novel registration framework constructed upon a Hierarchical Pyramid Architecture (HPA) designed for robust multi-scale feature extraction and fusion. The framework integrates two pivotal components consisting of the Hierarchical Cross-Layer Attention (HCLA) module and the Iterative Geometry-Aware Refinement (IGAR) module. The HCLA module utilizes skip attention mechanisms to align multi-resolution features and enhance local geometric consistency. Simultaneously, the IGAR module is designed for the fine matching phase by leveraging reliable correspondences established during coarse matching. This synergistic integration within the architecture allows IGASA to adapt effectively to diverse point cloud structures and intricate transformations. We evaluate the performance of IGASA on four widely recognized benchmark datasets including 3D(Lo)Match, KITTI, and nuScenes. Our extensive experiments consistently demonstrate that IGASA significantly surpasses state-of-the-art methods and achieves notable improvements in registration accuracy. This work provides a robust foundation for advancing point cloud registration techniques while offering valuable insights for practical 3D vision applications. The code for IGASA is available in https://github.com/DongXu-Zhang/IGASA.