Attributed vector quantization: a new paradigm for image segmentation and pattern acquisition
Bibliographic record
Abstract
Robust segmentation of complex images is a challenging problem. Performance with traditional use of statistical information, such as intensity, first and second derivatives, and local intensity histograms, is often degraded severely by noise. Good results with model-based segmentation approaches are generally sensitive to the precise initialization of the model within the image to be segmented. The basic idea of this paper is to integrate a set of image attributes into a single, unified framework, such that their complementary information facilitates reliable and robust decisions in image segmentation. This paper proposes a new vector clustering method, called Attributed Vector Quantization (Attributed VQ), for this purpose. The new method can be considered as a variation of the existing weighted vector quantization method, but uses a different weighting scheme from the traditional method, which is clearly motivated by the complex image segmentation problem. Furthermore, the vector quantization process intrinsically produces hierarchically organized structural information that can characterize the pattern of the object to be segmented. We demonstrate the new method with industrial images as the example. We demonstrate, preliminarily, that this approach shows promise in its application to training and recognition in industrial vision systems by requiring minimal user interaction during training, and by leveraging its basis in vector quantization to reduce sensitivity to noise and other anomalies during recognition.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.004 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| 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".