Andere Kunden interessierten sich auch für
![Development Of An Efficient Grid Based Partitioning -Around -Medoids]( "Development Of An Efficient Grid Based Partitioning -Around -Medoids")
Development Of An Efficient Grid Based Partitioning -Around -Medoids32,99 €![Modified Frequent Pattern Tree for Mining Negative Association Rules]( "Modified Frequent Pattern Tree for Mining Negative Association Rules")
Modified Frequent Pattern Tree for Mining Negative Association Rules39,99 €![Clustering Gene Expression Data Using Modified Cuckoo Search Algorithm]( "Clustering Gene Expression Data Using Modified Cuckoo Search Algorithm")
Clustering Gene Expression Data Using Modified Cuckoo Search Algorithm23,99 €![Artificial Bee Colony Algorithm With Mutation (ABCM)using Modified Sea]( "Artificial Bee Colony Algorithm With Mutation (ABCM)using Modified Sea")
Artificial Bee Colony Algorithm With Mutation (ABCM)using Modified Sea29,99 €![Statistical Image Processing Techniques for Noisy Images]( "Statistical Image Processing Techniques for Noisy Images")
Statistical Image Processing Techniques for Noisy Images37,99 €![Cryptography using Modified ASCII Conversion & Mathematical Function]( "Cryptography using Modified ASCII Conversion & Mathematical Function")
Cryptography using Modified ASCII Conversion & Mathematical Function40,99 €![Image Segmentation and Mesh Generation]( "Image Segmentation and Mesh Generation")
Image Segmentation and Mesh Generation32,99 €
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.