Primitive-based Shape Abstraction via Nonparametric Bayesian Inference

• URL: http://arxiv.org/abs/2203.14714v1
• Date: Mon, 28 Mar 2022 13:00:06 GMT
• Title: Primitive-based Shape Abstraction via Nonparametric Bayesian Inference
• Authors: Yuwei Wu, Weixiao Liu, Sipu Ruan, Gregory S. Chirikjian
• Abstract summary: 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.
• Score: 29.7543198254021
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 3D shape abstraction has drawn great interest over the years. Apart from low-level representations such as meshes and voxels, researchers also seek to semantically abstract complex objects with basic geometric primitives. Recent deep learning methods rely heavily on datasets, with limited generality to unseen categories. Furthermore, abstracting an object accurately yet with a small number of primitives still remains a challenge. In this paper, 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. We model the generation of points as observations sampled from an infinite mixture of Gaussian Superquadric Taper Models (GSTM). Our approach formulates the abstraction as a clustering problem, in which: 1) each point is assigned to a cluster via the Chinese Restaurant Process (CRP); 2) a primitive representation is optimized for each cluster, and 3) a merging post-process is incorporated to provide a concise representation. We conduct extensive experiments on various datasets. The results indicate that our method outperforms the state-of-the-art in terms of accuracy and is generalizable to various types of objects.

Related papers

• Generalized Few-Shot Point Cloud Segmentation Via Geometric Words [54.32239996417363]
  Few-shot point cloud segmentation algorithms learn to adapt to new classes at the sacrifice of segmentation accuracy for the base classes. We present the first attempt at a more practical paradigm of generalized few-shot point cloud segmentation. We propose the geometric words to represent geometric components shared between the base and novel classes, and incorporate them into a novel geometric-aware semantic representation.
  arXiv  Detail & Related papers  (2023-09-20T11:24:33Z)
• Marching-Primitives: Shape Abstraction from Signed Distance Function [29.7543198254021]
  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.
  arXiv  Detail & Related papers  (2023-03-23T11:42:35Z)
• Clustering large 3D volumes: A sampling-based approach [0.0]
  In many applications of X-ray computed tomography, an unsupervised segmentation of the reconstructed 3D volumes forms an important step in the image processing chain. We introduce a novel clustering technique based on random sampling, which allows for the voxelwise classification of arbitrarily large volumes.
  arXiv  Detail & Related papers  (2023-03-07T19:23:33Z)
• Unified Multi-View Orthonormal Non-Negative Graph Based Clustering Framework [74.25493157757943]
  We formulate a novel clustering model, which exploits the non-negative feature property and incorporates the multi-view information into a unified joint learning framework. We also explore, for the first time, the multi-model non-negative graph-based approach to clustering data based on deep features.
  arXiv  Detail & Related papers  (2022-11-03T08:18:27Z)
• BIMS-PU: Bi-Directional and Multi-Scale Point Cloud Upsampling [60.257912103351394]
  We develop a new point cloud upsampling pipeline called BIMS-PU. We decompose the up/downsampling procedure into several up/downsampling sub-steps by breaking the target sampling factor into smaller factors. We show that our method achieves superior results to state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-06-25T13:13:37Z)
• 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)
• Finding Geometric Models by Clustering in the Consensus Space [61.65661010039768]
  We propose a new algorithm for finding an unknown number of geometric models, e.g., homographies. We present a number of applications where the use of multiple geometric models improves accuracy. These include pose estimation from multiple generalized homographies; trajectory estimation of fast-moving objects.
  arXiv  Detail & Related papers  (2021-03-25T14:35:07Z)
• PointFlow: Flowing Semantics Through Points for Aerial Image Segmentation [96.76882806139251]
  We propose a point-wise affinity propagation module based on the Feature Pyramid Network (FPN) framework, named PointFlow. Rather than dense affinity learning, a sparse affinity map is generated upon selected points between the adjacent features. Experimental results on three different aerial segmentation datasets suggest that the proposed method is more effective and efficient than state-of-the-art general semantic segmentation methods.
  arXiv  Detail & Related papers  (2021-03-11T09:42:32Z)
• Deep Magnification-Flexible Upsampling over 3D Point Clouds [103.09504572409449]
  We propose a novel end-to-end learning-based framework to generate dense point clouds. We first formulate the problem explicitly, which boils down to determining the weights and high-order approximation errors. Then, we design a lightweight neural network to adaptively learn unified and sorted weights as well as the high-order refinements.
  arXiv  Detail & Related papers  (2020-11-25T14:00:18Z)
• PatchPerPix for Instance Segmentation [9.62543698736491]
  Our method is based on predicting dense local shape descriptors, which we assemble to form instances. To our knowledge, our method is the first non-iterative method that yields instances that are composed of learnt shape patches.
  arXiv  Detail & Related papers  (2020-01-21T16:06:51Z)

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.