Filtering airborne LiDAR data based on multi-view window and multi-resolution hierarchical cloth simulation
Bibliographic record
Abstract
Ground filtering is a fundamental step in airborne LiDAR data processing toward a variety of applications. However, existing algorithms remain tremendously challenging in complex environments, e.g. steep hillsides, ridges, valleys, discontinuities, and numerous objects. We presented a new ground filtering algorithm that can handle various landscapes. First, the multi-view window is developed to increase the number of ground seeds on the various terrains. Second, multi-resolution hierarchical cloth simulation is used to rapidly construct the high-resolution reference terrain, and bidirectional internal force operation is proposed to improve the accuracy of reference terrain by smoothing the spikes in cloth. Finally, ground and non-ground points are classified based on the height differences between points and the reference terrain. The proposed algorithm was validated not only in the International Society for Photogrammetry and Remote Sensing (ISPRS) but also karst datasets, where particularly complex environments is contained. Results showed that the proposed algorithm outperformed the existing algorithms, with the lowest average total error of 3.85% and the highest average kappa coefficient of 87.75%. Moreover, the proposed algorithm can completely preserve complex terrain, e.g. extremely steep hillsides, and sharp ridges. This study had great potential to provide a useful tool for LiDAR data processing.
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.000 |
| 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".