Automated Detection of Spatial Traffic Violations through use of Video Sensors
Bibliographic record
Abstract
It is plausible that road use behavior that leads to traffic violations can be a contributing factor to the failure mechanism that prompts a collision. The detection and the understanding of traffic violations, therefore, can be key components of a sound safety diagnosis. Recent advances in computer vision techniques have enabled the conduct of automated and large-scale analyses of various approaches to safety diagnoses, including traffic conflicts and violation analysis. This paper proposes and compares two approaches to detect vehicular spatial violations. The approaches are (a) k-means clustering and (b) pattern matching with use of the longest common subsequence (LCSS) similarity measure. The purpose of this study was to learn what constituted normal movement patterns and to interpret any discrepancy between these patterns and observed tracks as an indication of a traffic violation. Each of the approaches was applied to detect U-turn violations on an urban intersection in Kuwait City, Kuwait. Violation detection on the basis of LCSS generally was superior to detection with piecewise k-means clustering, especially when low false detection rates were desirable. This expected differential was the result of the performance of LCSS matching on observed road user positions, and not on an approximated model.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".