Jensen Janus Nørtoft, Hannemose Morten, Bærentzen J Andreas, Wilm Jakob, Frisvad Jeppe Revall, Dahl Anders Bjorholm
DTU Compute, Technical University of Denmark, 2800 Kgs. Lyngby, Denmark.
SDU Robotics, University of Southern Denmark, 5230 Odense, Denmark.
Sensors (Basel). 2021 Feb 4;21(4):1068. doi: 10.3390/s21041068.
When 3D scanning objects, the objective is usually to obtain a continuous surface. However, most surface scanning methods, such as structured light scanning, yield a point cloud. Obtaining a continuous surface from a point cloud requires a subsequent surface reconstruction step, which is directly affected by any error from the computation of the point cloud. In this work, we propose a one-step approach in which we compute the surface directly from structured light images. Our method minimizes the least-squares error between photographs and renderings of a triangle mesh, where the vertex positions of the mesh are the parameters of the minimization problem. To ensure fast iterations during optimization, we use differentiable rendering, which computes images and gradients in a single pass. We present simulation experiments demonstrating that our method for computing a triangle mesh has several advantages over approaches that rely on an intermediate point cloud. Our method can produce accurate reconstructions when initializing the optimization from a sphere. We also show that our method is good at reconstructing sharp edges and that it is robust with respect to image noise. In addition, our method can improve the output from other reconstruction algorithms if we use these for initialization.
在对物体进行三维扫描时,目标通常是获取一个连续的表面。然而,大多数表面扫描方法,如结构光扫描,会生成一个点云。从点云获取连续表面需要后续的表面重建步骤,这直接受到点云计算中任何误差的影响。在这项工作中,我们提出了一种一步法,即直接从结构光图像计算表面。我们的方法使三角形网格的照片与渲染之间的最小二乘误差最小化,其中网格的顶点位置是最小化问题的参数。为了确保优化过程中的快速迭代,我们使用可微渲染,它在单次遍历中计算图像和梯度。我们进行了模拟实验,证明我们计算三角形网格的方法比依赖中间点云的方法有几个优点。当从球体初始化优化时,我们的方法可以产生准确的重建结果。我们还表明,我们的方法擅长重建尖锐边缘,并且对图像噪声具有鲁棒性。此外,如果我们将其他重建算法用于初始化,我们的方法可以改善其输出结果。