HyperGCT: A Dynamic Hyper-GNN-Learned Geometric Constraint for 3D Registration
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916833575043072 |
|---|---|
| author | Zhang, Xiyu Ma, Jiayi Guo, Jianwei Hu, Wei Qi, Zhaoshuai Hui, Fei Yang, Jiaqi Zhang, Yanning |
| author_facet | Zhang, Xiyu Ma, Jiayi Guo, Jianwei Hu, Wei Qi, Zhaoshuai Hui, Fei Yang, Jiaqi Zhang, Yanning |
| contents | Geometric constraints between feature matches are critical in 3D point cloud registration problems. Existing approaches typically model unordered matches as a consistency graph and sample consistent matches to generate hypotheses. However, explicit graph construction introduces noise, posing great challenges for handcrafted geometric constraints to render consistency. To overcome this, we propose HyperGCT, a flexible dynamic Hyper-GNN-learned geometric ConstrainT that leverages high-order consistency among 3D correspondences. To our knowledge, HyperGCT is the first method that mines robust geometric constraints from dynamic hypergraphs for 3D registration. By dynamically optimizing the hypergraph through vertex and edge feature aggregation, HyperGCT effectively captures the correlations among correspondences, leading to accurate hypothesis generation. Extensive experiments on 3DMatch, 3DLoMatch, KITTI-LC, and ETH show that HyperGCT achieves state-of-the-art performance. Furthermore, HyperGCT is robust to graph noise, demonstrating a significant advantage in terms of generalization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_02195 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | HyperGCT: A Dynamic Hyper-GNN-Learned Geometric Constraint for 3D Registration Zhang, Xiyu Ma, Jiayi Guo, Jianwei Hu, Wei Qi, Zhaoshuai Hui, Fei Yang, Jiaqi Zhang, Yanning Computer Vision and Pattern Recognition Geometric constraints between feature matches are critical in 3D point cloud registration problems. Existing approaches typically model unordered matches as a consistency graph and sample consistent matches to generate hypotheses. However, explicit graph construction introduces noise, posing great challenges for handcrafted geometric constraints to render consistency. To overcome this, we propose HyperGCT, a flexible dynamic Hyper-GNN-learned geometric ConstrainT that leverages high-order consistency among 3D correspondences. To our knowledge, HyperGCT is the first method that mines robust geometric constraints from dynamic hypergraphs for 3D registration. By dynamically optimizing the hypergraph through vertex and edge feature aggregation, HyperGCT effectively captures the correlations among correspondences, leading to accurate hypothesis generation. Extensive experiments on 3DMatch, 3DLoMatch, KITTI-LC, and ETH show that HyperGCT achieves state-of-the-art performance. Furthermore, HyperGCT is robust to graph noise, demonstrating a significant advantage in terms of generalization. |
| title | HyperGCT: A Dynamic Hyper-GNN-Learned Geometric Constraint for 3D Registration |
| topic | Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2503.02195 |