An enhanced descriptor extraction algorithm for power line detection from point clouds
Bibliographic record
Abstract
Abstract Mobile terrestrial laser scanning (MTLS) systems provide a safe and efficient means to survey roadway corridors at high speed. MTLS point clouds are rich in planimetric data. However, manual extraction of useful information from these point clouds can be time consuming and laborious and automated object extraction from MTLS point clouds has become a hot topic in the remote sensing community. This study proposes an automated method for power line extraction from MTLS point clouds based on a multilayer perceptron (MLP) neural network. The proposed method consists of three main steps: (i) point cloud preprocessing, (ii) descriptor extraction and selection, and (iii) point classification. The preprocessing step involves filtering out more than 90% of the point cloud by eliminating the vast majority of unneeded points. Next, various descriptors are extracted from the remaining points including planarity, linearity, and verticality, and the descriptor standard deviation is used to select the best‐suited descriptors for power line extraction. Finally, an MLP neural network is trained using the selected descriptors from several cable and noncable sample points. The proposed algorithm was evaluated in three MTLS point clouds in urban and nonurban environments totalling 5.5 kilometres in length. An average precision of 94% and a recall of 94% showed the algorithm’s reliability and feasibility.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| 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.001 |
| 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".