Deep Confidence Guided Distance for 3D Partial Shape Registration
Dvir Ginzburg, Dan Raviv

TL;DR
This paper introduces CGD-net, a learnable, non-iterative method for partial 3D shape registration that effectively handles severe occlusions and outliers by combining point embeddings and spatial distances.
Contribution
The paper proposes a novel Confidence Guided Distance Network that fuses learnable similarity and spatial distance for robust partial shape registration, outperforming existing methods.
Findings
Significant performance improvement over recent methods.
Effective alignment even with severe occlusions and symmetries.
Robust to internal symmetries and acute rotations.
Abstract
We present a novel non-iterative learnable method for partial-to-partial 3D shape registration. The partial alignment task is extremely complex, as it jointly tries to match between points and identify which points do not appear in the corresponding shape, causing the solution to be non-unique and ill-posed in most cases. Until now, two principal methodologies have been suggested to solve this problem: sample a subset of points that are likely to have correspondences or perform soft alignment between the point clouds and try to avoid a match to an occluded part. These heuristics work when the partiality is mild or when the transformation is small but fails for severe occlusions or when outliers are present. We present a unique approach named Confidence Guided Distance Network (CGD-net), where we fuse learnable similarity between point embeddings and spatial distance between point…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
Topics3D Shape Modeling and Analysis · Image Processing and 3D Reconstruction · Robotics and Sensor-Based Localization
