Automatically Refining Degraded and Occluded Lane Marking Information to Enhance the quality of High Definition Maps for Autonomous Vehicles
Bibliographic record
Abstract
Autonomous vehicle technology has been advancing over the past decade with many challenges and obstacles. One obstacle to achieving fully autonomous driving is the feasibility of efficiently producing robust high definition (HD) maps of existing road infrastructure in a sustainable manner. HD maps are digital twins of road infrastructure that include 3-D representation of road features critical to a vehicle’s ability to navigate a road and maintain a consistent trajectory. This includes lane markings, barriers, and road edges. HD maps are often produced by first surveying roads using remote sensing technology. The collected data are then segmented using computer vision and machine learning algorithms to produce an HD map of the features of concern. One common challenge that is specific to extracting lane marking information is that the markings are occasionally occluded or degraded by high traffic volumes. This results in failure to detect lane markings and the existence of significant gaps in the extracted information. These gaps are manually filled in by quality control staff in a tedious and time-consuming process. To help overcome such challenges, this paper proposes a novel algorithm through which Kalman filtering is combined with Bézier curve fitting to automatically refine lane marking information. The proposed algorithm is tested on multiple roads where mobile lidar data were collected and segmentation was first applied using deep learning technology. The proposed algorithm was then used to refine the lane marking information which helped close all the gaps and recreate missing portions of the extracted lane markings.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 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".