Fusing a Bluetooth Traffic Monitoring System With Loop Detector Data for Improved Freeway Traffic Speed Estimation
Bibliographic record
Abstract
Anonymous probe vehicle monitoring systems are being developed to measure travel times on highways and arterials based on wireless signals available from technologies such as Bluetooth. Probe vehicle data can provide accurate measurements of current traffic speeds and travel times due to their excellent spatial coverage. However, presently probe vehicles are only a small portion of the vehicles that make up all of the traffic in the network. Alternatively, data from conventional loop detectors cover almost all the vehicles that have traveled along a road section, resulting in excellent temporal coverage. Unfortunately, loop detector measurements can be imprecise; their spatial sampling depends on the loop detector spacing, and they typically only represent traffic speed at the location of the detector and not over the entire road segment. With this complementarity in mind, this article explores several data fusion techniques for fusing data from these sources together. All methods are implemented and compared in terms of their ability to fuse data from loop detectors and probe vehicles to accurately estimate freeway traffic speeds. Data from a Bluetooth traffic monitoring system are fused with corresponding loop detector data and compared against GPS collected probe vehicle data on a stretch of Highway 401 in Toronto, Canada. The analysis shows that through data fusion, even a few probe vehicle measurements from a Bluetooth traffic monitoring system can improve the accuracy of traffic speed estimates traditionally obtained from loop detectors.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".