Multispectral Airborne LiDAR Point Cloud Classification With Maximum Entropy Hierarchical Pooling
Bibliographic record
Abstract
The demand for accurate airborne LiDAR point cloud classification has increased with improved resolutions of land cover map products. Although existing deep learning-based methods are capable of classifying airborne LiDAR point clouds, these methods indeed have a limited capability to extract the local features and suffer from global and local information losses with the commonly used pooling approaches. Therefore, we present a deep learning-based optimal homogeneous neighbor selection (HNS) and hierarchical pooling by exploiting maximum entropy, called MEHPool. The module is designed to directly extract sufficient homogeneous neighbor points for each point, followed by a designed graph pooling (GP) layer that encapsulates the selected homogeneous neighbor points into small-size graphs to build hierarchical features. The plug-and-play module consisting of an HNS module, two GP layers, and three graph neural networks (GNNs) can be easily embedded into various networks for point cloud classification and produces the architecture MEHPool-Net in this letter. Our experimental results show that the proposed MEHPool-Net realizes effective performance for multispectral airborne LiDAR point cloud classification, consistently outperforms four other deep learning methods, and confirms the superiority of the GP module compared with five other pooling methods.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".