arXiv Computer Vision
Robust Single-Parameter Point Cloud Registration using Truncated Lp Functions
Read the original on arXiv Computer Vision →The Flow has not summarised this story yet — read it at arXiv Computer Vision.
Related stories
arXiv Computer Vision
Sep 23
PARTE: Plane-Assisted Robust Transformation Estimation for Point Cloud Registration
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 Computer Vision
Sep 14
Spectral Consistency-Guided Multiview Point Cloud Registration for Low-Overlap Scenes
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 Computer Vision
Oct 22
Register Anything Model for Generalizable and Robust Point Cloud Registration
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.
arXiv Machine Learning
Jun 29
Scalable and Differentiable Point-Cloud Registration Using Maximum Mean Discrepancy
arXiv:2606. 27818v1 Announce Type: cross Abstract: We present MMD-Reg, a novel correspondence-free approach to point-cloud registration that is differentiable and has linear computational complexity in the number of points.
arXiv Computer Vision
Aug 31
Ex-Sim(3)-Reg: 2D-3D Correspondence Pruning via Extended Sim(3) Registration
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.
arXiv AI
Jun 10
Generalized-CVO: Fast and Correspondence-Free Local Point Cloud Registration with Second Order Riemannian Optimization
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.