TRAS: An Interactive Software for Tracing Tree Ring Cross Sections

• URL: http://arxiv.org/abs/2605.08025v1
• Date: Fri, 08 May 2026 17:11:38 GMT
• Title: TRAS: An Interactive Software for Tracing Tree Ring Cross Sections
• Abstract summary: Tree Ring Analyzer Suite (TRAS) is an open-source software for automatic delineation, manual correction, and measurement of tree rings in wood cross-sectional images.<n>TRAS integrates three complementary detection algorithms: the classical image-processing method CS-TRD and two deep-learning approaches, DeepCS-TRD and INBD.<n>DeepCS-TRD achieved the best automatic detection performance, with an F-score of 81.0% and precision of 86.4%.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Tree ring marking remains a key step in dendrometry and dendrochronology, but it is often performed manually, making the process time-consuming, subjective, and difficult to scale to large image datasets. We present the Tree Ring Analyzer Suite (TRAS), an open-source graphical software for automatic delineation, manual correction, and measurement of tree rings in wood cross-sectional images. TRAS integrates three complementary detection algorithms: the classical image-processing method CS-TRD and two deep-learning approaches, DeepCS-TRD and INBD. The interface allows users to refine automatic detections, remove false positives, and manually add missing rings. It also computes dendrochronological metrics such as earlywood and latewood areas, ring perimeter, equivalent ring width, and custom path-based ring-width measurements. TRAS was evaluated on 18 expertly annotated Pinus taeda L. cross-section images. DeepCS-TRD achieved the best automatic detection performance, with an F-score of 81.0% and precision of 86.4%. Automatic detection reduced the required manual correction effort to approximately 20% of ring boundaries. For one-dimensional ring-width measurements, TRAS showed excellent agreement with CooRecorder ($r > 0.99$). Common detection errors, such as jump propagation or false positives near knots, were easily corrected through the postprocessing interface. TRAS provides a flexible and reproducible solution for tree-ring analysis on Windows, macOS, and Linux. Code is available at the https://hmarichal93.github.io/tras.

Related papers

• Thinking in Scales: Accelerating Gigapixel Pathology Image Analysis via Adaptive Continuous Reasoning [52.41928980786654]
  We propose PathCTM to enable token-efficient scale-space continuous reasoning for gigapixel whole slide images.<n>PathCTM formulates diagnostic inference as a dynamic sequential information pursuit.<n>It reduces the number of required image patches by 95.95% and shortens inference time by approximately 95.62%, while maintaining AUC without degradation.
  arXiv  Detail & Related papers  (2026-05-19T07:46:44Z)
• 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.<n>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)
• Global Context Aggregation Network for Lightweight Saliency Detection of Surface Defects [70.48554424894728]
  We develop a Global Context Aggregation Network (GCANet) for lightweight saliency detection of surface defects on the encoder-decoder structure. First, we introduce a novel transformer encoder on the top layer of the lightweight backbone, which captures global context information through a novel Depth-wise Self-Attention (DSA) module. The experimental results on three public defect datasets demonstrate that the proposed network achieves a better trade-off between accuracy and running efficiency compared with other 17 state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-09-22T06:19:11Z)
• 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)
• Read Pointer Meters in complex environments based on a Human-like Alignment and Recognition Algorithm [16.823681016882315]
  We propose a human-like alignment and recognition algorithm to overcome these problems. A Spatial Transformed Module(STM) is proposed to obtain the front view of images in a self-autonomous way. A Value Acquisition Module(VAM) is proposed to infer accurate meter values by an end-to-end trained framework.
  arXiv  Detail & Related papers  (2023-02-28T05:37:04Z)
• 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)
• Lightweight Salient Object Detection in Optical Remote Sensing Images via Feature Correlation [93.80710126516405]
  We propose a novel lightweight ORSI-SOD solution, named CorrNet, to address these issues. By reducing the parameters and computations of each component, CorrNet ends up having only 4.09M parameters and running with 21.09G FLOPs. Experimental results on two public datasets demonstrate that our lightweight CorrNet achieves competitive or even better performance compared with 26 state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-01-20T08:28:01Z)
• Dense Label Encoding for Boundary Discontinuity Free Rotation Detection [69.75559390700887]
  This paper explores a relatively less-studied methodology based on classification. We propose new techniques to push its frontier in two aspects. Experiments and visual analysis on large-scale public datasets for aerial images show the effectiveness of our approach.
  arXiv  Detail & Related papers  (2020-11-19T05:42:02Z)
• Automatic Tree Ring Detection using Jacobi Sets [0.9786690381850356]
  We present novel automated methods for locating the pith of a tree disk, and ring boundaries. Our methods use a combination of standard image processing techniques and tools from topological data analysis. We evaluate the efficacy of our method for two different CT scans by comparing its results to manually located rings and centers.
  arXiv  Detail & Related papers  (2020-10-17T01:28:16Z)
• SADet: Learning An Efficient and Accurate Pedestrian Detector [68.66857832440897]
  This paper proposes a series of systematic optimization strategies for the detection pipeline of one-stage detector. It forms a single shot anchor-based detector (SADet) for efficient and accurate pedestrian detection. Though structurally simple, it presents state-of-the-art result and real-time speed of $20$ FPS for VGA-resolution images.
  arXiv  Detail & Related papers  (2020-07-26T12:32:38Z)
• High-Order Information Matters: Learning Relation and Topology for Occluded Person Re-Identification [84.43394420267794]
  We propose a novel framework by learning high-order relation and topology information for discriminative features and robust alignment. Our framework significantly outperforms state-of-the-art by6.5%mAP scores on Occluded-Duke dataset.
  arXiv  Detail & Related papers  (2020-03-18T12:18: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.