Cross-PCR: A Robust Cross-Source Point Cloud Registration Framework

Guiyu Zhao, Zhentao Guo, Zewen Du, Hongbin Ma
12/25/2024
cs.CV

No official code found. Best implementation: GuiyuZhao/Cross-PCR (16 stars, last commit 2024-12-12).

Abstract

Due to the density inconsistency and distribution difference between cross-source point clouds, previous methods fail in cross-source point cloud registration. We propose a density-robust feature extraction and matching scheme to achieve robust and accurate cross-source registration. To address the density inconsistency between cross-source data, we introduce a density-robust encoder for extracting density-robust features. To tackle the issue of challenging feature matching and few correct correspondences, we adopt a loose-to-strict matching pipeline with a ``loose generation, strict selection'' idea. Under it, we employ a one-to-many strategy to loosely generate initial correspondences. Subsequently, high-quality correspondences are strictly selected to achieve robust registration through sparse matching and dense matching. On the challenging Kinect-LiDAR scene in the cross-source 3DCSR dataset, our method improves feature matching recall by 63.5 percentage points (pp) and registration recall by 57.6 pp. It also achieves the best performance on 3DMatch, while maintaining robustness under diverse downsampling densities.

View on arXivView PDF

Code Implementations(1)

[AAAI 2025] Cross-PCR: A Robust Cross-Source Point Cloud Registration Framework

160Dec 12, 20241 years ago

Similar Papers

Cite this paper

@article{zhao2024crosspcr,
  title  = {Cross-PCR: A Robust Cross-Source Point Cloud Registration Framework},
  author = {Guiyu Zhao and Zhentao Guo and Zewen Du and Hongbin Ma},
  year   = {2024},
  eprint = {2412.18873},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.18873v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.18873.svg)](https://codeofpaper.com/paper/2412.18873)

Discussion