POINTNET++ TRANSFER LEARNING FOR TREE EXTRACTION FROM MOBILE LIDAR POINT CLOUDS
Bibliographic record
Abstract
Abstract. Trees are an essential part of the natural and urban environment due to providing crucial benefits such as increasing air quality and wildlife habitats. Therefore, various remote sensing and photogrammetry technologies, including Mobile Laser Scanner (MLS), have been recently introduced for precise 3D tree mapping and modeling. The MLS provides densely 3D LiDAR point clouds from the surrounding, which results in measuring applicable information of trees like stem diameter or elevation. In this paper, a transfer learning procedure on the PointNet++ has been proposed for tree extraction. Initially, two steps of converting the MLS point clouds into same-length smaller sections and eliminating ground points have been conducted to overcome the massive volume of MLS data. The algorithm was tested on four LiDAR datasets ranging from challengeable urban environments containing multiple objects like tall buildings to railway surroundings. F1-Score accuracy was gained at around 93% and 98%, which showed the feasibility and efficiency of the proposed algorithm. Noticeably, the algorithms also measured geometrical information of extracted trees such as 2D coordinate space, height, stem diameter, and 3D boundary tree locations.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".