Scene-Layout Compatible Conditional Random Field for Classifying Terrestrial Laser Point Clouds
Bibliographic record
Abstract
Abstract. Terrestrial Laser Scanning (TLS) rapidly becomes a primary surveying tool due to its fast acquisition of highly dense threedimensional point clouds. For fully utilizing its benefits, developing a robust method to classify many objects of interests from huge amounts of laser point clouds is urgently required. Conditional Random Field (CRF) is a well-known discriminative classifier, which integrates local appearance of the observation (laser point) with spatial interactions among its neighbouring points in classification process. Typical CRFs employ generic label consistency using short-range dependency only, which often causes locality problem. In this paper, we present a multi-range and asymmetric Conditional Random Field (CRF) (maCRF), which adopts a priori information of scene-layout compatibility addressing long-range dependency. The proposed CRF constructs two graphical models, one for enhancing a local labelling smoothness within short-range (srCRF) and the other for favouring a global and asymmetric regularity of spatial arrangement between different object classes within long-range (lrCRF). This maCRF classifier assumes two graphical models (srCRF and lrCRF) are independent of each other. Final labelling decision was accomplished by probabilistically combining prediction results obtained from two CRF models. We validated maCRF's performance with TLS point clouds acquired from RIEGL LMS-Z390i scanner using cross validation. Experiment results demonstrate that synergetic classification improvement can be achievable by incorporating two CRF models.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| 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.001 | 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".