Identifying Areas of High-Risk Vegetation Encroachment on Electrical Powerlines Using Mobile and Airborne Laser Scanned Point Clouds
Bibliographic record
Abstract
Powerline vegetation encroachment detection is pivotal in averting power outages and forest fires, especially in urban areas where a high density of buildings, roads, and other urban structures complicates detection. While prior research has effectively detected encroachments within point clouds, they largely overlooked the challenges posed by urban environments and did not leverage publicly available urban datasets. These urban intricacies can hinder the precise classification of powerline and vegetation points. This paper proposes a two-stage method for accurately and automatically detecting vegetation encroachment on urban powerlines. The first stage classifies the points in the point cloud as either belonging to one of three classes of points: vegetation, powerlines or background. The classifier model in this stage is chosen based on a comparative analysis of two deep learning models, PointCNN and RandLA-Net. The second stage detects encroachment areas from the detected vegetation and powerline points using a novel Point-Based Encroachment Detection (P-BED) algorithm. This algorithm identifies encroachment areas with high precision using the following steps: sectioning the map, selecting informative sections in the map, voxel-based down-sampling of points in point cloud, and conducting proximity analysis between vegetation and powerlines voxels. The proposed methodology was trained and tested with two publicly available datasets namely, mobile laser-scanned (MLS) and airborne laser-scanned (ALS) datasets. The first stage achieves an F1-scores of 0.98 for classifying background and 0.96 and 0.94 for classifying vegetation and powerline points, respectively. The newly proposed P-BED method successfully detected encroachments with 100% precision and 96.0% recall, showcasing its potential for improved vegetation management and proactive maintenance in urban settings.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 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.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".