HeMoRa: Unsupervised Heuristic Consensus Sampling for Robust Point Cloud Registration

Shaocheng Yan, Yiming Wang, Kaiyan Zhao, Pengcheng Shi, Zhenjun Zhao +2 more
2/10/2026

No official code found. Best implementation: Laka-3DV/HeMoRa (12 stars, last commit 2025-03-23).

Abstract

Heuristic information for consensus set sampling is essential for correspondence-based point cloud registration, but existing approaches typically rely on supervised learning or expert-driven parameter tuning. In this work, we propose HeMoRa, a new unsupervised framework that trains a Heuristic information Generator (HeGen) to estimate sampling probabilities for correspondences using a Multi-order Reward Aggregator (MoRa) loss. The core of MoRa is to train HeGen through extensive trials and feedback, enabling unsupervised learning. While this process can be implemented using policy optimization, directly applying the policy gradient to optimize HeGen presents challenges such as sensitivity to noise and low reward efficiency. To address these issues, we propose a Maximal Reward Propagation (MRP) mechanism that enhances the training process by prioritizing noise-free signals and improving reward utilization. Experimental results show that equipped with HeMoRa, the consensus set sampler achieves improvements in both robustness and accuracy. For example, on the 3DMatch dataset with FCGF feature, the registration recall of our unsupervised methods (Ours+SM and Ours+SC2) even outperforms the state-of-the-art supervised method VBreg. Our code is available at HeMoRa.

DOISemantic Scholar

Code Implementations(1)

Laka-3DV/HeMoRaCommunity69%

[CVPR-2025] HeMoRa: Unsupervised Heuristic Consensus Sampling for Robust Point Cloud Registration

121Mar 16, 20251 years ago

Cite this paper

@article{yan2026hemora,
  title  = {HeMoRa: Unsupervised Heuristic Consensus Sampling for Robust Point Cloud Registration},
  author = {Shaocheng Yan and Yiming Wang and Kaiyan Zhao and Pengcheng Shi and Zhenjun Zhao and Yongjun Zhang and Jiayuan Li},
  year   = {2026},
  doi    = {10.1109/CVPR52734.2025.00135},
  url    = {https://doi.org/10.1109/CVPR52734.2025.00135},
  journal = {CVPR 2025 2025}
}

Discussion