The paper introduces GMPCR, a non‑learning spectral consistency‑guided framework for multiview point cloud registration in low‑overlap scenes. GMPCR refines initial correspondences into a second‑order compatibility structure, uses spectral analysis to filter unreliable matches and select informative scan pairs, and then applies maximal‑clique hypothesis generation for robust relative transformations. The resulting sparse pose graph is further refined with an adaptive history‑aware synchronization scheme, and a recovery mechanism allows previously down‑weighted edges to regain confidence, achieving high registration recalls on benchmark datasets while reducing computational cost.
arXiv:2609.25375v1 Announce Type: cross Abstract: Global point-cloud registration remains challenging when limited overlap, repetitive geometry, and sensor noise produce correspondence sets dominated...
arXiv:2610.34271v1 Announce Type: new Abstract: We propose a novel method for robust point cloud registration with only one tunable parameter. Our method, dubbed TLP, uses truncated $L_p$ functions w...
The paper introduces Ex‑Sim(3)‑Reg, a fast and robust method for pruning 2D‑3D correspondences by reformulating the problem as an extended Sim(3) registration that explicitly accounts for depth noise. The authors provide a theoretical justification and demonstrate that their approach improves registration recall by up to 24.7% on several benchmark datasets, outperforming state‑of‑the‑art baselines. The code for the method is publicly available on GitHub.
FlashReg is a GPU‑accelerated method for point cloud registration that bypasses the construction of dense second‑order compatibility graphs. It builds a sparse second‑order graph directly from a binary first‑order graph using Fast First‑ and Second‑Order Graph (FFSOG) construction, then performs a dataflow‑optimized 3‑clique search to select correspondence pivots and enumerate triples. On indoor and outdoor benchmarks, FlashReg achieves 2–3× lower correspondence‑to‑pose latency than TurboReg while using roughly half the peak tensor memory on an embedded GPU, making it suitable for high‑throughput onboard perception pipelines.
C3VDReg is a benchmark for local-to-local colonoscopic registration that uses the Colonoscopy 3D Video Dataset (C3VD) to generate 10,015 partial-to-partial point cloud pairs, with 2,088 held‑out test pairs. Each pair consists of a source point cloud from depth reprojection and a target point cloud from CT mesh raycasting, evaluated under a standardized protocol of 8,192 points per cloud and fixed pose conventions. Experiments show that high geometric overlap does not guarantee reliable pose recovery, revealing translation ambiguity along repetitive tubular anatomy as a key failure mode.
SAGE (Semantic-Augmented Geometric Experts) is a new point‑cloud registration method that incorporates frozen, pre‑trained semantic representations into the registration pipeline without extra sensors or fine‑tuning. It uses a Semantic‑Guided Mixture of Experts (SG‑MoE) to route data so that each expert specializes in specific semantic‑geometric patterns, thereby reducing mismatches that plague geometry‑only approaches. On the 3DLoMatch benchmark, SAGE achieves the highest registration recall and, with the same number of refinement iterations, also attains the best inlier ratio and recall on both 3DLoMatch and 3DMatch.
arXiv:2608. 19536v1 Announce Type: cross Abstract: Learning-based global point cloud registration has achieved remarkable progress, yet its reliance on geometric representations makes existing methods sensitive to variations in point density, scan pattern, viewpoint, and sensor characteristics.
The paper introduces DPA-I2P, a depth-guided projective alignment method for image-to-point-cloud registration in autonomous driving. It employs Ray-Conditioned Metric Depth Encoding and Projection-Consistent Vision Lifting to align depth and visual cues geometrically, and uses Cross-Modal Query Pruning to enhance matching stability. Experiments on KITTI and nuScenes show significant reductions in rotation and translation errors compared to existing implicit baselines.
Learning-based global point cloud registration has achieved remarkable progress, yet its reliance on geometric representations makes existing methods sensitive to variations in point density, scan pattern, viewpoint, and sensor characteristics. We propose CVSD-Reg, a robust global LiDAR registration framework that distills visual semantic priors from a vision foundation model into LiDAR representations.
DMM-Align introduces a closed‑loop framework for 2D‑3D registration that jointly refines correspondences, estimates pose, and learns representations using a shared differentiable geometric state. The method employs two diffusion processes: a geometry‑aware diffusion that improves the soft matching matrix for robust correspondence estimation, and a geometry‑conditioned diffusion teacher that feeds pose‑induced supervision back into feature learning. Experiments on 7‑Scenes and RGB‑D Scenes V2 show that DMM‑Align outperforms strong baselines, particularly in low‑overlap and heavily occluded scenarios, demonstrating the value of closed‑loop geometric feedback.
The paper introduces DPA-I2P, a depth‑guided projective alignment method for image‑to‑point‑cloud registration in autonomous driving. It employs Ray‑Conditioned Metric Depth Encoding and Projection‑Consistent Vision Lifting to align depth and visual cues geometrically, and uses Cross‑Modal Query Pruning to filter unreliable matches during refinement. Experiments on KITTI and nuScenes show significant improvements, reducing rotation and translation errors by up to 55.6% compared to existing implicit baselines.
The paper introduces the Register Anything Model (RAM), a unified approach for 3D point cloud registration that can robustly estimate 6‑DoF transformations across a wide range of domains, including indoor, outdoor, and object scenes. RAM overcomes domain‑specific challenges by employing a geometry‑aware normalization that voxelizes and standardizes point clouds based on their geometric properties, followed by a hierarchical coarse‑to‑fine pipeline with a geometric transformer that focuses on local consistency. Experiments on 12 benchmarks show that RAM achieves state‑of‑the‑art inlier ratios and registration recall, outperforming methods trained on individual domains and demonstrating strong generalization.