Metraipolis › archive › dc_64cdc1d64c6a

Ex-Sim(3)-Reg: 2D-3D Correspondence Pruning via Extended Sim(3) Registration — arXiv:2608.28096

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.28096
License (as archived)
CC0-1.0
Archived
2026-10-17T11:33:09.741Z
SHA-256 of the archived text
50bf9805bff4eb83b4f248b5a87c40cfa08e59c5f61c6e581df36f1db059da2c
Stable URL of this page
https://metraipolis.com/documento/dc_64cdc1d64c6a

How to cite

Ex-Sim(3)-Reg: 2D-3D Correspondence Pruning via Extended Sim(3) Registration — arXiv:2608.28096 — arXiv (en), https://arxiv.org/abs/2608.28096 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_64cdc1d64c6a (Metraipolis archive dc_64cdc1d64c6a, sha256 50bf9805bff4eb83b4f248b5a87c40cfa08e59c5f61c6e581df36f1db059da2c)
BibTeX
@misc{dc64cdc1d64c6a,
  title = {Ex-Sim(3)-Reg: 2D-3D Correspondence Pruning via Extended Sim(3) Registration — arXiv:2608.28096},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.28096},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_64cdc1d64c6a; sha256 50bf9805bff4eb83b4f248b5a87c40cfa08e59c5f61c6e581df36f1db059da2c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.28096. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Learning-based image-to-point-cloud (I2P) registration has garnered increasing attention in recent years. Nevertheless, existing methods still struggle with severe outliers under challenging scenarios with unseen, low-inlier, or distorted cases. A fast and robust 2D-3D correspondence pruning method is therefore highly desirable. Recently, a promising scheme lifts 2D-3D correspondences to 3D-3D correspondences using depth priors, casting correspondence pruning as a Sim(3) registration problem. However, depth priors estimated from monocular images are inherently noisy, which undermines the reliability of this scheme. In this paper, to explicitly model non-negligible depth noise, we reformulate correspondence pruning as an extended Sim(3) registration problem and propose a simple yet effective pruning algorithm termed Ex-Sim(3)-Reg. We further provide a theoretical analysis to justify the effectiveness of our method. Extensive experiments on the 7-Scenes, RGBD-V2, ScanNet, and TUM datasets demonstrate that Ex-Sim(3)-Reg achieves up to \textbf{24.7\% improvement} in registration recall over state-of-the-art baseline methods. Code is released at this http URL

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-31 in cs.CV).
Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV).
Pagina del lavoro: https://arxiv.org/abs/2608.28096 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T11:10:05.304Z dalla pagina https://arxiv.org/catchup/cs.CV/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).