Deep Confidence Guided Distance for 3D Partial Shape Registration

• URL: http://arxiv.org/abs/2201.11379v1
• Date: Thu, 27 Jan 2022 08:40:05 GMT
• Title: Deep Confidence Guided Distance for 3D Partial Shape Registration
• Authors: Dvir Ginzburg and Dan Raviv
• Abstract summary: We present a novel non-iterative learnable method for partial-to-partial 3D shape registration. We present Confidence Guided Distance Network (CGD-net), where we fuse learnable similarity between point embeddings and spatial distance between point clouds.
• Score: 14.315501760755609
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 clouds, inducing an optimized solution for the overlapping points while ignoring parts that only appear in one of the shapes. The point feature generation is done by a self-supervised architecture that repels far points to have different embeddings, therefore succeeds to align partial views of shapes, even with excessive internal symmetries or acute rotations. We compare our network to recently presented learning-based and axiomatic methods and report a fundamental boost in performance.

Related papers

• Partial-to-Partial Shape Matching with Geometric Consistency [47.46502145377953]
  Finding correspondences between 3D shapes is an important and long-standing problem in computer vision, graphics and beyond. We bridge the gap between existing (rather artificial) 3D full shape matching and partial-to-partial real-world settings by exploiting geometric consistency as a strong constraint. For the first time, we achieve geometric consistency for partial-to-partial matching, which is realized by a novel integer non-linear program formalism building on triangle product spaces.
  arXiv  Detail & Related papers  (2024-04-18T14:14:07Z)
• Geometrically Consistent Partial Shape Matching [50.29468769172704]
  Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics. An often neglected but essential property of matching geometrics is consistency. We propose a novel integer linear programming partial shape matching formulation.
  arXiv  Detail & Related papers  (2023-09-10T12:21:42Z)
• Zero-Shot 3D Shape Correspondence [67.18775201037732]
  We propose a novel zero-shot approach to computing correspondences between 3D shapes. We exploit the exceptional reasoning capabilities of recent foundation models in language and vision. Our approach produces highly plausible results in a zero-shot manner, especially between strongly non-isometric shapes.
  arXiv  Detail & Related papers  (2023-06-05T21:14:23Z)
• Learning a Task-specific Descriptor for Robust Matching of 3D Point Clouds [40.81429160296275]
  We learn a robust task-specific feature descriptor to consistently describe the correct point correspondence under interference. Our method EDFNet develops from two aspects. First, we augment the matchability of correspondences by utilizing their repetitive local structure.
  arXiv  Detail & Related papers  (2022-10-26T17:57:23Z)
• A Representation Separation Perspective to Correspondences-free Unsupervised 3D Point Cloud Registration [40.12490804387776]
  3D point cloud registration in remote sensing field has been greatly advanced by deep learning based methods. We propose a correspondences-free unsupervised point cloud registration (UPCR) method from the representation separation perspective. Our method not only filters out the disturbance in pose-invariant representation but also is robust to partial-to-partial point clouds or noise.
  arXiv  Detail & Related papers  (2022-03-24T17:50:19Z)
• IDEA-Net: Dynamic 3D Point Cloud Interpolation via Deep Embedding Alignment [58.8330387551499]
  We formulate the problem as estimation of point-wise trajectories (i.e., smooth curves) We propose IDEA-Net, an end-to-end deep learning framework, which disentangles the problem under the assistance of the explicitly learned temporal consistency. We demonstrate the effectiveness of our method on various point cloud sequences and observe large improvement over state-of-the-art methods both quantitatively and visually.
  arXiv  Detail & Related papers  (2022-03-22T10:14:08Z)
• Multiway Non-rigid Point Cloud Registration via Learned Functional Map Synchronization [105.14877281665011]
  We present SyNoRiM, a novel way to register multiple non-rigid shapes by synchronizing the maps relating learned functions defined on the point clouds. We demonstrate via extensive experiments that our method achieves a state-of-the-art performance in registration accuracy.
  arXiv  Detail & Related papers  (2021-11-25T02:37:59Z)
• PointDSC: Robust Point Cloud Registration using Deep Spatial Consistency [38.93610732090426]
  We present PointDSC, a novel deep neural network that explicitly incorporates spatial consistency for pruning outlier correspondences. Our method outperforms the state-of-the-art hand-crafted and learning-based outlier rejection approaches on several real-world datasets.
  arXiv  Detail & Related papers  (2021-03-09T14:56:08Z)
• A Rotation-Invariant Framework for Deep Point Cloud Analysis [132.91915346157018]
  We introduce a new low-level purely rotation-invariant representation to replace common 3D Cartesian coordinates as the network inputs. Also, we present a network architecture to embed these representations into features, encoding local relations between points and their neighbors, and the global shape structure. We evaluate our method on multiple point cloud analysis tasks, including shape classification, part segmentation, and shape retrieval.
  arXiv  Detail & Related papers  (2020-03-16T14:04:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.