Image segmentation by a new weighted Student's <i>t</i> ‐mixture model
Bibliographic record
Abstract
In this study, the authors introduce a new weighted Student's t ‐mixture model (WSMM) for image segmentation. Gaussian distribution and Student's t ‐distribution are the two commonly used probabilities in the finite mixture model (FMM). The Student's t ‐mixture model has come to be regarded as an alternative to Gaussian mixture models, as it is heavily tailed and more robust for outliers. Moreover, the pixels are considered independent of each other in the FMM. Although some existing methods incorporate the spatial relationship between neighbouring pixels, they do not consider the relationship between spatial information and clustering information, thus those reported methods remain sensitive to noise. The advantages of the authors method are as follows: first, the authors introduce WSMM to incorporate the local spatial information, pixel intensity value and clustering information in an image. Second, the authors model is simple, easy to implement and has a good balance between noise insensitiveness and image detail preservation. Third, they adopt the gradient method and expectation maximisation algorithm, which allow for simultaneous estimation of optimal parameters. Finally, the most useful statistical tool for image segmentation, the well‐known hidden Markov random field model, is a special case of their model. Thus, their method is general enough for model‐based techniques construction. Experimental results on synthetic and real images demonstrate the improved robustness and effectiveness of their approach.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.003 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.002 | 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".