Real-time license plate identification by perceptual shape grouping and tracking
Bibliographic record
Abstract
This paper presents a perceptual organization based method for real-time license plate identification and tracking by video content analysis. In this method, video content is described using a set of perceptual shape features, called generic edge tokens (GET). A video frame can be represented as a GET map. Motion GETs (MGETs) are segmented from the consecutive images based on GET map and motion clue. A MGET graph is proposed for coding the moving content in video sequence. A license plate is identified by searching a sub-MGET-graph (SMG) that satisfies the license plate shape model. This target shape model is pre-defined by a set of recognition rules according to the GET based shape representation. The SMG representing the license plate can be detected by perceptually grouping the plate shape in MGET graph. The license plate is then tracked on the region of interest (ROI) predicted based on the motion continuity, so that the search can be focused to the most relevant sub-region of the image instead of the entire image. Accordingly, the data flow to be processed is reduced significantly based on perception clues and the motion pattern prediction. This system may be adapted for other target identification tasks by updating a subset of the recognition rules. The efficiency and effectiveness of this method are demonstrated using a gate way setting camera application
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.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".