Blurred License Plate Recognition based on single snapshot from drive recorder
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Nowadays, drive recorders are becoming a popular form of evidences used by drivers and accepted by court. One common investigation task is to identify vehicles of interest and recognize their license plates (LPs). In this paper, we focus on License Plate Recognition (LPR) based on single snapshot from a drive recorder. As drive recorders are installed on moving vehicles, snapshots by drive recorders usually suffer from serious blur, and the key issue is recognizing the Blurred License Plate (BLP) from single image. A straightforward method is first deblurring the BLP and then recognizing it. However, the first problem with this method is that general image deblurring methods are designed to get a good overall visual effect and the deblurred results may be not good for LPR. The second problem is that general image deblurring methods don't use the features of the LPs, which could be important priors for the deblurring process. To overcome these issues, this paper proposes a novel method that integrates deblurring and recognizing in a closed-loop. The proposed method utilizes characters and patterns of LPs as priors, and the deblurring and recognizing process will stop when a reliable recognition result is obtained from the deblurred image. Furthermore, by analyzing the features of BLPs, this paper proposes a ℓ <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</inf> -norm based deblurring method. Experiments show that, compared to other LPR methods, the proposed method can achieve higher recognition rate on the BLPs.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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 it