3PSDF: Three-Pole Signed Distance Function for Learning Surfaces with Arbitrary Topologies

• URL: http://arxiv.org/abs/2205.15572v1
• Date: Tue, 31 May 2022 07:24:04 GMT
• Title: 3PSDF: Three-Pole Signed Distance Function for Learning Surfaces with Arbitrary Topologies
• Authors: Weikai Chen, Cheng Lin, Weiyang Li, Bo Yang
• Abstract summary: We present a novel learnable implicit representation called the three-pole signed distance function (3PSDF) It can represent non-watertight 3D shapes with arbitrary topologies while supporting easy field-to-mesh conversion. We propose a dedicated learning framework to effectively learn 3PSDF without worrying about the vanishing gradient due to the null labels.
• Score: 18.609959464825636
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent advances in learning 3D shapes using neural implicit functions have achieved impressive results by breaking the previous barrier of resolution and diversity for varying topologies. However, most of such approaches are limited to closed surfaces as they require the space to be divided into inside and outside. More recent works based on unsigned distance function have been proposed to handle complex geometry containing both the open and closed surfaces. Nonetheless, as their direct outputs are point clouds, robustly obtaining high-quality meshing results from discrete points remains an open question. We present a novel learnable implicit representation, called the three-pole signed distance function (3PSDF), that can represent non-watertight 3D shapes with arbitrary topologies while supporting easy field-to-mesh conversion using the classic Marching Cubes algorithm. The key to our method is the introduction of a new sign, the NULL sign, in addition to the conventional in and out labels. The existence of the null sign could stop the formation of a closed isosurface derived from the bisector of the in/out regions. Further, we propose a dedicated learning framework to effectively learn 3PSDF without worrying about the vanishing gradient due to the null labels. Experimental results show that our approach outperforms the previous state-of-the-art methods in a wide range of benchmarks both quantitatively and qualitatively.

Related papers

• Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds [34.774577477968805]
  We propose a novel non-linear implicit filter to smooth the implicit field while preserving geometry details. Our novelty lies in that we can filter the surface (zero level set) by the neighbor input points with gradients of the signed distance field. By moving the input raw point clouds along the gradient, our proposed implicit filtering can be extended to non-zero level sets.
  arXiv  Detail & Related papers  (2024-07-18T09:40:24Z)
• Unsupervised Occupancy Learning from Sparse Point Cloud [8.732260277121547]
  Implicit Neural Representations have gained prominence as a powerful framework for capturing complex data modalities. In this paper, we propose a method to infer occupancy fields instead of Neural Signed Distance Functions. We highlight its capacity to improve implicit shape inference with respect to baselines and the state-of-the-art using synthetic and real data.
  arXiv  Detail & Related papers  (2024-04-03T14:05:39Z)
• Neural Vector Fields: Implicit Representation by Explicit Learning [63.337294707047036]
  We propose a novel 3D representation method, Neural Vector Fields (NVF) It not only adopts the explicit learning process to manipulate meshes directly, but also the implicit representation of unsigned distance functions (UDFs) Our method first predicts displacement queries towards the surface and models shapes as text reconstructions.
  arXiv  Detail & Related papers  (2023-03-08T02:36:09Z)
• GeoUDF: Surface Reconstruction from 3D Point Clouds via Geometry-guided Distance Representation [73.77505964222632]
  We present a learning-based method, namely GeoUDF, to tackle the problem of reconstructing a discrete surface from a sparse point cloud. To be specific, we propose a geometry-guided learning method for UDF and its gradient estimation. To extract triangle meshes from the predicted UDF, we propose a customized edge-based marching cube module.
  arXiv  Detail & Related papers  (2022-11-30T06:02:01Z)
• NeuralUDF: Learning Unsigned Distance Fields for Multi-view Reconstruction of Surfaces with Arbitrary Topologies [87.06532943371575]
  We present a novel method, called NeuralUDF, for reconstructing surfaces with arbitrary topologies from 2D images via volume rendering. In this paper, we propose to represent surfaces as the Unsigned Distance Function (UDF) and develop a new volume rendering scheme to learn the neural UDF representation.
  arXiv  Detail & Related papers  (2022-11-25T15:21:45Z)
• CAP-UDF: Learning Unsigned Distance Functions Progressively from Raw Point Clouds with Consistency-Aware Field Optimization [54.69408516025872]
  CAP-UDF is a novel method to learn consistency-aware UDF from raw point clouds. We train a neural network to gradually infer the relationship between queries and the approximated surface. We also introduce a polygonization algorithm to extract surfaces using the gradients of the learned UDF.
  arXiv  Detail & Related papers  (2022-10-06T08:51:08Z)
• Deep Implicit Surface Point Prediction Networks [49.286550880464866]
  Deep neural representations of 3D shapes as implicit functions have been shown to produce high fidelity models. This paper presents a novel approach that models such surfaces using a new class of implicit representations called the closest surface-point (CSP) representation.
  arXiv  Detail & Related papers  (2021-06-10T14:31:54Z)
• Neural-Pull: Learning Signed Distance Functions from Point Clouds by Learning to Pull Space onto Surfaces [68.12457459590921]
  Reconstructing continuous surfaces from 3D point clouds is a fundamental operation in 3D geometry processing. We introduce textitNeural-Pull, a new approach that is simple and leads to high quality SDFs.
  arXiv  Detail & Related papers  (2020-11-26T23:18:10Z)
• DUDE: Deep Unsigned Distance Embeddings for Hi-Fidelity Representation of Complex 3D Surfaces [8.104199886760275]
  DUDE is a disentangled shape representation that utilizes an unsigned distance field (uDF) to represent proximity to a surface, and a normal vector field (nVF) to represent surface orientation. We show that a combination of these two (uDF+nVF) can be used to learn high fidelity representations for arbitrary open/closed shapes.
  arXiv  Detail & Related papers  (2020-11-04T22:49:05Z)

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.