Clustering Vehicle Trajectories with Hidden Markov Models Application to Automated Traffic Safety Analysis
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The importance of reducing the social and economic costs associated with traffic collisions can not be over-stated. The first goal of this research is to develop a method for automated road safety analysis using video sensors in order to address the problem of a dependency on the deteriorating collision data. The method will automate the extraction of traffic conflicts (near misses) from video sensor data. To our knowledge, there is limited research primarily applied to traffic conflicts. In this paper a method based on the clustering of vehicle trajectories is presented. The clustering uses a k-means approach with hidden Markov models and a simple heuristic to find the number of clusters automatically. Traffic conflicts can then be detected by identifying and adapting pairs of models of conflicting trajectories. The technique is demonstrated on real world video sequences of traffic conflicts.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it