mlsanityData to 14 Oct 2026

Learning 3D-3D Correspondences for One-shot Partial-to-partial Registration

arXiv 2006.04523 ↗First posted 8 Jun 2020cs.CVcited by 9

Not on the map. Why?

Abstract (arXiv)

While 3D-3D registration is traditionally tacked by optimization-based methods, recent work has shown that learning-based techniques could achieve faster and more robust results. In this context, however, only PRNet can handle the partial-to-partial registration scenario. Unfortunately, this is achieved at the cost of relying on an iterative procedure, with a complex network architecture. Here, we show that learning-based partial-to-partial registration can be achieved in a one-shot manner, jointly reducing network complexity and increasing registration accuracy. To this end, we propose an Optimal Transport layer able to account for occluded points thanks to the use of outlier bins. The resulting OPRNet framework outperforms the state of the art on standard benchmarks, demonstrating better robustness and generalization ability than existing techniques.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 3; 2022: 1; 2023: 4; 2024: 0; 2025: 0; 2026: 1.

9 papers.