MétaCan
Menu
Back to cohort
Record W2623385463 · doi:10.1109/mis.2017.2581328

Robust and Fast Segmentation Based on Fuzzy clustering combined with Unsupervised Histogram analysis

2017· article· en· W2623385463 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

VenueIEEE Intelligent Systems · 2017
Typearticle
Languageen
FieldEngineering
TopicIndustrial Vision Systems and Defect Detection
Canadian institutionsNova Scotia Community College
Fundersnot available
KeywordsHistogramThresholdingArtificial intelligenceBalanced histogram thresholdingComputer scienceImage segmentationPattern recognition (psychology)SegmentationFuzzy logicImage histogramHistogram matchingRegion growingPartition (number theory)Cluster analysisScale-space segmentationComputer visionMathematicsImage (mathematics)Image texture

Abstract

fetched live from OpenAlex

Many real-time engineering applications have used histogram thresholding methods that failed to segment images whose histogram had only one peak. A fuzzy c-means cluster algorithm (FCM), in contrast, can segment this type of image but at the cost of time. To improve unsupervised segmentation, the authors developed a new method for fast and efficient segmentation based on automatic histogram analysis of acquired images and a combined FCM and intensity transformation (HIST_FCM_IT) approach. The first part of the algorithm uses parabolic approximation for peak evaluation, and the second modifies image intensity to allow the partition matrix to be rapidly constant.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.491
Threshold uncertainty score0.851

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.040
GPT teacher head0.245
Teacher spread0.205 · 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