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 View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="1904.00649")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="1904.00649", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="1904.00649")
Code
Syntology 2 code samples harvested from 1 repository linked to this paper: 2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. Where Syntology's instrument failed: 1 where the contract check could not run; failures of Syntology's instrument, not of the code.
By repository: official repository: 2 samples from 1 repository, 2 ran (1 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Levels written on 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.
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: 2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 1 of the 2 samples is pointer only, meaning Syntology does not serve that copy's text. For that sample, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. 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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.
06e62194f17cd06a · report
fixture: signature filename:str/0/str · returned list · level recorded 2026-09-25 census: 5 implementations from 10 papers, 2 distinct outputs on one shared input lib/datasets/voc_eval.py ran; the contract check could not run (RAISES) fingerprinted Apache-2.0 (permissive) here; the stored copy is pointer only ·
611c47c44c424dba · report
fixture: signature rec:ndarray/1/float, prec:ndarray/1/float, use_07_metric:bool/0/bool · returned float64 · level recorded 2026-09-25 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