We introduce anchored radial observations (ARO), a novel shape encoding for learning neural field representation of shapes that is category-agnostic and generalizable amid significant shape variations. The main idea behind our work is to reason about shapes through partial observations from a set of viewpoints, called anchors. We develop a general and unified shape representation by employing a fixed set of anchors, via Fibonacci sampling, and designing a coordinate-based deep neural network to predict the occupancy value of a query point in space. Differently from prior neural implicit models, that use global shape feature, our shape encoder operates on contextual, query-specific features. To predict point occupancy, locally observed shape information from the perspective of the anchors surrounding the input query point are encoded and aggregated through an attention module, before implicit decoding is performed. We demonstrate the quality and generality of our network, coined ARO-Net, on surface reconstruction from sparse point clouds, with tests on novel and unseen object categories, "one-shape" training, and comparisons to state-of-the-art neural and classical methods for reconstruction and tessellation.

Training parts from ShapeNet. (b) t-SNE plot of part embeddings. (c) Reconstructing entire scenes with Local Implicit Grids Figure 1:We learn an embedding of parts from objects in ShapeNet [3] using a part autoencoder with an implicit decoder. We show that this representation of parts is generalizable across object categories, and easily scalable to large scenes. By localizing implicit functions in a grid, we are able to reconstruct entire scenes from points via optimization of the latent grid.

We advocate the use of implicit fields for learning generative models of shapes and introduce an implicit field decoder, called IM-NET, for shape generation, aimed at improving the visual quality of the generated shapes. An implicit field assigns a value to each point in 3D space, so that a shape can be extracted as an iso-surface. IM-NET is trained to perform this assignment by means of a binary classifier. Specifically, it takes a point coordinate, along with a feature vector encoding a shape, and outputs a value which indicates whether the point is outside the shape or not. By replacing conventional decoders by our implicit decoder for representation learning (via IM-AE) and shape generation (via IM-GAN), we demonstrate superior results for tasks such as generative shape modeling, interpolation, and single-view 3D reconstruction, particularly in terms of visual quality. Code and supplementary material are available at https://github.com/czq142857/implicit-decoder.

Figure 1. This paper introduces Local Deep Implicit Functions, a 3D shape representation that decomposes an input shape (mesh on left in every triplet) into a structured set of shape elements (colored ellipses on right) whose contributions to an implicit surface reconstruction (middle) are represented by latent vectors decoded by a deep network. Project video and website at ldif.cs.princeton.edu.

我们呈现神经内核字段：一种基于学习内核回归重建隐式3D形状的新方法。我们的技术在重建3D对象和稀疏导向点的大型场景时，我们的技术实现了最先进的结果，并且可以在训练组外重建形状类别，几乎没有准确度。我们的方法的核心介绍是，当所选内核具有适当的感应偏压时，内核方法对于重建形状非常有效。因此，我们将形状重建问题分为两部分：（1）骨干神经网络从数据中学习内核参数，（2）通过求解一个简单的正面的正定方法，该骨架ridge回归拟合输入点。使用学习内核的线性系统。由于这种分解，我们的重建在稀疏点密度下获得了数据驱动方法的益处，同时保持了与地面真理形状收敛的插值行为，因为输入采样密度增加。我们的实验表明了在列车集类别之外的对象和扫描场景的强大概括能力。源代码和预磨料模型可在https://nv-tlabs.github.io/nkf上获得。

在本文中，我们提出了一种新的点云表示。与传统点云表示不同，其中每个点仅表示3D空间中的位置或局部平面，神经点中的每个点通过神经领域表示局部连续几何形状。因此，神经点可以表达更复杂的细节，因此具有更强的表示能力。具有含有丰富的几何细节的高分辨率表面培训神经点，使得训练模型具有足够的各种形状的表达能力。具体地，我们通过2D参数域和3D本地补丁之间的局部同构来提取点上的深度局部特征并通过局部同构构造神经字段。在决赛中，局部神经领域集成在一起以形成全局表面。实验结果表明，神经点具有强大的代表能力，展示了优异的鲁棒性和泛化能力。通过神经点，我们可以用任意分辨率重新采样点云，并优于最先进的点云上采样方法，通过大边距。

在视觉计算中，3D几何形状以许多不同的形式表示，包括网格，点云，体素电网，水平集和深度图像。每个表示都适用于不同的任务，从而使一个表示形式转换为另一个表示（前向地图）是一个重要且常见的问题。我们提出了全向距离字段（ODF），这是一种新的3D形状表示形式，该表示通过将深度从任何观看方向从任何3D位置存储到对象的表面来编码几何形状。由于射线是ODF的基本单元，因此可以轻松地从通用的3D表示和点云等常见的3D表示。与限制代表封闭表面的水平集方法不同，ODF是未签名的，因此可以对开放表面进行建模（例如服装）。我们证明，尽管在遮挡边界处存在固有的不连续性，但可以通过神经网络（Neururodf）有效地学习ODF。我们还引入了有效的前向映射算法，以转换odf to＆从常见的3D表示。具体而言，我们引入了一种有效的跳跃立方体算法，用于从ODF生成网格。实验表明，神经模型可以通过过度拟合单个对象学会学会捕获高质量的形状，并学会概括对共同的形状类别。

隐式神经网络已成功用于点云的表面重建。然而，它们中的许多人面临着可扩展性问题，因为它们将整个对象或场景的异构面功能编码为单个潜在载体。为了克服这种限制，一些方法在粗略普通的3D网格或3D补丁上推断潜伏向量，并将它们插入以应对占用查询。在这样做时，它们可以与对象表面上采样的输入点进行直接连接，并且它们在空间中均匀地附加信息，而不是其最重要的信息，即在表面附近。此外，依赖于固定的补丁大小可能需要离散化调整。要解决这些问题，我们建议使用点云卷积并计算每个输入点的潜伏向量。然后，我们使用推断的权重在最近的邻居上执行基于学习的插值。对象和场景数据集的实验表明，我们的方法在大多数古典指标上显着优于其他方法，产生更精细的细节和更好的重建更薄的卷。代码可在https://github.com/valeoai/poco获得。

最近对隐含形状表示的兴趣日益增长。与明确的陈述相反，他们没有解决局限性，他们很容易处理各种各样的表面拓扑。为了了解这些隐式表示，电流方法依赖于一定程度的形状监督（例如，内部/外部信息或距离形状知识），或者至少需要密集点云（以近似距离 - 到 - 到 - 形状）。相比之下，我们介绍{\方法}，一种用于学习形状表示的自我监督方法，从可能极其稀疏的点云。就像在水牛的针问题一样，我们在点云上“掉落”（样本）针头，认为，静统计地靠近表面，针端点位于表面的相对侧。不需要形状知识，点云可以高稀疏，例如，作为车辆获取的Lidar点云。以前的自我监督形状表示方法未能在这种数据上产生良好的结果。我们获得定量结果与现有的形状重建数据集上现有的监督方法标准，并在Kitti等硬自动驾驶数据集中显示有前途的定性结果。

表面重建是3D图形的基本问题。在本文中，我们提出了一种基于学习的基于云层云层的隐式表面重建的方法，没有正常。我们的方法是在潜在的能源理论中受到高斯引理的启发，这为指标功能提供了明确的整体公式。我们设计一个新颖的深神经网络，以执行表面积分，并从未定向和嘈杂的点云学习修改的指示灯。我们连接具有不同尺度的特征，以便准确地对整数的贡献。此外，我们提出了一种新颖的表面元件特征提取器来学习局部形状特性。实验表明，我们的方法从具有不同噪声尺度的点云的点云产生具有高正常一致性的平滑表面，并与当前的数据驱动和非数据驱动的方法相比，实现了最先进的重建性能。

本地化隐式功能的最新进展使神经隐式表示能够可扩展到大型场景。然而，这些方法采用的3D空间的定期细分未能考虑到表面占用的稀疏性和几何细节的变化粒度。结果，其内存占地面积与输入体积均别较大，即使在适度密集的分解中也导致禁止的计算成本。在这项工作中，我们为3D表面，编码OCTFIELD提供了一种学习的分层隐式表示，允许具有低内存和计算预算的复杂曲面的高精度编码。我们方法的关键是仅在感兴趣的表面周围分发本地隐式功能的3D场景的自适应分解。我们通过引入分层Octree结构来实现这一目标，以根据表面占用和部件几何形状的丰富度自适应地细分3D空间。随着八十六是离散和不可分辨性的，我们进一步提出了一种新颖的等级网络，其模拟八偏细胞的细分作为概率的过程，并以可差的方式递归地编码和解码八叠结构和表面几何形状。我们展示了Octfield的一系列形状建模和重建任务的价值，显示出在替代方法方面的优越性。

The recent neural implicit representation-based methods have greatly advanced the state of the art for solving the long-standing and challenging problem of reconstructing a discrete surface from a sparse point cloud. These methods generally learn either a binary occupancy or signed/unsigned distance field (SDF/UDF) as surface representation. However, all the existing SDF/UDF-based methods use neural networks to implicitly regress the distance in a purely data-driven manner, thus limiting the accuracy and generalizability to some extent. In contrast, we propose the first geometry-guided method for UDF and its gradient estimation that explicitly formulates the unsigned distance of a query point as the learnable affine averaging of its distances to the tangent planes of neighbouring points. Besides, we model the local geometric structure of the input point clouds by explicitly learning a quadratic polynomial for each point. This not only facilitates upsampling the input sparse point cloud but also naturally induces unoriented normal, which further augments UDF estimation. Finally, to extract triangle meshes from the predicted UDF we propose a customized edge-based marching cube module. We conduct extensive experiments and ablation studies to demonstrate the significant advantages of our method over state-of-the-art methods in terms of reconstruction accuracy, efficiency, and generalizability. The source code is publicly available at https://github.com/rsy6318/GeoUDF.

从嘈杂，不均匀和无知点云中的表面重建是计算机视觉和图形中的一个令人迷人但具有挑战性的问题。随着3D扫描技术的创新，强烈希望直接转换原始扫描数据，通常具有严重噪声，进入歧管三角网格。现有的基于学习的方法旨在学习零级曲面对底层形状进行的隐式功能。然而，大多数人都无法获得嘈杂和稀疏点云的理想结果，限制在实践中。在本文中，我们介绍了神经IML，一种新的方法，它直接从未引起的原始点云学习抗噪声符号距离功能（SDF）。通过最大限度地减少由隐式移动最小二乘函数获得的损耗，我们的方法通过最小化了自我监督的方式，从原始点云中从原始点云中的底层SDF，而不是明确地学习前提。 （IML）和我们的神经网络另一个，我们的预测器的梯度定义了便于计算IML的切线束。我们证明，当几个SDFS重合时，我们的神经网络可以预测符号隐式功能，其零电平集用作底层表面的良好近似。我们对各种基准进行广泛的实验，包括合成扫描和现实世界扫描，以表现出从各种投入重建忠实形状的能力，特别是对于具有噪音或间隙的点云。

Figure 1: DeepSDF represents signed distance functions (SDFs) of shapes via latent code-conditioned feed-forward decoder networks. Above images are raycast renderings of DeepSDF interpolating between two shapes in the learned shape latent space. Best viewed digitally.

Intelligent mesh generation (IMG) refers to a technique to generate mesh by machine learning, which is a relatively new and promising research field. Within its short life span, IMG has greatly expanded the generalizability and practicality of mesh generation techniques and brought many breakthroughs and potential possibilities for mesh generation. However, there is a lack of surveys focusing on IMG methods covering recent works. In this paper, we are committed to a systematic and comprehensive survey describing the contemporary IMG landscape. Focusing on 110 preliminary IMG methods, we conducted an in-depth analysis and evaluation from multiple perspectives, including the core technique and application scope of the algorithm, agent learning goals, data types, targeting challenges, advantages and limitations. With the aim of literature collection and classification based on content extraction, we propose three different taxonomies from three views of key technique, output mesh unit element, and applicable input data types. Finally, we highlight some promising future research directions and challenges in IMG. To maximize the convenience of readers, a project page of IMG is provided at \url{https://github.com/xzb030/IMG_Survey}.

Implicit fields have been very effective to represent and learn 3D shapes accurately. Signed distance fields and occupancy fields are the preferred representations, both with well-studied properties, despite their restriction to closed surfaces. Several other variations and training principles have been proposed with the goal to represent all classes of shapes. In this paper, we develop a novel and yet fundamental representation by considering the unit vector field defined on 3D space: at each point in $\mathbb{R}^3$ the vector points to the closest point on the surface. We theoretically demonstrate that this vector field can be easily transformed to surface density by applying the vector field divergence. Unlike other standard representations, it directly encodes an important physical property of the surface, which is the surface normal. We further show the advantages of our vector field representation, specifically in learning general (open, closed, or multi-layered) surfaces as well as piecewise planar surfaces. We compare our method on several datasets including ShapeNet where the proposed new neural implicit field shows superior accuracy in representing any type of shape, outperforming other standard methods. The code will be released at https://github.com/edomel/ImplicitVF

This work introduces alternating latent topologies (ALTO) for high-fidelity reconstruction of implicit 3D surfaces from noisy point clouds. Previous work identifies that the spatial arrangement of latent encodings is important to recover detail. One school of thought is to encode a latent vector for each point (point latents). Another school of thought is to project point latents into a grid (grid latents) which could be a voxel grid or triplane grid. Each school of thought has tradeoffs. Grid latents are coarse and lose high-frequency detail. In contrast, point latents preserve detail. However, point latents are more difficult to decode into a surface, and quality and runtime suffer. In this paper, we propose ALTO to sequentially alternate between geometric representations, before converging to an easy-to-decode latent. We find that this preserves spatial expressiveness and makes decoding lightweight. We validate ALTO on implicit 3D recovery and observe not only a performance improvement over the state-of-the-art, but a runtime improvement of 3-10$\times$. Project website at https://visual.ee.ucla.edu/alto.htm/.

神经隐式功能的最新发展已在高质量的3D形状重建方面表现出巨大的成功。但是，大多数作品将空间分为形状的内部和外部，从而将其代表力量限制为单层和水密形状。这种局限性导致乏味的数据处理（将非紧密的原始数据转换为水密度），以及代表现实世界中一般对象形状的无能。在这项工作中，我们提出了一种新颖的方法来表示一般形状，包括具有多层表面的非水平形状和形状。我们介绍了3D形状（GIF）的一般隐式函数，该功能建模了每两个点之间的关系，而不是点和表面之间的关系。 GIF没有将3D空间分为预定义的内部区域，而是编码是否将两个点分开。 Shapenet上的实验表明，在重建质量，渲染效率和视觉保真度方面，GIF的表现优于先前的最先进方法。项目页面可从https://jianglongye.com/gifs获得。