MétaCan
Menu
Back to cohort
Record W2131686127 · doi:10.1109/icme.2009.5202578

A new localized superpixel Markov random field for image segmentation

2009· article· en· W2131686127 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Image and Video Retrieval Techniques
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsMarkov random fieldArtificial intelligencePixelComputer scienceSegmentationPattern recognition (psychology)Image segmentationMarkov processMarkov chainConditional random fieldProcess (computing)Computer visionRandom fieldField (mathematics)Image (mathematics)Machine learningMathematicsStatistics

Abstract

fetched live from OpenAlex

In this paper, we present a novel localized Markov random field (MRF) method based on superpixels for region segmentation. Early vision problems could be formulated as pixel labeling using MRF. But the local interaction in MRF is limited to pixel label comparison. We propose a new localized superpixel Markov random field (SMRF) model to incorporate local data interaction in unsupervised parameter learning. The advantages of the new model include computational efficiency by using superpixel structure and its ability to integrate local knowledge in the learning process. Quantitative evaluation and visual effects show that the new model achieves not only better segmentation accuracy but also lower computational cost than the baseline pixel based model.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.914
Threshold uncertainty score0.348

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.011
GPT teacher head0.305
Teacher spread0.294 · 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