An Efficient Real-Time Vehicle Re-Identification Scheme Using Urban Surveillance Videos
Bibliographic record
Abstract
With the explosive use of surveillance and onboard cameras, vision-based Vehicle Re-identification (VReID) has attracted widespread attention. The goal of VReID is to search and identify the target vehicle from a large number of images. An efficient VReID model can help the police make fast decisions and improve regional security. The major challenge of the VReID is to distinguish the subtle visual difference between different vehicles. In this work, we propose a Compact Attention Unit (CAU) that relies on a single attention map to extract the discriminative local features of the vehicle. We add two CAUs to the truncated ResNet to construct a small but efficient VReID model, ResNetT-CAU. The feature representation of the vehicle image is the concatenation of the extracted global and local features. Compared with the original ResNet, the model size of ResNetT-CAU is reduced by 60% and has excellent VReID performance. We conduct experiments on two benchmark datasets, VeRi and VehicleID. The results show the proposed model stably achieves excellent VReID performance with very fast processing speed.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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".