Railway Tracks Detection of Railways Based On Computer VisionTechnique and GNSS Data
Bibliographic record
Abstract
Railway networks are major components of any country's infrastructure. In Egypt, the length of the railway network is 9570 km, where, 85% of the lines' movements are operated by mechanical signals. In July 2017, the Egyptian government launched a series of railway infrastructure projects aimed to modernize the Egyptian National Railways which includes the infrastructures rehabilitation for the network. This research focuses on developing an efficient low-cost framework using video camera and computer vision techniques for automatic railway track detection. A computer vision technique is used for automatic detection of railway tracks. Interior orientation parameters are extracted as part of the camera calibration task. Bundle adjustment calibration technique is used to compute the exterior orientation parameters based on selected ground control points. Hence, the eye fish effect of the images is removed and orthogonal images for the railway tracks are constructed using matching and feature extraction algorithms. The framework is tested on a dataset of a railway network with an approximate length of 20 km. The accuracy of the results is compared with a field survey data conducted to the same area using conventional surveying instruments such as Total station and Global Navigation Satellite System (GNSS). The proposed framework enables automatic extraction of railway tracks and its relationship with surrounding features, which contributes to quality control and assurance procedures for field collected data. The framework also offers a method for continuous and low-cost monitoring of the railway network. This will help to rapidly assess maintenance requirements for the network.
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.005 | 0.003 |
| 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.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".