Traffic State Recognition of Intersection Based on Image Model and PCA Hashing
Bibliographic record
Abstract
The premise of implementing an effective traffic control strategy is the accurate traffic state recognition. In the existing study, traffic state recognition methods were processed by using statistical characteristics and long-term scale detection of field traffic data. Hence, the dynamic characteristics and subtle changes in traffic flow were easy to overlook. At present, more and more advanced traffic detection technology provides reliable and accurate data for measuring and distinguishing the state of urban road traffic, such as the cooperative vehicle-infrastructure system, wide-area radar technology, and 5G technology. This study proposes a novel method called HTSI (High Precision Traffic State Identification Method), which is based on the advanced detection technology in traffic state recognition at the intersection: The raw data used for intersection traffic state recognition is high-precision detection data of tracking characteristics, which make the data look like a picture of the intersection at God’s perspective. To this end, we construct an image model for intersections and implement image feature extraction in a way that is different from traditional image processing. Then, the traffic state recognition problem at the intersection is translated into an image searching problem with tags. The image searching is realized by the hashing algorithm. Finally, the comprehensive experiments prove that the proposed method is more accurate and finer than other methods.
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.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".