author: | patelojas |

score: | 5 / 10 |

# Core Idea

DeepSDF represents an approach to represent 3D geometries for rendering and reconstruction and is a novel aproach to generative 3D modeling. Given a 2D or partial 3D observation, we wish to reconstruct a 3D model. It is used in robotics, simulations, etc. Other approaches face a similar trade-off across fidelity, efficiency, and compression capabilities. The goal is to maximize these traits or determine an appropriate balance between them. DeepSDF is a learned continuous Signed Distance Function that represents a class of shapes that enables high quality shape representation, interpolation, and completion from partial and noisy 3D input data. It represents a shape’s surface by a continuous volumetric field. It uses the magnitude of a point in the field to represent the distance to the surface boundary and uses the sign to indicate whether the region is inside or outside of the shape. One key advantage of DeepSDF is that it allows the ability to finely represent surface details.

# Difference Between Classical SDF

Classical SDF typically represents the surface of a single shape, but DeepSDF can represent an entire class of shapes. Previous methods include voxel (high memory requirement, point cloud (do not represent the surface) and mesh.

# Technical Implementation

DeepSDF is a continuous shape learning approach. The authors describe modeling shapes as the zero iso-surface decision boundaries of feed-forward networks trained to represent SDFs. They use a signed function, which is a continuous function that outputs a point’s distance to the closest surface who’s sign encodes whether the point is inside or outside of the surface. The surface is represented by SDF(*) = 0. This is used to predict the SDF value of a given query position to then extract the zero level-set surface.

\[SDF(x) = s: x \in R^3, s \in R\]The most direct way to use this approach is to train a single deep network for a given shape. To then generate the 3D model, they use a feed-forward network composed of 8 fully connected layers with dropouts.

However, training a network for each shape is not practical. A better approach is to create a model that can represent a wide variety of shapes in a low dimensional latent space.

Training a network for an individual shape is not practical or helpful. To model a wide variety of shapes, a latent vector z is introduced. It is used as an encoding of the desired shape and is passed in as a second input to the Deep SDF neural network. This vector is essentially mapped to a 3D shape represented by a continuous SDF. We can represent a shape’s approximate SDF as:

\[f_{\theta}(z_{i}, x) = SDF^{i}(x)\]Here, the shape is indexed at i and $f_\theta$ is a function of the latent code $z_i$. x is a 3D query location.

In using latent vectors, we can model multiple SDFs in a single neural network.

# Performance

A number of experiments were conducted to show the representational power of DeepSDF. The metrics were both in terms of its ability to describe geometric details and its generalization capabilitiy to learn a desirable shape embedding space. Four experiments were proposed to test its ability to represent training data, use learned feature representation to reconstruct unseen shapes, apply shape priors to complete partial shapes, and learn smooth and complete shape embedding space from which we can sample new shapes. The ShapeNet dataset was used.

For representing known 3D shapes, the results are shown below. DeepSDF significantly beats OGN and AtlasNet in Chamfer distance.

In representing unknown 3D shapes, DeepSDF again beats AtlasNet. AtlasNet performs well on shapes that have no holes, but struggles with shapes like chairs that have holes.

DeepSDF also produces more visually pleasing and accurate shape reconstructions than other methods.

## TL;DR

- DeepSDF is an adjustment on classical SDF for shape representation and completion
- Can represent complex topologies, closed surfaces, and provide a high quality surface of a normal shape
- Outperforms the applicable benchmarked methods for its tasks