Automated Extraction of Driving Lines from Mobile Laser Scanning Point Clouds
Bibliographic record
Abstract
Abstract. This paper presents a novel approach to automated generation of driving lines from mobile laser scanning (MLS) point cloud data. The proposed method consists of three steps: road surface segmentation, road marking extraction and classification, and driving line generation. The voxel-based upward-growing algorithm was firstly used to extract ground points from the raw MLS point clouds followed by segmentation of road surface using a region-growing algorithm. Then, the statistical outlier removal filter was applied to separate and refine the road marking points followed by extracting and classifying the lane markings based on the geometric features of different road markings using empirical hierarchical decision trees. Finally, land node structures were constructed followed by generation of driving lines using a curve-fitting algorithm. The proposed method was tested on both circular road sections and irregular intersections. The smoothing spline curve fitting model was tested on the circular road sections, while the Catmull-Rom spline with five control points was used to generate the driving lines at road intersections. The overall performance of the proposed algorithms is promising with 96.0% recall, 100.0% precision, and 98.0% F1-score for the lane marking extraction specifically. Most significantly, the validation results demonstrate that the driving lines can be effectively generated within 20 cm-level localization accuracy at an average of 3.5% miscoding using MLS point clouds, which meets the requirement of localization accuracy of fully autonomous driving functions. The results demonstrate the proposed methods can successfully generate road driving lines in the test datasets to support the development of high-definition maps.
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.000 | 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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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".