Use of Drivers’ Jerk Profiles in Computer Vision–Based Traffic Safety Evaluations
Bibliographic record
Abstract
A traffic conflict is usually composed of a chain of events in which at least one of the involved road users performs some sort of evasive action to avoid a collision. An evasive action usually involves powerful braking, which leads to sudden, negative change in acceleration (deceleration). The temporal dynamics (variation over time) of the acceleration of a vehicle is represented by the jerk profile. More formally, jerk is the derivative of the acceleration. In the case of an evasive action by braking, the jerk profile is characterized by strong, negative values. This study examined two issues in the quest to understand the benefits of evasive action analysis. The first issue was whether jerk profiles can be used to identify critical traffic events (conflicts). The second issue addressed the validity of the assumption that the deceleration profile is inadequate as a stand-alone measure for conflict identification. Automated video analysis was used to collect traffic data and analysis was applied on two data sets with distinct traffic patterns. The study revealed a significant difference between the jerk behavior of the groups of drivers involved in conflictive and normal traffic interactions. It also showed instances in which automated jerk evaluation was successful in finding conflicts undetected by conventional conflict indicators. The same could not be demonstrated for the road users’ deceleration behavior. These findings support earlier studies on the shortcomings of the use of deceleration data for conflict identification.
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.003 | 0.013 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.005 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| 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".