Adaptive local threshold with shape information and its application to object segmentation
Bibliographic record
Abstract
This paper presents a novel local threshold segmentation algorithm for digital images incorporating shape information. In image segmentation, most of local threshold algorithms are only based on intensity analysis. In many applications where an image contains objects with a similar shape, besides the intensity information, prior known shape attributes could be exploited to improve the segmentation. The goal of this work is to design a local threshold algorithm that includes shape information to enhance the segmentation quality. The algorithm can be divided into two steps: adaptively selecting local threshold based on maximum likelihood, and then removing unwanted segmented fragments by a supervised classifier. Shape attribute distributions are learned from typical objects in ground truth images. Local threshold for each object in an image to be segmented is chosen to maximize probabilities of these shape attributes according to learned distributions. After local thresholds are picked, the algorithm applies a supervised classifier trained by shape features to reject unwanted fragments. Experiments on oil sand images have shown that the proposed algorithm has superior performance to local threshold approaches based on intensity information in terms of segmentation quality.
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 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.002 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".