Generation of Horizontally Curved Driving Lines in HD Maps Using Mobile Laser Scanning Point Clouds
Bibliographic record
Abstract
This paper presents the development of a semiautomated driving line generation method using point clouds acquired by a mobile laser scanning system. Horizontally curved driving lines are a critical component for high-definition maps that are required by autonomous vehicles. The proposed method consists of three steps: Road surface extraction, road marking extraction, and driving line generation. First, the points covering road surfaces are extracted using the curb-based road surface extraction algorithms depending on both the elevation and slope differences. Then, road markings are identified and extracted according to a variety of algorithms consisting of georeferenced intensity imagery generation, multithreshold road marking extraction, and statistical outlier removal. Finally, the conditional Euclidean clustering algorithm is employed, followed by the cubic spline curve-fitting algorithm and equidistant line-based driving line generation algorithms for horizontally curved driving line generation. Our method is evaluated by six MLS point cloud datasets collected from various types of horizontally curved road corridors. Quantitative evaluations demonstrate that the proposed road marking extraction algorithm achieves an average recall, precision, and F1-score of 90.79%, 92.94%, and 91.85%, respectively. The generated driving lines are assessed by overlaying them on the manually interpreted reference buffers from 4-cm resolution unmanned aerial vehicle orthoimagery, and a 15 cm level navigation and localization accuracy is achieved.
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.000 | 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".