Gradient Distance Function

• URL: http://arxiv.org/abs/2410.22422v1
• Date: Tue, 29 Oct 2024 18:04:01 GMT
• Title: Gradient Distance Function
• Authors: Hieu Le, Federico Stella, Benoit Guillard, Pascal Fua,
• Abstract summary: We show that Gradient Distance Functions (GDFs) can be differentiable at the surface while still being able to represent open surfaces. This is done by associating to each 3D point a 3D vector whose norm is taken to be the unsigned distance to the surface. We demonstrate the effectiveness of GDFs on ShapeNet Car, Multi-Garment, and 3D-Scene datasets.
• Score: 52.615859148238464
• License:
• Abstract: Unsigned Distance Functions (UDFs) can be used to represent non-watertight surfaces in a deep learning framework. However, UDFs tend to be brittle and difficult to learn, in part because the surface is located exactly where the UDF is non-differentiable. In this work, we show that Gradient Distance Functions (GDFs) can remedy this by being differentiable at the surface while still being able to represent open surfaces. This is done by associating to each 3D point a 3D vector whose norm is taken to be the unsigned distance to the surface and whose orientation is taken to be the direction towards the closest surface point. We demonstrate the effectiveness of GDFs on ShapeNet Car, Multi-Garment, and 3D-Scene datasets with both single-shape reconstruction networks or categorical auto-decoders.

Related papers

• Statistical Edge Detection And UDF Learning For Shape Representation [1.9799527196428242]
  We propose a method for learning UDFs that improves the fidelity of the obtained Neural UDF to the original 3D surface. We show that sampling more training points around surface edges allows better local accuracy of the trained Neural UDF. Our method is shown to detect surface edges more accurately than a commonly used local geometric descriptor.
  arXiv  Detail & Related papers  (2024-05-06T11:40:57Z)
• UDiFF: Generating Conditional Unsigned Distance Fields with Optimal Wavelet Diffusion [51.31220416754788]
  We present UDiFF, a 3D diffusion model for unsigned distance fields (UDFs) which is capable to generate textured 3D shapes with open surfaces from text conditions or unconditionally. Our key idea is to generate UDFs in spatial-frequency domain with an optimal wavelet transformation, which produces a compact representation space for UDF generation.
  arXiv  Detail & Related papers  (2024-04-10T09:24:54Z)
• Unsigned Orthogonal Distance Fields: An Accurate Neural Implicit Representation for Diverse 3D Shapes [29.65562721329593]
  In this paper, we introduce a novel neural implicit representation based on unsigned distance fields (UDFs) In UODFs, the minimal unsigned distance from any spatial point to the shape surface is defined solely in one direction, contrasting with the multi-directional determination made by SDF and UDF. We verify the effectiveness of UODFs through a range of reconstruction examples, extending from watertight or non-watertight shapes to complex shapes.
  arXiv  Detail & Related papers  (2024-03-03T06:58:35Z)
• NeuralODF: Learning Omnidirectional Distance Fields for 3D Shape Representation [7.208066405543874]
  In visual computing, 3D geometry is represented in many different forms including meshes, point clouds, voxel grids, level sets, and depth images. We propose Omni Distance Fields (ODFs), a new 3D shape representation that encodes geometry by storing the depth to the object's surface from any 3D position in any viewing direction.
  arXiv  Detail & Related papers  (2022-06-12T20:59:26Z)
• RangeUDF: Semantic Surface Reconstruction from 3D Point Clouds [106.54285912111888]
  We present RangeUDF, a new implicit representation based framework to recover the geometry and semantics of continuous 3D scene surfaces from point clouds. We show that RangeUDF clearly surpasses state-of-the-art approaches for surface reconstruction on four point cloud datasets.
  arXiv  Detail & Related papers  (2022-04-19T21:39:45Z)
• MeshUDF: Fast and Differentiable Meshing of Unsigned Distance Field Networks [68.82901764109685]
  Recent work modelling 3D open surfaces train deep neural networks to approximate Unsigned Distance Fields (UDFs) We propose to directly mesh deep UDFs as open surfaces with an extension of marching cubes, by locally detecting surface crossings. Our method is order of magnitude faster than meshing a dense point cloud, and more accurate than inflating open surfaces.
  arXiv  Detail & Related papers  (2021-11-29T14:24:02Z)
• Learning Anchored Unsigned Distance Functions with Gradient Direction Alignment for Single-view Garment Reconstruction [92.23666036481399]
  We propose a novel learnable Anchored Unsigned Distance Function (AnchorUDF) representation for 3D garment reconstruction from a single image. AnchorUDF represents 3D shapes by predicting unsigned distance fields (UDFs) to enable open garment surface modeling at arbitrary resolution.
  arXiv  Detail & Related papers  (2021-08-19T03:45:38Z)
• 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)
• Neural Unsigned Distance Fields for Implicit Function Learning [53.241423815726925]
  We propose Neural Distance Fields (NDF), a neural network based model which predicts the unsigned distance field for arbitrary 3D shapes. NDF represent surfaces at high resolutions as prior implicit models, but do not require closed surface data. NDF can be used for multi-target regression (multiple outputs for one input) with techniques that have been exclusively used for rendering in graphics.
  arXiv  Detail & Related papers  (2020-10-26T22:49: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.