Classification of high-voltage power line structures in low density ALS data acquired over broad non-urban areas
Bibliographic record
Abstract
Airborne laser scanning (ALS) has gained importance over recent decades for multiple uses related to the cartography of landscapes. Processing ALS data over large areas for forest resource estimation and ecological assessments requires efficient algorithms to filter out some points from the raw data and remove human-made structures that would otherwise be mistaken for natural objects. In this paper, we describe an algorithm developed for the segmentation and cleaning of electrical network facilities in low density (2.5 to 13 points/m 2 ) ALS point clouds. The algorithm was designed to identify transmission towers, conductor wires and earth wires from high-voltage power lines in natural landscapes. The method is based on two priors i.e . (1) the availability of a map of the high-voltage power lines across the area of interest and (2) knowledge of the type of transmission towers that hold the conductors along a given power line. It was tested on a network totalling 200 km of wires supported by 415 transmission towers with diverse topographies and topologies with an accuracy of 98.6%. This work will help further the automated detection capacity of power line structures, which had previously been limited to high density point clouds in small, urbanised areas. The method is open-source and available online.
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.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".