MétaCan
Menu
Back to cohort
Record W2384208097

Multilevel Thresholding Methods for Image Segmentation with Improved-Otsu Based on Ant Colony Algorithm

2008· article· en· W2384208097 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 · 2008
Typearticle
Languageen
FieldEngineering
TopicAdvanced Measurement and Detection Methods
Canadian institutionsnot available
Fundersnot available
KeywordsOtsu's methodComputer scienceThresholdingImage segmentationArtificial intelligenceImage (mathematics)Ant colony optimization algorithmsSegmentationBalanced histogram thresholdingComputationPattern recognition (psychology)Scale-space segmentationKey (lock)Segmentation-based object categorizationImage processingComputer visionAnt colonyAlgorithm
DOInot available

Abstract

fetched live from OpenAlex

Image segmentation is the key step from image processing to image analysis. Ostu thresholding, which features a good performance, is one of the main image threshold segmentation methods. Like other threshold methods, the application of the Otsu has been restricted for the long-paying computation and the peak value of the rule function may not be exclusive. In order to overcome the disadvantages and get better results, a new method with improved-Otsu based on Ant Colony algorithm is proposed in this paper. The image by use of the thresholds can be segmented. Simulation results show that the method is not only of higher segmentation quality but also of higher computational speed. So it proved that the algorithm is right and efficient.

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.560
Threshold uncertainty score0.721

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.026
GPT teacher head0.323
Teacher spread0.297 · 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