AN ITERATIVE TERRAIN RECOVERY APPROACH TO AUTOMATED DTM GENERATION FROM AIRBORNE LIDAR POINT CLOUDS
Bibliographic record
Abstract
Abstract. This paper presents a hierarchical recovery method to generate DTMs from airborne LiDAR point clouds based one an idea of layering. The developed method first registers the last return points, and then layering them. The layering is done by dividing the points into different height layers and assigning layer numbers to each point. The layer numbers are comparing references in later identification process. Then a series of rasterized pyramid levels which consisted of lowest points are generated. Since the outliers have been removed after the layering, the cells in top level are considered to be terrain points and used as reference to identify cells in the following level. After the identification of the second level, an interpolation will occur in the cells which identified as offterrain. And the interpolated level will be used as reference in its following level and the same process is repeated at each level. Once this process of the bottom level finished, the proposed method adjusts the results based on the first return feedback and followed by the final interpolation. As a result, this produces the final DTM. The developed method is data driven, and does not assume a prior knowledge about the scene complexity. The proposed method was tested with the ISPRS WG III/3 LiDAR datasets covering different terrain types and filtering difficulties. The results show that the proposed method can perform well in flat terrain or gentle slope area.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".