Robust reconstructions by multi-scale/irregular tangential covering

• URL: http://arxiv.org/abs/2111.05688v1
• Date: Wed, 10 Nov 2021 14:02:05 GMT
• Title: Robust reconstructions by multi-scale/irregular tangential covering
• Authors: Antoine Vacavant and Bertrand Kerautret and Fabien Feschet
• Abstract summary: 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.
• Score: 38.469070341871365
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we propose an original manner to employ a tangential cover algorithm - minDSS - in order to geometrically reconstruct noisy digital contours. To do so, we exploit the representation of graphical objects by maximal primitives we have introduced in previous works. By calculating multi-scale and irregular isothetic representations of the contour, we obtained 1-D (one-dimensional) intervals, and achieved afterwards a decomposition into maximal line segments or circular arcs. By adapting minDSS to this sparse and irregular data of 1-D intervals supporting the maximal primitives, we are now able to reconstruct the input noisy objects into cyclic contours made of lines or arcs with a minimal number of primitives. In this work, we explain our novel complete pipeline, and present its experimental evaluation by considering both synthetic and real image data. We also show that this is a robust approach, with respect to selected references from state-of-the-art, and by considering a multi-scale noise evaluation process.

Related papers

• LinPrim: Linear Primitives for Differentiable Volumetric Rendering [53.780682194322225]
  We introduce two new scene representations based on linear primitives-octahedra and tetrahedra-both of which define homogeneous volumes bounded by triangular faces. This formulation aligns naturally with standard mesh-based tools, minimizing overhead for downstream applications. We demonstrate comparable performance to state-of-the-art volumetric methods while requiring fewer primitives to achieve similar reconstruction fidelity.
  arXiv  Detail & Related papers  (2025-01-27T18:49:38Z)
• Curvy: A Parametric Cross-section based Surface Reconstruction [2.1165011830664677]
  We present a novel approach for reconstructing shape point clouds using planar sparse cross-sections with the help of generative modeling. We use a compact parametric polyline representation using adaptive splitting to represent the cross-sections and perform learning using a Graph Neural Network to reconstruct the underlying shape.
  arXiv  Detail & Related papers  (2024-09-01T20:15:08Z)
• P2PFormer: A Primitive-to-polygon Method for Regular Building Contour Extraction from Remote Sensing Images [5.589842901102337]
  Existing methods struggle with irregular contours, rounded corners, and redundancy points. We introduce a novel, streamlined pipeline that generates regular building contours without post-processing. P2PFormer achieves new state-of-the-art performance on the WHU, CrowdAI, and WHU-Mix datasets.
  arXiv  Detail & Related papers  (2024-06-05T04:38:45Z)
• Gradient Descent Provably Solves Nonlinear Tomographic Reconstruction [60.95625458395291]
  In computed tomography (CT) the forward model consists of a linear transform followed by an exponential nonlinearity based on the attenuation of light according to the Beer-Lambert Law. We show that this approach reduces metal artifacts compared to a commercial reconstruction of a human skull with metal crowns.
  arXiv  Detail & Related papers  (2023-10-06T00:47:57Z)
• Learning end-to-end inversion of circular Radon transforms in the partial radial setup [0.0]
  We present a deep learning algorithm for inversion of circular Radon transforms in the partial radial setup, arising in photoacoustic tomography. We first demonstrate that the truncated singular value decomposition-based method, which is the only traditional algorithm available to solve this problem, leads to severe artifacts which renders the reconstructed field as unusable. With the objective of overcoming this computational bottleneck, we train a ResBlock based U-Net to recover the inferred field that directly operates on the measured data.
  arXiv  Detail & Related papers  (2023-08-27T15:57:08Z)
• PolyDiffuse: Polygonal Shape Reconstruction via Guided Set Diffusion Models [26.819929072916363]
  PolyDiffuse is a novel structured reconstruction algorithm that transforms visual sensor data into polygonal shapes with Diffusion Models (DM) DM is an emerging machinery amid exploding generative AI, while formulating reconstruction as a generation process conditioned on sensor data. We have evaluated our approach for reconstructing two types of polygonal shapes: floorplan as a set of polygons and HD map for autonomous cars as a set of polylines.
  arXiv  Detail & Related papers  (2023-06-02T11:38:04Z)
• Neural Kernel Surface Reconstruction [80.51581494300423]
  We present a novel method for reconstructing a 3D implicit surface from a large-scale, sparse, and noisy point cloud. Our approach builds upon the recently introduced Neural Kernel Fields representation.
  arXiv  Detail & Related papers  (2023-05-31T06:25:18Z)
• Fitting and recognition of geometric primitives in segmented 3D point clouds using a localized voting procedure [1.8352113484137629]
  We introduce a novel technique for processing point clouds that, through a voting procedure, is able to provide an initial estimate of the primitive parameters each type. By using these estimates we localize the search of the optimal solution in a dimensionally-reduced space, making it efficient to extend the HT to more primitive than those that generally found in the literature.
  arXiv  Detail & Related papers  (2022-05-30T20:47:43Z)
• Deep Shells: Unsupervised Shape Correspondence with Optimal Transport [52.646396621449]
  We propose a novel unsupervised learning approach to 3D shape correspondence. We show that the proposed method significantly improves over the state-of-the-art on multiple datasets.
  arXiv  Detail & Related papers  (2020-10-28T22:24:07Z)
• Learning multiview 3D point cloud registration [74.39499501822682]
  We present a novel, end-to-end learnable, multiview 3D point cloud registration algorithm. Our approach outperforms the state-of-the-art by a significant margin, while being end-to-end trainable and computationally less costly.
  arXiv  Detail & Related papers  (2020-01-15T03:42:14Z)

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.