K-means iterative Fisher (KIF) unsupervised clustering algorithm applied to image texture segmentation

DOI10.1016/S0031-3203(01)00138-8MaRDI QIDQ1860144zbMATH OpenFDO

Authors David A. Clausi

Publication date 20 February 2003

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0031-3203(01)00138-8

zbMATH Keywords

binary hierarchical clusteringco-occurrence probabilitiescomputer visionFisher linear discriminantGabor filtersimage segmentationK-meanstexture segmentation

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45) Computing methodologies and applications (68U99)

Recommendations

• A new texture segmentation method based on the fuzzy C-means algorithm and statistical features
• A color texture image segmentation method based on fuzzy c-means clustering and region-level Markov random field model
• Image segmentation by fissive K-mean clustering method
• Segmentation of textured images based on fractals and image filtering
• A New Approach for Unsupervised Classification in Image Segmentation

Cited in

(6)

• Simultaneous model-based clustering and visualization in the Fisher discriminative subspace
• Potential functions-based wavelet transforms in pattern recognition problems
• Unsupervised multistage image classification using hierarchical clustering with a bayesian similarity measure
• An improved \(K\)-means clustering algorithm for fish image segmentation
• Archetypal analysis: an alternative to clustering for unsupervised texture segmentation
• Texture classification based on EMD and FFT

This page was built for publication: K-means iterative Fisher (KIF) unsupervised clustering algorithm applied to image texture segmentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1860144)