Marching-Primitives: Shape Abstraction from Signed Distance Function

• URL: http://arxiv.org/abs/2303.13190v2
• Date: Tue, 6 Jun 2023 03:21:47 GMT
• Title: Marching-Primitives: Shape Abstraction from Signed Distance Function
• Authors: Weixiao Liu, Yuwei Wu, Sipu Ruan, Gregory S. Chirikjian
• Abstract summary: We present a novel method, named Marching-Primitives, to obtain a primitive-based abstraction directly from an SDF. Our method grows geometric primitives iteratively by analyzing the connectivity of voxels. We evaluate the performance of our method on both synthetic and real-world datasets.
• Score: 29.7543198254021
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Representing complex objects with basic geometric primitives has long been a topic in computer vision. Primitive-based representations have the merits of compactness and computational efficiency in higher-level tasks such as physics simulation, collision checking, and robotic manipulation. Unlike previous works which extract polygonal meshes from a signed distance function (SDF), in this paper, we present a novel method, named Marching-Primitives, to obtain a primitive-based abstraction directly from an SDF. Our method grows geometric primitives (such as superquadrics) iteratively by analyzing the connectivity of voxels while marching at different levels of signed distance. For each valid connected volume of interest, we march on the scope of voxels from which a primitive is able to be extracted in a probabilistic sense and simultaneously solve for the parameters of the primitive to capture the underlying local geometry. We evaluate the performance of our method on both synthetic and real-world datasets. The results show that the proposed method outperforms the state-of-the-art in terms of accuracy, and is directly generalizable among different categories and scales. The code is open-sourced at https://github.com/ChirikjianLab/Marching-Primitives.git.

Related papers

• SpaceMesh: A Continuous Representation for Learning Manifold Surface Meshes [61.110517195874074]
  We present a scheme to directly generate manifold, polygonal meshes of complex connectivity as the output of a neural network. Our key innovation is to define a continuous latent connectivity space at each mesh, which implies the discrete mesh. In applications, this approach not only yields high-quality outputs from generative models, but also enables directly learning challenging geometry processing tasks such as mesh repair.
  arXiv  Detail & Related papers  (2024-09-30T17:59:03Z)
• Abstracting Sketches through Simple Primitives [53.04827416243121]
  Humans show high-level of abstraction capabilities in games that require quickly communicating object information. We propose the Primitive-based Sketch Abstraction task where the goal is to represent sketches using a fixed set of drawing primitives. Our Primitive-Matching Network (PMN), learns interpretable abstractions of a sketch in a self supervised manner.
  arXiv  Detail & Related papers  (2022-07-27T14:32:39Z)
• SDFEst: Categorical Pose and Shape Estimation of Objects from RGB-D using Signed Distance Fields [5.71097144710995]
  We present a modular pipeline for pose and shape estimation of objects from RGB-D images. We integrate a generative shape model with a novel network to enable 6D pose and shape estimation from a single or multiple views. We demonstrate the benefits of our approach over state-of-the-art methods in several experiments on both synthetic and real data.
  arXiv  Detail & Related papers  (2022-07-11T13:53:50Z)
• 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)
• Primitive-based Shape Abstraction via Nonparametric Bayesian Inference [29.7543198254021]
  We propose a novel non-parametric Bayesian statistical method to infer an abstraction, consisting of an unknown number of geometric primitives, from a point cloud. Our method outperforms the state-of-the-art in terms of accuracy and is generalizable to various types of objects.
  arXiv  Detail & Related papers  (2022-03-28T13:00:06Z)
• Sparse Instance Activation for Real-Time Instance Segmentation [72.23597664935684]
  We propose a conceptually novel, efficient, and fully convolutional framework for real-time instance segmentation. SparseInst has extremely fast inference speed and achieves 40 FPS and 37.9 AP on the COCO benchmark.
  arXiv  Detail & Related papers  (2022-03-24T03:15:39Z)
• Pretrained equivariant features improve unsupervised landmark discovery [69.02115180674885]
  We formulate a two-step unsupervised approach that overcomes this challenge by first learning powerful pixel-based features. Our method produces state-of-the-art results in several challenging landmark detection datasets.
  arXiv  Detail & Related papers  (2021-04-07T05:42:11Z)
• PrimiTect: Fast Continuous Hough Voting for Primitive Detection [49.72425950418304]
  Our method classifies points into different geometric primitives, such as planes and cones, leading to a compact representation of the data. We use a local, low-dimensional parameterization of primitives to determine type, shape and pose of the object that a point belongs to. This makes our algorithm suitable to run on devices with low computational power, as often required in robotics applications.
  arXiv  Detail & Related papers  (2020-05-15T10:16:07Z)
• Spatial Pyramid Based Graph Reasoning for Semantic Segmentation [67.47159595239798]
  We apply graph convolution into the semantic segmentation task and propose an improved Laplacian. The graph reasoning is directly performed in the original feature space organized as a spatial pyramid. We achieve comparable performance with advantages in computational and memory overhead.
  arXiv  Detail & Related papers  (2020-03-23T12:28:07Z)

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.