MétaCan
Menu
Back to cohort
Record W1975842137 · doi:10.1109/tsmcb.2011.2161284

Gaussian-Mixture-Model-Based Spatial Neighborhood Relationships for Pixel Labeling Problem

2011· article· en· W1975842137 on OpenAlexafffund
Thanh Minh Nguyen, Q. M. Jonathan Wu

Bibliographic record

VenueIEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · 2011
Typearticle
Languageen
FieldComputer Science
TopicImage Retrieval and Classification Techniques
Canadian institutionsUniversity of Windsor
FundersNational Research Council CanadaCanada Research Chairs
KeywordsMixture modelPixelRobustness (evolution)Artificial intelligencePattern recognition (psychology)Computer scienceGaussianMarkov chainExpectation–maximization algorithmImage segmentationSegmentationMarkov random fieldMaximizationMathematicsAlgorithmStatisticsMaximum likelihoodMathematical optimizationMachine learning

Abstract

fetched live from OpenAlex

In this paper, we present a new algorithm for pixel labeling and image segmentation based on the standard Gaussian mixture model (GMM). Unlike the standard GMM where pixels themselves are considered independent of each other and the spatial relationship between neighboring pixels is not taken into account, the proposed method incorporates this spatial relationship into the standard GMM. Moreover, the proposed model requires fewer parameters compared with the models based on Markov random fields. In order to estimate model parameters from observations, instead of utilizing an expectation-maximization algorithm, we employ gradient method to minimize a higher bound on the data negative log-likelihood. The performance of the proposed model is compared with methods based on both standard GMM and Markov random fields, demonstrating the robustness, accuracy, and effectiveness of our 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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.002
Science and technology studies0.0010.001
Scholarly communication0.0010.003
Open science0.0030.001
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.052
GPT teacher head0.249
Teacher spread0.197 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations75
Published2011
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Same topicImage Retrieval and Classification TechniquesFrench-language works237,207