Robust and Accurate Cylinder Triangulation

• URL: http://arxiv.org/abs/2212.02319v1
• Date: Mon, 5 Dec 2022 14:42:40 GMT
• Title: Robust and Accurate Cylinder Triangulation
• Authors: Anna Gummeson and Magnus Oskarsson
• Abstract summary: We show numerically that linear estimation of a general quadric surface is inherently a badly posed problem. We derive a fast minimal solver based on three image silhouette lines, that can be used to bootstrap robust estimation schemes. We also present a constrained least squares solver that can incorporate all available image lines for accurate estimation.
• Score: 23.35080249212613
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper we present methods for triangulation of infinite cylinders from image line silhouettes. We show numerically that linear estimation of a general quadric surface is inherently a badly posed problem. Instead we propose to constrain the conic section to a circle, and give algebraic constraints on the dual conic, that models this manifold. Using these constraints we derive a fast minimal solver based on three image silhouette lines, that can be used to bootstrap robust estimation schemes such as RANSAC. We also present a constrained least squares solver that can incorporate all available image lines for accurate estimation. The algorithms are tested on both synthetic and real data, where they are shown to give accurate results, compared to previous methods.

Related papers

• BG-Triangle: Bézier Gaussian Triangle for 3D Vectorization and Rendering [60.240908644910874]
  Differentiable rendering enables efficient optimization by allowing gradients to be computed through the rendering process. Existing solutions approximate or re-formulate traditional rendering operations using smooth, probabilistic proxies. We present a novel hybrid representation that combines B'ezier triangle-based vector graphics primitives with Gaussian-based probabilistic models.
  arXiv  Detail & Related papers  (2025-03-18T06:53:52Z)
• No Pose, No Problem: Surprisingly Simple 3D Gaussian Splats from Sparse Unposed Images [100.80376573969045]
  NoPoSplat is a feed-forward model capable of reconstructing 3D scenes parameterized by 3D Gaussians from multi-view images. Our model achieves real-time 3D Gaussian reconstruction during inference. This work makes significant advances in pose-free generalizable 3D reconstruction and demonstrates its applicability to real-world scenarios.
  arXiv  Detail & Related papers  (2024-10-31T17:58:22Z)
• Vanishing Point Estimation in Uncalibrated Images with Prior Gravity Direction [82.72686460985297]
  We tackle the problem of estimating a Manhattan frame. We derive two new 2-line solvers, one of which does not suffer from singularities affecting existing solvers. We also design a new non-minimal method, running on an arbitrary number of lines, to boost the performance in local optimization.
  arXiv  Detail & Related papers  (2023-08-21T13:03:25Z)
• Practical solutions to the relative pose of three calibrated cameras [59.0302033761239]
  We study the challenging problem of estimating the relative pose of three calibrated cameras from four point correspondences. We propose novel efficient solutions to this problem that are based on the simple idea of using four correspondences to estimate an approximate geometry of the first two views.
  arXiv  Detail & Related papers  (2023-03-28T15:50:48Z)
• NeuralMeshing: Differentiable Meshing of Implicit Neural Representations [63.18340058854517]
  We propose a novel differentiable meshing algorithm for extracting surface meshes from neural implicit representations. Our method produces meshes with regular tessellation patterns and fewer triangle faces compared to existing methods.
  arXiv  Detail & Related papers  (2022-10-05T16:52:25Z)
• Machine learning algorithms for three-dimensional mean-curvature computation in the level-set method [0.0]
  We propose a data-driven mean-curvature solver for the level-set method. Our proposed system can yield more accurate mean-curvature estimations than modern particle-based interface reconstruction.
  arXiv  Detail & Related papers  (2022-08-18T20:19:22Z)
• Absolute Triangulation Algorithms for Space Exploration [0.0]
  This work provides a comprehensive review of the history and theoretical foundations of triangulation. Two new optimal non-iterative triangulation algorithms are introduced that provide the same solution as Hartley and Sturm. The various triangulation algorithms are assessed with a few numerical examples, including planetary terrain relative navigation.
  arXiv  Detail & Related papers  (2022-05-24T16:54:07Z)
• A Scalable Combinatorial Solver for Elastic Geometrically Consistent 3D Shape Matching [69.14632473279651]
  We present a scalable algorithm for globally optimizing over the space of geometrically consistent mappings between 3D shapes. We propose a novel primal coupled with a Lagrange dual problem that is several orders of magnitudes faster than previous solvers.
  arXiv  Detail & Related papers  (2022-04-27T09:47:47Z)
• Shortest Paths in Graphs with Matrix-Valued Edges: Concepts, Algorithm and Application to 3D Multi-Shape Analysis [69.08838724594584]
  Finding shortest paths in a graph is relevant for numerous problems in computer vision and graphics. We introduce the novel graph-theoretic concept of a shortest path in a graph with matrix-valued edges.
  arXiv  Detail & Related papers  (2021-12-08T08:23:37Z)
• Robust reconstructions by multi-scale/irregular tangential covering [38.469070341871365]
  We employ a tangential cover algorithm - minDSS - in order to geometrically reconstruct noisy digital contours. By calculating multi-scale and irregular isothetic representations of the contour, we obtained 1-D intervals. We are now able to reconstruct the input noisy objects into cyclic contours made of lines or arcs with a minimal number of primitives.
  arXiv  Detail & Related papers  (2021-11-10T14:02:05Z)
• Differentiable Surface Triangulation [40.13834693745158]
  We present a differentiable surface triangulation that enables optimization for any per-vertex or per-face differentiable objective function over the space of underlying surface triangulations. Our method builds on the result that any 2D triangulation can be achieved by a suitably weighted Delaunay triangulation. We extend the algorithm to 3D by decomposing shapes into developable sets and differentiably meshing each set with suitable boundary constraints.
  arXiv  Detail & Related papers  (2021-09-22T12:42:43Z)
• Hybrid Trilinear and Bilinear Programming for Aligning Partially Overlapping Point Sets [85.71360365315128]
  In many applications, we need algorithms which can align partially overlapping point sets are invariant to the corresponding corresponding RPM algorithm. We first show that the objective is a cubic bound function. We then utilize the convex envelopes of trilinear and bilinear monomial transformations to derive its lower bound. We next develop a branch-and-bound (BnB) algorithm which only branches over the transformation variables and runs efficiently.
  arXiv  Detail & Related papers  (2021-01-19T04:24:23Z)

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.