Occlusion Reasoning for Skeleton Extraction of Self-Occluded Tree Canopies

• URL: http://arxiv.org/abs/2301.08387v1
• Date: Fri, 20 Jan 2023 01:46:07 GMT
• Title: Occlusion Reasoning for Skeleton Extraction of Self-Occluded Tree Canopies
• Authors: Chung Hee Kim, George Kantor
• Abstract summary: A tree skeleton compactly describes the topological structure and contains useful information. Our method uses an instance segmentation network to detect visible trunk, branches, and twigs. We show that our method outperforms baseline methods in highly occluded scenes.
• Score: 5.368313160283353
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we present a method to extract the skeleton of a self-occluded tree canopy by estimating the unobserved structures of the tree. A tree skeleton compactly describes the topological structure and contains useful information such as branch geometry, positions and hierarchy. This can be critical to planning contact interactions for agricultural manipulation, yet is difficult to gain due to occlusion by leaves, fruits and other branches. Our method uses an instance segmentation network to detect visible trunk, branches, and twigs. Then, based on the observed tree structures, we build a custom 3D likelihood map in the form of an occupancy grid to hypothesize on the presence of occluded skeletons through a series of minimum cost path searches. We show that our method outperforms baseline methods in highly occluded scenes, demonstrated through a set of experiments on a synthetic tree dataset. Qualitative results are also presented on a real tree dataset collected from the field.

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)
• 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)
• DeepTree: Modeling Trees with Situated Latents [8.372189962601073]
  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.
  arXiv  Detail & Related papers  (2023-05-09T03:33:14Z)
• CherryPicker: Semantic Skeletonization and Topological Reconstruction of Cherry Trees [3.8697834534260447]
  We present CherryPicker, an automatic pipeline that reconstructs photo-metric point clouds of trees. Our system combines several state-of-the-art algorithms to enable automatic processing for further usage in 3D-plant phenotyping applications.
  arXiv  Detail & Related papers  (2023-04-10T16:54:05Z)
• 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)
• Tree Reconstruction using Topology Optimisation [0.685316573653194]
  We present a general method for extracting the branch structure of trees from point cloud data. We discuss the benefits and drawbacks of this novel approach to tree structure reconstruction. Our method generates detailed and accurate tree structures in most cases.
  arXiv  Detail & Related papers  (2022-05-26T07:08:32Z)
• 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)
• Linguistically Driven Graph Capsule Network for Visual Question Reasoning [153.76012414126643]
  We propose a hierarchical compositional reasoning model called the "Linguistically driven Graph Capsule Network" The compositional process is guided by the linguistic parse tree. Specifically, we bind each capsule in the lowest layer to bridge the linguistic embedding of a single word in the original question with visual evidence. Experiments on the CLEVR dataset, CLEVR compositional generation test, and FigureQA dataset demonstrate the effectiveness and composition generalization ability of our end-to-end model.
  arXiv  Detail & Related papers  (2020-03-23T03:34:25Z)
• 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.