AN UNSUPERVISED COLOR-TEXTURE SEGMENTATION USING TWO-STAGE FUZZY c-MEANS ALGORITHM
Bibliographic record
Abstract
Unsupervised image segmentation is a fundamental but challenging problem in computer vision. In this paper, we propose a novel unsupervised segmentation algorithm, which could find diverse applications in pattern recognition, particularly in computer vision. The algorithm, named Two-stage Fuzzy c-means Hybrid Approach (TFHA), adaptively clusters image pixels according to their multichannel Gabor responses taken at multiple scales and orientations. In the first stage, the fuzzy c-means (FCM) algorithm is applied for intelligent estimation of centroid number and initialization of cluster centroids, which endows the novel segmentation algorithm with adaptivity. To improve the efficiency of the algorithm, we utilize the Gray Level Co-occurrence Matrix (GLCM) feature extracted at the hyperpixel level instead of the pixel level to estimate centroid number and hyperpixel-cluster memberships, which are used as initialization parameters of the following main clustering stage to reduce the computational cost while keeping the segmentation performance in terms of accuracy close to original one. Then, in the second stage, the FCM algorithm is utilized again at the pixel level to improve the compactness of the clusters forming final homogeneous regions. To examine the performance of the proposed algorithm, extensive experiments were conducted and experimental results show that the proposed algorithm has a very effective segmentation results and computational behavior, decreases the execution time and increases the quality of segmentation results, compared with the state-of-the-art segmentation methods recently proposed in the literature.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
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".