paper-with-me

Papers

SG-PGM: Partial Graph Matching Network with Semantic Geometric Fusion for 3D Scene Graph Alignment and Its Downstream Tasks

2024-03-28 · CVPR 2024 1 · Yaxu Xie, Alain Pagani, Didier Stricker

Scene graphs have been recently introduced into 3D spatial understanding as a comprehensive representation of the scene. The alignment between 3D scene graphs is the first step of many downstream tasks such as scene graph aided point cloud registration, mosaicking, overlap checking, and robot navigation. In this work, we treat 3D scene graph alignment as a partial graph-matching problem and propose to solve it with a graph neural network. We reuse the geometric features learned by a point cloud registration method and associate the clustered point-level geometric features with the node-level semantic feature via our designed feature fusion module. Partial matching is enabled by using a learnable method to select the top-k similar node pairs. Subsequent downstream tasks such as point cloud registration are achieved by running a pre-trained registration network within the matched regions. We further propose a point-matching rescoring method, that uses the node-wise alignment of the 3D scene graph to reweight the matching candidates from a pre-trained point cloud registration method. It reduces the false point correspondences estimated especially in low-overlapping cases. Experiments show that our method improves the alignment accuracy by 10~20% in low-overlap and random transformation scenarios and outperforms the existing work in multiple downstream tasks.

📄 PDF Abstract BibTeX arXiv:2403.19474

Code (1)

dfki-av/sg-pgm 공식 구현 pytorch

Tasks

3D Scene Graph AlignmentGraph MatchingGraph Neural NetworkPoint Cloud RegistrationRobot Navigation

Similar Papers 제목 키워드 기반

Partial-to-Partial Shape Matching with Geometric Consistency

2024-04-18 · CVPR 2024 1 · Viktoria Ehm, Maolin Gao, Paul Roetzer, Marvin Eisenberger 외

Finding correspondences between 3D shapes is an important and long-standing problem in computer vision, graphics and beyond. A prominent challenge are partial-to-partial shape matching settings, which occur when the shap…

Geometrically Consistent Partial Shape Matching

2023-09-10 · Viktoria Ehm, Paul Roetzer, Marvin Eisenberger, Maolin Gao 외

Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but…

Pose Transfer

Universe Points Representation Learning for Partial Multi-Graph Matching

2022-12-01 · Zhakshylyk Nurlanov, Frank R. Schmidt, Florian Bernard

Many challenges from natural world can be formulated as a graph matching problem. Previous deep learning-based methods mainly consider a full two-graph matching setting. In this work, we study the more general partial ma…

Deep LearningGraph MatchingRepresentation Learning

Deep Semantic Graph Matching for Large-scale Outdoor Point Clouds Registration

2023-08-10 · Shaocong Liu, Tao Wang, Yan Zhang, Ruqin Zhou 외

Current point cloud registration methods are mainly based on local geometric information and usually ignore the semantic information contained in the scenes. In this paper, we treat the point cloud registration problem a…

Graph MatchingPoint Cloud RegistrationSemantic Segmentation

iMatcher: Improve matching in point cloud registration via local-to-global geometric consistency learning

2025-09-10 · Karim Slimani, Catherine Achard, Brahim Tamadazte arxiv

This paper presents iMatcher, a fully differentiable framework for feature matching in point cloud registration. The proposed method leverages learned features to predict a geometrically consistent confidence matrix, inc…

Point Cloud RegistrationGraph EmbeddingPose Estimation