CLIPPER: Robust Data Association without an Initial Guess
원문 초록
Identifying correspondences in noisy data is a critically important step in estimation processes. When an informative initial estimation guess is available, the data association challenge is less acute; however, the existence of a high-quality initial guess is rare in most contexts. We explore graph-theoretic formulations for data association, which do not require an initial estimation guess. Existing graph-theoretic approaches optimize over unweighted graphs, discarding important consistency information encoded in weighted edges, and frequently attempt to solve NP-hard problems exactly. In contrast, we formulate a new optimization problem that fully leverages weighted graphs and seeks the densest edge-weighted clique. We introduce two relaxations to this problem: a convex semidefinite relaxation which we find to be empirically tight, and a fast first-order algorithm called CLIPPER which frequently arrives at nearly-optimal solutions in milliseconds. When evaluated on point cloud registration problems, our algorithms remain robust up to at least 95% outliers while existing algorithms begin breaking down at 80% outliers. Code is available at https://mit-acl.github.io/clipper.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Cross-modal feature fusion for robust point cloud registration with ambiguous geometry
Registration of 3D Point Sets Using Exponential-based Similarity Matrix
Matching Distance and Geometric Distribution Aided Learning Multiview Point Cloud Registration
ColabSfM: Collaborative Structure-from-Motion by Point Cloud Registration
Unlocking Generalization Power in LiDAR Point Cloud Registration
BUFFER-X: Towards Zero-Shot Point Cloud Registration in Diverse Scenes
토론
이 논문과 연결된 포럼 글이 아직 없습니다.