Traffic sign extraction using deep hierarchical feature learning and mobile light detection and ranging (LiDAR) data on rural highways
Bibliographic record
Abstract
The application of deep learning techniques on point cloud data holds significant promise for efficient data segmentation and classification of traffic signs. This study proposes modifications to the PointNet++ neural network to improve performance on outdoor scenes. In addition, the method leverages the use of local geometric features in the training process. Several models with different combinations of geometric features and proposed changes were trained using labeled data from seven highway segments in Alberta, Canada. The results indicate that the proposed models have improved performance in accuracy and processing times compared to previous studies on sign detection using point cloud data. The overall per sign detection performance shows a 99.2% recall (98% per point) and a 98% F1-score (97% per point). Overall, the inclusion of z-gradient significantly increased sign detection in terms of precision, recall, and F1-score, by 9%, 4.9%, and 7.1%, respectively, allowing the model to yield notable performance improvements for outdoor scene recognition. Ablation tests were performed to validate the performed PointNet++ modifications. The modified PointNet++ was compared with SqueezeSegV2, a state-of-the-art neural network designed for road-object segmentation, and showed improved performance. A comparison was also made with existing sign detection methods on the Paris-Lille-3D benchmark, finding higher recall rates than existing studies. The proposed approach suggests that with adjustments, the PointNet++ neural network architecture can achieve remarkable results on large metric scale scenes for sign extraction using point cloud data.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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".