Joint Clusters and Iterative Graph Cuts for ALS Point Cloud Filtering
Bibliographic record
Abstract
A novel method that combines joint clusters and iterative graph cuts for ALS point cloud filtering is proposed in this paper. The method first extracts clusters of points from the raw point cloud, and then classifies ground points at the cluster level. There are four main steps, i.e., two-step point cloud clustering, critical point extraction, initial terrain determination, and terrain densification based on iterative graph cuts. Smooth clusters, rough clusters, and scattered points are extracted by the two-step clustering to depict the raw point cloud, which reduces the complexity of raw data and the judgment difficulty in the subsequent procedures. Critical points of each cluster are extracted, and the initial terrain is determined among the smooth clusters. Using the initial terrain and critical points, iterative graph cuts is performed to segment ground and nonground points at the cluster level. Experiments on ISPRS dataset with a low point density and Utah dataset with a moderate point density show that our approach provides a satisfactory trade off between Type I and Type II errors. Moreover, our method significantly outperforms progressive TIN densification based filters, and successfully controls Type II errors.
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.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.005 | 0.005 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.002 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".