GS-Matching: Reconsidering Feature Matching task in Point Cloud Registration
원문 초록
Traditional point cloud registration (PCR) methods for feature matching often employ the nearest neighbor policy. This leads to many-to-one matches and numerous potential inliers without any corresponding point. Recently, some approaches have framed the feature matching task as an assignment problem to achieve optimal one-to-one matches. We argue that the transition to the Assignment problem is not reliable for general correspondence-based PCR. In this paper, we propose a heuristics stable matching policy called GS-matching, inspired by the Gale-Shapley algorithm. Compared to the other matching policies, our method can perform efficiently and find more non-repetitive inliers under low overlapping conditions. Furthermore, we employ the probability theory to analyze the feature matching task, providing new insights into this research problem. Extensive experiments validate the effectiveness of our matching policy, achieving better registration recall on multiple datasets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.