论文标题
Shapeassembly:学习为3D形状结构合成生成程序
ShapeAssembly: Learning to Generate Programs for 3D Shape Structure Synthesis
论文作者
论文摘要
手动创作3D形状是困难且耗时的。 3D形状的生成模型提供了引人注目的替代方案。程序表示是一种可能性:它们提供高质量且可编辑的结果,但很难撰写,并且经常产生多样性有限的产出。在另一个极端上是深层生成模型:鉴于足够的数据,他们可以学会生成任何类别的形状,但是它们的输出具有人工制品,并且表示不可编辑。在本文中,我们朝着实现新颖的3D形状合成的两全其美迈出了一步。我们提出了ShapeSembly,这是一种针对3D形状结构的特定领域的“组装”。 Shapeassembly程序通过宣布Cuboid Part代理并以分层和对称的方式将它们互相构建形状。它的功能通过自由变量进行参数化,以便一个程序结构能够捕获相关形状的家族。我们展示了如何从Partnet数据集中的现有形状结构中提取Shapeassembly程序。然后,我们训练一个深层生成模型,即层次序列VAE,该模型学会了编写新颖的Shapeassembly程序。该程序捕获了可解释和可编辑的可变性子集。深层模型捕获了很难在程序上表达的形状集合之间的相关性。我们通过将生成程序与其他最新形状结构合成模型的形状输出进行比较来评估我们的方法。我们发现,与其他方法相比,我们的生成的形状更合理和物理。此外,我们评估了这些模型的潜在空间,并发现我们的结构更好,并产生更顺畅的插值。作为一个应用程序,我们使用生成模型和可区分的程序解释器来推断和拟合形状程序,以将其定为非结构化的几何形状,例如点云。
Manually authoring 3D shapes is difficult and time consuming; generative models of 3D shapes offer compelling alternatives. Procedural representations are one such possibility: they offer high-quality and editable results but are difficult to author and often produce outputs with limited diversity. On the other extreme are deep generative models: given enough data, they can learn to generate any class of shape but their outputs have artifacts and the representation is not editable. In this paper, we take a step towards achieving the best of both worlds for novel 3D shape synthesis. We propose ShapeAssembly, a domain-specific "assembly-language" for 3D shape structures. ShapeAssembly programs construct shapes by declaring cuboid part proxies and attaching them to one another, in a hierarchical and symmetrical fashion. Its functions are parameterized with free variables, so that one program structure is able to capture a family of related shapes. We show how to extract ShapeAssembly programs from existing shape structures in the PartNet dataset. Then we train a deep generative model, a hierarchical sequence VAE, that learns to write novel ShapeAssembly programs. The program captures the subset of variability that is interpretable and editable. The deep model captures correlations across shape collections that are hard to express procedurally. We evaluate our approach by comparing shapes output by our generated programs to those from other recent shape structure synthesis models. We find that our generated shapes are more plausible and physically-valid than those of other methods. Additionally, we assess the latent spaces of these models, and find that ours is better structured and produces smoother interpolations. As an application, we use our generative model and differentiable program interpreter to infer and fit shape programs to unstructured geometry, such as point clouds.