skip to main content

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Thursday, February 13 until 2:00 AM ET on Friday, February 14 due to maintenance. We apologize for the inconvenience.


Title: Poisson Surface Reconstruction with Envelope Constraints
Abstract

Reconstructing surfaces from scanned 3D points has been an important research area for several decades. One common approach that has proven efficient and robust to noise is implicit surface reconstruction, i.e. fitting to the points a 3D scalar function (such as an indicator function or signed‐distance field) and then extracting an isosurface. Though many techniques fall within this category, existing methods either impose no boundary constraints or impose Dirichlet/Neumann conditions on the surface of a bounding box containing the scanned data.

In this work, we demonstrate the benefit of supporting Dirichlet constraints on a general boundary. To this end, we adapt the Screened Poisson Reconstruction algorithm to input a constraint envelope in addition to the oriented point cloud. We impose Dirichlet boundary conditions, forcing the reconstructed implicit function to be zero outside this constraint surface. Using a visual hull and/or depth hull derived from RGB‐D scans to define the constraint envelope, we obtain substantially improved surface reconstructions in regions of missing data.

 
more » « less
PAR ID:
10183573
Author(s) / Creator(s):
 ;  ;  ;  
Publisher / Repository:
Wiley-Blackwell
Date Published:
Journal Name:
Computer Graphics Forum
Volume:
39
Issue:
5
ISSN:
0167-7055
Page Range / eLocation ID:
p. 173-182
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We consider a model of congestion dynamics with chemotaxis, where the density of cells follows the chemical signal it generates, while observing an incompressibility constraint (incompressible parabolic-elliptic Patlak-Keller-Segel model). We show that when the chemical diffuses slowly and attracts the cells strongly, then the dynamics of the congested cells is well approximated by a surface-tension driven free boundary problem. More precisely, we rigorously establish the convergence of the solution to the characteristic function of a set whose evolution is determined by the classical Hele-Shaw free boundary problem with surface tension.

    The problem is set in a bounded domain, which leads to an interesting analysis on the limiting boundary conditions. Namely, we prove that the assumption of Robin boundary conditions for the chemical potential leads to a contact angle condition for the free interface (in particular Neumann boundary conditions lead to an orthogonal contact angle condition, while Dirichlet boundary conditions lead to a tangential contact angle condition).

     
    more » « less
  2. We present Neural Kernel Fields: a novel method for reconstructing implicit 3D shapes based on a learned kernel ridge regression. Our technique achieves state-of-the-art results when reconstructing 3D objects and large scenes from sparse oriented points, and can reconstruct shape categories outside the training set with almost no drop in accuracy. The core insight of our approach is that kernel methods are extremely effective for reconstructing shapes when the chosen kernel has an appropriate inductive bias. We thus factor the problem of shape reconstruction into two parts: (1) a backbone neural network which learns kernel parameters from data, and (2) a kernel ridge regression that fits the input points on-the-fly by solving a simple positive definite linear system using the learned kernel. As a result of this factorization, our reconstruction gains the benefits of datadriven methods under sparse point density while maintaining interpolatory behavior, which converges to the ground truth shape as input sampling density increases. Our experiments demonstrate a strong generalization capability to objects outside the train-set category and scanned scenes. Source code and pretrained models are available at https:// nv-tlabs.github.io/nkf. 
    more » « less
  3. Purpose

    Wave‐CAIPI is a novel acquisition approach that enables highly accelerated 3D imaging. This paper investigates the combination of Wave‐CAIPI with LORAKS‐based reconstruction (Wave‐LORAKS) to enable even further acceleration.

    Methods

    LORAKS is a constrained image reconstruction framework that can impose spatial support, smooth phase, sparsity, and/or parallel imaging constraints. LORAKS requires minimal prior information, and instead uses the low‐rank subspace structure of the raw data to automatically learn which constraints to impose and how to impose them. Previous LORAKS implementations addressed 2D image reconstruction problems. In this work, several recent advances in structured low‐rank matrix recovery were combined to enable large‐scale 3D Wave‐LORAKS reconstruction with improved quality and computational efficiency. Wave‐LORAKS was investigated by retrospective subsampling of two fully sampled Wave‐encoded 3D MPRAGE datasets, and comparisons were made against existing Wave reconstruction approaches.

    Results

    Results show that Wave‐LORAKS can yield higher reconstruction quality with 16×‐accelerated data than is obtained by traditional Wave‐CAIPI with 9×‐accerated data.

    Conclusions

    There are strong synergies between Wave encoding and LORAKS, which enables Wave‐LORAKS to achieve higher acceleration and more flexible sampling compared to Wave‐CAIPI.

     
    more » « less
  4. Abstract

    Extracting quadrilateral layouts from surface triangulations is an important step in texture mapping, semi-structured quadrilateral meshing for traditional analysis and spline reconstruction for isogeometric analysis. Current methods struggle to yield high-quality layouts with appropriate connectivity between singular nodes (known as “extraordinary points” for spline representations) without resorting to either mixed-integer optimization or manual constraint prescription. The first of these is computationally expensive and comes with no guarantees, while the second is laborious and error-prone. In this work, we rigorously characterize curves in a quadrilateral layout up to homotopy type and use this information to quickly define high-quality connectivity constraints between singular nodes. The mathematical theory is accompanied by appropriate computational algorithms. The efficacy of the proposed method is demonstrated in generating quadrilateral layouts on the United States Army’s DEVCOM Generic Hull vehicle and parts of a bilinear quadrilateral finite element mesh (with some linear triangles) of a 1996 Dodge Neon.

     
    more » « less
  5. Given only a finite collection of points sampled from a Riemannian manifold embedded in a Euclidean space, in this paper we propose a new method to numerically solve elliptic and parabolic partial differential equations (PDEs) supplemented with boundary conditions. Since the construction of triangulations on unknown manifolds can be both difficult and expensive, both in terms of computational and data requirements, our goal is to solve these problems without a triangulation. Instead, we rely only on using the sample points to define quadrature formulas on the unknown manifold. Our main tool is the diffusion maps algorithm. We re-analyze this well-known method in a variational sense for manifolds with boundary. Our main result is that the variational diffusion maps graph Laplacian is a consistent estimator of the Dirichlet energy on the manifold. This improves upon previous results and provides a rigorous justification of the well-known relationship between diffusion maps and the Neumann eigenvalue problem. Moreover, using semigeodesic coordinates we derive the first uniform asymptotic expansion of the diffusion maps kernel integral operator for manifolds with boundary. This expansion relies on a novel lemma which relates the extrinsic Euclidean distance to the coordinate norm in a normal collar of the boundary. We then use a recently developed method of estimating the distance to boundary function (notice that the boundary location is assumed to be unknown) to construct a consistent estimator for boundary integrals. Finally, by combining these various estimators, we illustrate how to impose Dirichlet and Neumann conditions for some common PDEs based on the Laplacian. Several numerical examples illustrate our theoretical findings. 
    more » « less