DETECTION AND SEGMENTATION OF POLE-LIKE OBJECTS IN MOBILE LASER SCANNING POINT CLOUDS
Bibliographic record
Abstract
Abstract. Pole-like object (PLO) detection and segmentation are important in many applications, such as 3D city modelling, urban planning, road assets monitoring, intelligent transportation, road safety, and forest monitoring. Arguably, vehicle-based mobile laser scanning (MLS) is the best on-road data acquisition system, because it is fast, precise and non-invasive. As part of that, laser scanning georeferenced data (i.e., point clouds) provide detailed structural morphology of the scanned objects. However, point clouds are not free from outliers and noise. Critically, many of the object extraction methods that depend on local saliency features (e.g., normals)-based segmentation use principal component analysis (PCA). PCA can provide the local features but struggle to produce robust results in the presence of outliers and noise. To reduce the influence of outliers for saliency features estimation and in segmentation, this paper employs Robust distance-based Diagnostic PCA (RD-PCA) coupled with the well-known DBSCAN clustering algorithm. This study contributes to a better understanding of object detection and segmentation by (i) exploring the problems of local saliency features estimation in the presence of outliers and noise; (ii) understanding problems with PCA and why RD-PCA is important; and (iii) introducing a novel method for PLOs detection and segmentation following a robust segmentation approach. The performance of the new algorithm is demonstrated through MLS data acquired in an urban road setup.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| 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".