Papers › Uncertainty-based Traffic Accident Anticipation with Spatio-Temporal Relational Learning

Uncertainty-based Traffic Accident Anticipation with Spatio-Temporal Relational Learning

1 Aug 2020arXiv:2008.00334archive 2025-07-28

Wentao Bao, Qi Yu, Yu Kong

Traffic accident anticipation aims to predict accidents from dashcam videos as early as possible, which is critical to safety-guaranteed self-driving systems. With cluttered traffic scenes and limited visual cues, it is of great challenge to predict how long there will be an accident from early observed frames. Most existing approaches are developed to learn features of accident-relevant agents for accident anticipation, while ignoring the features of their spatial and temporal relations. Besides, current deterministic deep neural networks could be overconfident in false predictions, leading to high risk of traffic accidents caused by self-driving systems. In this paper, we propose an uncertainty-based accident anticipation model with spatio-temporal relational learning. It sequentially predicts the probability of traffic accident occurrence with dashcam videos. Specifically, we propose to take advantage of graph convolution and recurrent networks for relational feature learning, and leverage Bayesian neural networks to address the intrinsic variability of latent relational representations. The derived uncertainty-based ranking loss is found to significantly boost model performance by improving the quality of relational features. In addition, we collect a new Car Crash Dataset (CCD) for traffic accident anticipation which contains environmental attributes and accident reasons annotations. Experimental results on both public and the newly-compiled datasets show state-of-the-art performance of our model. Our code and CCD dataset are available at https://github.com/Cogito2012/UString.

PaperPDFCodeCode Syntology ran

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):

Code

Syntology 10 code samples harvested from 1 repository linked to this paper: 8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 10 samples from 1 repository, 8 ran (8 with no instrument failure; 0 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 between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

Cogito2012/CarCrashDataset officialmentioned in paperMITSyntology: not harvested report
Cogito2012/UString officialmentioned in paperpytorchMITSyntology: 10 samples, 8 ran (0 instrument-failed) · 2 unverified report

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

10 samples harvested: 8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
7ran
2unverified

Licence: 1 of the 10 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 Cogito2012/UString. “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.

Cogito2012/UString official repository 10 samples, 8 ran (0 instrument-failed) · 2 unverified
compute_graph_edge_weights src/DataLoader.py ran MIT (permissive) · 1f2bee452d766f67 · report fixture: signature boxes:ndarray/2/float, edges:ndarray/2/int · returned ndarray · level recorded 2026-09-25
generate_graph_from_list src/DataLoader.py ran MIT (permissive) · 17771c96b9488ae3 · report fixture: signature L:list/1/int, create_using:NoneType/0/? · returned list · level recorded 2026-09-25
generate_st_graph src/DataLoader.py ran MIT (permissive) · 214b0b5552c42efd · report fixture: signature detections:ndarray/3/float · returned tuple · level recorded 2026-09-25
get_boxes script/extract_res101_dad.py ran MIT (permissive) · bdd64a977afd9b6c · report fixture: signature dets_all:ndarray/2/float, im_size:tuple/1/int · returned ndarray · level recorded 2026-09-25
get_video_frames script/extract_res101_dad.py ran MIT (permissive) · 4c512b058c37afb2 · report fixture: signature video_file:str/0/str, n_frames:int/0/int · returned list · level recorded 2026-09-25
get_video_frames script/vis_crash_det.py ran MIT (permissive) · 8cf8cc5c870f5866 · report fixture: signature video_file:str/0/str, n_frames:int/0/int · returned list · level recorded 2026-09-25
process in 60 papers script/split_dad.py ran MIT (permissive) · 6242e10c800afddf · report fixture: signature data_path:str/0/str, dest_path:str/0/str, phase:str/0/str · returned list · level recorded 2026-09-25
tuple_to_array src/utils.py ran · honoured contract MIT (permissive) here; the stored copy is pointer only · cb2d801625fc35f2 · report fixture: signature lot:tuple/1/list · returned ndarray · level recorded 2026-09-22
bbox_to_imroi script/extract_res101_dad.py unverified MIT (permissive) · 2027d64ab218fc74 · report
evaluation in 57 papers src/eval_tools.py unverified MIT (permissive) · 491e614341f4f94d · report

Tasks

Accident AnticipationActivity PredictionFuture predictionRelational ReasoningTime-to-Event PredictionVideo Understanding

Datasets

Introduced by this paper, per the archive.

CCD

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Accident Anticipation CCD UString AP 99.5 #2 of 2 Archive leaderboard report
Accident Anticipation CCD UString TTA 4.74 #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

Convolution

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