A Brief Analysis of the Iterative Next Boundary Detection Network for Tree Rings Delineation in Images of Pinus taeda

• URL: http://arxiv.org/abs/2408.14343v1
• Date: Mon, 26 Aug 2024 15:16:28 GMT
• Title: A Brief Analysis of the Iterative Next Boundary Detection Network for Tree Rings Delineation in Images of Pinus taeda
• Authors: Henry Marichal, Gregory Randall,
• Abstract summary: INBD network operates in two stages: first, it segments the background, pith, and ring boundaries. In the second stage, the image is transformed into polar coordinates, and ring boundaries are iteratively segmented from the pith to the bark. The method achieves an F-Score of 77.5, a mAR of 0.540, and an ARAND of 0.205 on the evaluation set.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: This work presents the INBD network proposed by Gillert et al. in CVPR-2023 and studies its application for delineating tree rings in RGB images of Pinus taeda cross sections captured by a smartphone (UruDendro dataset), which are images with different characteristics from the ones used to train the method. The INBD network operates in two stages: first, it segments the background, pith, and ring boundaries. In the second stage, the image is transformed into polar coordinates, and ring boundaries are iteratively segmented from the pith to the bark. Both stages are based on the U-Net architecture. The method achieves an F-Score of 77.5, a mAR of 0.540, and an ARAND of 0.205 on the evaluation set. The code for the experiments is available at https://github.com/hmarichal93/mlbrief_inbd.

Related papers

• DeepCS-TRD, a Deep Learning-based Cross-Section Tree Ring Detector [0.0]
  Deep CS-TRD is a new automatic algorithm for detecting tree rings in whole cross-sections. It substitutes the edge detection step of CS-TRD by a deep-learning-based approach (U-Net)
  arXiv  Detail & Related papers  (2025-04-22T20:15:49Z)
• UruDendro, a public dataset of cross-section images of Pinus taeda [0.0]
  This paper presents a publicly available database of 64 scanned images of transverse sections of commercially grown Pinus taeda trees from northern Uruguay, ranging from 17 to 24 years old. The collection contains several challenging features for automatic ring detection, including illumination and surface preparation variation, fungal infection (blue stains), knot formation, missing cortex or interruptions in outer rings, and radial cracking. This paper presents to the dendrochronology community one such method, Cross-Section Tree-Ring Detection (CS-TRD), which identifies and marks complete annual rings in cross-sections for tree species presenting a clear definition between early and latewood.
  arXiv  Detail & Related papers  (2024-04-16T19:10:40Z)
• Automatic Wood Pith Detector: Local Orientation Estimation and Robust Accumulation [0.0]
  We present a fully automated technique for wood pith detection (APD) The method estimates the ring's local orientations using the 2D structure tensor and finds the pith position. We also present a variant (APD-PCL) that enhances the method's effectiveness when there are no clear tree ring patterns.
  arXiv  Detail & Related papers  (2024-04-02T13:47:15Z)
• CS-TRD: a Cross Sections Tree Ring Detection method [0.0]
  The method depends on the parameters for the Canny Devernay edge detector (sigma), a resize factor, the number of rays, and the pith location. CS-TRD is fully automated and achieves an F-Score of 89% in the UruDendro dataset (of Pinus taeda) and 97% in the Kennel dataset (of Abies alba) without specialized hardware requirements.
  arXiv  Detail & Related papers  (2023-05-18T08:43:57Z)
• Point2Tree(P2T) -- framework for parameter tuning of semantic and instance segmentation used with mobile laser scanning data in coniferous forest [0.22940141855172028]
  We train a model based on Pointnet++ architecture which achieves 0.92 F1-score in semantic segmentation. As a second step in our pipeline we used graph-based approach for instance segmentation which reached F1-score approx. 0.6.
  arXiv  Detail & Related papers  (2023-05-04T08:45:17Z)
• Iterative Next Boundary Detection for Instance Segmentation of Tree Rings in Microscopy Images of Shrub Cross Sections [58.720142291102135]
  We propose a new iterative method which we term Iterative Next Boundary Detection (INBD) It intuitively models the natural growth direction, starting from the center of the shrub cross section and detecting the next ring boundary in each step. In our experiments, INBD shows superior performance to generic instance segmentation methods and is the only one with a built-in notion of chronological order.
  arXiv  Detail & Related papers  (2022-12-06T14:49:41Z)
• CroCo: Cross-Modal Contrastive learning for localization of Earth Observation data [62.96337162094726]
  It is of interest to localize a ground-based LiDAR point cloud on remote sensing imagery. We propose a contrastive learning-based method that trains on DEM and high-resolution optical imagery. In the best scenario, the Top-1 score of 0.71 and Top-5 score of 0.81 are obtained.
  arXiv  Detail & Related papers  (2022-04-14T15:55:00Z)
• A singular Riemannian geometry approach to Deep Neural Networks II. Reconstruction of 1-D equivalence classes [78.120734120667]
  We build the preimage of a point in the output manifold in the input space. We focus for simplicity on the case of neural networks maps from n-dimensional real spaces to (n - 1)-dimensional real spaces.
  arXiv  Detail & Related papers  (2021-12-17T11:47:45Z)
• DFM: A Performance Baseline for Deep Feature Matching [10.014010310188821]
  The proposed method uses pre-trained VGG architecture as a feature extractor and does not require any additional training specific to improve matching. Our algorithm achieves 0.57 and 0.80 overall scores in terms of Mean Matching Accuracy (MMA) for 1 pixel and 2 pixels thresholds respectively on Hpatches dataset.
  arXiv  Detail & Related papers  (2021-06-14T22:55:06Z)
• Deep ensembles based on Stochastic Activation Selection for Polyp Segmentation [82.61182037130406]
  This work deals with medical image segmentation and in particular with accurate polyp detection and segmentation during colonoscopy examinations. Basic architecture in image segmentation consists of an encoder and a decoder. We compare some variant of the DeepLab architecture obtained by varying the decoder backbone.
  arXiv  Detail & Related papers  (2021-04-02T02:07:37Z)
• Saliency Enhancement using Gradient Domain Edges Merging [65.90255950853674]
  We develop a method to merge the edges with the saliency maps to improve the performance of the saliency. This leads to our proposed saliency enhancement using edges (SEE) with an average improvement of at least 3.4 times higher on the DUT-OMRON dataset. The SEE algorithm is split into 2 parts, SEE-Pre for preprocessing and SEE-Post pour postprocessing.
  arXiv  Detail & Related papers  (2020-02-11T14:04:56Z)
• R-FCN: Object Detection via Region-based Fully Convolutional Networks [87.62557357527861]
  We present region-based, fully convolutional networks for accurate and efficient object detection. Our result is achieved at a test-time speed of 170ms per image, 2.5-20x faster than the Faster R-CNN counterpart.
  arXiv  Detail & Related papers  (2016-05-20T15:50:11Z)

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.