๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Improvement of the k-means clustering filtering algorithm

โœ Scribed by Jim Z.C. Lai; Yi-Ching Liaw


Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
269 KB
Volume
41
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


K-means Iterative Fisher (KIF) unsupervi
โœ D.A. Clausi ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 417 KB

The K-means Iterative Fisher (KIF) algorithm is a robust, unsupervised clustering algorithm applied here to the problem of image texture segmentation. The KIF algorithm involves two steps. First, K-means is applied. Second, the K-means class assignments are used to estimate parameters required for a