Benchmarking Individual Tree Mapping with Sub-meter Imagery

• URL: http://arxiv.org/abs/2311.07981v1
• Date: Tue, 14 Nov 2023 08:21:36 GMT
• Title: Benchmarking Individual Tree Mapping with Sub-meter Imagery
• Authors: Dimitri Gominski, Ankit Kariryaa, Martin Brandt, Christian Igel, Sizhuo Li, Maurice Mugabowindekwe, Rasmus Fensholt
• Abstract summary: We introduce an evaluation framework suited for individual tree mapping in any physical environment. We review and compare different approaches and deep architectures, and introduce a new method that we experimentally prove to be a good compromise between segmentation and detection.
• Score: 6.907098367807166
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: There is a rising interest in mapping trees using satellite or aerial imagery, but there is no standardized evaluation protocol for comparing and enhancing methods. In dense canopy areas, the high variability of tree sizes and their spatial proximity makes it arduous to define the quality of the predictions. Concurrently, object-centric approaches such as bounding box detection usuallyperform poorly on small and dense objects. It thus remains unclear what is the ideal framework for individual tree mapping, in regards to detection and segmentation approaches, convolutional neural networks and transformers. In this paper, we introduce an evaluation framework suited for individual tree mapping in any physical environment, with annotation costs and applicative goals in mind. We review and compare different approaches and deep architectures, and introduce a new method that we experimentally prove to be a good compromise between segmentation and detection.

Related papers

• ViTree: Single-path Neural Tree for Step-wise Interpretable Fine-grained Visual Categorization [56.37520969273242]
  We introduce ViTree, a novel approach for fine-grained visual categorization. By traversing the tree paths, ViTree effectively selects patches from transformer-processed features to highlight informative local regions. This patch and path selectivity enhances model interpretability of ViTree, enabling better insights into the model's inner workings.
  arXiv  Detail & Related papers  (2024-01-30T14:32:25Z)
• Hierarchical clustering with dot products recovers hidden tree structure [53.68551192799585]
  In this paper we offer a new perspective on the well established agglomerative clustering algorithm, focusing on recovery of hierarchical structure. We recommend a simple variant of the standard algorithm, in which clusters are merged by maximum average dot product and not, for example, by minimum distance or within-cluster variance. We demonstrate that the tree output by this algorithm provides a bona fide estimate of generative hierarchical structure in data, under a generic probabilistic graphical model.
  arXiv  Detail & Related papers  (2023-05-24T11:05:12Z)
• 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)
• 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)
• Comparative Study Between Distance Measures On Supervised Optimum-Path Forest Classification [0.0]
  Optimum-Path Forest (OPF) uses a graph-based methodology and a distance measure to create arcs between nodes and hence sets of trees. This work proposes a comparative study over a wide range of distance measures applied to the supervised Optimum-Path Forest classification.
  arXiv  Detail & Related papers  (2022-02-08T13:34:09Z)
• Triggering Failures: Out-Of-Distribution detection by learning from local adversarial attacks in Semantic Segmentation [76.2621758731288]
  We tackle the detection of out-of-distribution (OOD) objects in semantic segmentation. Our main contribution is a new OOD detection architecture called ObsNet associated with a dedicated training scheme based on Local Adversarial Attacks (LAA) We show it obtains top performances both in speed and accuracy when compared to ten recent methods of the literature on three different datasets.
  arXiv  Detail & Related papers  (2021-08-03T17:09:56Z)
• Instance segmentation of fallen trees in aerial color infrared imagery using active multi-contour evolution with fully convolutional network-based intensity priors [0.5276232626689566]
  We introduce a framework for segmenting instances of a common object class by multiple active contour evolution over semantic segmentation maps of images. We instantiate the proposed framework in the context of segmenting individual fallen stems from high-resolution aerial multispectral imagery.
  arXiv  Detail & Related papers  (2021-05-05T11:54:05Z)
• Rethinking Learnable Tree Filter for Generic Feature Transform [71.77463476808585]
  Learnable Tree Filter presents a remarkable approach to model structure-preserving relations for semantic segmentation. To relax the geometric constraint, we give the analysis by reformulating it as a Markov Random Field and introduce a learnable unary term. For semantic segmentation, we achieve leading performance (82.1% mIoU) on the Cityscapes benchmark without bells-and-whistles.
  arXiv  Detail & Related papers  (2020-12-07T07:16:47Z)
• TopNet: Topology Preserving Metric Learning for Vessel Tree Reconstruction and Labelling [22.53041565779104]
  We propose a novel deep learning architecture for vessel tree reconstruction. The network architecture simultaneously solves the task of detecting voxels on vascular centerlines (i.e. nodes) and estimates connectivity between center-voxels (edges) in the tree structure to be reconstructed. A thorough evaluation on public IRCAD dataset shows that the proposed method considerably outperforms existing semantic segmentation based methods.
  arXiv  Detail & Related papers  (2020-09-18T07:55:58Z)
• 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)
• Rethinking Localization Map: Towards Accurate Object Perception with Self-Enhancement Maps [78.2581910688094]
  This work introduces a novel self-enhancement method to harvest accurate object localization maps and object boundaries with only category labels as supervision. In particular, the proposed Self-Enhancement Maps achieve the state-of-the-art localization accuracy of 54.88% on ILSVRC.
  arXiv  Detail & Related papers  (2020-06-09T12:35:55Z)

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.