paper-with-me

홈 › Papers

Shortest-Path Decomposition for Foliage-Robust 3D Tree Modeling and Above-Ground Biomass Estimation from Point Clouds

2025-06-18 · Di Wang, Shi Li arxiv

Estimating above-ground biomass (AGB) from terrestrial laser scanning (TLS) via quantitative structural models (QSMs) is highly accurate under leaf-off conditions, yet major QSM paradigms degrade sharply when foliage is present. The standard remedy, leaf-wood separation, introduces its own errors and complexity. We present topology-driven foliage suppression that replaces explicit leaf--wood classification inside the reconstruction pipeline. On the shortest-path tree of a point-cloud graph, the number of root-to-node paths traversing a node equals the size of its rooted subtree, so path traversal frequency is an exact topological descriptor of branching hierarchy. Three decompositions of the path structure, plus an adaptive frequency threshold at the elbow of frequency growth along each branch, recover the branching hierarchy from a single Dijkstra run. We evaluate it on 90 trees under exclusively leaf-on conditions across tropical TLS and temperate UAV laser scanning (ULS) platforms. On dense tropical TLS it achieves a mean absolute percentage deviation (MAPD) of 17.2% with RMSE 2.37~Mg (RMSE% 34.8%) and an R^2 of 0.956, outperforming the best separation-assisted TreeQSM pipeline (21.2%). Structural analysis confirms that foliage introduces 2.6~cm of mean geometric error (3.8~cm RMS) and preserves the hierarchical volume distribution. On low-density ULS data, MAPD reaches 6.4% with field-measured diameter at breast height (DBH) and 32.3% with DBH inferred allometrically from tree height. All AGB experiments use identical parameter settings. Directly recovering branching hierarchy from shortest-path structure removes a barrier to operational QSM-based forest inventory under leaf-on conditions.

📄 PDF Abstract BibTeX arXiv:2506.15577

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Latent Tree Decomposition Parsers for AMR-to-Text Generation

2021-08-27 · Lisa Jin, Daniel Gildea

Graph encoders in AMR-to-text generation models often rely on neighborhood convolutions or global vertex attention. While these approaches apply to general graphs, AMRs may be amenable to encoders that target their tree-…

AMR-to-Text GenerationClusteringMolecular Property PredictionProperty Prediction+2

AGRO-Nav: Autonomous Graph-based Orchard Navigation

2026-08-26 · Ho Young Yun, Jaemin Yu, Duksu Kim arxiv

Orchards form semi-structured environments in which parallel tree rows create natural driving corridors, yet narrow inter-row clearance and dense foliage lead geometry-agnostic grid planners to drift off the row center a…

Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs

2021-12-25 · Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann 외

Active Directory is the default security management system for Windows domain networks. We study the shortest path edge interdiction problem for defending Active Directory style attack graphs. The problem is formulated a…

ManagementTree Decomposition

A Dependency-Based Neural Network for Relation Classification

2015-07-16 · IJCNLP 2015 7 · Yang Liu, Furu Wei, Sujian Li, Heng Ji 외

Previous research on relation classification has verified the effectiveness of using dependency shortest paths or subtrees. In this paper, we further explore how to make full use of the combination of these dependency in…

ClassificationGeneral ClassificationRelationRelation Classification

Query-decision Regression between Shortest Path and Minimum Steiner Tree

2024-02-03 · Guangmo Tong, Peng Zhao, Mina Samizadeh

Considering a graph with unknown weights, can we find the shortest path for a pair of nodes if we know the minimal Steiner trees associated with some subset of nodes? That is, with respect to a fixed latent decision-maki…

Decision MakingregressionSteiner Tree Problem