Network-Based Rail Running Band Anomaly Recognition via Recurrent Attention Graphs
Bibliographic record
Abstract
Anomaly detection for rail running bands, the pattern of wheel–rail contact area, is crucial to analyze composite rail irregularities. This paper presents an all-weather vision-based solution for running-band inspection. However, two major algorithmic challenges restrict inspection effectiveness: 1) the identification of high-quality features for diversified and imbalanced data subject to noise and outliers, and 2) inferring implicit anomaly co-occurrence patterns. We regard overall running-band anomaly detection as a multi-label classification problem and develop a novel deep multi-anomaly recognition network via recurrent attention graphs (RAGRN). The proposed RAGRN consists of two fundamental components, each directly addressing the two major challenges of this paper: 1) Class-specific features are extracted for fine-grained discrimination via split-channel and gradient-guided class-specific attention mechanisms; 2) We develop a multi-anomaly classifier, which effectively captures long-distance correlation features via a recurrent attention graph with visual and statistical guidance for graph propagation, containing prior statistical and image-specific information. The experiments and statistical analyses demonstrate that RAGRN outperforms all related state-of-the-art frameworks and has the potential to be applied to practical inspection.
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.001 | 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".