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

K-region-based Clustering Algorithm for Image Segmentation

โœ Scribed by Kumar, R.; Arthanariee, A. M.


Book ID
121555205
Publisher
Springer-Verlag
Year
2013
Tongue
English
Weight
610 KB
Volume
94
Category
Article
ISSN
2250-2106

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Learning-based algorithm selection for i
โœ Xia Yong; Dagan Feng; Zhao Rongchun; Maria Petrou ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 438 KB

Segmentation of nontrivial images is one of the most important tasks in image processing. It is easy for human being, but extremely difficult for computers. With the purpose of finding optimal segmentation algorithm for every image through learning from human experience, this paper investigates the

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