paper-with-me

홈 › Papers

Three-dimensional Segmentation of Trees Through a Flexible Multi-Class Graph Cut Algorithm (MCGC)

2019-03-20 · Jonathan Williams, Carola-Bibiane Schönlieb, Tom Swinfield, Juheon Lee, Xiaohao Cai, Lan Qie, David A. Coomes

Developing a robust algorithm for automatic individual tree crown (ITC) detection from laser scanning datasets is important for tracking the responses of trees to anthropogenic change. Such approaches allow the size, growth and mortality of individual trees to be measured, enabling forest carbon stocks and dynamics to be tracked and understood. Many algorithms exist for structurally simple forests including coniferous forests and plantations. Finding a robust solution for structurally complex, species-rich tropical forests remains a challenge; existing segmentation algorithms often perform less well than simple area-based approaches when estimating plot-level biomass. Here we describe a Multi-Class Graph Cut (MCGC) approach to tree crown delineation. This uses local three-dimensional geometry and density information, alongside knowledge of crown allometries, to segment individual tree crowns from LiDAR point clouds. Our approach robustly identifies trees in the top and intermediate layers of the canopy, but cannot recognise small trees. From these three-dimensional crowns, we are able to measure individual tree biomass. Comparing these estimates to those from permanent inventory plots, our algorithm is able to produce robust estimates of hectare-scale carbon density, demonstrating the power of ITC approaches in monitoring forests. The flexibility of our method to add additional dimensions of information, such as spectral reflectance, make this approach an obvious avenue for future development and extension to other sources of three-dimensional data, such as structure from motion datasets.

📄 PDF Abstract BibTeX arXiv:1903.08481

Code (1)

jonvw28/MCGC

Similar Papers 제목 키워드 기반

Segmentation of high dimensional means over multi-dimensional change points and connections to regression trees

2021-05-20 · Abhishek Kaul

This article is motivated by the objective of providing a new analytically tractable and fully frequentist framework to characterize and implement regression trees while also allowing a multivariate (potentially high dim…

Astronomyregressionvalid

SegNBDT: Visual Decision Rules for Segmentation

2020-06-11 · Alvin Wan, Daniel Ho, Younjin Song, Henk Tillman 외

The black-box nature of neural networks limits model decision interpretability, in particular for high-dimensional inputs in computer vision and for dense pixel prediction tasks like segmentation. To address this, prior …

Explainable Modelsimage-classificationImage ClassificationSegmentation

Improving the Projection of Global Structures in Data through Spanning Trees

2019-07-12 · Daniel Alcaide, Jan Aerts

The connection of edges in a graph generates a structure that is independent of a coordinate system. This visual metaphor allows creating a more flexible representation of data than a two-dimensional scatterplot. In this…

Dimensionality Reduction

Monitoring Urban Forests from Auto-Generated Segmentation Maps

2022-06-14 · Conrad M Albrecht, Chenying Liu, Yi Wang, Levente Klein 외

We present and evaluate a weakly-supervised methodology to quantify the spatio-temporal distribution of urban forests based on remotely sensed data with close-to-zero human interaction. Successfully training machine lear…

Semantic Segmentation

Fréchet random forests for metric space valued regression with non euclidean predictors

2019-06-04 · Louis Capitaine, Jérémie Bigot, Rodolphe Thiébaut, Robin Genuer

Random forests are a statistical learning method widely used in many areas of scientific research because of its ability to learn complex relationships between input and output variables and also its capacity to handle h…

regression