Papers › Deep Learning for Large-Scale Traffic-Sign Detection and Recognition
Deep Learning for Large-Scale Traffic-Sign Detection and Recognition
Domen Tabernik, Danijel Skočaj
Automatic detection and recognition of traffic signs plays a crucial role in management of the traffic-sign inventory. It provides accurate and timely way to manage traffic-sign inventory with a minimal human effort. In the computer vision community the recognition and detection of traffic signs is a well-researched problem. A vast majority of existing approaches perform well on traffic signs needed for advanced drivers-assistance and autonomous systems. However, this represents a relatively small number of all traffic signs (around 50 categories out of several hundred) and performance on the remaining set of traffic signs, which are required to eliminate the manual labor in traffic-sign inventory management, remains an open question. In this paper, we address the issue of detecting and recognizing a large number of traffic-sign categories suitable for automating traffic-sign inventory management. We adopt a convolutional neural network (CNN) approach, the Mask R-CNN, to address the full pipeline of detection and recognition with automatic end-to-end learning. We propose several improvements that are evaluated on the detection of traffic signs and result in an improved overall performance. This approach is applied to detection of 200 traffic-sign categories represented in our novel dataset. Results are reported on highly challenging traffic-sign categories that have not yet been considered in previous works. We provide comprehensive analysis of the deep learning method for the detection of traffic signs with large intra-category appearance variation and show below 3% error rates with the proposed approach, which is sufficient for deployment in practical applications of traffic-sign inventory management.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1904.00649")
Code
Syntology Ran 0 of 2 code samples harvested from 1 repository linked to this paper; 2 have no recorded run.
By repository: official repository: 2 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
2 samples harvested; 0 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 0 of the 2 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from skokec/detectron-traffic-signs. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
06e62194f17cd06a · report
611c47c44c424dba · report
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Traffic Sign Recognition | DFG traffic-sign dataset | Mask R-CNN with adaptations for traffic sings and augmentations (ResNet50) | mAP @0.5:0.95 | 84.4 | #1 of 5 | Archive leaderboard | report |
| Traffic Sign Recognition | DFG traffic-sign dataset | Mask R-CNN with adaptations for traffic sings and augmentations (ResNet50) | mAP@0.50 | 95.5 | #1 of 5 | Archive leaderboard | report |
| Traffic Sign Recognition | DFG traffic-sign dataset | Mask R-CNN with adaptations for traffic sings (ResNet50) | mAP@0.50 | 95.2 | #2 of 5 | Archive leaderboard | report |
| Traffic Sign Recognition | DFG traffic-sign dataset | Mask R-CNN (ResNet50) | mAP @0.5:0.95 | 82.3 | #3 of 5 | Archive leaderboard | report |
| Traffic Sign Recognition | DFG traffic-sign dataset | Mask R-CNN (ResNet50) | mAP@0.50 | 93.0 | #3 of 5 | Archive leaderboard | report |
| Traffic Sign Recognition | DFG traffic-sign dataset | Faster R-CNN | mAP @0.5:0.95 | 80.4 | #4 of 5 | Archive leaderboard | report |
| Traffic Sign Recognition | DFG traffic-sign dataset | Faster R-CNN | mAP@0.50 | 92.4 | #4 of 5 | Archive leaderboard | report |
| Traffic Sign Recognition | DFG traffic-sign dataset | Mask R-CNN with adaptations for traffic sings (ResNet50) | mAP @0.5:0.95 | 82.0 | #5 of 5 | Archive leaderboard | report |
| Traffic Sign Recognition | Swedish traffic-sign dataset (STSD) | Mask R-CNN with adaptations for traffic sings (ResNet50) | mAP@0.50 | 95.2 | #1 of 2 | Archive leaderboard | report |
| Traffic Sign Recognition | Swedish traffic-sign dataset (STSD) | Faster R-CNN | mAP@0.50 | 94.3 | #2 of 2 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections