Automatic Detection of Defects on Periodically Patterned Textures
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
Abstract Defect detection is a major concern in quality control of various products in industries. This paper presents two different machine-vision based methods for detecting defects on periodically patterned textures. In the first method, input defective image is split into several blocks of size same as the size of the periodic unit of the image and chi-square histogram distances of each periodic block with respect to itself and all other periodic blocks are calculated to get a dissimilarity matrix. This dissimilarity matrix is subjected to Ward's hierarchical clustering to automatically identify defective and defect-free blocks. The second method of defect detection is based on Universal Quality Index which is a measure of loss of correlation, luminance distortion and contrast distortion between any two signals. Quality indices of a periodic block with respect to itself and all other periodic blocks are calculated to get a similarity matrix containing quality indices. Specific variances of the periodic blocks are derived from the quality index matrix through orthogonal factor model based on eigen decomposition. These variances are subjected to Ward's hierarchical clustering to automatically identify defective and defect-free blocks. Results of experiments on real fabric images with defects show that the defect detection methods based on chi-square histogram distance and universal quality index yield a success rate of 98.6% and 97.8% respectively.
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.001 | 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.000 | 0.000 |
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