DeepTree: Modeling Trees with Situated Latents

• URL: http://arxiv.org/abs/2305.05153v1
• Date: Tue, 9 May 2023 03:33:14 GMT
• Title: DeepTree: Modeling Trees with Situated Latents
• Authors: Xiaochen Zhou, Bosheng Li, Bedrich Benes, Songlin Fei, S\"oren Pirk
• Abstract summary: We propose a novel method for modeling trees based on learning developmental rules for branching structures instead of manually defining them. We call our deep neural model situated latent because its behavior is determined by the intrinsic state. Our method enables generating a wide variety of tree shapes without the need to define intricate parameters.
• Score: 8.372189962601073
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we propose DeepTree, a novel method for modeling trees based on learning developmental rules for branching structures instead of manually defining them. We call our deep neural model situated latent because its behavior is determined by the intrinsic state -- encoded as a latent space of a deep neural model -- and by the extrinsic (environmental) data that is situated as the location in the 3D space and on the tree structure. We use a neural network pipeline to train a situated latent space that allows us to locally predict branch growth only based on a single node in the branch graph of a tree model. We use this representation to progressively develop new branch nodes, thereby mimicking the growth process of trees. Starting from a root node, a tree is generated by iteratively querying the neural network on the newly added nodes resulting in the branching structure of the whole tree. Our method enables generating a wide variety of tree shapes without the need to define intricate parameters that control their growth and behavior. Furthermore, we show that the situated latents can also be used to encode the environmental response of tree models, e.g., when trees grow next to obstacles. We validate the effectiveness of our method by measuring the similarity of our tree models and by procedurally generated ones based on a number of established metrics for tree form.

Related papers

• BranchPoseNet: Characterizing tree branching with a deep learning-based pose estimation approach [0.0]
  This paper presents an automated pipeline for detecting tree whorls in proximally laser scanning data using a pose-estimation deep learning model. Accurate whorl detection provides valuable insights into tree growth patterns, wood quality, and offers potential for use as a biometric marker to track trees throughout the forestry value chain.
  arXiv  Detail & Related papers  (2024-09-23T07:10:11Z)
• Forecasting with Hyper-Trees [50.72190208487953]
  Hyper-Trees are designed to learn the parameters of time series models. By relating the parameters of a target time series model to features, Hyper-Trees also address the issue of parameter non-stationarity. In this novel approach, the trees first generate informative representations from the input features, which a shallow network then maps to the target model parameters.
  arXiv  Detail & Related papers  (2024-05-13T15:22:15Z)
• HetTree: Heterogeneous Tree Graph Neural Network [12.403166161903378]
  HetTree is a novel heterogeneous tree graph neural network that models both the graph structure and heterogeneous aspects. HetTree builds a semantic tree data structure to capture the hierarchy among metapaths. Our evaluation of HetTree on a variety of real-world datasets demonstrates that it outperforms all existing baselines on open benchmarks.
  arXiv  Detail & Related papers  (2024-02-21T03:14:45Z)
• ViTree: Single-path Neural Tree for Step-wise Interpretable Fine-grained Visual Categorization [56.37520969273242]
  We introduce ViTree, a novel approach for fine-grained visual categorization. By traversing the tree paths, ViTree effectively selects patches from transformer-processed features to highlight informative local regions. This patch and path selectivity enhances model interpretability of ViTree, enabling better insights into the model's inner workings.
  arXiv  Detail & Related papers  (2024-01-30T14:32:25Z)
• Smart-Tree: Neural Medial Axis Approximation of Point Clouds for 3D Tree Skeletonization [0.0]
  Smart-Tree is a supervised method for approximating the medial axes of branch skeletons from a tree point cloud. A greedy algorithm performs robust skeletonization using the estimated medial axis. We evaluate Smart-Tree using a multi-species synthetic tree dataset and perform qualitative analysis on a real-world tree point cloud.
  arXiv  Detail & Related papers  (2023-03-21T03:03:46Z)
• RLET: A Reinforcement Learning Based Approach for Explainable QA with Entailment Trees [47.745218107037786]
  We propose RLET, a Reinforcement Learning based Entailment Tree generation framework. RLET iteratively performs single step reasoning with sentence selection and deduction generation modules. Experiments on three settings of the EntailmentBank dataset demonstrate the strength of using RL framework.
  arXiv  Detail & Related papers  (2022-10-31T06:45:05Z)
• A Tree-structured Transformer for Program Representation Learning [27.31416015946351]
  Long-term/global dependencies widely exist in programs, and most neural networks fail to capture these dependencies. In this paper, we propose Tree-Transformer, a novel tree-structured neural network which aims to overcome the above limitations. By combining bottom-up and top-down propagation, Tree-Transformer can learn both global contexts and meaningful node features.
  arXiv  Detail & Related papers  (2022-08-18T05:42:01Z)
• A Neural Tangent Kernel Perspective of Infinite Tree Ensembles [8.020742121274417]
  We introduce and study the Tree Neural Tangent Kernel (TNTK), which provides new insights into the behavior of the infinite ensemble of soft trees. We find several non-trivial properties, such as the effect of the oblivious tree structure and the degeneracy of the TNTK induced by the deepening of the trees.
  arXiv  Detail & Related papers  (2021-09-10T16:48:24Z)
• Visualizing hierarchies in scRNA-seq data using a density tree-biased autoencoder [50.591267188664666]
  We propose an approach for identifying a meaningful tree structure from high-dimensional scRNA-seq data. We then introduce DTAE, a tree-biased autoencoder that emphasizes the tree structure of the data in low dimensional space.
  arXiv  Detail & Related papers  (2021-02-11T08:48:48Z)
• Growing Deep Forests Efficiently with Soft Routing and Learned Connectivity [79.83903179393164]
  This paper further extends the deep forest idea in several important aspects. We employ a probabilistic tree whose nodes make probabilistic routing decisions, a.k.a., soft routing, rather than hard binary decisions. Experiments on the MNIST dataset demonstrate that our empowered deep forests can achieve better or comparable performance than [1],[3].
  arXiv  Detail & Related papers  (2020-12-29T18:05:05Z)
• PT2PC: Learning to Generate 3D Point Cloud Shapes from Part Tree Conditions [66.87405921626004]
  This paper investigates the novel problem of generating 3D shape point cloud geometry from a symbolic part tree representation. We propose a conditional GAN "part tree"-to-"point cloud" model (PT2PC) that disentangles the structural and geometric factors.
  arXiv  Detail & Related papers  (2020-03-19T08:27:25Z)

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.