RIM-Net: Recursive Implicit Fields for Unsupervised Learning of Hierarchical Shape Structures

• URL: http://arxiv.org/abs/2201.12763v1
• Date: Sun, 30 Jan 2022 09:31:24 GMT
• Title: RIM-Net: Recursive Implicit Fields for Unsupervised Learning of Hierarchical Shape Structures
• Authors: Chengjie Niu, Manyi Li, Kai Xu, Hao Zhang
• Abstract summary: RIM-Net is a neural network which learns implicit fields for unsupervised inference of hierarchical shape structures. We show the quality, consistency, and interpretability of hierarchical structural inference by RIM-Net.
• Score: 18.5420635041504
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce RIM-Net, a neural network which learns recursive implicit fields for unsupervised inference of hierarchical shape structures. Our network recursively decomposes an input 3D shape into two parts, resulting in a binary tree hierarchy. Each level of the tree corresponds to an assembly of shape parts, represented as implicit functions, to reconstruct the input shape. At each node of the tree, simultaneous feature decoding and shape decomposition are carried out by their respective feature and part decoders, with weight sharing across the same hierarchy level. As an implicit field decoder, the part decoder is designed to decompose a sub-shape, via a two-way branched reconstruction, where each branch predicts a set of parameters defining a Gaussian to serve as a local point distribution for shape reconstruction. With reconstruction losses accounted for at each hierarchy level and a decomposition loss at each node, our network training does not require any ground-truth segmentations, let alone hierarchies. Through extensive experiments and comparisons to state-of-the-art alternatives, we demonstrate the quality, consistency, and interpretability of hierarchical structural inference by RIM-Net.

Related papers

• StructRe: Rewriting for Structured Shape Modeling [63.792684115318906]
  We present StructRe, a structure rewriting system, as a novel approach to structured shape modeling. Given a 3D object represented by points and components, StructRe can rewrite it upward into more concise structures, or downward into more detailed structures.
  arXiv  Detail & Related papers  (2023-11-29T10:35:00Z)
• Hierarchical clustering with dot products recovers hidden tree structure [53.68551192799585]
  In this paper we offer a new perspective on the well established agglomerative clustering algorithm, focusing on recovery of hierarchical structure. We recommend a simple variant of the standard algorithm, in which clusters are merged by maximum average dot product and not, for example, by minimum distance or within-cluster variance. We demonstrate that the tree output by this algorithm provides a bona fide estimate of generative hierarchical structure in data, under a generic probabilistic graphical model.
  arXiv  Detail & Related papers  (2023-05-24T11:05:12Z)
• Image To Tree with Recursive Prompting [16.56278942191951]
  We propose a novel approach to predicting tree connectivity structure which reformulates the task as an optimization problem over individual steps. Our proposed method achieves compelling results on a pair of synthetic datasets, and outperforms a shortest-path baseline.
  arXiv  Detail & Related papers  (2023-01-01T17:35:24Z)
• D$^2$IM-Net: Learning Detail Disentangled Implicit Fields from Single Images [6.121310352120004]
  We present the first single-view 3D reconstruction network aimed at recovering geometric details from an input image. Our key idea is to train the network to learn a detail disentangled reconstruction consisting of two functions.
  arXiv  Detail & Related papers  (2020-12-11T21:42:52Z)
• Cascaded Refinement Network for Point Cloud Completion with Self-supervision [74.80746431691938]
  We introduce a two-branch network for shape completion. The first branch is a cascaded shape completion sub-network to synthesize complete objects. The second branch is an auto-encoder to reconstruct the original partial input.
  arXiv  Detail & Related papers  (2020-10-17T04:56:22Z)
• Dual-constrained Deep Semi-Supervised Coupled Factorization Network with Enriched Prior [80.5637175255349]
  We propose a new enriched prior based Dual-constrained Deep Semi-Supervised Coupled Factorization Network, called DS2CF-Net. To ex-tract hidden deep features, DS2CF-Net is modeled as a deep-structure and geometrical structure-constrained neural network. Our network can obtain state-of-the-art performance for representation learning and clustering.
  arXiv  Detail & Related papers  (2020-09-08T13:10:21Z)
• MRGAN: Multi-Rooted 3D Shape Generation with Unsupervised Part Disentanglement [49.05682172235875]
  We present MRGAN, a multi-rooted adversarial network which generates part-disentangled 3D point-cloud shapes without part-based shape supervision. The network fuses multiple branches of tree-structured graph convolution layers which produce point clouds, with learnable constant inputs at the tree roots.
  arXiv  Detail & Related papers  (2020-07-25T14:41:51Z)
• UCSG-Net -- Unsupervised Discovering of Constructive Solid Geometry Tree [6.605824452872053]
  Existing approaches to 3D shape reconstruction are supervised and require the entire CSG primitive tree that is given upfront during the process. We show that our model predicts parameters of an operation and parses their representation through differentiable indicator function. We show that our model is interpretable and can be used in software.
  arXiv  Detail & Related papers  (2020-06-16T12:13:37Z)
• Unsupervised Learning of Intrinsic Structural Representation Points [50.92621061405056]
  Learning structures of 3D shapes is a fundamental problem in the field of computer graphics and geometry processing. We present a simple yet interpretable unsupervised method for learning a new structural representation in the form of 3D structure points.
  arXiv  Detail & Related papers  (2020-03-03T17:40:00Z)

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.