Color image segmentation using connected regions
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
A color image segmentation algorithm based on region growing is presented. Each region is characterized using two parameters: within region color contrast and between region color contrast. The first parameter is the distance between the two most distant pixels in terms of color. The second parameter is the distance between the candidate pixel and its nearest neighbor in the region. The color similarity measure used is the vector angle, which is invariant to shading. Highlight invariance is accomplished by using a highlight removal transformation, which removes the average pixel intensity from each RGB coordinate. The first calculation is very computationally intensive. To reduce this computational burden, the algorithm keeps track of which pixels already in the region are furthest spatially from the pixel being considered. The assumption would be that the pixels the furthest away would be the ones most different from the pixel being considered. We will present results on artificial and real images to illustrate the effectiveness of the method.
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.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