ZS-TreeSeg: A Zero-Shot Framework for Tree Crown Instance Segmentation
- URL: http://arxiv.org/abs/2602.00470v1
- Date: Sat, 31 Jan 2026 02:48:17 GMT
- Title: ZS-TreeSeg: A Zero-Shot Framework for Tree Crown Instance Segmentation
- Authors: Pengyu Chen, Fangzheng Lyu, Sicheng Wang, Cuizhen Wang,
- Abstract summary: Individual tree crown segmentation is an important task in remote sensing for biomass estimation and ecological monitoring.<n>We propose ZSeg, a framework that adapts from two mature tasks.<n>Our framework generalizes robustly across sensor types and canopy.
- Score: 5.392796525513568
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Individual tree crown segmentation is an important task in remote sensing for forest biomass estimation and ecological monitoring. However, accurate delineation in dense, overlapping canopies remains a bottleneck. While supervised deep learning methods suffer from high annotation costs and limited generalization, emerging foundation models (e.g., Segment Anything Model) often lack domain knowledge, leading to under-segmentation in dense clusters. To bridge this gap, we propose ZS-TreeSeg, a Zero-Shot framework that adapts from two mature tasks: 1) Canopy Semantic segmentation; and 2) Cells instance segmentation. By modeling tree crowns as star-convex objects within a topological flow field using Cellpose-SAM, the ZS-TreeSeg framework forces the mathematical separation of touching tree crown instances based on vector convergence. Experiments on the NEON and BAMFOREST datasets and visual inspection demonstrate that our framework generalizes robustly across diverse sensor types and canopy densities, which can offer a training-free solution for tree crown instance segmentation and labels generation.
Related papers
- Learning Order Forest for Qualitative-Attribute Data Clustering [52.612779710298526]
This paper discovers a tree-like distance structure to flexibly represent the local order relationship among intra-attribute qualitative values.<n>A joint learning mechanism is proposed to iteratively obtain more appropriate tree structures and clusters.<n>Experiments demonstrate that the joint learning adapts the forest to the clustering task to yield accurate results.
arXiv Detail & Related papers (2026-03-03T07:49:50Z) - Learning Image-based Tree Crown Segmentation from Enhanced Lidar-based Pseudo-labels [2.0799088384708564]
We present a method to train deep learning models that segment and separate individual trees from RGB and multispectral images.<n>Our method offers a way to obtain domain-specific training annotations for optical image-based models without any manual annotation cost.
arXiv Detail & Related papers (2026-02-13T15:26:38Z) - Weakly-Supervised Learning for Tree Instances Segmentation in Airborne Lidar Point Clouds [1.5624421399300306]
Tree instance segmentation of airborne laser scanning (ALS) data is of utmost importance for forest monitoring.<n>We propose a weakly supervised approach where labels of an initial segmentation result are provided as a quality rating by a human operator.<n>The labels produced during the quality assessment are then used to train a rating model, whose task is to classify a segmentation output into the same classes as specified by the human operator.
arXiv Detail & Related papers (2025-08-21T15:25:23Z) - Zero-Shot Tree Detection and Segmentation from Aerial Forest Imagery [1.2770132985501168]
Current RGB tree segmentation methods rely on training specialized machine learning models with labeled tree datasets.<n>In this paper, we investigate the efficacy of using a state-of-the-art image segmentation model, Segment Anything Model 2 (SAM2) in a zero-shot manner for individual tree detection and segmentation.<n>Our results suggest that SAM2 not only has impressive generalization capabilities, but also can form a natural synergy with specialized methods trained on in-domain labeled data.
arXiv Detail & Related papers (2025-06-03T17:44:43Z) - Bridging Classical and Modern Computer Vision: PerceptiveNet for Tree Crown Semantic Segmentation [0.0]
PerceptiveNet is a novel model incorporating a Logarithmic Gabor- parameterised convolutional layer with trainable filter parameters.<n>We investigate the impact of Log-Gabor, Gabor, and standard convolutional layers on semantic segmentation performance.<n>Our results outperform state-of-the-art models, demonstrating significant performance improvements on a tree crown dataset.
arXiv Detail & Related papers (2025-05-29T16:11:08Z) - View-Consistent Hierarchical 3D Segmentation Using Ultrametric Feature Fields [52.08335264414515]
We learn a novel feature field within a Neural Radiance Field (NeRF) representing a 3D scene.
Our method takes view-inconsistent multi-granularity 2D segmentations as input and produces a hierarchy of 3D-consistent segmentations as output.
We evaluate our method and several baselines on synthetic datasets with multi-view images and multi-granular segmentation, showcasing improved accuracy and viewpoint-consistency.
arXiv Detail & Related papers (2024-05-30T04:14:58Z) - Unsupervised Universal Image Segmentation [59.0383635597103]
We propose an Unsupervised Universal model (U2Seg) adept at performing various image segmentation tasks.
U2Seg generates pseudo semantic labels for these segmentation tasks via leveraging self-supervised models.
We then self-train the model on these pseudo semantic labels, yielding substantial performance gains.
arXiv Detail & Related papers (2023-12-28T18:59:04Z) - A Lightweight Clustering Framework for Unsupervised Semantic
Segmentation [28.907274978550493]
Unsupervised semantic segmentation aims to categorize each pixel in an image into a corresponding class without the use of annotated data.
We propose a lightweight clustering framework for unsupervised semantic segmentation.
Our framework achieves state-of-the-art results on PASCAL VOC and MS COCO datasets.
arXiv Detail & Related papers (2023-11-30T15:33:42Z) - 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) - Occlusion-Aware Instance Segmentation via BiLayer Network Architectures [73.45922226843435]
We propose Bilayer Convolutional Network (BCNet), where the top layer detects occluding objects (occluders) and the bottom layer infers partially occluded instances (occludees)
We investigate the efficacy of bilayer structure using two popular convolutional network designs, namely, Fully Convolutional Network (FCN) and Graph Convolutional Network (GCN)
arXiv Detail & Related papers (2022-08-08T21:39:26Z) - Semantic Attention and Scale Complementary Network for Instance
Segmentation in Remote Sensing Images [54.08240004593062]
We propose an end-to-end multi-category instance segmentation model, which consists of a Semantic Attention (SEA) module and a Scale Complementary Mask Branch (SCMB)
SEA module contains a simple fully convolutional semantic segmentation branch with extra supervision to strengthen the activation of interest instances on the feature map.
SCMB extends the original single mask branch to trident mask branches and introduces complementary mask supervision at different scales.
arXiv Detail & Related papers (2021-07-25T08:53:59Z) - Deep Occlusion-Aware Instance Segmentation with Overlapping BiLayers [72.38919601150175]
We propose Bilayer Convolutional Network (BCNet) to segment highly-overlapping objects.
BCNet detects the occluding objects (occluder) and the bottom GCN layer infers partially occluded instance (occludee)
arXiv Detail & Related papers (2021-03-23T06:25:42Z)
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.