TreeFormer: Single-view Plant Skeleton Estimation via Tree-constrained Graph Generation

• URL: http://arxiv.org/abs/2411.16132v1
• Date: Mon, 25 Nov 2024 06:43:20 GMT
• Title: TreeFormer: Single-view Plant Skeleton Estimation via Tree-constrained Graph Generation
• Abstract summary: We present TreeFormer, a plant skeleton estimator via tree-constrained graph generation. Our approach combines learning-based graph generation with traditional graph algorithms to impose the constraints during the training loop. Experiments show that our method accurately estimates target plant skeletal structures for multiple domains.
• Score: 13.507708659476064
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Accurate estimation of plant skeletal structure (e.g., branching structure) from images is essential for smart agriculture and plant science. Unlike human skeletons with fixed topology, plant skeleton estimation presents a unique challenge, i.e., estimating arbitrary tree graphs from images. While recent graph generation methods successfully infer thin structures from images, it is challenging to constrain the output graph strictly to a tree structure. To this problem, we present TreeFormer, a plant skeleton estimator via tree-constrained graph generation. Our approach combines learning-based graph generation with traditional graph algorithms to impose the constraints during the training loop. Specifically, our method projects an unconstrained graph onto a minimum spanning tree (MST) during the training loop and incorporates this prior knowledge into the gradient descent optimization by suppressing unwanted feature values. Experiments show that our method accurately estimates target plant skeletal structures for multiple domains: Synthetic tree patterns, real botanical roots, and grapevine branches. Our implementations are available at https://github.com/huntorochi/TreeFormer/.

Related papers

• PlantPose: Universal Plant Skeleton Estimation via Tree-constrained Graph Generation [16.241282394201225]
  We introduce PlantPose, a universal plant skeleton estimator via tree-constrained graph generation.<n>PlantPose combines learning-based graph generation with traditional graph algorithms to enforce tree constraints during the training loop.<n>Our approach demonstrates robust and accurate plant skeleton estimation across multiple domains.
  arXiv  Detail & Related papers  (2026-05-18T02:46:36Z)
• From GNNs to Trees: Multi-Granular Interpretability for Graph Neural Networks [29.032055397116217]
  Interpretable Graph Neural Networks (GNNs) aim to reveal the underlying reasoning behind model predictions. Existing subgraph-based interpretable methods suffer from an overemphasis on local structure. We introduce a novel Tree-like Interpretable Framework (TIF) for graph classification.
  arXiv  Detail & Related papers  (2025-05-01T07:22:51Z)
• 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)
• NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification [70.51126383984555]
  We introduce a novel all-pair message passing scheme for efficiently propagating node signals between arbitrary nodes. The efficient computation is enabled by a kernerlized Gumbel-Softmax operator. Experiments demonstrate the promising efficacy of the method in various tasks including node classification on graphs.
  arXiv  Detail & Related papers  (2023-06-14T09:21:15Z)
• Graph Generation with Diffusion Mixture [57.78958552860948]
  Generation of graphs is a major challenge for real-world tasks that require understanding the complex nature of their non-Euclidean structures. We propose a generative framework that models the topology of graphs by explicitly learning the final graph structures of the diffusion process.
  arXiv  Detail & Related papers  (2023-02-07T17:07:46Z)
• A Simple yet Effective Method for Graph Classification [7.397201068210497]
  We investigate the feasibility of improving graph classification performance while simplifying the learning process. Inspired by structural entropy on graphs, we transform the data sample from graphs to coding trees. We present a tree kernel and a convolutional network to implement our scheme for graph classification.
  arXiv  Detail & Related papers  (2022-06-06T07:24:44Z)
• Social Interpretable Tree for Pedestrian Trajectory Prediction [75.81745697967608]
  We propose a tree-based method, termed as Social Interpretable Tree (SIT), to address this multi-modal prediction task. A path in the tree from the root to leaf represents an individual possible future trajectory. Despite the hand-crafted tree, the experimental results on ETH-UCY and Stanford Drone datasets demonstrate that our method is capable of matching or exceeding the performance of state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-26T12:18:44Z)
• Explanation Graph Generation via Pre-trained Language Models: An Empirical Study with Contrastive Learning [84.35102534158621]
  We study pre-trained language models that generate explanation graphs in an end-to-end manner. We propose simple yet effective ways of graph perturbations via node and edge edit operations. Our methods lead to significant improvements in both structural and semantic accuracy of explanation graphs.
  arXiv  Detail & Related papers  (2022-04-11T00:58:27Z)
• Tree in Tree: from Decision Trees to Decision Graphs [2.2336243882030025]
  Tree in Tree decision graph (TnT) is a framework that extends the conventional decision tree to a more generic and powerful directed acyclic graph. Our proposed model is a novel, more efficient, and accurate alternative to the widely-used decision trees.
  arXiv  Detail & Related papers  (2021-10-01T13:20:05Z)
• Structural Optimization Makes Graph Classification Simpler and Better [5.770986723520119]
  We investigate the feasibility of improving graph classification performance while simplifying the model learning process. Inspired by progress in structural information assessment, we optimize the given data sample from graphs to encoding trees. We present an implementation of the scheme in a tree kernel and a convolutional network to perform graph classification.
  arXiv  Detail & Related papers  (2021-09-05T08:54:38Z)
• TD-GEN: Graph Generation With Tree Decomposition [31.751200416677225]
  TD-GEN is a graph generation framework based on tree decomposition. Tree nodes are supernodes, each representing a cluster of nodes in the graph.
  arXiv  Detail & Related papers  (2021-06-20T08:57:43Z)
• Neural Trees for Learning on Graphs [19.05038106825347]
  Graph Neural Networks (GNNs) have emerged as a flexible and powerful approach for learning over graphs. We propose a new GNN architecture -- the Neural Tree. We show that the neural tree architecture can approximate any smooth probability distribution function over an undirected graph.
  arXiv  Detail & Related papers  (2021-05-15T17:08:20Z)
• 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)
• SGA: A Robust Algorithm for Partial Recovery of Tree-Structured Graphical Models with Noisy Samples [75.32013242448151]
  We consider learning Ising tree models when the observations from the nodes are corrupted by independent but non-identically distributed noise. Katiyar et al. (2020) showed that although the exact tree structure cannot be recovered, one can recover a partial tree structure. We propose Symmetrized Geometric Averaging (SGA), a more statistically robust algorithm for partial tree recovery.
  arXiv  Detail & Related papers  (2021-01-22T01:57:35Z)

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.