Least squares surface reconstruction on arbitrary domains

• URL: http://arxiv.org/abs/2007.08661v2
• Date: Mon, 20 Jul 2020 14:27:27 GMT
• Title: Least squares surface reconstruction on arbitrary domains
• Authors: Dizhong Zhu, William A P Smith
• Abstract summary: We propose a new method for computing numerical derivatives based on 2D Savitzky-Golay filters and K-nearest neighbour kernels. We show how to write both orthographic or perspective height-from-normals as a linear least squares problem using the same formulation. We demonstrate improved performance relative to state-of-the-art on both synthetic and real data.
• Score: 30.354512876068085
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Almost universally in computer vision, when surface derivatives are required, they are computed using only first order accurate finite difference approximations. We propose a new method for computing numerical derivatives based on 2D Savitzky-Golay filters and K-nearest neighbour kernels. The resulting derivative matrices can be used for least squares surface reconstruction over arbitrary (even disconnected) domains in the presence of large noise and allowing for higher order polynomial local surface approximations. They are useful for a range of tasks including normal-from-depth (i.e. surface differentiation), height-from-normals (i.e. surface integration) and shape-from-x. We show how to write both orthographic or perspective height-from-normals as a linear least squares problem using the same formulation and avoiding a nonlinear change of variables in the perspective case. We demonstrate improved performance relative to state-of-the-art across these tasks on both synthetic and real data and make available an open source implementation of our method.

Related papers

• On the design of scalable, high-precision spherical-radial Fourier features [5.216151302783165]
  We introduce a new family of quadrature rules that accurately approximate the Gaussian measure in higher dimensions by exploiting its isotropy. Compared to previous work, our approach leverages a thorough analysis of the approximation error, which suggests natural choices for both the radial and spherical components.
  arXiv  Detail & Related papers  (2024-08-23T17:11:25Z)
• Explicit Neural Surfaces: Learning Continuous Geometry With Deformation Fields [33.38609930708073]
  We introduce Explicit Neural Surfaces (ENS), an efficient smooth surface representation that encodes topology with a deformation field from a known base domain. Compared to implicit surfaces, ENS trains faster and has several orders of magnitude faster inference times.
  arXiv  Detail & Related papers  (2023-06-05T15:24:33Z)
• Bridging Discrete and Backpropagation: Straight-Through and Beyond [62.46558842476455]
  We propose a novel approach to approximate the gradient of parameters involved in generating discrete latent variables. We propose ReinMax, which achieves second-order accuracy by integrating Heun's method, a second-order numerical method for solving ODEs.
  arXiv  Detail & Related papers  (2023-04-17T20:59:49Z)
• Point normal orientation and surface reconstruction by incorporating isovalue constraints to Poisson equation [16.467735758073363]
  Oriented normals are common pre-requisites for many geometric algorithms based on point clouds. We propose a novel approach to orient point cloud normals by incorporating isovalue constraints to the Poisson equation. Our method can achieve high performance in non-uniform and noisy data.
  arXiv  Detail & Related papers  (2022-09-30T17:47:48Z)
• Minimal Neural Atlas: Parameterizing Complex Surfaces with Minimal Charts and Distortion [71.52576837870166]
  We present Minimal Neural Atlas, a novel atlas-based explicit neural surface representation. At its core is a fully learnable parametric domain, given by an implicit probabilistic occupancy field defined on an open square of the parametric space. Our reconstructions are more accurate in terms of the overall geometry, due to the separation of concerns on topology and geometry.
  arXiv  Detail & Related papers  (2022-07-29T16:55:06Z)
• A shallow physics-informed neural network for solving partial differential equations on surfaces [0.0]
  We introduce a mesh-free physics-informed neural network for solving partial differential equations on surfaces. With the aid of level set function, the surface geometrical quantities, such as the normal and mean curvature of the surface, can be computed directly and used in our surface differential expressions. With just a few hundred trainable parameters, our network model is able to achieve high predictive accuracy.
  arXiv  Detail & Related papers  (2022-03-03T09:18:21Z)
• DeepMesh: Differentiable Iso-Surface Extraction [53.77622255726208]
  We introduce a differentiable way to produce explicit surface mesh representations from Deep Implicit Fields. Our key insight is that by reasoning on how implicit field perturbations impact local surface geometry, one can ultimately differentiate the 3D location of surface samples. We exploit this to define DeepMesh -- end-to-end differentiable mesh representation that can vary its topology.
  arXiv  Detail & Related papers  (2021-06-20T20:12:41Z)
• Canny-VO: Visual Odometry with RGB-D Cameras based on Geometric 3D-2D Edge Alignment [85.32080531133799]
  This paper reviews the classical problem of free-form curve registration and applies it to an efficient RGBD visual odometry system called Canny-VO. Two replacements for the distance transformation commonly used in edge registration are proposed: Approximate Nearest Neighbour Fields and Oriented Nearest Neighbour Fields. 3D2D edge alignment benefits from these alternative formulations in terms of both efficiency and accuracy.
  arXiv  Detail & Related papers  (2020-12-15T11:42:17Z)
• Debiasing Distributed Second Order Optimization with Surrogate Sketching and Scaled Regularization [101.5159744660701]
  In distributed second order optimization, a standard strategy is to average many local estimates, each of which is based on a small sketch or batch of the data. Here, we introduce a new technique for debiasing the local estimates, which leads to both theoretical and empirical improvements in the convergence rate of distributed second order methods.
  arXiv  Detail & Related papers  (2020-07-02T18:08:14Z)
• Effective Dimension Adaptive Sketching Methods for Faster Regularized Least-Squares Optimization [56.05635751529922]
  We propose a new randomized algorithm for solving L2-regularized least-squares problems based on sketching. We consider two of the most popular random embeddings, namely, Gaussian embeddings and the Subsampled Randomized Hadamard Transform (SRHT)
  arXiv  Detail & Related papers  (2020-06-10T15:00:09Z)
• MeshSDF: Differentiable Iso-Surface Extraction [45.769838982991736]
  We introduce a differentiable way to produce explicit surface mesh representations from Deep Signed Distance Functions. Our key insight is that by reasoning on how implicit field perturbations impact local surface geometry, one can ultimately differentiate the 3D location of surface samples. We exploit this to define MeshSDF, an end-to-end differentiable mesh representation which can vary its topology.
  arXiv  Detail & Related papers  (2020-06-06T23:44:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.