Cross-Coordinate Correspondence Pruning for Image-to-Point Cloud Registration

• URL: http://arxiv.org/abs/2607.17200v1
• Date: Sun, 19 Jul 2026 11:45:14 GMT
• Title: Cross-Coordinate Correspondence Pruning for Image-to-Point Cloud Registration
• Abstract summary: We propose a novel Cross-Coordinate Correspondences Pruning (CCP) strategy to acquire sufficient inliers while ensuring a low outlier ratio.<n>Our method achieves a significant performance improvement, surpassing existing state-of-the-art methods by at least 8.6% in Registration Recall across various benchmarks.
• Score: 70.44225088078274
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent detection-free approaches have shown significant efficacy in image-to-point cloud (I2P) registration by employing a coarse-to-fine matching pipeline. In the coarse stage, down-sampled image features and voxelized point cloud features are typically fused to establish initial coarse correspondences for subsequent refinement. However, existing methods largely overlook the critical role of point cloud density, which fundamentally dictates the quality of coarse correspondences and the final registration results. Specifically, excessively sparse point clouds lead to an insufficient number of inliers, while overly dense ones often introduce a high outlier ratio. Consequently, this creates an inherent density trade-off, thereby significantly limiting the registration accuracy of current approaches. For mitigating this trade-off, we propose a novel Cross-Coordinate Correspondences Pruning (CCP) strategy to acquire sufficient inliers while ensuring a low outlier ratio. To minimize interference from inter-modal coordinate discrepancies, we first project cross-coordinate coarse correspondences to the 2D image coordinate system for spatial unification. Subsequently, a lightweight pruning network is responsible for predicting the inlier confidences, which are used to filter coarse outliers, from coordinate geometric and modal feature dimensions. To maximize inlier recall, we further design a Multi-Density Point Ensemble (MDPE) strategy that consolidates and deduplicates pruned coarse correspondences across varying point cloud densities. Our method achieves a significant performance improvement, surpassing existing state-of-the-art methods by at least 8.6% in Registration Recall across various benchmarks.

Related papers

• Cross3DReg: Towards a Large-scale Real-world Cross-source Point Cloud Registration Benchmark [57.42211080221526]
  Cross-source point cloud registration, which aims to align point cloud data from different sensors, is a fundamental task in 3D vision.<n>The lack of publicly available large-scale real-world datasets for training the deep registration models, and the inherent differences in point clouds captured by multiple sensors pose challenges.<n>We construct Cross3DReg, the currently largest and real-world multi-modal cross-source point cloud registration dataset.<n>A visual-geometric attention guided matching module is proposed to enhance the consistency of cross-source point cloud features.
  arXiv  Detail & Related papers  (2025-09-08T09:01:13Z)
• RBFIM: Perceptual Quality Assessment for Compressed Point Clouds Using Radial Basis Function Interpolation [58.04300937361664]
  One of the main challenges in point cloud compression (PCC) is how to evaluate the perceived distortion so that the RB can be optimized for perceptual quality.<n>We propose a novel assessment method, utilizing radial basis function (RBF) to convert discrete point features into a continuous feature function for the distorted point cloud.
  arXiv  Detail & Related papers  (2025-03-18T11:25:55Z)
• Fully-Geometric Cross-Attention for Point Cloud Registration [51.865371511201765]
  Point cloud registration approaches often fail when the overlap between point clouds is low due to noisy point correspondences.<n>This work introduces a novel cross-attention mechanism tailored for Transformer-based architectures that tackles this problem.<n>We integrate the Gromov-Wasserstein distance into the cross-attention formulation to jointly compute distances between points across different point clouds.<n>At the point level, we also devise a self-attention mechanism that aggregates the local geometric structure information into point features for fine matching.
  arXiv  Detail & Related papers  (2025-02-12T10:44:36Z)
• DiffCom: Decoupled Sparse Priors Guided Diffusion Compression for Point Clouds [54.96190721255167]
  Lossy compression relies on an autoencoder to transform a point cloud into latent points for storage.<n>We propose a diffusion-based framework guided by sparse priors that achieves high reconstruction quality, especially at lows.
  arXiv  Detail & Related papers  (2024-11-21T05:41:35Z)
• FreeReg: Image-to-Point Cloud Registration Leveraging Pretrained Diffusion Models and Monocular Depth Estimators [37.39693977657165]
  Matching cross-modality features between images and point clouds is a fundamental problem for image-to-point cloud registration. We propose to unify the modality between images and point clouds by pretrained large-scale models first. We show that the intermediate features, called diffusion features, extracted by depth-to-image diffusion models are semantically consistent between images and point clouds.
  arXiv  Detail & Related papers  (2023-10-05T09:57:23Z)
• One-Nearest Neighborhood Guides Inlier Estimation for Unsupervised Point Cloud Registration [24.275038551236907]
  We propose an effective inlier estimation method for unsupervised point cloud registration. We capture geometric structure consistency between the source point cloud and its corresponding reference point cloud copy. We train the proposed model in an unsupervised manner, and experiments on synthetic and real-world datasets illustrate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2023-07-26T08:04:01Z)
• Quantity-Aware Coarse-to-Fine Correspondence for Image-to-Point Cloud Registration [4.954184310509112]
  Image-to-point cloud registration aims to determine the relative camera pose between an RGB image and a reference point cloud. Matching individual points with pixels can be inherently ambiguous due to modality gaps. We propose a framework to capture quantity-aware correspondences between local point sets and pixel patches.
  arXiv  Detail & Related papers  (2023-07-14T03:55:54Z)
• Learning to Register Unbalanced Point Pairs [10.369750912567714]
  Recent 3D registration methods can effectively handle large-scale or partially overlapping point pairs. We present a novel 3D registration method, called UPPNet, for the unbalanced point pairs.
  arXiv  Detail & Related papers  (2022-07-09T08:03:59Z)
• CoFiNet: Reliable Coarse-to-fine Correspondences for Robust Point Cloud Registration [35.57761839361479]
  CoFiNet - Coarse-to-Fine Network - extracts hierarchical correspondences from coarse to fine without keypoint detection. Our model learns to match down-sampled nodes whose vicinity points share more overlap. Point correspondences are then refined from the overlap areas of corresponding patches, by a density-adaptive matching module.
  arXiv  Detail & Related papers  (2021-10-26T23:05:00Z)
• RPM-Net: Robust Point Matching using Learned Features [79.52112840465558]
  RPM-Net is a less sensitive and more robust deep learning-based approach for rigid point cloud registration. Unlike some existing methods, our RPM-Net handles missing correspondences and point clouds with partial visibility.
  arXiv  Detail & Related papers  (2020-03-30T13:45:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.