Abstract
Image segmentation is the process of subdividing an image into its constituent parts and extracting these parts of interest, which are the objects. Colour image segmentation emerges as a new area of research. It can solve many contemporary problems in medical imaging, mining and mineral imaging, bioinformatics, and material sciences. Naturally, color image segmentation demands well defined borders of different objects in an image. So, there is a fundamental demand of accuracy. The segmented regions or components should not be further away from the true object than one or a few pixels. So, there is a need for improved image segmentation technique that can segment different components precisely. Image data may have corrupted values due to the usual limitations or artifacts of imaging devices. Noisy data, data sparsity, and high dimensionality of data create difficulties in image pixel clustering. As a result, image pixel clustering becomes a harder problem than other form of data. Taking into account all the above considerations we propose an unsupervised image segmentation method using Rough-Fuzzy C-Mean a hybrid model for segmenting RGB image by reducing cluster centers using rough sets and Fuzzy C-Means Method, and also compare the effectiveness of the clustering methods such as Hard C Means (HCM), Fuzzy C Means (FCM), Fuzzy K Means (FKM), Rough C Means (RCM) with cluster validity index such as DB Index, XB Index and Dunn Index. A good clustering procedure should make the value of DB index as low as possible, for Dunn Index high value, and for XB Index low value.
Highlights
Clustering analysis has been an emerging research issue in data mining due its variety of applications
Taking into account all the above considerations we propose an unsupervised image segmentation method using RoughFuzzy C-Mean a hybrid model for segmenting RGB image by reducing cluster centers using rough sets and Fuzzy CMeans Method, and compare the effectiveness of the clustering methods such as Hard C Means (HCM), Fuzzy C Means (FCM), Fuzzy K Means (FKM), Rough C Means (RCM) with cluster validity index such as DB Index, XB Index and Dunn Index
We propose a hybrid algorithm, termed as rough-fuzzy c-means, based on rough sets and fuzzy sets
Summary
Clustering analysis has been an emerging research issue in data mining due its variety of applications. Clustering is a process which partitions a given data set into homogeneous groups based on given features such that similar objects are kept in a group whereas dissimilar objects are in different groups. It is the most important unsupervised learning problem. For some special cases these features might not be sufficient to decide if theses patients suffer from flu or not (e.g. further, more detailed diagnoses are required) In such cases rough clustering is an appropriate method since it separates the objects that are definite members of a cluster from the objects that are only possible members of a cluster. Step 2: At k-step : calculate the center vectors c(k) =[cj] with U(K)
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
