Automated Highway Sign Extraction Using Lidar Data
Bibliographic record
Abstract
Traffic signs are integral elements of any transportation network; however, keeping records of those signs and their condition is a tedious, time-consuming, and labor-intensive process. As a result, many agencies worldwide have been working toward automating the process. One form of automation uses remote sensing techniques to extract traffic sign information. An algorithm is proposed that can automatically extract traffic signs from mobile light detection and ranging data. After the number of signs on a road segment has been determined, the coordinates of those signs are mapped onto the road segment. The sign extraction procedure involves applying multiple filters to the point cloud data and clustering the data into traffic signs. The proposed algorithm was tested on three highways located in different regions of the province of Alberta, Canada. The segments on which the algorithm was tested include a two-lane undivided rural road and four-lane divided highways. The highway geometry varied, as did vegetation and tree density. Success rates ranged from 93% to 100%, and the algorithm performed better on highways without overhead signs. Results indicate that the proposed method is simple but effective for creating an accurate inventory of traffic signs.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.003 | 0.001 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.003 | 0.000 |
| Research integrity | 0.000 | 0.002 |
| 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 teacher head, 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".