An Extendable Gaussian Mixture Model for Lane-Based Queue Length Estimation Based on License Plate Recognition Data
Bibliographic record
Abstract
Most existing studies on queue length estimation based on license plate recognition (LPR) data require multisection LPR data. Studies based on single-section LPR data cannot ensure the accuracy and stability of the estimates when missed detections occur, which greatly limits the practicability of existing studies. Therefore, using single-section LPR data, this study proposes a lane-based queue length estimation method based on a two-dimensional Gaussian mixture model. First, the LPR data were processed to obtain the departure times and time headway of vehicles. Then, the two-dimensional Gaussian distributions of queued vehicles and nonqueued vehicles were fitted, and the expectation-maximization algorithm was adopted to solve the distribution parameters. Finally, the queuing status of each vehicle was determined, and the lane-based queue length was estimated based on the last identified queued vehicle in the cycle. The empirical results showed that the mean absolute errors (MAEs) of the proposed method were just 1.3 veh/cycle under no missed detections and 2 veh/cycle under a 20% missed detection rate, outperforming existing methods. The simulation results indicate that the proposed method can achieve accurate estimates under various traffic demands. In addition, the proposed method can be extended to real-time applications and multisection LPR systems.
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.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".