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.
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.
By Eunsoo Im, Junghun Suh, Gyeonggwan Lee, Seunghwan Hong
arXiv:2606. 10019v1 Announce Type: cross Abstract: We propose a fast and correspondence-free local point cloud registration method that leverages geometric surface structure and reproducing kernel Hilbert space (RKHS) embeddings.
By Ray Zhang, Marcus Greiff, Thomas Lew, John Subosits
arXiv:2608. 19522v1 Announce Type: cross Abstract: Scan-to-map LiDAR odometry drifts unboundedly along the unobservable axes of geometrically degenerate environments like tunnels and corridors, and existing degeneracy handling requires environment-specific parameter tuning.
By Eunsoo Im
BridgeMatch is a two‑stage generative solver that preserves the full soft matching matrix for 3D deformable registration. Stage I uses denoising diffusion to estimate a global matching matrix at a coarse resolution, then lifts it to high resolution while maintaining hierarchy and rank constraints. Stage II refines this lifted matrix via a conditional transport bridge, implemented with either a deterministic Flow Matching ODE or a stochastic Brownian‑bridge SDE, and demonstrates improved correspondence accuracy and registration performance on 4DMatch, 4DLoMatch, CAPE, and DeepDeform datasets, especially in low‑overlap scenarios.
By Qianliang Wu, Haobo Jiang, Guangwei Gao, Shuo Chen, Jin Xie, Jian Yang, Yaqing Ding
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.
By Tianyu Li, Yanghong Lin, Shudong Zhou, Kui Yang, Jingru Zhang, Li Fang, Wei Yao
The paper introduces PointVGGT, a zero‑shot framework for multiview RGB‑D point cloud registration that replaces the traditional pairwise‑then‑global pipeline. It employs a foundation‑then‑refinement paradigm, using visual geometry foundation models to directly recover metrically consistent global poses and then refining them with voxelized spatial hashing and IRLS‑based bundle adjustment. Experiments on indoor, object‑centric, and outdoor datasets demonstrate superior registration accuracy and computational efficiency without any training.
By Haobo Jiang, Liang Yu, Jianmin Zheng
XCalib is an unsupervised dense registration framework that aligns thermal and visible video streams by optimizing virtual pinhole camera parameters and predicted monocular depth, thereby restricting spatial displacements to physically valid projection geometries. It introduces a novel registration paradigm using camera parameterization as an implicit regularizer, a robust Normalized Edges Correlation (NEC) metric for cross‑spectral alignment, and demonstrates superior temporal stability and alignment accuracy on public ADAS datasets compared to unconstrained dense flow baselines.
By Aurelien Godet, Gabriel Jobert, Mauro Dalla Mura
LightLoc++ introduces a sensor‑robust framework for outdoor LiDAR localization that decouples a pretrained backbone from lightweight scene‑specific heads, enabling efficient new‑scene training. The authors present SULID, a synchronized urban multi‑LiDAR dataset featuring 32‑, 64‑, and 128‑beam sensors, which is used to pretrain a backbone via cross‑sensor consistency learning. Additional techniques such as sample classification guidance and redundant sample downsampling reduce regression ambiguity and computational load, achieving state‑of‑the‑art performance with minimal new‑scene training cost.
By Wen Li, Shangshu Yu, Dunqiang Liu, Shaoyang Chen, Qiming Xia, Sheng Ao, Siqi Shen, Chenglu Wen, Cheng Wang
arXiv:2506. 22784v2 Announce Type: replace-cross Abstract: Point-pixel registration between LiDAR point clouds and camera images is a fundamental yet challenging task in autonomous driving and robotic perception.
By Yu Han, Zhiwei Huang, Yanting Zhang, Fangjun Ding, Shen Cai, Xiaoyu Tang, Yanchao Dong, Rui Fan
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.
By Chongjian Wang, Junjie Gao
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.
By Zheng Qin, Junhua Xi, Yan Huang, Jiahong Lai, Anwen Huang, Qiong Li, Guangda Zhang, Kai Xu