Multi-Railway Track and Switch Region Recognition Using Mobile Laser Scanning Data
Bibliographic record
Abstract
Railway infrastructure is a vital component of modern transportation systems. However, today's railway equipment inspections primarily rely on labor-intensive fieldwork and errorprone human visual analysis. In this study, we present an automated system for the recognition of railway assets using mobile laser scanning data. Our method simultaneously detects rail tracks and localizes switch regions, identifying switch region orientation (right/left), status (open/closed), and overlap type (merge/split). This integrated railway tracing and switch recognition method is built on binary multiscale template matching within a Kalman filtering framework. To trace the railway trajectories, the Kalman filter predicts a new state vector that consists of the position and orientation of the rail track window. This prediction which is based on the previous state vector is then updated using the observed track points already classified in a local track window using the Gaussian mixture model clustering method. To detect multi-tracks and determine appropriate observations for the targeted rail track, we employ minimum description length technique. Lastly, to recognize the switch type, template matching is applied by considering the similarity between a multi-track region and the templates as well as track design constraints observed in the sequential multitrack regions. We test our algorithm on a densely-annotated private benchmark of 3D point cloud data captured from a largescale railway network. Experiments on this dataset show that the proposed method can robustly produce accurate rail track vectors (99.46% recall) and recognize switch types (97% success rate).
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.001 | 0.001 |
| Bibliometrics | 0.003 | 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.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.002 |
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".