MétaCan
Menu
Back to cohort
Record W2120405244 · doi:10.1109/nafips.2000.877392

An adaptive deterministic annealing approach for medical image segmentation

2002· article· en· W2120405244 on OpenAlexfundno aff
S. Mitra, R. Castellanos, Sumedh Shridhar Joshi

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMedical Image Segmentation Techniques
Canadian institutionsnot available
FundersMcGill University
KeywordsSimulated annealingCluster analysisSegmentationImage segmentationComputer scienceAdaptive simulated annealingArtificial intelligenceMathematical optimizationScale-space segmentationAlgorithmPattern recognition (psychology)Mathematics

Abstract

fetched live from OpenAlex

We present a stochastic model based technique that uses the concept of deterministic annealing to obtain a generalized solution to the nonconvex optimization problem encountered by many image segmentation techniques. Deterministic annealing [DA] is an elegant and useful tool for clustering and classification. This novel optimization approach works with the efficiency of a deterministic procedure and has been successfully applied to a number of combinatorial optimization problems. We demonstrate effective segmentation of simulated MR brain images and provide a quality measure for accuracy of classification. A generalized deterministic annealing procedure, which works tender a structural constraint of mass or density, has been utilized for this purpose. This method produces a hierarchy of solutions giving segmentation results from a coarse to a fine level. Automatic edge detection can be performed using these solutions that are at different degrees of coarseness. The procedure has been made more efficient by utilizing a new similarity parameter from the concepts of neuro-fuzzy clustering.

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.001
metaresearch head score (Gemma)0.001
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: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.040
GPT teacher head0.323
Teacher spread0.283 · 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
GenreMethods

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

Citations6
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicMedical Image Segmentation TechniquesFrench-language works237,207