An Optimized Deep Learning Approach for Robust Image Quality Classification
Bibliographic record
Abstract
This study presents a novel methodology for robust classification of image quality, a critical task in the domain of computer vision.The ability to accurately and promptly classify an image as being of inferior quality, due to factors such as lighting, focus, encoding, and compression, is crucial for a wide range of applications, including autonomous vehicles, web search technologies, smartphones, and digital cameras.Moreover, this capability holds significant potential for numerous industrial applications, particularly in the realm of quality assurance in manufacturing processes or outgoing inspections.In response to this requirement, a novel automated system is proposed herein, employing an optimization algorithm to categorize images into six distinct classes: motion blur, white noise, Gaussian blur, poor illumination, JPEG 2000, and high-quality reference images.The proposed framework is evaluated against existing methodologies using a selection of publicly available datasets.Both subjective and objective assessment results will be presented to demonstrate the efficacy of the proposed framework.This work underscores the potential of leveraging optimized deep learning techniques for robust and automatic image quality classification, thereby paving the way for improved quality assurance across diverse industries.
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.001 | 0.003 |
| 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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| 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".