A Survey On 3D Inner Structure Prediction from its Outer Shape

• URL: http://arxiv.org/abs/2002.04571v1
• Date: Tue, 11 Feb 2020 17:56:38 GMT
• Title: A Survey On 3D Inner Structure Prediction from its Outer Shape
• Authors: Mohamed Mejri, Antoine Richard, C\'edric Pradalier
• Abstract summary: The analysis of the internal structure of trees is highly important for both forest experts, biological scientists, and the wood industry. Traditionally, CT-scanners are considered as the most efficient way to get an accurate inner representation of the tree. Our goal is to design neural-network-based methods to predict the internal density of the tree from its external bark shape.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The analysis of the internal structure of trees is highly important for both forest experts, biological scientists, and the wood industry. Traditionally, CT-scanners are considered as the most efficient way to get an accurate inner representation of the tree. However, this method requires an important investment and reduces the cost-effectiveness of this operation. Our goal is to design neural-network-based methods to predict the internal density of the tree from its external bark shape. This paper compares different image-to-image(2D), volume-to-volume(3D) and Convolutional Long Short Term Memory based neural network architectures in the context of the prediction of the defect distribution inside trees from their external bark shape. Those models are trained on a synthetic dataset of 1800 CT-scanned look-like volumetric structures of the internal density of the trees and their corresponding external surface.

Related papers

• $TrIND$: Representing Anatomical Trees by Denoising Diffusion of Implicit Neural Fields [17.943355593568242]
  Anatomical trees play a central role in clinical diagnosis and treatment planning. Traditional methods for representing tree structures exhibit drawbacks in terms of resolution, flexibility, and efficiency. We propose a novel approach, $TrIND$, for representing anatomical trees using implicit neural representations.
  arXiv  Detail & Related papers  (2024-03-13T21:43:24Z)
• Improving Knot Prediction in Wood Logs with Longitudinal Feature Propagation [0.0]
  In this paper, we address the task of predicting the location of inner defects from the outer shape of the logs. The dataset is built by extracting both the contours and the knots with X-ray measurements. We propose to solve this binary segmentation task by leveraging convolutional recurrent neural networks.
  arXiv  Detail & Related papers  (2023-08-22T09:12:11Z)
• Occlusion Reasoning for Skeleton Extraction of Self-Occluded Tree Canopies [5.368313160283353]
  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.
  arXiv  Detail & Related papers  (2023-01-20T01:46:07Z)
• Enforcing connectivity of 3D linear structures using their 2D projections [54.0598511446694]
  We propose to improve the 3D connectivity of our results by minimizing a sum of topology-aware losses on their 2D projections. This suffices to increase the accuracy and to reduce the annotation effort required to provide the required annotated training data.
  arXiv  Detail & Related papers  (2022-07-14T11:42:18Z)
• 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)
• 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)
• A Study on Trees's Knots Prediction from their Bark Outer-Shape [0.0]
  In the industry, the value of wood-logs strongly depends on their internal structure and more specifically on the knots' distribution inside the trees. Knowing where the knots are within a tree could improve the efficiency of the overall tree industry by reducing waste and improving the quality of wood-logs by-products. Three types of techniques based on Convolutional Neural Networks (CNN) will be studied. The architectures are tested on both real and synthetic CT-scanned trees.
  arXiv  Detail & Related papers  (2020-10-05T19:13:10Z)
• MurTree: Optimal Classification Trees via Dynamic Programming and Search [61.817059565926336]
  We present a novel algorithm for learning optimal classification trees based on dynamic programming and search. Our approach uses only a fraction of the time required by the state-of-the-art and can handle datasets with tens of thousands of instances.
  arXiv  Detail & Related papers  (2020-07-24T17:06:55Z)
• Exploiting Syntactic Structure for Better Language Modeling: A Syntactic Distance Approach [78.77265671634454]
  We make use of a multi-task objective, i.e., the models simultaneously predict words as well as ground truth parse trees in a form called "syntactic distances" Experimental results on the Penn Treebank and Chinese Treebank datasets show that when ground truth parse trees are provided as additional training signals, the model is able to achieve lower perplexity and induce trees with better quality.
  arXiv  Detail & Related papers  (2020-05-12T15:35:00Z)
• 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.