Real-Time Vehicle Make and Model Recognition Based on a Bag of SURF Features
Bibliographic record
Abstract
In this paper, we propose and evaluate unexplored approaches for real-time automated vehicle make and model recognition (VMMR) based on a bag of speeded-up robust features (BoSURF) and demonstrate the suitability of these approaches for vehicle identification systems. The proposed approaches use SURF features of vehicles' front- or rear-facing images and retain the dominant characteristic features (codewords) in a dictionary. Two schemes of dictionary building are evaluated: “single dictionary” and “modular dictionary.” Based on the optimized dictionaries, the SURF features of vehicles' front- or rear-face images are embedded into BoSURF histograms, which are used to train multiclass support vector machines (SVMs) for classification. Two real-time VMMR classification schemes are proposed and evaluated: a single multiclass SVM and an ensemble of multiclass SVM based on attribute bagging. The processing speed and accuracy of the VMMR system are affected greatly by the size of the dictionary. The tradeoff between speed and accuracy is studied to determine optimal dictionary sizes for the VMMR problem. The effectiveness of our approaches is demonstrated through cross-validation tests on a recent publicly accessible VMMR data set. The experimental results prove the superiority of our work over the state of the art, in terms of both processing speed and accuracy, making it highly applicable to real-time VMMR 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.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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.002 |
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".