arXiv Computer Vision
Geometry-Constrained Bidirectional Point Cloud Registration for Thin, Sheet-Like Heritage Artifacts
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
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 Computer Vision
Oct 28
SAGE: Semantic-Augmented Geometric Experts for Point Cloud Registration
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 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 27
Robust Single-Parameter Point Cloud Registration using Truncated Lp Functions
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...
arXiv AI
Aug 11
Coarse-to-Fine Registration of Jawbone CT and Intraoral Scan Data Using GeDi and ICP with Pseudo-IOS Ground Truth
arXiv:2608. 07564v1 Announce Type: cross Abstract: In digital dentistry and oral surgery, the registration of jawbone CT and intraoral scanner (IOS) data is essential for integrating internal bone structure with high-resolution dental surface geometry.
arXiv Computer Vision
Sep 30
Context without Commitment: Robust Dense Correspondence under Non-Rigid Deformation
arXiv:2609.37071v1 Announce Type: new Abstract: Non-rigid point-cloud registration aims to find the corresponding target point for each point on a deforming source surface. Point-level matching keeps...