Automated traffic sign change detection using low-cost LiDAR scans and unsupervised machine learning
Bibliographic record
Abstract
Current practices in traffic sign monitoring heavily rely on manual inspections, a method that is both time-consuming and prone to human error. This leads to inefficiencies in the management and maintenance of these critical roadside assets. The objective of this work is to overcome these limitations by proposing a method for automated change detection in traffic signs using low-density LiDAR data. The proposed solution integrates noise elimination, point cloud restructuring, and cross-scan KD-tree generation, followed by the application of unsupervised machine learning techniques for change identification. The effectiveness of this method was verified by testing across three different highways with varying point cloud resolutions. For robust testing, an algorithm was also designed to simulate a broad range of different damage scenarios in traffic signs of different types, sizes, and placements. Testing in different scenarios along almost 15 km of the road revealed impressive results with accuracy and F1 score metrics ranging from 92% to 100%. Moreover, the algorithm was also extremely efficient with an average runtime of just 115” per km of fully automated unattended processing. The change detection potential of the proposed algorithm extends beyond traffic signs, as it could be adapted for many highway elements, enhancing the efficiency of transportation asset management and highway maintenance programmes. The findings indicate that this approach not only fills a significant gap in the current traffic sign monitoring and asset management practice but also offers a promising, comprehensive solution towards automated, cost-effective, and precise monitoring and maintenance of traffic signs, thus addressing a major challenge in this area.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| 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".