Improving Knot Prediction in Wood Logs with Longitudinal Feature Propagation

• URL: http://arxiv.org/abs/2308.11291v1
• Date: Tue, 22 Aug 2023 09:12:11 GMT
• Title: Improving Knot Prediction in Wood Logs with Longitudinal Feature Propagation
• Authors: Salim Khazem, Jeremy Fix, C\'edric Pradalier
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The quality of a wood log in the wood industry depends heavily on the presence of both outer and inner defects, including inner knots that are a result of the growth of tree branches. Today, locating the inner knots require the use of expensive equipment such as X-ray scanners. 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. Once the neural network is trained, inference can be performed from the outer shape measured with cheap devices such as laser profilers. We demonstrate the effectiveness of our approach on fir and spruce tree species and perform ablation on the recurrence to demonstrate its importance.

Related papers

• Towards synthetic generation of realistic wooden logs [0.03994567502796063]
  We propose a novel method to synthetically generate realistic 3D representations of wooden logs. Efficient sawmilling relies on accurate measurement of logs and the distribution of knots inside them. We demonstrate that the proposed mathematical log model accurately fits to real data obtained from CT scans and enables the generation of realistic logs.
  arXiv  Detail & Related papers  (2025-03-18T14:16:21Z)
• Deep Unsupervised Segmentation of Log Point Clouds [0.04681661603096333]
  In sawmills, it is essential to accurately measure the raw material, i.e. wooden logs, to optimise the sawing process. Earlier studies have shown that accurate predictions of the inner structure of the logs can be obtained using just surface point clouds produced by a laser scanner. We propose a novel Point Transformer-based point cloud segmentation technique that learns to find the points belonging to the log surface in unsupervised manner.
  arXiv  Detail & Related papers  (2025-03-18T13:28:10Z)
• 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)
• Addressing caveats of neural persistence with deep graph persistence [54.424983583720675]
  We find that the variance of network weights and spatial concentration of large weights are the main factors that impact neural persistence. We propose an extension of the filtration underlying neural persistence to the whole neural network instead of single layers. This yields our deep graph persistence measure, which implicitly incorporates persistent paths through the network and alleviates variance-related issues.
  arXiv  Detail & Related papers  (2023-07-20T13:34:11Z)
• 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)
• 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)
• Simultaneous Bone and Shadow Segmentation Network using Task Correspondence Consistency [60.378180265885945]
  We propose a single end-to-end network with a shared transformer-based encoder and task independent decoders for simultaneous bone and shadow segmentation. We also introduce a correspondence consistency loss which makes sure that network utilizes the inter-dependency between the bone surface and its corresponding shadow to refine the segmentation.
  arXiv  Detail & Related papers  (2022-06-16T22:37:05Z)
• On the Neural Tangent Kernel Analysis of Randomly Pruned Neural Networks [91.3755431537592]
  We study how random pruning of the weights affects a neural network's neural kernel (NTK) In particular, this work establishes an equivalence of the NTKs between a fully-connected neural network and its randomly pruned version.
  arXiv  Detail & Related papers  (2022-03-27T15:22:19Z)
• And/or trade-off in artificial neurons: impact on adversarial robustness [91.3755431537592]
  Presence of sufficient number of OR-like neurons in a network can lead to classification brittleness and increased vulnerability to adversarial attacks. We define AND-like neurons and propose measures to increase their proportion in the network. Experimental results on the MNIST dataset suggest that our approach holds promise as a direction for further exploration.
  arXiv  Detail & Related papers  (2021-02-15T08:19:05Z)
• 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)
• Identifying and interpreting tuning dimensions in deep networks [83.59965686504822]
  tuning dimension is a stimulus attribute that accounts for much of the activation variance of a group of neurons. This work contributes an unsupervised framework for identifying and interpreting "tuning dimensions" in deep networks.
  arXiv  Detail & Related papers  (2020-11-05T21:26:03Z)
• 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)
• Deep Modeling of Growth Trajectories for Longitudinal Prediction of Missing Infant Cortical Surfaces [58.780482825156035]
  We will introduce a method for longitudinal prediction of cortical surfaces using a spatial graph convolutional neural network (GCNN) The proposed method is designed to model the cortical growth trajectories and jointly predict inner and outer curved surfaces at multiple time points. We will demonstrate with experimental results that our method is capable of capturing the nonlinearity oftemporal cortical growth patterns.
  arXiv  Detail & Related papers  (2020-09-06T18:46:04Z)
• A Survey On 3D Inner Structure Prediction from its Outer Shape [0.0]
  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.
  arXiv  Detail & Related papers  (2020-02-11T17:56:38Z)

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.