Articles liés à Modified K- Medoids Algorithm For Image Segmentation:...

Modified K- Medoids Algorithm For Image Segmentation: Application of Clustering in Image Processing - Couverture souple

Yerpude, Amit; Dubey, Sipi

 
9783659167454: Modified K- Medoids Algorithm For Image Segmentation: Application of Clustering in Image Processing
Couverture souple
ISBN 10 : 3659167452 ISBN 13 : 9783659167454
Editeur : LAP LAMBERT Academic Publishing, 2012

Synopsis

Clustering as a segmentation technique gives a vector of N measurements describing each pixel or group of pixels (i.e., region) in an image, a similarity of the measurement vectors and therefore their clustering in the N-dimensional measurement space implies similarity of the corresponding pixels or pixel groups. Therefore, clustering in measurement space may be an indicator of similarity of image regions, and may be used for segmentation purposes. This book investigates efficient and effective clustering and soft computing algorithms for image segmentation.The improved algorithm for K-medoids clustering incorporates histogram equalization as its first step to reduce the number of centroids. The algorithm calculates the best optimal medoids and uses them for segmentation to reduce the time complexity without much affecting the intercluster similarity.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

Clustering as a segmentation technique gives a vector of N measurements describing each pixel or group of pixels (i.e., region) in an image, a similarity of the measurement vectors and therefore their clustering in the N-dimensional measurement space implies similarity of the corresponding pixels or pixel groups. Therefore, clustering in measurement space may be an indicator of similarity of image regions, and may be used for segmentation purposes. This book investigates efficient and effective clustering and soft computing algorithms for image segmentation.The improved algorithm for K-medoids clustering incorporates histogram equalization as its first step to reduce the number of centroids. The algorithm calculates the best optimal medoids and uses them for segmentation to reduce the time complexity without much affecting the intercluster similarity.

Biographie de l'auteur

B.E. (Computer Science and Engg with 1st Division )and M. Tech.(Computer Technology With Honors)

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2012
Langue
anglais
ISBN 10 
3659167452
ISBN 13 
9783659167454
Reliure
Broché
Nombre de pages
68
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne