<i>TreeStructor</i>: Forest Reconstruction With Neural Ranking

We introduce <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TreeStructor</i>, a novel approach for isolating and reconstructing forest trees. The key novelty is a deep neural model that uses neural ranking to assign pre-generated connectable 3D geometries to a point cloud. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TreeStructor</i> is trained on a large set of synthetically generated point clouds. The input to our method is a forest point cloud (<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">FPC</i>) that we first decompose into point clouds that approximately represent trees (TPC) and then into point clouds that represent their parts (<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">PPC</i>). We use a point cloud encoder-decoder to compute embedding vectors that retrieve the best-fitting surface mesh for each <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">PPC</i> from a large set of predefined branch parts. Finally, the retrieved meshes are connected and oriented to obtain individual surface meshes of all trees represented by the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">FPC</i>. We qualitatively and quantitatively validate that our method can reconstruct forest trees with unprecedented accuracy and visual fidelity. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TreeStructor</i> outperforms the state-of-the-art reconstruction method for around 6% on quantitative metrics and 12% less error compared with QSM on low-quality scanned data. The code and data are available at https://lewkesy.github.io/<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TreeStructor</i>/.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Geoscience and Remote Sensing
Published
2025-01-01
DOI
https://doi.org/10.1109/tgrs.2025.3558312
Citations
2
Primary Topic
Remote Sensing and LiDAR Applications
Type
article
Field-Weighted Citation Impact
1.60
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

TreeStructor: Forest Reconstruction With Neural Ranking

Sören Pirk, Songlin Fei, Ayman Habib, Bedřich Beneš et al.
2 citations
IEEE Transactions on Geoscience and Remote Sensing
Remote Sensing and LiDAR Applications
1.60
article

TreeStructor: Forest Reconstruction With Neural Ranking

Sören Pirk, Songlin Fei, Ayman Habib, Bedřich Beneš, J. Shao, Bosheng Li, Xiaocheng Zhou
article en
2 citations

Abstract

We introduce <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TreeStructor</i>, a novel approach for isolating and reconstructing forest trees. The key novelty is a deep neural model that uses neural ranking to assign pre-generated connectable 3D geometries to a point cloud. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TreeStructor</i> is trained on a large set of synthetically generated point clouds. The input to our method is a forest point cloud (<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">FPC</i>) that we first decompose into point clouds that approximately represent trees (TPC) and then into point clouds that represent their parts (<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">PPC</i>). We use a point cloud encoder-decoder to compute embedding vectors that retrieve the best-fitting surface mesh for each <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">PPC</i> from a large set of predefined branch parts. Finally, the retrieved meshes are connected and oriented to obtain individual surface meshes of all trees represented by the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">FPC</i>. We qualitatively and quantitatively validate that our method can reconstruct forest trees with unprecedented accuracy and visual fidelity. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TreeStructor</i> outperforms the state-of-the-art reconstruction method for around 6% on quantitative metrics and 12% less error compared with QSM on low-quality scanned data. The code and data are available at https://lewkesy.github.io/<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TreeStructor</i>/.

IEEE Transactions on Geoscience and Remote SensingVol. 63
Purdue University West Lafayette (US), Christian-Albrechts-Universität zu Kiel (DE)
Openalex Percentile: Top 19%
Remote Sensing and LiDAR Applications
1.60
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.