MétaCan
Menu
Back to cohort
Record W2387021316

Algorithm of for 2D Maximum Between-Cluster Image Segmentation Based on GA

2011· article· en· W2387021316 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueMicrocomputer applications · 2011
Typearticle
Languageen
FieldEngineering
TopicAdvanced Measurement and Detection Methods
Canadian institutionsnot available
Fundersnot available
KeywordsOtsu's methodComputer scienceImage segmentationSegmentationArtificial intelligenceRegion growingComputationGenetic algorithmScale-space segmentationSegmentation-based object categorizationPattern recognition (psychology)Image (mathematics)Image processingNoise (video)Gray (unit)AlgorithmComputer visionMachine learning
DOInot available

Abstract

fetched live from OpenAlex

The traditional two-dimensional maximum between-cluster variance method(0tsu) threshold segmentation algorithm has the high computation complexity,poor real-time and noise sensitivity in processing image.In this paper,to solve these problems,a 2-D Otsu method based on an improved genetic algorithm(GA) was improved,and lay the emphases on the gray image segmentation method that combine the genetic algorithm and the Otsu method.The 2-D Otsu method not only consider the gray information of the image,but also the related information of neighbor space to ensure the accuracy of image segmentation.The result shows that :the proposed algorithm have the two advantage,more calculating speed and more precision.

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.907
Threshold uncertainty score0.466

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.000
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.033
GPT teacher head0.275
Teacher spread0.242 · 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