AI RESEARCH
DC-Reg: Globally Optimal Point Cloud Registration via Tight Bounding with Difference of Convex Programming
arXiv CS.CV
•
ArXi:2603.25442v1 Announce Type: new Achieving globally optimal point cloud registration under partial overlaps and large misalignments remains a fundamental challenge. While simultaneous transformation ($\boldsymbol{\theta}$) and correspondence ($\mathbf{P}$) estimation has the advantage of being robust to nonrigid deformation, its non-convex coupled objective often leads to local minima for heuristic methods and prohibitive convergence times for existing global solvers due to loose lower bounds.